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 average fare/ driver # of drivers in each period period 1 80 period 2 500 period 3 420 period 4 300 period 5 270 >= 10 >= 12 >= 20 >= 25 >= 32 minimum # of drivers DV # of drivers/period Objective function D1 D2 D3 D4 D5 period 6 210 >= 18 D6 profit weight Denim Jeans 90 CD Player 150 Compact discs 30 2 Denim Jeans 3 CD Player 1 Compact discs <= 5 DV Constraint Objective function Texas Consolidated Electronics Company Project 1 2 3 4 5 6 7 8 Management Expense ($1,000s) Scientists required $50 105 56 45 90 80 78 60 6 8 9 3 7 5 8 5 <= 300 <= 40 Estimated Profit (1,000,000s) $0.30 0.85 0.2 0.15 0.5 0.45 0.55 0.4 Constraints DV Project 1 2 3 4 5 6 7 8 Objective Maximize Profits Please include the following constraints in Note: project 5 >= project 2 Note: All projects must be integer (1 or 0) Project Selection constraints include the following constraints in your solutions project 5 >= project 2 All projects must be integer (1 or 0) Mortgage Associates Let P = # of permanent operators and T = # of temporary operators average pay/operator daily # of accounts/per operator #of computers available average errors/ day Decision variables objective function Permanent operator 120 220 1 0.4 Temporary operator 75 140 1 0.9 P T >= <= <= 6300 32 15 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 1 2 3 4 5 6 2 3 <= <= <= <= <= <= 1 1 1 1 1 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