7. Lab Week 8 Problem Solutions

# 7. Lab Week 8 Problem Solutions - Lab Week 8 Problem...

This preview shows pages 1–5. Sign up to view the full content.

Lab Week 8 Problem Solutions CHAPTER 6 INTEGER PROGRAMMING METHODS 13. When using solver, make sure that "assume non-negativity" and "assume linear model" are checked under the options menu.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
17. Decision Variables: X 1, 2 = output from machines 1 and 2 respectively Y 1 = 1 if X 1 > 0, 0 if X 1 = 0 Y 2 = 1 if X 2 > 0, 0 if X 2 = 0 M = very large number (10000) Objective Function: Maximize Z: 50X 1 + 40X 2 – 250Y 1 – 210Y 2 Subject to Constraint 1: Constraint 2 : 2X 1 + 3X 2 ≤ 30 4X 1 + 2X 2 ≤ 36 Fixed Time Charge : Y 1 , Y 2 = binary X 1 – MY 1 ≤ 0 X 1 , X 2 >= 0 and integer X 2 – MY 2 ≤ 0
17b. When using solver, make sure "assume non-negativity" and "assume linear model" are checked under the options menu.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
18. 18a. Decision Variables: X 1, 2 = output from machines 1 and 2 respectively Y 1 = 1 if X 1 > 0, 0 if X 1 = 0 Y 2 = 1 if X 2 > 0, 0 if X 2 = 0 Objective Function: Minimize Cost: 50X 1 + 40X 2 + 250Y 1 + 210Y 2 Constraint 1: Constraint 2 : 2X 1 + 3X 2 ≤ 30 4X 1 + 2X
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

7. Lab Week 8 Problem Solutions - Lab Week 8 Problem...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online