Scheduled To Employees Minimum Start At Time Available In Employees Time Period Period Time Period Needed 12 am to 4 am 90 90 90 4 am to 8 am 125 215

215 8 am to 12 pm 125 250 250 12 pm to 4 pm 40 165 165 4 pm to 8 pm 260 300 300 8 pm to 12 am 0 260 125 Total Employees: 640 Decision Variables: x1: x2: x3: x4: x5: x6: Objective Function: Min Z: x1 + x2 + x3 + x4 + x5 + x6 (Scheduled Employees) Constraint: Subject To: x1 + x6 90 x1 + x2 215 x2 + x3 250 x3 + x4 165 x4 + x5 300 x5 + x6 125 Xj 0 and integer, J= 1 to 6

Number of Employees 90 125 125 40 260 0

Employees to Report at 12AM 4AM 8AM 12NN 4PM 8PM

640

Total Employees

Number of Employees 90 215 250 165 300 260

Minimum Number 90 215 250 165 300 125

Employees to Report at 12AM - 4AM 4AM - 8AM 8AM - 12NN 12NN - 4PM 4PM - 8PM 8PM - 12MN

Machine Hulling Roasting Coating Packaging

Minutes Required per pound Whole Cluster Crunch 1.00 1.00 1.00 2.00 1.50 1.00 1.00 0.70 0.20 2.50 1.60 1.25 Whole 1000 1000 5.00 3.15 1.85 1850 Cluster 500 400 500 4.00 2.60 1.40 700 Crunch 80 0 150 3.20 2.16 1.04 83.2

Roasted 1.00 1.75 0.00 1.00 Roasted 200 0 200 4.50 3.10 1.40 280

Used Time 1780 3180 1366 3600

Available Time 3600 3600 3600 3600

No. of lb to produce Min lb to produce Max lb to produce SP/lb VC/Unit CM/Unit Total CM/product

Total CM 2913.2 Used 1016 764 Available 1100 800

Nuts Chocolate

0.60 0.40

0.40 0.60

0.20 0.80

1.00 0.00

Decision Variables: x1: no of Whole products to produce x2: no of Cluster products to produce x3: no of Crunch products to produce x4: no of Roasted products to produce Objective Function: Max Z: 1.85x1 + 1.4x2 + 1.04x3 + 1.4x4 (Total CM) Constraints: Subject to: x1 + x2 + x3 + x4 3600 (Available time in Hauling Machine) 2x1 + 1.5x2 + x3 + 1.75x4 3600 (Available time in Roasting Machine) x1 + .7x2 + .2x3 3600 (Available Time in Coating) 2.5x1 + 1.6x2 + 1.25x3 + x4 3600 (Available time in Packaging) x1 1000 (Minimum demand for Whole products) 400 x2 500 (Min/Max demand for Cluster products) x3 150 (Max demand for Crunch products) x4 200 (Max demand for Roasted products) .6x1 + .4x2 + .2x3 + x4 1100 (Available Nuts) .4x1 + .6x2 + .8x3 800 (Available Chocolate) Non negativity, Xj 0 and integer, J=1 to 4

Commodity 1 2 3 4 Cargo Hold Forward Center Rear

Amount Available (tons) 4800 2500 1200 1700 Weight Capacity (tons) 3000 6000 4000

Volume per Ton (cubic feet) 40 25 60 55 Volume Capacity (cubic feet) 145000 180000 155000

Profit per Ton ($) 70 50 60 80

Commodity 1 2 3 4

Weight Used Weigt Capacity Volume Used Volume Capacity

Decision Variables: x1: no of tons of commodity 1 to be placed on forward position x2: no of tons of commodity 1 to be placed on center position x3: no of tons of commodity 1 to be placed on rear position x4: no of tons of commodity 2 to be placed on forward position x5: no of tons of commodity 2 to be placed on center position x6: no of tons of commodity 2 to be placed on rear position x7: no of tons of commodity 3 to be placed on forward position x8: no of tons of commodity 3 to be placed on center position x9: no of tons of commodity 3 to be placed on rear position x10: no of tons of commodity 4 to be placed on forward position x11: no of tons of commodity 4 to be placed on center position x12: no of tons of commodity 4 to be placed on rear position Objective Function Max Z: 70*(x1 + x2 + x3) + 50*(x4+x5+x6) + 60*(x7+x8+x9) + 80*(x10+x11+x12) [Total Profit] Constraints: Subject To: x1 + x2 + x3 4800 ( Available Tons on Commodity 1) x4 + x5 + x6 2500 (Available Tons on Commodity 2) x7 + x8 + x9 1200 (Available Tons on Commodity 3) x10 + x11 + x12 1700 (Available Tons on Commodity 4) x1 + x4 + x7 + x10 3000 (Forward Cargo weight capacity on tons) x2 + x5 + x8 + x11 6000 (Center Cargo weight capacity on tons) x3 + x6 + x9 + x12 4000 (Rear Cargo weight capacity on tons) 40x1 + 25x4 + 60x7 + 55x10 145000 (Forward Cargo volume capacity) 40x2 + 25x5 + 60x8 + 55x11 180000 (Center Cargo volume capacity) 40x3 + 25x6 + 60x9 + 55x12 155000 (Rear Cargo volume capacity) Balance Considerations: x1 + x4 + x7 + x10 .1*(x3 + x6 + x9 + x12) x2 + x5 + x8 + x11 .4*(x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 + x12)

x2 + x5 + x8 + x11 .6*(x1 + x2 + x3 + x4 + x5 + x6 + x7 + x8 + x9 + x10 + x11 + x12) Xj 0 and integer, j= 1 to 12

Forward 0 0 0 400

Center 1066 670 1198 0

Rear 2700 0 0 1300

Used Tons 3766 670 1198 1700 Totals 7334 13000 202000 480000

Available Tons 4800 2500 1200 1700

Total CM 505000

400 3000 22000 145000

2934 6000 180000 180000

4000 4000 0 155000

PC Board (square inc) Resistors Memory Chips Assembly Labor (hrs) No. of Cards to Produce Actual Cards Produced Target Cards to Produce

Hyperlink 20 28 8 0.75

Per Unit Requirements Fastlink Speedlink Microlink Etherlink 15 10 8 5 24 18 12 16 8 4 4 6 0.6 0.5 0.65 1

Used 60500 100000 30000 3687.5

Available 80000 100000 30000 5000 Total CM 215000

500 500 500

1000 1000 500

1500 1500 500

2250 2250 500

500 500 500

Wholesale Price Manufacturing Cost CM

Per Unit Revenues and Costs Hyperlink Fastlink Speedlink Microlink Etherlink 189 149 129 169 139 136 101 96 137 101 53 48 33 32 38

Decision Variables: x1: no. of Hyperlink cards to produce x2: no. of Fastlink cards to produce x3; no. of Speedlink cards to produce x4: no. of Microlink cards to produce x5: no of Etherlink cards to produce Objective Function: Max Z: 53x1 + 48x2 + 33x3 + 32x4 + 38x5 (Total Profit) Subject to: 20x1 + 15x2 + 10x3 + 8x4 + 5x5 80000 (PC Board Available) 28x1 + 24x2 + 18x3 + 12x4 + 16x5 100000 (Resistors Available) 8x1 + 8x2 + 4x3 + 4x4 + 6x5 30000 (Memory Chips Available) 0.75x1 + 0.6x2 + 0.5x3 + 0.65x4 + x5 5000 (Assembly Time Available) x1 500 (Hyperlink Cards to produce) x2 500 (Fastlink Cards to produce) x3 500 (Speedlink Cards to produce) x4 500 (Microlink Cards to produce) x5 500 (Etherlink Cards to produce) x2 2x1 (Fastlink atleast twice as Hyperlink) Non negativity Xj 0 and integer, j = 1 to 5

HL Units Minumum SP/unit VC/unit CM/unit Total CM/Unit 500 500

189 136 53

FL 1000 500
149 101 48

SL 1500 500
129 96 33

ML 2250 500
169 137 32

EL
500

Ratio of FL to HL 500
139 101 38 FL 1000 Total CM

26500
Hyperlink 20 28 8 0.75

48000

49500

72000

19000

215000
Used 60500 100000 30000 3687.5 Available 80000 100000 30000 5000

PC Board (square inc) Resistors Memory Chips Assembly Labor (hrs)

Fastlink Speedlink Microlink Etherlink 15 10 8 5 24 18 12 16 8 4 4 6 0.6 0.5 0.65 1

Ratio of FL to HL
2 HL 1000

Microsoft Excel 12.0 Answer Report Worksheet: [Assignment.xlsx]#22 Report Created: 06/10/13 12:04:04 PM Target Cell (Max) Cell Name $H$9 Target Cards to Produce Total CM Adjustable Cells Cell Name $B$7 No. of Cards to Produce Hyperlink $C$7 No. of Cards to Produce Fastlink $D$7 No. of Cards to Produce Speedlink $E$7 No. of Cards to Produce Microlink $F$7 No. of Cards to Produce Etherlink Constraints Cell Name $G$3 PC Board (square inc) Used $G$4 Resistors Used $G$5 Memory Chips Used $G$6 Assembly Labor (hrs) Used $B$8 Actual Cards Produced Hyperlink $C$8 Actual Cards Produced Fastlink $D$8 Actual Cards Produced Speedlink $E$8 Actual Cards Produced Microlink $F$8 Actual Cards Produced Etherlink $C$8 Actual Cards Produced Fastlink $B$7 No. of Cards to Produce Hyperlink $C$7 No. of Cards to Produce Fastlink $D$7 No. of Cards to Produce Speedlink $E$7 No. of Cards to Produce Microlink $F$7 No. of Cards to Produce Etherlink

Original Value 0 Original Value 0 0 0 0 0 Cell Value 60500 100000 30000 3687.5 500 1000 1500 2250 500 1000 500 1000 1500 2250 500

Final Value 215000 Final Value 500 1000 1500 2250 500 Formula $G$3<=$H$3 $G$4<=$H$4 $G$5<=$H$5 $G$6<=$H$6 $B$8>=$B$9 $C$8>=$C$9 $D$8>=$D$9 $E$8>=$E$9 $F$8>=$F$9 $C$8>=2*$B$8 $B$7=integer $C$7=integer $D$7=integer $E$7=integer $F$7=integer Status Not Binding Binding Binding Not Binding Binding Not Binding Not Binding Not Binding Binding Binding Binding Binding Binding Binding Binding Slack 19500 0 0 1312.5 0 500 1000 1750 0 0 0 0 0 0 0

Hours Required per Trimmer Electric Gas Production 0.2 0.4 Assembly 0.3 0.5 Packaging 0.1 0.1 Make Cost 55 85 Buy Cost 67 95 Supplies 30000 15000 Electric Make Cost 55 Buy Cost 67 Total Trimmers Contracted Supplies Gas 85 95

Used Hours 10000 14000 4000

Hrs Available 10000 15000 5000

Electric Qty 30000 0 30000 30000

Gas Qty 10000 5000 15000 15000

Total Cost 2975000

Decision Variables; x1: no of electric trimmer to make in house x2: no of electric trimmer to buy from competitor x3: no of gas trimmer to make in house x4: no of gas trimmer to buy from competitor Objective Function: Min Z: 55x1 + 67x2 + 85x3 + 95x4 (Total Cost) Constraints: Subject to: x1 + x3 = 30000 (Contracted Supplies for Electric Trimmers) x2 + x4 = 15000 (Contracted Supplies for Gas Trimmers) .2x1 + .4x3 10000 (Available Production to Make) .3x1 + .5x3 15000 (Available Assembly to Make) .1x1 + .1x3 5000 (Available Packaging to Make) Non negativity: Xj 0 and integer, j=1 to 4

Month Beginning Inventory Units Demanded Production Capacity Minimum Production Units Produce Estimated Ave Inv Ending Inventory Required Min Inv Production Cost Inventory Cost 1 120 420 500 400 410 115 110 50 49 1.5 2 110 580 520 400 520 80 50 50 45 1.5 3 50 310 450 400 400 95 140 50 46 1.5 4 140 540 550 400 450 95 50 50 47 1.5

Total Cost 83617.5

Decision Variables: x1: No. of units produce for Month 1 x2: No. of units produce for Month 2 x3: No. of units produce for Month 3 x4: No. of units produce for Month 4 x5: No. of units in inventory for Month 1 x6: No. of units in inventory for Month 2 x7: No. of units in inventory for Month 3 x8: No. of units in inventory for Month 4

Objective Function: Min Z: 49x1 + 45x2 + 46x3 + 47x4 + 1.5(120 + x5)/2 + 1.5(x5 + x6)/2 + 1.5(x6 + x7)/2 + 1.5(x7 + x8)/2 (Total Production & Inven Subject to: 400 x1 500 (Month 1 Production) 400 x2 520 (Month 2 Production) 400 x3 450 (Month 3 Production) 400 x4 550 (Month 4 Production) x5 = 120 + x1 - 420 50 (Safety Stocks for Month 1) x6 = x5 + x2 - 580 50 (Safety Stocks for Month 2) x7 = x6 + x3 - 310 50 (Safety Stocks for Month 3) x8 = x7 + x4 - 540 50 (Safety Stocks for Month 4) Non negatvity: Xj 0 and integer, J=1 to 8

x8)/2 (Total Production & Inventory Cost)

Investment Available Matures (yrs) A Every year 1 B 1, 3, 5, 7 2 C 1, 4 3 D 1 7

Return at Maturity (%) 6 14 18 65

Solution: Vineyard 1 2 Price/Bottle

Shipping Cost per Bottle of Wine Restaurant 1 2 3 7 8 13 12 6 8 69 67 70 Profits per Bottle 2 3 36 34 36 37 Bottles to Sell 2 3 1700 0 600 1250 2300 1250 2300 1250

4 9 7 66

Production Cost 23 25

Vineyard 1 2

1 39 32

4 34 34

Total CM

241,750

Vineyard 1 2 Received Demand

1 1800 0 1800 1800

4 0 1250 1250 1750

Produce 3500 3100 7100

Capacity 3500 3100

Decision Variables: x1: no of bottles to ship from Vineyard 1 to Restaurant 1 x2: no of bottles to ship from Vineyard 1 to Restaurant 2 x3: no of bottles to ship from Vineyard 1 to Restaurant 3 x4: no of bottles to ship from Vineyard 1 to Restaurant 4 x5: no of bottles to ship from Vineyard 2 to Restaurant 1 x6: no of bottles to ship from Vineyard 2 to Restaurant 2 x7: no of bottles to ship from Vineyard 2 to Restaurant 3 x8: no of bottles to ship from Vineyard 2 to Restaurant 4 Objective Function: Max Z: 39x1 + 36x2 + 34x3 + 34x4 + 32x5 + 36x6 + 37x7 + 34x8 (Total Profit) Subject To: x1 + x2 + x3 + x4 = 3500 (Bottles produced from Vineyard 1) x5 + x6 + x7 + x8 = 3100 (Botlles produced from Vineyard 2) x1 + x5 1800 (Restaurant 1 demanded bottles) x2 + x6 2300 (Restaurant 2 demanded bottles) x3 + x7 1250 (Restaurant 3 demanded bottles) x4 + x8 1750 (Restaurant 4 demanded bottles) Non negativity: Xj 0 and integer, j=1 to 8

Vineyard 1 2

Qty Delivered Max Demand

1 1800 0 1800 1800

2 1700 600 2300 2300

3 0 1250 1250 1250

4 0 1250 1250 1750

Qty Supplied Capacity 3500 3500 3100 3100

VY 1 2 Total CM

Total CM per Vineyard per Resto 1 2 3

70200 0 61200 21600 0 46250

4
0 42500

70200

82800

46250 Shipping Cost 1

7 12

42500

Total 131400 110350 241750

VY 1 2

Capacity 3500 3100 CM per bottle 1

39 32 69

Cost 23 25

2
8 6

3
13 8

4
9 7

VY 1 2 SP Resto 1 2 3 4

2
36 36 67

3
34 37 70

4
34 34 66

Max Demand 1800 2300 1250 1750

Microsoft Excel 12.0 Answer Report Worksheet: [Book1]Sheet1 Report Created: 06/09/13 6:13:10 PM Target Cell (Max) Cell $G$10 Total Profit:

Name

Original Value 0

Final Value 241,750

Adjustable Cells Cell Name $B$15 Shipping Cost per Bottle of Wine $C$15 Bottles to Sell $D$15 $E$15 $B$16 Shipping Cost per Bottle of Wine $C$16 Bottles to Sell $D$16 $E$16 Constraints Cell Name $F$15 Produce $F$16 Produce $B$17 Received Shipping Cost per Bottle of Wine $C$17 Received Bottles to Sell $D$17 Received $E$17 Received $B$15 Shipping Cost per Bottle of Wine $C$15 Bottles to Sell $D$15 $E$15 $B$16 Shipping Cost per Bottle of Wine $C$16 Bottles to Sell $D$16 $E$16

Original Value 0 0 0 0 0 0 0 0

Final Value 1800 1700 0 0 0 600 1250 1250

Cell Value 3500 3100 1800 2300 1250 1250 1800 1700 0 0 0 600 1250 1250

Formula $F$15=$G$15 $F$16=$G$16 $B$17<=$B$18 $C$17<=$C$18 $D$17<=$D$18 $E$17<=$E$18 $B$15=integer $C$15=integer $D$15=integer $E$15=integer $B$16=integer $C$16=integer $D$16=integer $E$16=integer

Status Not Binding Not Binding Binding Binding Binding Not Binding Binding Binding Binding Binding Binding Binding Binding Binding

Slack 0 0 0 0 0 500 0 0 0 0 0 0 0 0