Professional Documents
Culture Documents
Chapter 61
Chapter 61
0 0
0 0
0 0
0 0
Demand 0 0 0 0 0
Quantity Shipped 0 0 0 0 0 Clear
Total Cost = 0
Maximize
Minimize
Unit Cost Table: Destinations
Sources
Notes:
You must enter unit shipping costs in D17:H21, supply in I5:I9,
and demand in D10:H10.
Optionally you may enter source names in C17:C21 and destination names in D16:H16.
You may enter values in changing cells (D5:H9) to demonstrate a manual solution.
You may insert additonal columns or rows, you should insert columns in the middle of the
range and not at the end.
Unbalanced problems with supply exceeding demand can be solved without using Dummy column.
Unbalanced problems with demand exceeding supply are not feasible and will require a Dummy row.
In order to solve, the Solver Add-in must be available, use Tools Add-In and select Solver if necessary.
You may solve problem either by pressing the Maximize or Minimize button or by selecting Solver in the Tools menu.
Small numbers in scientific notation (e.g. 2.4091E-11) reflects the precision of Solver and can be treated as zero.
The Clear button enables you to clear all coefficients and changing cells.
Transshipment Model
Shipment Table: Trans Point Quantity Unit Cost Table: Trans Point
Supply Shipped
0 0
Sources
Sources
0 0
0 0
0 0
0 0
Trans Capacity 0 0 0 0 0
Quantity Shipped 0 0 0 0 0
Trans Point
0 0
0 0
0 0
0 0
Demand 0 0 0 0 0
Quantity Shipped 0 0 0 0 0 Clear
Total Cost = 0
Maximize
Minimize
Notes:
You must enter unit shipping costs in N5:R9 and N15:R19, supply in I5:I9,
demand in D20:H20, and transshipment capacity in D10:H10.
You may insert additonal columns or rows, you should insert columns in the middle of the
range and not at the end.
Unbalanced problems with supply exceeding demand can be solved without using Dummy column.
Unbalanced problems with demand exceeding supply are not feasible and will require a Dummy row.
In order to solve, the Solver Add-in must be available, use Tools Add-In and select Solver if necessary.
You may solve problem either by pressing the Maximize or Minimize button or by selecting Solver in the Tools menu.
Small numbers in scientific notation (e.g. 2.4091E-11) reflects the precision of Solver and can be treated as zero.
The Clear button enables you to clear all coefficients and changing cells.
Trans Point
Destination
Assignment Model
Assignment Costs:
Assignments:
Available Assigned
0 0
0 0
0 0
0 0
0 0
Available 0 0 0 0 0
Assigned 0 0 0 0 0 Clear
Total Cost = 0
Maximize
Minimize
Notes:
You must enter unit shipping costs in D17:H21, and available (1's) in I5:I9
and D10:H10.
Optionally you may enter source names in C17:C21 and destination names in D16:H16.
You may enter values in changing cells (D5:H9) to demonstrate a manual solution.
Unbalanced problems with supply exceeding demand can be solved without using Dummy column.
Unbalanced problems with demand exceeding supply are not feasible and will require a Dummy row.
In order to solve, the Solver Add-in must be available, use Tools Add-In and select Solver if necessary.
You may solve problem either by pressing the Maximize or Minimize button or by selecting Solver in the Tools menu.
Small numbers in scientific notation (e.g. 2.4091E-11) reflects the precision of Solver and can be treated as zero.
The Clear button enables you to clear all coefficients and changing cells.
Example 1 - Transportation Model
Minimize
Unit Cost Table: Destinations
Project 1 Project 2 Project 3
Sources
Farm A 4 2 8
Farm B 5 1 9
Farm C 7 6 3
Example 2 - Transshipment Model
Shipment Table: Trans Point Quantity Unit Cost Table: Trans Point
Wrhs 1 Wrhs 2 Supply Shipped Wrhs 1 Wrhs 2
Sources
Sources
Farm A 0 100 0 100 100 Farm A 3 2
Farm B 0 200 0 200 200 Farm B 4 3
Farm C 200 0 0 200 200 Farm C 2.5 3.5
Trans Capacity 999 999 0
Quantity Shipped 200 300 0
Trans Point
Trans Point
Shipment Table: Destination Quantity Unit Cost Table: Destination
Proj 1 Proj 2 Proj 3 Shipped Residual Proj 1 Proj 2 Proj 3
Wrhs 1 50 150 2.13E-010 200 0 Wrhs 1 2 1 4
Wrhs 2 0 0 300 300 0 Wrhs 2 3 2 5
Demand 50 150 300
Quantity Shipped 50 150 300 Clear
Total Cost = 3050
Maximize
Minimize
Example 3 - Aggregate Planning
Minimize
Unit Cost Table: Destinations
Period 1 Period 2 Period 3
Beg Inv 0 1 2
Reg 1 60 61 62
Over 1 80 81 82
Sub 1 90 91 92
Sources
Reg 2 63 60 61
Over 2 83 80 81
Sub 2 93 90 91
Reg 3 66 63 60
Over 3 86 83 80
Sub 3 96 93 90
Example 4 - Assignment Model
<Back
Assignment Costs:
Al Bill Cindy David Earle
Job 1 15 20 18 24 19
Job 2 12 17 16 15 14
Job 3 14 15 19 17 18
Job 4 11 14 12 13 15
Job 5 13 16 17 18 16
Assignments:
Al Bill Cindy David Earle Available Assigned
Job 1 0 0 1 0 0 1 1
Job 2 0 0 0 0 1 1 1
Job 3 0 1 0 0 0 1 1
Job 4 0 0 0 1 0 1 1
Job 5 1 0 0 0 0 1 1
Available 1 1 1 1 1
Assigned 1 1 1 1 1 Clear
Total Cost = 73
Maximize
Minimize
Solved Problem 1 - Transportation Model
<Back
Shipment Table: Destinations Quantity
Chicago South Bend Pittsburg Supply Shipped
Sources
Milwaukee 50 11 0 61 61
Cleveland 0 44 17 61 61
Demand 50 55 17
Quantity Shipped 50 55 17 Clear
Total Cost = 465
Maximize
Minimize
Unit Cost Table: Destinations
Chicago South Bend Pittsburg
Sources
Milwaukee 2 3 9
Cleveland 7 6 4
Solved Problem 2 - Assignment Model
<Back
Assignment Costs:
Al Bob Cheryl
Job D 6 4 7
Job E 9 5 2
Job F 5 7 1
Assignments:
Al Bob Cheryl Available Assigned
Job D 0 1 0 1 1
Job E 0 0 1 1 1
Job F 1 0 0 1 1
Available 1 1 1
Assigned 1 1 1 Clear
Total Cost = 11
Maximize
Minimize
Solved Problem 3 - Transshipment Model
<Back
Shipment Table: Trans Point Quantity Unit Cost Table: Trans Point
Iowa CitySouth Bend Supply Shipped Iowa CitySouth Bend
Sources
Sources
Dubuque 2000 0 0 2000 2000 Dubuque 1 2.4
Springfield 1000 2500 0 3500 3500 Springfield 1.5 2.2
Omaha 2000 0 0 2000 2000 Omaha 1.2 2.8
Trans Capacity 9999 9999 0
Quantity Shipped 5000 2500 0
Trans Point
Trans Point
Shipment Table: Destination Quantity Unit Cost Table: Destination
St. Louis Chicago Toledo Shipped Residual St. Louis Chicago Toledo
Iowa City 2500 2500 0 5000 0 Iowa City 1 1.1 2.4
South Bend 0 0 2500 2500 0 South Bend 2 0.9 1.2
Demand 2500 2500 2500
Quantity Shipped 2500 2500 2500 Clear
Total Cost = 19650
Maximize
Minimize