mcgraw-hill/irwin © the mcgraw-hill companies, inc., 2008 7.1 table of contents chapter 7 (using...
TRANSCRIPT
© The McGraw-Hill Companies, Inc., 2008
7.1McGraw-Hill/Irwin
Table of ContentsChapter 7 (Using Binary Integer Programming)
A Case Study: California Manufacturing (Section 7.1) 7.2–7.11Using BIP for Project Selection: Tazer Corp. (Section 7.2) 7.12–7.15Using BIP for the Selection of Sites: Caliente City (Section 7.3) 7.16–7.19Using BIP for Crew Scheduling: Southwestern Airways (Section 7.4) 7.20–7.24Using Mixed BIP to Deal with Setup Costs: Revised Wyndor (Section 7.5) 7.25–7.30
Introduction to Integer Programming (UW Lecture) 7.31–7.46These slides are based upon a lecture from the MBA core-course in Management Science at the University of Washington (as taught by one of the authors).
Applications of Integer Programming (UW Lecture) 7.47–7.59These slides are based upon a lecture from the MBA elective “Modeling with Spreadsheets” at the University of Washington (as taught by one of the authors).
© The McGraw-Hill Companies, Inc., 2008
7.2McGraw-Hill/Irwin
Applications of Binary Variables
• Since binary variables only provide two choices, they are ideally suited to be the decision variables when dealing with yes-or-no decisions.
• Examples:– Should we undertake a particular fixed project?
– Should we make a particular fixed investment?
– Should we locate a facility in a particular site?
© The McGraw-Hill Companies, Inc., 2008
7.3McGraw-Hill/Irwin
California Manufacturing Company
• The California Manufacturing Company is a diversified company with several factories and warehouses throughout California, but none yet in Los Angeles or San Francisco.
• A basic issue is whether to build a new factory in Los Angeles or San Francisco, or perhaps even both.
• Management is also considering building at most one new warehouse, but will restrict the choice to a city where a new factory is being built.
Question: Should the California Manufacturing Company expand with factories and/or warehouses in Los Angeles and/or San Francisco?
© The McGraw-Hill Companies, Inc., 2008
7.4McGraw-Hill/Irwin
Data for California Manufacturing
DecisionNumber
Yes-or-NoQuestion
DecisionVariable
Net PresentValue
(Millions)
CapitalRequired(Millions)
1 Build a factory in Los Angeles? x1 $8 $6
2 Build a factory in San Francisco? x2 5 3
3 Build a warehouse in Los Angeles? x3 6 5
4 Build a warehouse in San Francisco? x4 4 2
Capital Available: $10 million
© The McGraw-Hill Companies, Inc., 2008
7.5McGraw-Hill/Irwin
Binary Decision Variables
DecisionNumber
DecisionVariable
PossibleValue
Interpretationof a Value of 1
Interpretationof a Value of 0
1 x1 0 or 1Build a factory inLos Angeles
Do not buildthis factory
2 x2 0 or 1Build a factory inSan Francisco
Do not buildthis factory
3 x3 0 or 1Build a warehouse inLos Angeles
Do not buildthis warehouse
4 x4 0 or 1Build a warehouse inSan Francisco
Do not buildthis warehouse
© The McGraw-Hill Companies, Inc., 2008
7.6McGraw-Hill/Irwin
Algebraic Formulation
Let x1 = 1 if build a factory in L.A.; 0 otherwisex2 = 1 if build a factory in S.F.; 0 otherwisex3 = 1 if build a warehouse in Los Angeles; 0 otherwisex4 = 1 if build a warehouse in San Francisco; 0 otherwise
Maximize NPV = 8x1 + 5x2 + 6x3 + 4x4 ($millions)subject to
Capital Spent: 6x1 + 3x2 + 5x3 + 2x4 ≤ 10 ($millions)Max 1 Warehouse: x3 + x4 ≤ 1Warehouse only if Factory: x3 ≤ x1
x4 ≤ x2
andx1, x2, x3, x4 are binary variables.
© The McGraw-Hill Companies, Inc., 2008
7.7McGraw-Hill/Irwin
Spreadsheet Model
3456789
1011121314151617181920
B C D E F GNPV ($millions) LA SF
Warehouse 6 4
Factory 8 5
Capital Required($millions) LA SFWarehouse 5 2 Capital Capital
Spent AvailableFactory 6 3 9 <= 10
Total MaximumBuild? LA SF Warehouses Warehouses
Warehouse 0 0 0 <= 1<= <=
Factory 1 1
Total NPV ($millions) 13
© The McGraw-Hill Companies, Inc., 2008
7.8McGraw-Hill/Irwin
Sensitivity Analysis with Solver Table
2324252627282930313233343536
B C D E F GCapital Available Warehouse Warehouse Factory Factory Total NPV
($millions) in LA? in SF? in LA? in SF? ($millions)0 0 1 1 13
5 0 1 0 1 96 0 1 0 1 97 0 1 0 1 98 0 1 0 1 99 0 0 1 1 1310 0 0 1 1 1311 0 1 1 1 1712 0 1 1 1 1713 0 1 1 1 1714 1 0 1 1 1915 1 0 1 1 19
© The McGraw-Hill Companies, Inc., 2008
7.9McGraw-Hill/Irwin
Management’s Conclusion
• Management’s initial tentative decision had been to make $10 million of capital available.
• With this much capital, the best plan would be to build a factory in both Los Angeles and San Francisco, but no warehouses.
• An advantage of this plan is that it only uses $9 million of this capital, which frees up $1 million for other projects.
• A heavy penalty (a reduction of $4 million in total net present value) would be paid if the capital made available were to be reduced below $9 million.
• Increasing the capital made available by $1 million (to $11 million) would enable a substantial ($4 million) increase in the total net present value. Management decides to do this.
• With this much capital available, the best plan is to build a factory in both cities and a warehouse in San Francisco.
© The McGraw-Hill Companies, Inc., 2008
7.10McGraw-Hill/Irwin
Some Other Applications
• Investment Analysis– Should we make a certain fixed investment?
– Examples: Turkish Petroleum Refineries (1990), South African National Defense Force (1997), Grantham, Mayo, Van Otterloo and Company (1999)
• Site Selection– Should a certain site be selected for the location of a new facility?
– Example: AT&T (1990)
• Designing a Production and Distribution Network– Should a certain plant remain open? Should a certain site be selected for a new
plant? Should a distribution center remain open? Should a certain site be selected for a new distribution center? Should a certain distribution center be assigned to serve a certain market area?
– Examples: Ault Foods (1994), Digital Equipment Corporation (1995)
© The McGraw-Hill Companies, Inc., 2008
7.11McGraw-Hill/Irwin
Some Other Applications
• Dispatching Shipments– Should a certain route be selected for a truck? Should a certain size truck be used?
Should a certain time period for departure be used?
– Examples: Quality Stores (1987), Air Products and Chemicals, Inc. (1983), Reynolds Metals Co. (1991), Sears, Roebuck and Company (1999)
• Scheduling Interrelated Activities– Should a certain activity begin in a certain time period?
– Examples: Texas Stadium (1983), China (1995)
• Scheduling Asset Divestitures– Should a certain asset be sold in a certain time period?
– Example: Homart Development (1987)
• Airline Applications:– Should a certain type of airplane be assigned to a certain flight leg? Should a certain
sequence of flight legs be assigned to a crew?
– Examples: American Airlines (1989, 1991), Air New Zealand (2001)
© The McGraw-Hill Companies, Inc., 2008
7.12McGraw-Hill/Irwin
Project Selection at Tazer Corp.
• Tazer Corporation is searching for a new breakthrough drug.
• Five potential research and development projects:– Project Up: Develop a more effect antidepressant that doesn’t cause mood swings
– Project Stable: Develop a drug that addresses manic depression
– Project Choice: Develop a less intrusive birth control method for women
– Project Hope: Develop a vaccine to prevent HIV infection
– Project Release: Develop a more effective drug to lower blood pressure
• $1.2 billion available for investment (enough for 2 or 3 projects)
Question: Which projects should be selected to research and develop?
© The McGraw-Hill Companies, Inc., 2008
7.13McGraw-Hill/Irwin
Data for the Tazer Project Selection Problem
1Up
2Stable
3Choice
4Hope
5Release
R&D ($million)
400 300 600 500 200
Success Rate 50% 35% 35% 20% 45%
Revenue if Successful ($million)
1,400 1,200 2,200 3,000 600
Expected Profit ($million)
300 120 170 100 70
© The McGraw-Hill Companies, Inc., 2008
7.14McGraw-Hill/Irwin
Algebraic Formulation of Tazer Project Selection
Let xi = 1 if approve project i; 0 otherwise (for i = 1, 2, 3, 4, and 5)
Maximize P = 300x1 + 120x2 + 170x3 + 100x4 + 70x5 ($million)
subject to
R&D Budget: 400x1 + 300x2 + 600x3 + 500x4 + 200x5 ≤ 1,200 ($million)
and xi are binary (for i = 1, 2, 3, 4, and 5).
© The McGraw-Hill Companies, Inc., 2008
7.15McGraw-Hill/Irwin
Spreadsheet for Tazer Project Selection Problem
123456789
10
A B C D E F G H I J
Tazer Corp. Project Selection Problem
Up Stable Choice Hope Release Total BudgetR&D Investment ($million) 400 300 600 500 200 1200 <= 1200
Success Rate 50% 35% 35% 20% 45%Revenue if Successful ($million) 1400 1200 2200 3000 600
Expected Profit ($million) 300 120 170 100 70 540
Do Project? 1 0 1 0 1
© The McGraw-Hill Companies, Inc., 2008
7.16McGraw-Hill/Irwin
Selection of Sites for Emergency Services:The Caliente City Problem
• Caliente City is growing rapidly and spreading well beyond its original borders
• They still have only one fire station, located in the congested center of town
• The result has been long delays in fire trucks reaching the outer part of the city
Goal: Develop a plan for locating multiple fire stations throughout the city
New Policy: Response Time ≤ 10 minutes
© The McGraw-Hill Companies, Inc., 2008
7.17McGraw-Hill/Irwin
Response Time and Cost Data for Caliente City
Fire Station in Tract
1 2 3 4 5 6 7 8
Response times
(minutes) for a fire in
tract
1 2 8 18 9 23 22 16 28
2 9 3 10 12 16 14 21 25
3 17 8 4 20 21 8 22 17
4 10 13 19 2 18 21 6 12
5 21 12 16 13 5 11 9 12
6 25 15 7 21 15 3 14 8
7 14 22 18 7 13 15 2 9
8 30 24 15 14 17 9 8 3
Cost of Station($thousands)
350 250 450 300 50 400 300 200
© The McGraw-Hill Companies, Inc., 2008
7.18McGraw-Hill/Irwin
Algebraic Formulation of Caliente City Problem
Let xj = 1 if tract j is selected to receive a fire station; 0 otherwise (j = 1, 2, … , 8)
Minimize C = 350x1 + 250x2 + 450x3 + 300x4 + 50x5 + 400x6 + 300x7 + 200x8
subject to
Tract 1: x1 + x2 + x4 ≥ 1Tract 2: x1 + x2 + x3 ≥ 1Tract 3: x2 + x3 + x6 ≥ 1Tract 4: x1 + x4 + x7 ≥ 1Tract 5: x5 + x7 ≥ 1Tract 6: x3 + x6 + x8 ≥ 1Tract 7: x4 + x7 + x8 ≥ 1Tract 8: x6 + x7 + x8 ≥ 1
and xj are binary (for j = 1, 2, … , 8).
© The McGraw-Hill Companies, Inc., 2008
7.19McGraw-Hill/Irwin
Spreadsheet Model for Caliente City Problem
123456789
1011121314151617181920212223242526272829
A B C D E F G H I J K L M N
Caliente City Fire Station Location Problem
Fire Station in Tract1 2 3 4 5 6 7 8
1 2 8 18 9 23 22 16 28Response 2 9 3 10 12 16 14 21 25
Times 3 17 8 4 20 21 8 22 17(Minutes) 4 10 13 19 2 18 21 6 12for a Fire 5 21 12 16 13 5 11 9 12in Tract 6 25 15 7 21 15 3 14 8
7 14 22 18 7 13 15 2 98 30 24 15 14 17 9 8 3
Cost of Station 350 250 450 300 50 400 300 200($thousands) Number
Covering1 1 1 0 1 0 0 0 0 1 >= 1
Response 2 1 1 1 0 0 0 0 0 1 >= 1Time 3 0 1 1 0 0 1 0 0 1 >= 1<= 4 1 0 0 1 0 0 1 0 1 >= 110 5 0 0 0 0 1 0 1 0 1 >= 1
Minutes? 6 0 0 1 0 0 1 0 1 1 >= 17 0 0 0 1 0 0 1 1 2 >= 18 0 0 0 0 0 1 1 1 2 >= 1
TotalFire Station in Tract Cost
1 2 3 4 5 6 7 8 ($thousands)Station in Tract? 0 1 0 0 0 0 1 1 750
© The McGraw-Hill Companies, Inc., 2008
7.20McGraw-Hill/Irwin
Southwestern Airways Crew Scheduling
• Southwestern Airways needs to assign crews to cover all its upcoming flights.
• We will focus on assigning 3 crews based in San Francisco (SFO) to 11 flights.
Question: How should the 3 crews be assigned 3 sequences of flights so that every one of the 11 flights is covered?
© The McGraw-Hill Companies, Inc., 2008
7.21McGraw-Hill/Irwin
Southwestern Airways Flights
Seat tl e (SEA)
San Francisco (SFO)
Los Angel es (LAX)
Denver (DEN)
Chicago ORD)
© The McGraw-Hill Companies, Inc., 2008
7.22McGraw-Hill/Irwin
Data for the Southwestern Airways Problem
Feasible Sequence of Flights
Flights 1 2 3 4 5 6 7 8 9 10 11 12
1. SFO–LAX 1 1 1 1
2. SFO–DEN 1 1 1 1
3. SFO–SEA 1 1 1 1
4. LAX–ORD 2 2 3 2 3
5. LAX–SFO 2 3 5 5
6. ORD–DEN 3 3 4
7. ORD–SEA 3 3 3 3 4
8. DEN–SFO 2 4 4 5
9. DEN–ORD 2 2 2
10. SEA–SFO 2 4 4 5
11. SEA–LAX 2 2 4 4 2
Cost, $1,000s 2 3 4 6 7 5 7 8 9 9 8 9
© The McGraw-Hill Companies, Inc., 2008
7.23McGraw-Hill/Irwin
Algebraic Formulation
Let xj = 1 if flight sequence j is assigned to a crew; 0 otherwise. (j = 1, 2, … , 12).
Minimize Cost = 2x1 + 3x2 + 4x3 + 6x4 + 7x5 + 5x6 + 7x7 + 8x8 + 9x9 + 9x10 + 8x11 + 9x12
(in $thousands)
subject to
Flight 1 covered: x1 + x4 + x7 + x10 ≥ 1
Flight 2 covered: x2 + x5 + x8 + x11 ≥ 1
: :
Flight 11 covered: x6 + x9 + x10 + x11 + x12 ≥ 1
Three Crews: x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 + x12 ≤ 3
and
xj are binary (j = 1, 2, … , 12).
© The McGraw-Hill Companies, Inc., 2008
7.24McGraw-Hill/Irwin
Spreadsheet Model
3456789
101112131415161718192021222324
B C D E F G H I J K L M N O P QFlight Sequence
1 2 3 4 5 6 7 8 9 10 11 12Cost ($thousands) 2 3 4 6 7 5 7 8 9 9 8 9 At
LeastIncludes Segment? Total One
SFO-LAX 1 0 0 1 0 0 1 0 0 1 0 0 1 >= 1SFO-DEN 0 1 0 0 1 0 0 1 0 0 1 0 1 >= 1SFO-SEA 0 0 1 0 0 1 0 0 1 0 0 1 1 >= 1LAX-ORD 0 0 0 1 0 0 1 0 1 1 0 1 1 >= 1LAX-SFO 1 0 0 0 0 1 0 0 0 1 1 0 1 >= 1ORD-DEN 0 0 0 1 1 0 0 0 1 0 0 0 1 >= 1ORD-SEA 0 0 0 0 0 0 1 1 0 1 1 1 1 >= 1DEN-SFO 0 1 0 1 1 0 0 0 1 0 0 0 1 >= 1DEN-ORD 0 0 0 0 1 0 0 1 0 0 1 0 1 >= 1SEA-SFO 0 0 1 0 0 0 1 1 0 0 0 1 1 >= 1SEA-LAX 0 0 0 0 0 1 0 0 1 1 1 1 1 >= 1
Total Number1 2 3 4 5 6 7 8 9 10 11 12 Sequences of Crews
Fly Sequence? 0 0 1 1 0 0 0 0 0 0 1 0 3 <= 3
Total Cost ($thousands) 18
© The McGraw-Hill Companies, Inc., 2008
7.25McGraw-Hill/Irwin
Wyndor with Setup Costs
Suppose that two changes are made to the original Wyndor problem:
1. For each product, producing any units requires a substantial one-time setup cost for setting up the production facilities.
2. The production runs for these products will be ended after one week, so D and W in the original model now represent the total number of doors and windows produced, respectively, rather than production rates. Therefore, these two variables need to be restricted to integer values.
© The McGraw-Hill Companies, Inc., 2008
7.26McGraw-Hill/Irwin
Graphical Solution to Original Wyndor Problem
0 2 4 6 8
8
6
4
2
Production ratefor windows
Production rate for doors
FeasibleRegion
(2, 6)
Optimal solution
10
P = 3,600 = 300 D + 500 W
W
D
© The McGraw-Hill Companies, Inc., 2008
7.27McGraw-Hill/Irwin
Net Profit for Wyndor Problem with Setup Costs
Net Profit ($)
Number ofUnits Produced Doors Windows
0 0(300) – 0 = 0 0 (500) – 0 = 0
1 1(300) – 700 = –400 1(500) – 1,300 = –800
2 2(300) – 700 = –100 2(500) – 1,300 = –300
3 3(300) – 700 = 200 3(500) – 1,300 = 200
4 4(300) – 700 = 500 4(500) – 1,300 = 700
5 Not feasible 5(500) – 1,300 = 1,200
6 Not feasible 6(500) – 1,300 = 1,700
© The McGraw-Hill Companies, Inc., 2008
7.28McGraw-Hill/Irwin
Feasible Solutions for Wyndor with Setup Costs
0 2 4 6
2
4
6
8Production quantity for windows
(0, 0)gives P = 0
(4, 0) gives P = 500
(4, 3) gives P = 500 + 200
Production quantity for doors
(2, 6) gives P = -100 + 1700
(0, 6) gives P = 1700
8
= 1600
= 700
W
D
© The McGraw-Hill Companies, Inc., 2008
7.29McGraw-Hill/Irwin
Algebraic Formulation
Let D = Number of doors to produce,W = Number of windows to produce,y1 = 1 if perform setup to produce doors; 0 otherwise,y2 = 1 if perform setup to produce windows; 0 otherwise .
Maximize P = 300D + 500W – 700y1 – 1,300y2
subject toOriginal Constraints:
Plant 1: D ≤ 4Plant 2: 2W ≤ 12Plant 3: 3D + 2W ≤ 18
Produce only if Setup:Doors: D ≤ 99y1
Windows: W ≤ 99y2
andD ≥ 0, W ≥ 0, y1 and y2 are binary.
© The McGraw-Hill Companies, Inc., 2008
7.30McGraw-Hill/Irwin
Spreadsheet Model
3456789
1011121314151617
B C D E F G HDoors Windows
Unit Profit $300 $500Setup Cost $700 $1,300
Hours HoursUsed Available
Plant 1 1 0 0 <= 4Plant 2 0 2 12 <= 12Plant 3 3 2 12 <= 18
Doors WindowsUnits Produced 0 6
<= <= Production Profit $3,000Only If Setup 0 99 - Total Setup Cost $1,300
Setup? 0 1 Total Profit $1,700
Hours Used Per Unit Produced
© The McGraw-Hill Companies, Inc., 2008
7.31McGraw-Hill/Irwin
Integer Programming
• When are “non-integer” solutions okay?– Solution is naturally divisible
• e.g., $, pounds, hours
– Solution represents a rate
• e.g., units per week
– Solution only for planning purposes
• When is rounding okay?– When numbers are large
• e.g., rounding 114.286 to 114 is probably okay.
• When is rounding not okay?– When numbers are small
• e.g., rounding 2.6 to 2 or 3 may be a problem.
– Binary variables
• yes-or-no decisions
© The McGraw-Hill Companies, Inc., 2008
7.32McGraw-Hill/Irwin
The Challenges of Rounding
• Rounded Solution may not be feasible.
• Rounded solution may not be close to optimal.
• There can be many rounded solutions.
– Example: Consider a problem with 30 variables that are non-integer in the LP-solution. How many possible rounded solutions are there?
1 2 3 4 5
1
2
3
4
5
x1
x2
© The McGraw-Hill Companies, Inc., 2008
7.33McGraw-Hill/Irwin
How Integer Programs are Solved
1 2 3 4 5
1
2
3
4
5
x1
x2
© The McGraw-Hill Companies, Inc., 2008
7.34McGraw-Hill/Irwin
How Integer Programs are Solved
1 2 3 4 5
1
2
3
4
5
x1
x2
© The McGraw-Hill Companies, Inc., 2008
7.35McGraw-Hill/Irwin
Applications of Binary Variables
• Making “yes-or-no” type decisions– Build a factory?
– Manufacture a product?
– Do a project?
– Assign a person to a task?
• Set-covering problems– Make a set of assignments that “cover” a set of requirements.
• Fixed costs– If a product is produced, must incur a fixed setup cost.
– If a warehouse is operated, must incur a fixed cost.
© The McGraw-Hill Companies, Inc., 2008
7.36McGraw-Hill/Irwin
Example #1 (Capital Budgeting)
• Norwood Development is considering the potential of four different development projects.
• Each project would be completed in at most three years.
• The required cash outflow for each project is given in the table below, along with the net present value of each project to Norwood, and the cash that is available each year.
Cash Outflow Required ($million)
CashAvailable($million)Project 1 Project 2 Project 3 Project 4
Year 1 9 7 6 11 28
Year 2 6 4 3 0 13
Year 3 6 0 4 0 10
NPV 30 16 22 14
Question: Which projects should be undertaken?
© The McGraw-Hill Companies, Inc., 2008
7.37McGraw-Hill/Irwin
Algebraic Formulation
Let yi = 1 if project i is undertaken; 0 otherwise (i = 1, 2, 3, 4).
Maximize NPV = 30y1 + 16y2 + 22y3 + 14y4
subject to
Year 1: 9y1 + 7y2 + 6y3 + 11y4 ≤ 28 ($million)
Year 2 (cumulative): 15y1 + 11y2 + 9y3 + 11y4 ≤ 41 ($million)
Year 3 (cumulative): 21y1 + 11y2 + 13y3 + 11y4 ≤ 51 ($million)
and
yi are binary (i = 1, 2, 3, 4).
© The McGraw-Hill Companies, Inc., 2008
7.38McGraw-Hill/Irwin
Spreadsheet Solution
12345678910111213
A B C D E F G H I
Norwood Development Capital Budgeting
Project 1 Project 2 Project 3 Project 4NPV ($million) 30 16 22 14
Cumulative CumulativeOutflow Available
Year 1 9 7 6 11 22 <= 28Year 2 15 11 9 11 35 <= 41Year 3 21 11 13 11 45 <= 51
Total NPVProject 1 Project 2 Project 3 Project 4 ($million)
Undertake? 1 1 1 0 68
Cumulative Outflow Required ($million)
© The McGraw-Hill Companies, Inc., 2008
7.39McGraw-Hill/Irwin
Additional Considerations(Logic and Dependency Constraints)
• At least one of projects 1, 2, or 3
• Project 2 can’t be done unless project 3 is done
• Either project 3 or project 4, but not both
• No more than two projects total
Question: What constraints would need to be added for each of these additional considerations?
© The McGraw-Hill Companies, Inc., 2008
7.40McGraw-Hill/Irwin
Example #2 (Set Covering Problem)
• The Washington State legislature is trying to decide on locations at which to base search-and-rescue teams.
• The teams are expensive, so they would like as few as possible.
• Response time is critical, so they would like every county to either have a team located in that county or in an adjacent county.
Question: Where should search-and-rescue teams be located?
© The McGraw-Hill Companies, Inc., 2008
7.41McGraw-Hill/Irwin
The Counties of Washington State
1
2
3
4
7
6
9
10
11
12
8
5
13
14
15
16
17
18
19
20
2122
2325
24
26 27 28
29 30
31 32
33
3435
36
37
1. Clallum2. J efferson3. Grays Harbor4. Pacific5. Wahkiakum6. Kitsap7. Mason8. Thurston9. Whatcom10. Skagit11. Snohomish12. King13. Pierce14. Lewis15. Cowlitz16. Clark17. Skamania18. Okanogan
19. Chelan20. Douglas21. Kittitas22. Grant23. Yakima24. Klickitat25. Benton26. Ferry27. Stevens28. Pend Oreille29. Lincoln30. Spokane31. Adams32. Whitman33. Franklin34. Walla Walla35. Columbia36. Garfield37. Asotin
Counties
© The McGraw-Hill Companies, Inc., 2008
7.42McGraw-Hill/Irwin
Algebraic Formulation
Let yi = 1 if a team is located in county i; 0 otherwise (i = 1, 2, … , 37).
Minimize Number of Teams = y1 + y2 + … + y37
subject to
County 1 covered: y1 + y2 ≥ 1
County 2 covered: y1 + y2 + y3 + y6 + y7 ≥ 1
County 3 covered: y2 + y3 + y4 + y7 + y8 + y14 ≥ 1
:
County 37 covered: y32 + y36 + y37 ≥ 1
and
yi are binary (i = 1, 2, … , 37).
© The McGraw-Hill Companies, Inc., 2008
7.43McGraw-Hill/Irwin
Spreadsheet Solution
123456789101112131415161718192021222324
A B C D E F G H I J K L M N
Search & Rescue Location
# Teams # TeamsCounty Team? Nearby County Team? Nearby
1 Clallam 0 1 >= 1 19 Chelan 0 2 >= 12 Jefferson 1 1 >= 1 20 Douglas 0 1 >= 13 Grays Harbor 0 2 >= 1 21 Kittitas 1 1 >= 14 Pacific 0 1 >= 1 22 Grant 0 1 >= 15 Wahkiakum 0 1 >= 1 23 Yakima 0 3 >= 16 Kitsap 0 1 >= 1 24 Klickitat 0 1 >= 17 Mason 0 1 >= 1 25 Benton 0 1 >= 18 Thurston 0 1 >= 1 26 Ferry 0 1 >= 19 Whatcom 0 1 >= 1 27 Stevens 1 1 >= 110 Skagit 1 1 >= 1 28 Pend Oreille 0 1 >= 111 Snohomish 0 1 >= 1 29 Lincoln 0 1 >= 112 King 0 1 >= 1 30 Spokane 0 1 >= 113 Pierce 0 2 >= 1 31 Adams 0 1 >= 114 Lewis 1 2 >= 1 32 Whitman 0 2 >= 115 Cowlitz 0 2 >= 1 33 Franklin 1 1 >= 116 Clark 0 1 >= 1 34 Walla Walla 0 1 >= 117 Skamania 1 2 >= 1 35 Columbia 0 1 >= 118 Okanogan 0 1 >= 1 36 Garfield 1 1 >= 1
37 Asotin 0 1 >= 1Total Teams: 8
© The McGraw-Hill Companies, Inc., 2008
7.44McGraw-Hill/Irwin
Example #3 (Fixed Costs)
• Woodridge Pewter Company is a manufacturer of three pewter products: platters, bowls, and pitchers.
• The manufacture of each product requires Woodridge to have the appropriate machinery and molds available. The machinery and molds for each product can be rented at the following rates: for the platters, $400/week; for the bowls, $250/week; for the pitcher, $300/week.
• Each product requires the amounts of labor and pewter given in the table below. The sales price and variable cost are also given in the table.
LaborHours
Pewter(pounds)
SalesPrice
VariableCost
Platter 3 5 $100 $60
Bowl 1 4 85 50
Pitcher 4 3 75 40
Available 130 240
Question: Which products should be produced, and in what quantity?
© The McGraw-Hill Companies, Inc., 2008
7.45McGraw-Hill/Irwin
Algebraic Formulation
Let x1 = Number of platters produced,x2 = Number of bowls produced,x3 = Number of pitchers produced,yi = 1 if lease machine and mold for product i; 0 otherwise (i = 1, 2, 3).
Maximize Profit = ($100–$60)x1 + ($85–$50)x2 + ($75–$40)x3 – $400y1 – $250y2 – $300y3
subject toLabor: 3x1 + x2 + 4x3 ≤ 130 hoursPewter: 5x1 + 4x2 + 3x3 ≤ 240 poundsAllow production only if machines and molds are purchased:
x1 ≤ 99y1
x2 ≤ 99y2
x3 ≤ 99y3
andxi ≥ 0, and yi are binary (i = 1, 2, 3).
© The McGraw-Hill Companies, Inc., 2008
7.46McGraw-Hill/Irwin
Spreadsheet Solution
12345678910111213141516
A B C D E F G H
Woodridge Pewter Company
Platters Bowls PitchersSales Price $100 $85 $75
Variable Cost $60 $50 $40Fixed Cost $400 $250 $300
Constraint Usage (per unit produced) Total AvailableLabor (hrs.) 3 1 4 60 <= 130
Pewter (lbs.) 5 4 3 240 <= 240
Lease Equipment? 0 1 0Revenue $5,100
Production Quantity 0 60 0 Variable Cost $3,000<= <= <= Fixed Cost $250
Produce only if Lease 0 99 0 Profit $1,850
© The McGraw-Hill Companies, Inc., 2008
7.47McGraw-Hill/Irwin
Applications of Binary Variables
• Making “yes-or-no” type decisions– Build a factory?
– Manufacture a product?
– Do a project?
– Assign a person to a task?
• Fixed costs– If a product is produced, must incur a fixed setup cost.
– If a warehouse is operated, must incur a fixed cost.
• Either-or constraints– Production must either be 0 or ≥ 100.
• Subset of constraints– meet 3 out of 4 constraints.
© The McGraw-Hill Companies, Inc., 2008
7.48McGraw-Hill/Irwin
Capital Budgeting with Contingency Constraints(Yes-or-No Decisions)
• A company is planning their capital budget over the next several years.
• There are 10 potential projects they are considering pursuing.
• They have calculated the expected net present value of each project, along with the cash outflow that would be required over the next five years.
• Also, suppose there are the following contingency constraints:– at least one of project 1, 2 or 3 must be done,
– project 4 and project 5 cannot both be done,
– project 7 can only be done if project 6 is done.
Question: Which projects should they pursue?
© The McGraw-Hill Companies, Inc., 2008
7.49McGraw-Hill/Irwin
Data for Capital Budgeting Problem
Cash Outflow Required ($million)
CashAvailable($million)
Project
1 2 3 4 5 6 7 8 9 10
Year 1 1 4 0 4 4 3 2 8 2 6 25
Year 2 2 2 2 2 2 4 2 3 3 6 25
Year 3 3 2 5 2 4 2 3 4 8 2 25
Year 4 4 4 5 4 5 3 1 2 1 1 25
Year 5 1 1 0 6 5 5 5 1 1 2 25
NPV 20 25 22 30 42 25 18 35 28 33 ($million)
© The McGraw-Hill Companies, Inc., 2008
7.50McGraw-Hill/Irwin
Spreadsheet Solution
123456789101112131415161718192021
A B C D E F G H I J K L M N O
Capital Budgeting with Contingency Constraints
Project Project Project Project Project Project Project Project Project Project1 2 3 4 5 6 7 8 9 10
NPV ($million) 20 25 22 30 42 25 18 35 28 33Cumulative Cumulative
Cumulative Cash Outflow Required ($million) Total Outflow AvailableYear 1 1 4 0 4 4 3 2 8 2 6 22 <= 25Year 2 3 6 2 6 6 6 4 11 5 12 44 <= 50Year 3 6 8 7 8 10 8 7 15 13 14 73 <= 75Year 4 10 12 12 12 15 11 8 17 14 15 97 <= 100Year 5 11 13 12 18 20 16 13 18 15 17 117 <= 125
Project Project Project Project Project Project Project Project Project Project Total NPV1 2 3 4 5 6 7 8 9 10 ($million)
Undertake? 1 1 1 0 1 1 1 0 1 1 213
Contingency ConstraintsProject 1,2,3 3 >= 1Project 4,5 1 <= 1Project 7 1 <= 1 Project 6
© The McGraw-Hill Companies, Inc., 2008
7.51McGraw-Hill/Irwin
Electrical Generator Startup Planning (Fixed Costs)
• An electrical utility company owns five generators.
• To generate electricity, a generator must be started up, and associated with this is a fixed startup cost.
• All of the generators are shut off at the end of each day.
Generator
A B C D E
Fixed Startup Cost $2,450 $1,600 $1,000 $1,250 $2,200
Variable Cost (per MW) $3 $4 $6 $5 $4
Capacity (MW) 2,000 2,800 4,300 2,100 2,000
Question: Which generators should be started up to meet the total capacity needed for the day (6000 MW)?
© The McGraw-Hill Companies, Inc., 2008
7.52McGraw-Hill/Irwin
Spreadsheet Solution
123456789
10111213141516
A B C D E F G H I J
Electrical Utility Generator Startup Planning
Generator A Generator B Generator C Generator D Generator EFixed Startup Cost $2,450 $1,600 $1,000 $1,250 $2,200Cost per Megawatt $3 $4 $6 $5 $4Max Capacity (MW) 2,000 2,800 4,300 2,100 2,000
Startup? 1 1 0 1 0Total MW MW Needed
MW Generated 2,100 3,000 0 900 0 6000 >= 6,000<= <= <= <= <=
Capacity 2,000 2,800 0 2,100 0
Fixed Cost $5,300Variable Cost $22,800
Total Cost $28,100
© The McGraw-Hill Companies, Inc., 2008
7.53McGraw-Hill/Irwin
Quality Furniture (Either-Or Constraints)
• Reconsider the Quality Furniture Problem:– The Quality Furniture Corporation produces benches and picnic tables. The firm
has a limited supply of two resources: labor and wood. 1,600 labor hours are available during the next production period. The firm also has a stock of 9,000 pounds of wood available. Each bench requires 3 labor hours and 12 pounds of wood. Each table requires 6 labor hours and 38 pounds of wood. The profit margin on each bench is $8 and on each table is $18.
• Now suppose that they would not produce any fewer than 200 units of either product (i.e., either produce 0 or at least 200).
Question: What product mix will maximize their total profit?
© The McGraw-Hill Companies, Inc., 2008
7.54McGraw-Hill/Irwin
Spreadsheet Solution
12345678910111213141516171819
A B C D E F G
Quality Furniture (with either-or constraints)
Benches TablesProfit $8.00 $18.00
Min Production (if any) 200 200
Resources ResourcesUsed Available
Labor 3 6 1600 <= 1,600Wood 12 38 6400 <= 9,000
Produce? 1 0
Min Production 200 0<= <= Total Profit
Production Quantities 533.33 0 $4,266.67<= <=
Max Production 533 0Max Possible 533 237
Use of Resources
© The McGraw-Hill Companies, Inc., 2008
7.55McGraw-Hill/Irwin
Meeting a Subset of Constraints
• Consider a linear programming model with the following constraints, and suppose that meeting 3 out of 4 of these is good enough
– 12x1 + 24x2 + 18x3 ≥ 2,400
– 15x1 + 32x2 + 12x3 ≥ 1,800
– 20x1 + 15x2 + 20x3 ≤ 2,000
– 18x1 + 21x2 + 15x3 ≤ 1,600
© The McGraw-Hill Companies, Inc., 2008
7.56McGraw-Hill/Irwin
Meeting a Subset of Constraints
Let yi = 1 if constraint i is enforced; 0 otherwise.
Constraints:
y1 + y2 + y3 + y4 ≥ 3
12x1 + 24x2 + 18x3 ≥ 2,400y1
15x1 + 32x2 + 12x3 ≥ 1,800y2
20x1 + 15x2 + 20x3 ≤ 2,000 + M (1 – y3)
18x1 + 21x2 + 15x3 ≤ 1,600 + M (1 – y4)
where M is a large number.
© The McGraw-Hill Companies, Inc., 2008
7.57McGraw-Hill/Irwin
Facility Location
• Consider a company that operates 5 plants and 3 warehouses that serve customers in 4 different regions.
• To lower costs, they are considering streamlining by closing one or more plants and warehouses.
• Associated with each plant are fixed costs, shipping costs, and production costs. Each plant has a limited capacity.
• Associated with each warehouse are fixed costs and shipping costs. Each warehouse has a limited capacity.
Questions:Which plants should they keep open?
Which warehouses should they keep open?
How should they divide production among the open plants?
How much should be shipped from each plant to each warehouse, and from each warehouse to each customer?
© The McGraw-Hill Companies, Inc., 2008
7.58McGraw-Hill/Irwin
Data for Facility Location Problem
FixedCost
(per month)
(Shipping + Production) Cost(per unit)
Capacity(units per
month)WH #1 WH #2 WH #3
Plant 1 $42,000 $650 $750 $850 400
Plant 2 50,000 500 350 550 300
Plant 3 45,000 450 450 350 300
Plant 4 50,000 400 500 600 350
Plant 5 47,000 550 450 350 375
Fixed Cost(per month)
Shipping Cost (per unit)
Capacity(per month)Cust. 1 Cust. 2 Cust. 3 Cust. 4
WH #1 $45,000 $25 $65 $70 $35 600
WH #2 25,000 50 25 40 60 400
WH #3 65,000 60 20 40 45 900
Demand: 250 225 200 275
© The McGraw-Hill Companies, Inc., 2008
7.59McGraw-Hill/Irwin
Spreadsheet Solution
123456789
101112131415161718
192021222324252627282930313233
A B C D E F G H I J K L M
Plant to WarehouseShipping + Production FixedCost Warehouse 1 Warehouse 2 Warehouse 3 Cost Capacity
Plant 1 $650 $750 $850 $42,000 400Plant 2 $500 $350 $550 $50,000 300Plant 3 $450 $450 $350 $45,000 300Plant 4 $400 $500 $600 $50,000 350Plant 5 $550 $450 $350 $47,000 375
Shipment Total ActualQuantities Warehouse 1 Warehouse 2 Warehouse 3 Shipped Capacity Open? Total Costs
Plant 1 0 0 0 0 <= 0 0 Shipping Cost (P-->W) $332,500Plant 2 0 300 0 300 <= 300 1 Shipping Cost (W-->C) $37,375Plant 3 0 0 275 275 <= 300 1 Fixed Cost (P) $142,000Plant 4 0 0 0 0 <= 0 0 Fixed Cost (W) $90,000Plant 5 0 0 375 375 <= 375 1 Total Cost $601,875
Total Shipped 0 300 650
Warehouse to CustomerShipping FixedCost Customer 1 Customer 2 Customer 3 Customer 4 Cost Capacity
Warehouse 1 $25 $65 $70 $35 $45,000 600Warehouse 2 $50 $25 $40 $60 $25,000 400Warehouse 3 $60 $20 $40 $45 $65,000 900
Shipment Shipped Shipped ActualQuantities Customer 1 Customer 2 Customer 3 Customer 4 Out In Capacity Open?
Warehouse 1 0 0 0 0 0 <= 0 <= 0 0Warehouse 2 250 0 50 0 300 <= 300 <= 400 1Warehouse 3 0 225 150 275 650 <= 650 <= 900 1Total Shipped 250 225 200 275
>= >= >= >=Needed 250 225 200 275