What is feasible solution in transportation?

What is feasible solution in transportation?

Feasible solution: A feasible solution to a transportation problem is a set of non-negative allocations, x ij that satisfies the rim (row and column) restrictions. Optimal solution: A feasible solution (not necessarily basic) that minimizes (maximizes) the transportation cost (profit) is called an optimal solution.

What are the three methods of finding basic feasible solution of a transportation problem?

There are three methods for finding an initial basic feasible solution, NorthWest Corner Method. Least Cost Cell Method. Vogel’s Approximation Method.

Which of the following methods is used for basic feasible solution of transportation problem?

Usually, the initial basic feasible solution of any transportation problem is obtained by using well known methods such as North-West corner method (NWCM) or Least-Cost Method (LCM) or Vogel’s Approximation Method (VAM), and then finally the optimality of the given transportation problem is checked by MODI.

What are the steps to solving the transportation problem?

For solving the transportation problem, the following steps are to be systematically followed: Obtaining the initial feasible solution, which means identifying the solution that satisfies the requirements of demand and supply. There are several methods through which the initial feasible solution can be obtained; these are:

Which is the best definition of a feasible solution?

A feasible solution (not necessarily basic) is said to be optimal if it minimizes the total transportation cost. To solve a transportation problem first we need to find an initial basic feasible solution and then get an optimum solution.

How is the transportation problem solved in linear programming?

The transportation problem has a large number of linear programming applications. Various methods have been developed to solve the transportation problem and obtain an optimal solution, such as the modified distribution (MODI) method. In order to proceed with these methods, it is necessary to obtain the initial feasible solution.

How to find an initial feasible solution to a problem?

Hence there exists a feasible solution to the given problem. Vogel’s approximation method yields an initial basic feasible solution which is very close to the optimum solution.Various steps involved in this method are summarized as under Step 1: Calculate the penalties for each row and each column.