Des Monies Kanas City St.

Louis Supply
Jefferson City 14 9 7 30
Omaha 8 10 5 20
Demand 25 15 10 50

Destination
Des Monies Kanas City St. Louis Supply Factory capacity
Jefferson City 5 15 10 30 30
Omaha 20 0 0 20 20
Source Demand 25 15 10
Demand 25 15 10

Total cost $ 435.00

b, Warehouse
Plant Pittsburgh Mobile Denver Los Angeles
Seattle 10 20 5 9
Columbus 2 10 8 30
New York 1 20 7 10
CPUs required 3000 5000 4000 6000
 Warehouse
Plant Pittsburgh Mobile Denver Los Angeles
Seattle 0 0 4000 5000
Columbus 0 4000 0 0
New York 3000 1000 0 1000
Demand 3000 5000 4000 6000
CPUs required 3000 5000 4000 6000

MINIMIZE TOTAL SHIPPING COST 150000

c, Warehouse
Plant Pittsburgh Mobile Denver Los Angeles
Seattle 0 0 4000 5000
Columbus 0 5000 0 0
New York 4000 0 0 1000
Demand 4000 5000 4000 6000
CPUs required 4000 5000 4000 6000

MINIMIZE TOTAL SHIPPING COST 141000

With this production increase lead to an decrease in total shipping costs

house
Washington CPUs Available
10 9000
6 4000
4 8000
3000 21000
 Warehouse From
Washington Supply CPUs Available Seattle
0 9000 9000 Seattle
0 4000 4000 Columbus
3000 8000 8000 New York
3000 21000 New York
3000 New York
New York
Supplier run at full capacity, Demand of warehouse are met

Warehouse
Washington Supply CPUs Available From
0 9000 9000 Seattle
0 5000 5000 Seattle
3000 8000 8000 Columbus
3000 22000 New York
3000 New York
New York

tal shipping costs

 Optimal solution
To Units shipped Cost per units Total cost
Denver 4000 $ 5.00 $ 20,000.00
Los Angeles 5000 $ 9.00 $ 45,000.00
Mobile 4000 $ 10.00 $ 40,000.00
Pittsburgh 3000 $ 1.00 $ 3,000.00
Mobile 1000 $ 20.00 $ 20,000.00
Los Angeles 1000 $ 10.00 $ 10,000.00
Washington 3000 $ 4.00 $ 12,000.00
Total $ 150,000.00

Optimal solution
To Units shipped Cost per units Total cost
Denver 4000 $ 5.00 $ 20,000.00
Los Angeles 5000 $ 9.00 $ 45,000.00
Mobile 5000 $ 10.00 $ 50,000.00
Pittsburgh 4000 $ 1.00 $ 4,000.00
Los Angeles 1000 $ 10.00 $ 10,000.00
Washington 3000 $ 4.00 $ 12,000.00

Total $ 141,000.00
Microsoft Excel 16.78 Answer Report
Worksheet: [CHAPTER [Link]]EX 4
Report Created: 15/04/2024 [Link]
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 12885213,32 Seconds.
Iterations: 11 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 1E-06
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Solve Without Integer Constrain

Objective Cell (Min)

Cell Name Original Value Final Value
$F$49 MINiMIZE TOTAL SHIPPING COST Los Angeles 0 150000

Variable Cells
Cell Name Original Value Final Value Integer
$C$43 Seattle Pittsburgh 0 0 Contin
$D$43 Seattle Mobile 0 0 Contin
$E$43 Seattle Denver 0 4000 Contin
$F$43 Seattle Los Angeles 0 5000 Contin
$G$43 Seattle Washington 0 0 Contin
$C$44 Columbus Pittsburgh 0 0 Contin
$D$44 Columbus Mobile 0 4000 Contin
$E$44 Columbus Denver 0 0 Contin
$F$44 Columbus Los Angeles 0 0 Contin
$G$44 Columbus Washington 0 0 Contin
$C$45 New York Pittsburgh 0 3000 Contin
$D$45 New York Mobile 0 1000 Contin
$E$45 New York Denver 0 0 Contin
$F$45 New York Los Angeles 0 1000 Contin
$G$45 New York Washington 0 3000 Contin

Constraints
Cell Name Cell Value Formula Status
$C$46 Demand Pittsburgh 3000 $C$46=$C$47 Binding
$D$46 Demand Mobile 5000 $D$46=$D$47 Binding
$E$46 Demand Denver 4000 $E$46=$E$47 Binding
$F$46 Demand Los Angeles 6000 $F$46=$F$47 Binding
$G$46 Demand Washington 3000 $G$46=$G$47 Binding
$H$43 Seattle Supply 9000 $H$43<=$I$43 Binding
$H$44 Columbus Supply 4000 $H$44<=$I$44 Binding
$H$45 New York Supply 8000 $H$45<=$I$45 Binding
Without Integer Constraints, Assume NonNegative

Slack
0
0
0
0
0
0
0
0
a, Develop a network representation

b, Amout Billing CONSTRAINTS

Avery - Client A 0 0 Avery
Avery - Client B 40 5000 Baker
 Avery - Client C 100 11500 Campbell
Avery - Client D 0 0 A
Baber - Client A 40 4800 B
Baber - Client B 35 4725 C
Baber - Client C 0 0 D
Baber - Client D 85 10200
Campbell - Client A 140 21700
Campbell - Client B 0 0
Campbell - Client C 0 0
Campbell - Client D 0 0

TOTAL BILLING 57925

c,
Amout Billing CONSTRAINTS
Avery - Client A 0 0 Avery
Avery - Client B 0 0 Baker
Avery - Client C 100 11500 Campbell
Avery - Client D 40 4000 A
Baber - Client A 40 4800 B
Baber - Client B 75 10125 C
Baber - Client C 0 0 D
Baber - Client D 45 5400
Campbell - Client A 140 21700
Campbell - Client B 0 0
Campbell - Client C 0 0
Campbell - Client D 0 0

TOTAL BILLING 57525

Impact: By excluding Avery from working with client B, the total billing is reduced.
Revised schedule:
Avery: Client C ( 100 hours ), Client D ( 40 hours )
Baker: Client A ( 40 hours ), Client B ( 75 hours ), Client D ( 45 hou
Campbell: Client A ( 140 hours )
 Hours Schedule
140 160 Avery: Client B ( 40 hours ), Client C ( 100 hours )
160 160 Baker: Client A ( 40 hours ), Client B ( 35 hours ), Client D ( 85 hours )
 140 140 Campbell: Client A ( 140 hours )
180 180
75 75
100 100
85 85

Hours
140 160
160 160
140 140
180 180
75 75
100 100
85 85

billing is reduced.

urs ), Client D ( 45 hours )

), Client D ( 85 hours )
a, Develop a network representation of the problem

b, Client
Consultant A B C
Avery 100 125 115
Baker 120 135 115
Campbell 155 150 140

Hours required 180 75 100

Client
Consultant A B C
Avery 0 40 100
 Baker 40 35 0
Campbell 140 0 0
Total 180 75 100
= = =
Hours required 180 75 100

MAXIMIZE TOTAL BILLING 57925

Schedule
Avery: Client B ( 40 hou
Baker: Client A ( 40 hou
Campbell: Client A ( 14

c, Client
Consultant A B C
Avery 100 0 115
Baker 120 135 115
Campbell 155 150 140

Hours required 180 75 100

Client
Consultant A B C
Avery 0 0 100
Baker 40 75 0
Campbell 140 0 0
Total 180 75 100
= = =
Hours required 180 75 100

MAXIMIZE TOTAL BILLING 57525

Impact: By excluding Avery from working with client B, the total billing is re
Revised schedule:
Avery: Client C ( 100 hours ), Client D ( 40 hours )
Baker: Client A ( 40 hours ), Client B ( 75 hours ),
Campbell: Client A ( 140 hours )
 D Schedule work hours
100 160
120 160
130 140
460
85 440

D Total Schedule work hours

0 140 <= 160
 85 160 <= 160
0 140 <= 140
85 <=
=
85

chedule
very: Client B ( 40 hours ), Client C ( 100 hours )
aker: Client A ( 40 hours ), Client B ( 35 hours ), Client D ( 85 hours )
ampbell: Client A ( 140 hours )

D Schedule work hours

100 160
120 160
130 140
460
85 440

D Total Schedule work hours

40 140 <= 160
45 160 <= 160
0 140 <= 140
85 440 <=
=
85

t B, the total billing is reduced.

rs ), Client D ( 40 hours )
), Client B ( 75 hours ), Client D ( 45 hours )

Avery does not run

 Billing
A B C D
0 5000 11500 0
 4800 4725 0 10200
21700 0 0 0

Optimal Soluion
Consultant Client Units hours Dollar per hours
Avery B 40 $ 125.00
Avery C 100 $ 115.00
Baker A 40 $ 120.00
Baker B 35 $ 135.00
Baker D 85 $ 120.00
Campbell A 140 $ 155.00
Total

Avery does not run at full capacity

Billing
A B C D
0 0 11500 4000
4800 10125 0 5400
21700 0 0 0

Optimal Soluion
Consultant Client Units hours Dollar per hours
Avery C 100 $ 115.00
 Avery D 40 $ 100.00
Baker A 40 $ 120.00
Baker B 75 $ 135.00
Baker D 45 $ 120.00
Campbell A 140 $ 155.00
Total

ry does not run at full capacity

 Total cost
$ 5,000.00
$ 11,500.00
$ 4,800.00
$ 4,725.00
$ 10,200.00
$ 21,700.00
$ 57,925.00

Total cost
$ 11,500.00
$ 4,000.00
$ 4,800.00
$ 10,125.00
$ 5,400.00
$ 21,700.00
$ 57,525.00
Microsoft Excel 16.78 Answer Report
Worksheet: [CHAPTER [Link]]EX 5 483 pdf
Report Created: 15/04/2024 [Link]
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 12885215,819 Seconds.
Iterations: 11 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 1E-06, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$D$54 TOTAL BILLING Billing 0 57925

Variable Cells
Cell Name Original Value Final Value Integer
$C$41 Avery - Client A Amout 0 0 Contin
$C$42 Avery - Client B Amout 0 40 Contin
$C$43 Avery - Client C Amout 0 100 Contin
$C$44 Avery - Client D Amout 0 0 Contin
$C$45 Baber - Client A Amout 0 40 Contin
$C$46 Baber - Client B Amout 0 35 Contin
$C$47 Baber - Client C Amout 0 0 Contin
$C$48 Baber - Client D Amout 0 85 Contin
$C$49 Campbell - Client A Amout 0 140 Contin
$C$50 Campbell - Client B Amout 0 0 Contin
$C$51 Campbell - Client C Amout 0 0 Contin
$C$52 Campbell - Client D Amout 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$G$41 Avery 140 $G$41<=$H$41 Not Binding 20
$G$42 Baker 160 $G$42<=$H$42 Binding 0
$G$43 Campbell 140 $G$43<=$H$43 Binding 0
$G$44 A 180 $G$44=$H$44 Binding 0
$G$45 B 75 $G$45=$H$45 Binding 0
$G$46 C 100 $G$46=$H$46 Binding 0
$G$47 D 85 $G$47=$H$47 Binding 0
Assume NonNegative
 Customer
Plant D1 D2 D3
Clifton Springs 32 34 32
Danville 34 30 28

Distributor orders ( units ) 2000 5000 3000

Demand is higher than supply 4000 units

Customer
Plant D1 D2 D3
Clifton Springs 0 4000 0
Danville 2000 0 0
0 0 0
Demand 2000 4000 0
<= <= <=
Distributor orders ( units ) 2000 5000 3000

MAXIMIZE PROFITS 282000

Optimal Solution
Plant Customer Units produced Profit per unit
Clifton Springs D2 4000 $ 34.00
Clifton Springs D4 1000 $ 40.00
Danville D1 2000 $ 34.00
Danville D4 1000 $ 38.00
Total

Cusomer D2 has shortage 1000 units

Customer D3 are not met complely
 D4 Capacity ( units )
40 5000
38 3000
8000
2000 12000

D4 Supply Capacity ( units )

1000 5000 = 5000
1000 3000 = 3000
0
2000
<= Customer's demand are not met
2000

Total cost
$ 136,000.00
$ 40,000.00
$ 68,000.00
$ 38,000.00
$ 282,000.00
Microsoft Excel 16.78 Answer Report
Worksheet: [CHAPTER [Link]]EX 6 484 pdf
Report Created: 15/04/2024 [Link]
Result: Solver found a solution. All constraints and optimality conditions are satisfied.
Solver Engine
Engine: Simplex LP
Solution Time: 12885210,518 Seconds.
Iterations: 11 Subproblems: 0
Solver Options
Max Time Unlimited, Iterations Unlimited, Precision 0,000001, Use Automatic Scaling
Max Subproblems Unlimited, Max Integer Sols Unlimited, Integer Tolerance 1%, Assume NonNegative

Objective Cell (Max)

Cell Name Original Value Final Value
$B$19 MAXIMIZE PROFITS D1 282000 282000

Variable Cells
Cell Name Original Value Final Value Integer
$B$13 Clifton Springs D1 0 0 Contin
$C$13 Clifton Springs D2 4000 4000 Contin
$D$13 Clifton Springs D3 0 0 Contin
$E$13 Clifton Springs D4 1000 1000 Contin
$B$14 Danville D1 2000 2000 Contin
$C$14 Danville D2 0 0 Contin
$D$14 Danville D3 0 0 Contin
$E$14 Danville D4 1000 1000 Contin
$B$15 Dummy D1 0 0 Contin
$C$15 Dummy D2 1000 1000 Contin
$D$15 Dummy D3 3000 3000 Contin
$E$15 Dummy D4 0 0 Contin

Constraints
Cell Name Cell Value Formula Status Slack
$B$16 Demand D1 2000 $B$16=$B$17 Binding 0
$C$16 Demand D2 5000 $C$16=$C$17 Binding 0
$D$16 Demand D3 3000 $D$16=$D$17 Binding 0
$E$16 Demand D4 2000 $E$16=$E$17 Binding 0
$F$13 Clifton Springs Supply 5000 $F$13<=$G$13 Binding 0
$F$14 Danville Supply 3000 $F$14<=$G$14 Binding 0
$F$15 Dummy Supply 4000 $F$15<=$G$15 Binding 0
ume NonNegative