Question

Consider the following network representation of a transportation problem: Des Moines25 Jefferson City 30 15 City 20 Omaha St. Louis 10 Supplies Demands The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below City Jefferson City Des Moines 20 280 Jefferson City - St. Louis Omaha Des Moines Omaha Kansas City Total Cost: $540 Find an alternative optimal solution for the above problem City Jefferson City - Des Moines5 Jefferson City - Kansas City Jefferson City St. Louis Quantity Cost 70 40 150 10 15 Quantity Cost Omaha Des Moines

Answer 1

Solver Parameters Set Objective: 1$3 0: O Min Value Of: ax By Changing Variable Cells: $C$2:$E$3 Subject to the Constraints: Add Change Delete $C$2:$E$3integer $H$6 $J$6 Reset All Load/Save Make Unconstrained Variables Non-Negative Select a Solving Method: GRG Nonlinear Options Solving Method Select the GRG Nonlinear engine for Solver Problems that are smooth nonlinear. Select the LP Simplex engine for linear Solver Problems, and select the Evolutionary engine for Solver problems that are non-smooth. Help Solve Close