Question

9.2-6. Consider the transportation problem having the following parameter table: Destination 1 23 45Supply 8 6 375 20 5 M 847
0 0
Add a comment Improve this question Transcribed image text
Answer #1

20 30 30 20 25 25 20 10 20 Not optimal because C41-u4-V1-4, X41 is the entering variable 20 30 30 20 DI 25 25 20 10 20 X42 is

20 200 30 A 1 30 0 0 0 0 20 0) 200 0 D25 25 20 10 20 0 Not optimal because C31из-v--1, x31 is the entering variable

20 30 30 20 4 20 10 DI 25 20 25 X34 is the leaving variable 20 30 30 20 20 10 DI 25 20 25 Optimal, because ci-u-v, for all xi

Add a comment
Know the answer?
Add Answer to:
9.2-6. Consider the transportation problem having the following parameter table: Destination 1 23...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • The parameter table given below shows the transportation problem formulation of Option 1 for the Better...

    The parameter table given below shows the transportation problem formulation of Option 1 for the Better Products Co. problem presented in Sec. 9.3 of the textbook. As stated in the textbook, the optimal solution for this transportation problem has the following basic variables (allocations): x12 = 30, x13 = 30, x15 = 15, x24 = 15, x25 = 60, x31 = 20, x34 = 25 Verify that this optimal solution actually is optimal by applying just the optimality test portion...

  • DI 9.2-2. * Consider the transportation problem having the fol- lowing parameter table: Destination 1 2...

    DI 9.2-2. * Consider the transportation problem having the fol- lowing parameter table: Destination 1 2 3 4 5 Supply Source 1 - 2 3 4 2 7 8 0 4 4 6 7 0 4 6 3 5 0 2 5 M 2 0 5 7 4 5 0 5 Demand Use each of the following criteria to obtain an initial BF solution. Compare the values of the objective function for these solutions. (a) Northwest corner rule. (b) Vogel's...

  • Please help~ thanks!! Problem 6-29 (Algorithmic) The north-south highway system passing through Albany, New York, can accommodate the capacities shown. If the constant is "1" it must be ente...

    Please help~ thanks!! Problem 6-29 (Algorithmic) The north-south highway system passing through Albany, New York, can accommodate the capacities shown. If the constant is "1" it must be entered in the box. If your answer is zero enter "O For negative values enter "minus" sign () Flow capacity per hour 6,000vchicles Entering Albany (north) Leaving Albany (south) Max s.t. Flow Out Flow In 1 x121 x13 -1 | X x14 1 x25 Node 2 0 1 X X13+ 1 X...

  • (Transportation problem): Consider the transportation model in the table below. a) Use the northwest-corner method to...

    (Transportation problem): Consider the transportation model in the table below. a) Use the northwest-corner method to find a starting solution. b) Develop the iterations that lead to the optimal solution. $1 19 $8 6 $6 19 5

  • Consider the transportation table below. The solution displayed was obtained by performing some iterations of the...

    Consider the transportation table below. The solution displayed was obtained by performing some iterations of the transportation method on this problem.                                                                                                                                  Consider the transportation table below. The solution displayed was obtained by performing some iterations of the transportation method on this problem.                                                                                                                                  Copy to Clipboard + Destination Source DenverDenver YumaYuma MiamiMiami Supply HoustonHouston ​$22 ​$88 ​$11 2020 2020 St. LouisSt. Louis ​$44 ​$55 ​$66 3030 1010 2020 ChicagoChicago ​$66 ​$33 ​$22 4040 1010 3030 Demand 3030 3030 3030 The total...

  • 1. (6 points) Find an optimal solution for the following transportation problem using the minimal...

    1. (6 points) Find an optimal solution for the following transportation problem using the minimal cost method and the transportation algorithm: Minimize lahi + 2x12 + 2x13 + 4x21 + 3x22 + 4x23 + 4x31 + 1x32 + 3x33, subject to the constraints X11 + X12 + X13 = 100. x21 +x22 +x23 = 50. r31 + 232 +x33 100 x11 + 2'21 +2'3,-150. 12 22+32-50 x13 + x23 + x33-50. for all i, j = 1.2.3. xij > 0,...

  • Consider the following network representation of a transportation problem: The supplies, demands, and transportation costs per...

    Consider the following network representation of a transportation problem: The supplies, demands, and transportation costs per unit are shown on the network. The optimal (cost minimizing) distribution plan is given below. Des Moines Kansas City St.Louis Supply Jefferson City 20 0 10 30 Omaha 5 15 0 20 Demand 25 15 10 Total Cost: $540. Find an alternative optimal solution for the above problem. If your answer is zero, enter “0”. Des Moines Kansas City St.Louis Jefferson City ____ ______...

  • eBook Consider the following network representation of a transportation problem: Des Moines 25 14 30 Jefferson...

    eBook Consider the following network representation of a transportation problem: Des Moines 25 14 30 Jefferson City 16 > Kansas City 15 10 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. Des Moines Kansas City St.Louis Supply 20 0 10 30 Jefferson City Omaha Demand 5 15 0 20 25 15 10 Total Cost: $540 Find an alternative...

  • Consider the following network representation of a transportation problem: Des Moines 25 30 Jefferson City Kansas...

    Consider the following network representation of a transportation problem: Des Moines 25 30 Jefferson City Kansas City 115 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. Des Moines Kansas City St.Louis Supply Jefferson City 20 10 30 Omaha 5 15 Demand | 25 15 10 Total Cost: $540. Find an alternative optimal solution for the above problem. If your...

  • These are the choices for "Shortest Route" Please explain on an excel spreadsheet Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the const...

    These are the choices for "Shortest Route" Please explain on an excel spreadsheet Problem 6-23 (Algorithmic) Find the shortest route from node 1 to node 7 in the network shown. If the constant is '1" it must be entered in the box. If your answer is zero enter "O". For negative values enter "minus" sign ( 12 1 if the arc from node i to node j is on the shortest route Let X12+ X32 t x56 x13 + x35...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT