{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# 331-13 - Chapter 6 Integer and Goal Programming Models...

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

Chapter 6 Integer and Goal Programming Models

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

View Full Document
Integer Programming Example Produce 2 products (lamps and ceiling fans) using 2 limited resources Decisions: How many of each product to make? (the results must be integers) Objective: Maximize profit Harrison Electric Co.
Using Integers- General Rules When a Decision Variable can be counted , we impose integer conditions. Examples- Units to produce or product mix, scheduling people. When a Decision Variable is measured , we do not. Examples- Weight, dimensions, \$.

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

View Full Document
Decision Variables L = number of lamps to make F = number of ceiling fans to make Lamps (per lamp) Fans (per fan) Hours Available Profit Contribution \$600 \$700 Wiring Hours 2 hrs 3 hrs 12 Assembly Hours 6 hrs 5 hr 30
IP Model Summary Max 600 L + 700 F (\$ of profit) Subject to the constraints: 2L + 3F < 12 (wiring hours) 6L + 5F < 30 (assembly hours) L, F > 0, integers

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

View Full Document
Graphical Solution Optimal IP Solution (L=3, F=2, Profit=\$3,200) 600 L + 700 F 600 L + 700 F
Solver Solution An LP model without Integer constraints is referred to as the Relaxed Solution Find the Relaxed Solution for 6.1.xls

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 13

331-13 - Chapter 6 Integer and Goal Programming Models...

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

View Full Document
Ask a homework question - tutors are online