integer_programming_1

integer_programming_1 - INTEGER PROGRAMMING I Pure Integer...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: INTEGER PROGRAMMING I Pure Integer Program. max z = 3 x 1 + 2 x 2 x 1 + x 2 6 x 1 int x 2 int x 1 x 2 Mixed Integer Program. max z = 3 x 1 + 2 x 2 x 1 + x 2 6 x 1 int x 2 real x 1 x 2 Saigal (U of M) IOE 310 1 / 1 INTEGER PROGRAMMING II 0-1 IP. max z = 3 x 1 + 2 x 2 x 1 + 2 x 2 2 2 x 1- x 2 1 x 1 = 0 or 1 x 2 = 0 or 1 LP Relaxation. max z = 3 x 1 + 2 x 2 x 1 + x 2 6 x 1 x 2 Saigal (U of M) IOE 310 2 / 1 FORMULATION Fixed Charge Case I A company produces shirts, shorts and pants. It must rent machines for the production. The data follows: Item Shirt Short Pant Max Avail M/c Rental Fee $200 $150 $100 Labor/unit 3 hrs 2 hrs 6 hrs 150 hrs Cloth/unit 4 yrds 3 yrds 4 yrds 160 yrds Sales Price $ 12 $ 8 $ 15 Variable cost $ 6 $ 4 $ 8 Formulate an IP to maximize profit. Saigal (U of M) IOE 310 3 / 1 FORMULATION Continued I Decision Variables: x 1 = number of shirts produced x 2 = number of shorts produced x 3 = number of pants produced y 1 = 1 if any shirts produced...
View Full Document

Page1 / 9

integer_programming_1 - INTEGER PROGRAMMING I Pure Integer...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online