Week 9 hw
P1
| Cab Company Scheduling | |||||||
| let Di = # of drivers who start their 8 hour shift in period I (I = 1,2,3,4,5,6) | |||||||
| period 1 | 12:00:00 AM--4:00am | period 4 | 12 noon -- 4:00pm | ||||
| period 2 | 4:00am -- 8:00am | period 5 | 4:00pm -- 8:00pm | ||||
| period 3 | 8:00am -- 12 noon | period 6 | 8:00pm -- midnight | ||||
| period 1 | period 2 | period 3 | period 4 | period 5 | period 6 | ||
| average fare/ driver | 80 | 500 | 420 | 300 | 270 | 210 | |
| # of drivers in each period | |||||||
| >= | >= | >= | >= | >= | >= | ||
| minimum # of drivers | 10 | 12 | 20 | 25 | 32 | 18 | |
| DV | D1 | D2 | D3 | D4 | D5 | D6 | |
| # of drivers/period | |||||||
| Objective function | |||||||
P2
| Denim Jeans | CD Player | Compact discs | |
| profit | 90 | 150 | 30 |
| weight | 2 | 3 | 1 |
| Denim Jeans | CD Player | Compact discs | |
| DV | |||
| Constraint | <= | 5 | |
| Objective function | |||
P3
| Texas Consolidated Electronics Company | ||||||
| Project | Expense ($1,000s) | Management Scientists required | Estimated Profit | |||
| (1,000,000s) | Project Selection constraints | |||||
| 1 | $50 | 6 | $0.30 | |||
| 2 | 105 | 8 | 0.85 | |||
| 3 | 56 | 9 | 0.2 | |||
| 4 | 45 | 3 | 0.15 | |||
| 5 | 90 | 7 | 0.5 | |||
| 6 | 80 | 5 | 0.45 | |||
| 7 | 78 | 8 | 0.55 | |||
| 8 | 60 | 5 | 0.4 | |||
| Constraints | ||||||
| <= | <= | |||||
| 300 | 40 | |||||
| DV | Project | |||||
| 1 | ||||||
| 2 | Please include the following constraints in your solutions | |||||
| 3 | ||||||
| 4 | Note: project 5 >= project 2 | |||||
| 5 | ||||||
| 6 | Note: All projects must be integer (1 or 0) | |||||
| 7 | ||||||
| 8 | ||||||
| Objective | Maximize Profits |
P4
| Mortgage Associates | |||||||
| Let P = # of permanent operators and T = # of temporary operators | |||||||
| Permanent operator | Temporary operator | ||||||
| average pay/operator | 120 | 75 | |||||
| daily # of accounts/per operator | 220 | 140 | >= | 6300 | |||
| #of computers available | 1 | 1 | <= | 32 | |||
| average errors/ day | 0.4 | 0.9 | <= | 15 | |||
| P | T | ||||||
| Decision variables | |||||||
| objective function | |||||||
P5
| Global Investment Capital | ||||||||
| Year Sold | ||||||||
| (Estimated returns in $ 1000000) | ||||||||
| Company | 1 | 2 | 3 | |||||
| 1 | 14 | 18 | 23 | |||||
| 2 | 9 | 11 | 15 | |||||
| 3 | 18 | 23 | 27 | |||||
| 4 | 16 | 21 | 25 | |||||
| 5 | 12 | 16 | 22 | |||||
| 6 | 21 | 23 | 28 | |||||
| constraints | ||||||||
| 1 | 2 | 3 | ||||||
| 1 | <= | 1 | ||||||
| 2 | <= | 1 | ||||||
| 3 | <= | 1 | ||||||
| 4 | <= | 1 | ||||||
| 5 | <= | 1 | ||||||
| 6 | <= | 1 | ||||||
| Decision variables are C15:E20 | ||||||||
| this a 0-1 integer problem. Each decision variable has to be restricted to have the value 0 or 1 | ||||||||
| Objective function |