Can anyone help with excel questions
P1.a
| 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 | # of drivers/period | Avg fare/driver | # of drivers working during the period | Min # of drivers | ||||
| 1 | D1 | 80 | 0 | >= | 10 | |||
| 2 | D2 | 500 | 0 Strayer: total # of drivers during period 2 | >= | 12 | |||
| 3 | D3 | 420 | >= | 20 | ||||
| 4 | D4 | 300 | >= | 25 | ||||
| 5 | D5 | 270 | >= | 32 | ||||
| 6 | D6 | 210 | >= | 18 | ||||
| Total # of drivers |
Strayer: total # of drivers |
Strayer: total # of drivers during period 2 | = | 70 | ||||
| Maximize total fare | 0 | |||||||
P1.b
| 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 | # of drivers/period | Avg fare/driver | # of drivers working during the period | Min # of drivers | |||
| 1 | D1 | 80 | 0 | >= | 10 | ||
| 2 | D2 | 500 | 0 | >= | 12 | ||
| 3 | D3 | 420 | >= | 20 | |||
| 4 | D4 | 300 | >= | 25 | |||
| 5 | D5 | 270 | >= | 32 | |||
| 6 | D6 | 210 | >= | 18 | |||
| Total # of drivers | = | 70 | |||||
| Max late shift | 0 Strayer: total drivers in late shift | <= | 15 | ||||
| Maximize total fare | |||||||
P1.c
| 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 | # of drivers/period | Avg fare/driver | # of drivers working during the period | Min # of drivers | |||
| 1 | D1 | 80 | 0 | >= | 10 | ||
| 2 | D2 | 500 | 0 | >= | 12 | ||
| 3 | D3 | 420 | >= | 20 | |||
| 4 | D4 | 300 | >= | 25 | |||
| 5 | D5 | 270 | >= | 32 | |||
| 6 | D6 | 210 | >= | 18 | |||
| Total # of drivers | = | 70 | |||||
| Max late shift | <= | 15 | |||||
| Limit Day Shift | 0 Strayer: total drivers in day shift | <= | 20 | ||||
| Maximize total fare | |||||||
P2
| Denim Jeans | CD Player | Compact discs | |
| profit | 90 | 150 | 30 |
| weight | 2 | 3 | 1 |
| Denim Jeans | CD Player | Compact discs | |
| DV | |||
| Constraint |
Strayer: total weight <= 5 | <= | 5 |
| Objective function | |||
P3
| Texas Consolidated Electronics Company | |||||||
| Project | Decision Variables | Estimated Profit | Expense ($1,000s) | Management Scientists required | |||
| (1,000,000s) | Project Selection constraints | ||||||
| 1 | $0.30 | $50 | 6 | ||||
| 2 | 0.85 | 105 | 8 | ||||
| 3 | 0.2 | 56 | 9 | ||||
| 4 | 0.15 | 45 | 3 | ||||
| 5 | 0.5 | 90 | 7 | ||||
| 6 | 0.45 | 80 | 5 | ||||
| 7 | 0.55 | 78 | 8 | ||||
| 8 | 0.4 | 60 | 5 | ||||
| 0 | |||||||
| <= | <= | ||||||
| 300 | 40 | ||||||
| Maximize Profit | 0 | ||||||
| Please include the following constraints in your solutions | |||||||
| Note: project 5 >= project 2 | |||||||
| project 5 - project 2 >= 0 | |||||||
| Note: All projects must be integer (1 or 0) |
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 | 0 Strayer: total accounts processed | >= | 6300 | ||
| #of computers available | 1 | 1 | <= | 32 | |||
| average errors/ day | 0.4 | 0.9 | <= | 15 | |||
| P | T | ||||||
| Decision variables | |||||||
| objective function | 0 Strayer: total cost |
||||||
|
Strayer: total accounts processed |
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 | 0 Strayer: company can be sold at most once | <= | 1 | |||||
| 2 | <= | 1 | ||||||
| 3 | <= | 1 | ||||||
| 4 | <= | 1 | ||||||
| 5 | <= | 1 | ||||||
| 6 | <= | 1 | ||||||
| 0 Strayer: total returns from the sales for year 1 |
||||||||
| >= | >= | >= | ||||||
| 20 | 25 | 35 | ||||||
| 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 | ||||||||
| 1: company is sold | 0: company is not sold | |||||||
| Total returns for 3 yrs | 0 |