Question: Problem 6-02 (Algorithmic) Consider the following network representation of a transportation problem: The supplies, demands, and transportation costs per unit are shown on the network.
Problem 6-02 (Algorithmic)
Consider the following network representation of a transportation problem:
The supplies, demands, and transportation costs per unit are shown on the network.
- Develop a linear programming model for this problem; be sure to define the variables in your model. If constant is "1", it must be entered in the box.
Let xij = amount shipped from supply node i to demand node j. Min x11 + x12 + x13 + x21 + x22 + x23 s.t. x11 + x12 + x13 x21 + x22 + x23 x11 + x21 = x12 + x22 = x13 + x23 = x11, x12, x13, x21, x22, x23 0 - Solve the linear program to determine the optimal solution. Enter "0" if your answer is zero.
Quantity Cost Jefferson City - Des Moines Jefferson City - Kansas City Jefferson City - St. Louis Omaha - Des Moines Omaha - Kansas City Omaha - St. Louis Total Cost
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
