# Question

Reconsider Prob. 9.1-6. Starting with Russell's approximation method, interactively apply the transportation simplex method to obtain an optimal solution for this problem.

In problem

After several iterations of the transportation simplex method, a BF solution is obtained that has the following basic variables: x13 = 20, x21 = 25, x24 = 5, x32 = 25, x34 = 5, x42 = 0, x43 = 0, x45 = 20. Continue the transportation simplex method for two more iterations by hand. After two iterations, state whether the solution is optimal and, if so, why.

In problem

After several iterations of the transportation simplex method, a BF solution is obtained that has the following basic variables: x13 = 20, x21 = 25, x24 = 5, x32 = 25, x34 = 5, x42 = 0, x43 = 0, x45 = 20. Continue the transportation simplex method for two more iterations by hand. After two iterations, state whether the solution is optimal and, if so, why.

## Answer to relevant Questions

Reconsider the transportation problem formulated in Prob. 9.1-7a. The Childfair Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants 1, 2, and 3 produce 12, 17, and 11 shipments per month, respectively. Each distribution center ...Consider the transportation problem having the following parameter table: Consider the assignment problem having the following cost table. (a) Draw the network representation of this assignment problem. (b) Formulate this problem as a transportation problem by constructing the appropriate ...Consider the linear programming model for the general assignment problem given in Sec. 9.3. Construct the table of constraint coefficients for this model. Compare this table with the one for the general transportation ...Post your question

0