ip-solve - How to solve Integer Proggramming problems Idea...

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

View Full Document Right Arrow Icon
How to solve Integer Proggramming problems? Idea: Ignore the “integer” constraints, solve the LP relaxation, and then round. Problem 1: May need to change some variables that were integer, or change variables by more that 1 unit. x 1 + x 2 3 . 5 x 1 + x 2 16 . 5 x 1 , x 2 0 integer Problem 2: Rounded soltuion may not be optimal to the IP. max z = x 1 + 5 x 2 s . t . x 1 + 10 x 2 20 x 1 2 x 1 , x 2 0 integer So what to do???? 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Exhaustive enumeration: Check all integer points within the feasible region, and pick the best one. max z = 2 x 1 + x 2 s . t . x 1 + x 2 5 x 1 + x 2 0 6 x 1 + 2 x 2 21 x 1 , x 2 0 integer Problem: Very slow. 2
Background image of page 2
Branch and Bound, Sections 9-3, 9-4. Solve an LP relaxtion of a (sub) problem. If there is a variable x i = f that is required to be integer, but is not, then branch : Create 2 new subproblems, one with x i ≤ ⌊ f , and the other with x i ≥ ⌈ f . Bound:
Background image of page 3

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

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

Page1 / 5

ip-solve - How to solve Integer Proggramming problems Idea...

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

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