Scribd
Upload
21 views3 pages

Gaston

The document outlines a transportation problem involving two scenarios with different supply and demand matrices. It provides calculations for both minimum cost and maximum profit solutions using a transportation calculator. The results indicate non-degenerate solutions with specific allocations for each scenario.

Uploaded by

67kyk649gg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views3 pages

Gaston

The document outlines a transportation problem involving two scenarios with different supply and demand matrices. It provides calculations for both minimum cost and maximum profit solutions using a transportation calculator. The results indicate non-degenerate solutions with specific allocations for each scenario.

Uploaded by

67kyk649gg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Abegail Gaston

BBC 1201 B3B

PLEASE SUBMIT A HARD COPY OF THIS ON ________________


TRANSPORTATION METHOD The Minimization Problem / Maximization Problem
Balanced Table
Solve the following using the Transportation Calculator on line.

1)

P Q R SUPPLY

A 17 24 19 123

B 15 21 25 143

C 19 22 18 84

D 20 27 16 150

Demand 200 100 200 500

Determine the best allocation ( BEST PAIR) to find the optimal solution:

Prepare an answer for Minimum cost and Maximum Profit.

2)

P Q R S SUPPLY

A 56 86 80 61 134

B 59 76 78 65 203

C 62 70 57 67 176

D 60 68 75 71 187

DEMAND 175 175 175 175 700

Determine the best allocation ( BEST PAIR) to find the optimal solution:
Prepare an answer for Minimum cost and Maximum Profit.

2A. Minimum Cost

P Q R S Supply

A 56 (134) 86 80 61 134

B 59 (41) 76 78 65 (162) 203

C 62 70 57 (175) 67 (1) 176

D 60 68 (175) 75 71 (12) 187

Demand 175 175 175 175

The Minimum Total Transportation

Cost =56×134+59×41+65×162+57×175+67×1+68×175+71×12=43247

Here, the number of allocated cells = 7 is equal to m + n - 1 = 4 + 4 - 1 = 7

∴ This solution is non-degenerate

2B. Maximum Profit

P Q R S Supply

A 56 86 (134) 80 61 134

B 59 76 (28) 78 (174) 65 203

C 62 (163) 70 (13) 57 67 176

D 60 (12) 68 75 71 (175) 187

Demand 175 175 175 175

The Maximum Profit =86×134+76×28+78×175+62×163+70×13+60×12+71×175=51463

Here, the number of allocated cells = 7 is equal to m + n - 1 = 4 + 4 - 1 = 7

∴ This solution is non-degenerate


1A. Minimum Cost

P Q R Supply

A 17 (57) 24 (66) 19 123

B 15 (143) 21 25 143

C 19 22 (34) 18 (50) 84

D 20 27 16 (150) 150

Demand 200 100 200

The minimum total transportation cost =17×57+24×66+15×143+22×34+18×50+16×150=8746

Here, the number of allocated cells = 6 is equal to m + n - 1 = 4 + 3 - 1 = 6

∴ This solution is non-degenerate

1B. Maximum Profit

P Q R Supply

A 17 (66) 24 19 (57) 123

B 15 21 25 (143) 143

C 19 (84) 22 18 84

D 20 (50) 27 (100) 16 150

Demand 200 100 200

The maximum profit =17×66+19×57+25×143+19×84+20×50+27×100=11076

Here, the number of allocated cells = 6 is equal to m + n - 1 = 4 + 3 - 1 = 6

∴ This solution is non-degenerate

You might also like