0% found this document useful (0 votes)
84 views6 pages

Transportation Problems

This document presents a linear programming problem involving allocating production across two plants to meet customer demand and maximize profits. It provides a table showing the profit per unit for each plant-customer alternative. The problem is to determine the optimal allocation of production across plants and customers to maximize total profit, and to identify any unmet customer demand.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
84 views6 pages

Transportation Problems

This document presents a linear programming problem involving allocating production across two plants to meet customer demand and maximize profits. It provides a table showing the profit per unit for each plant-customer alternative. The problem is to determine the optimal allocation of production across plants and customers to maximize total profit, and to identify any unmet customer demand.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
You are on page 1/ 6

Foster Generators

Destination
Origin to Bostonto Chicagoto St. Louis
to LexingtonSupply
Clevelan 3 2 7 6 5000
Bedford 7 5 2 3 6000
York 2 5 4 5 2500
Demand 6000 4000 2000 1500 13500 13500
S=D

Min 39500 .

Origin to Bostonto Chicagoto St. Louis


to LexingtonSupply
Clevelan 3500 1500 0 0 5000 <= 5000
Bedford 0 2500 2000 1500 6000 <= 6000
York 2500 0 0 0 2500 <= 2500
Demand 6000 4000 2000 1500

6000 4000 2000 1500


6000
5000 C

4000
B
6000

Y
2000
2500

1500
Microsoft Excel 14.0 Sensitivity Report
Worksheet: [Transportation problems.xls]Dummy
Report Created: 09-12-2020 09:51:15

Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$17 CS D1 0 -4 32 4 1E+030
$C$17 CS D2 4000 0 34 2 2
$D$17 CS D3 0 -2 32 2 1E+030
$E$17 CS D4 1000 0 40 2 2
$B$18 D D1 2000 0 34 1E+030 2
$C$18 D D2 0 -2 30 2 1E+030
$D$18 D D3 0 -4 28 4 1E+030
$E$18 D D4 1000 0 38 2 2
$B$19 D1 0 -2 0 2 1E+030
$C$19 D2 1000 0 0 2 2
$D$19 D3 3000 0 0 1E+030 2
$E$19 D4 0 -6 0 6 1E+030

Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$B$20 Demand D1 2000 2 2000 0 1000
$C$20 Demand D2 5000 0 5000 0 1000
$D$20 Demand D3 3000 0 3000 0 3000
$E$20 Demand D4 2000 6 2000 0 1000
$F$17 CS Supply 5000 34 5000 1000 0
$F$18 D Supply 3000 32 3000 1000 0
$F$19 Supply 4000 0 4000 1E+030 0
Problem 6

Destination
Origin D1 D2 D3 D4 Supply
CS 32 34 32 40 5000
D 34 30 28 38 3000

Demand 2000 5000 3000 2000 12000


8000
4000
Max 282000

Origin D1 D2 D3 D4 Supply
CS 0 4000 0 1000 5000 5000
D 2000 0 0 1000 3000 3000
4000
Demand 2000 4000 0 2000

2000 5000 3000 2000


1000 3000
Klein Chemicals, Inc., produces a special oil-based material that is cur
Four of Klein’s customers have already placed orders that together ex
capacity of Klein’s two plants. Klein’s management faces the problem
how many units it should supply to each customer. Because the four
industries, different prices can be charged because of the various indu
structures. However, slightly different production costs at the two pla
costs between the plants and customers make a “sell to the highest b
unacceptable. After considering price, production costs, and transpor
Klein established the following profit per unit for each plant–custome

How many units should each plant produce for each customer in orde
Which customer demands will not be met? Show your network mode
formulation.
based material that is currently in short supply.
ed orders that together exceed the combined
gement faces the problem of deciding
stomer. Because the four customers are in different
ecause of the various industry pricing
uction costs at the two plants and varying transportation
ake a “sell to the highest bidder” strategy
uction costs, and transportation costs,
it for each plant–customer alternative:

for each customer in order to maximize profits?


Show your network model and linear programming

You might also like