Problems:
Transformation Algorithms - Linear Programming Models
Problem:
This question involves formulating a linear programming model a transportation problem where demand exceeds supply. The question has four parts: (a) to (d).
a) Write down a linear programming model of the transportation problem in the case when demand exceed supply.
b) Describe an algorithm to find the closed path of stepping-stones required by the transportation algorithm.
c) Apply Vogel's rule to the following transportation problem and then perform ONE iteration of the transportation algorithm. State the resulting basic feasible solution and whether or not it is optimal.
d) Write down three advantages the transportation algorithm has over the Simplex method for solving Transportation problems.
Attachment:- Table.rar