Use the minimum-entry and u-v methods to solve the following minimum-cost transportation problem. Assuming there is no cost associated with the artificial warehouse or market. Use Bland’s rule to choose entering and leaving variables where variables/cells are ordered from top to bottom and left to right.

Algebra & Trigonometry with Analytic Geometry
13th Edition
ISBN:9781133382119
Author:Swokowski
Publisher:Swokowski
Chapter10: Sequences, Series, And Probability
Section10.8: Probability
Problem 32E
icon
Related questions
Question

Use the minimum-entry and u-v methods to solve the following minimum-cost transportation
problem. Assuming there is no cost associated with the artificial warehouse or market.
Use Bland’s rule to choose entering and leaving variables where variables/cells are ordered from top
to bottom and left to right.

(a)
W₁
W₂
W3
Demands
D2
D2 D3
D3
2
6
4
D₁
2
4 5
1
6
20 30 30
D4
D4
6
3
96
20
Supplies
30
40
50
Transcribed Image Text:(a) W₁ W₂ W3 Demands D2 D2 D3 D3 2 6 4 D₁ 2 4 5 1 6 20 30 30 D4 D4 6 3 96 20 Supplies 30 40 50
Expert Solution
steps

Step by step

Solved in 5 steps with 1 images

Blurred answer
Recommended textbooks for you
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage