{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# intpr1 - INTEGER LINEAR PROGRAMMING There are many LP...

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

INTEGER LINEAR PROGRAMMING There are many LP problems in which the decision variables will take only integer values. If all the decision variables will only take integer values it is called a pure integer LPP; otherwise the problem is called a mixed integer LPP. We discuss Land-Doig Branch and Bound algorithm to solve an integer LPP.

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

View Full Document
Branch-and-Bound Algorithm (Problem 2a problem set 9.2A page 378) Maximize 2 1 2 3 x x z + = 9 5 2 2 1 + x x 9 2 4 2 1 + x x Subject to 0 , 2 1 x x and integers
The set of feasible region consists of the Lattice points (0,0),(1,0),(2,0),(0,1),(1,1). The associated LPP, LP0 is defined by removing the integer restrictions. Solving we get x 1 =1.69, x 2 =1.13, z=7.31. Because the optimum LP0 solution does not satisfy the integer requirements, the B&B algorithm modifies the solution space in a manner that eventually identifies the integer optimum solution. First we select one of the variables whose optimum value at LP0 is not an integer. We select x 1 .

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

View Full Document
We replace the original LP0 with two new LPPs, LP1 and LP2 defined as LP1 space = LP0 space + LP2 space = LP0 space + ) 1 ( 1 x ) 2 ( 1 x We solve the LP1 problem (which is given by adding to LP0, the constraint
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 16

intpr1 - INTEGER LINEAR PROGRAMMING There are many LP...

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

View Full Document
Ask a homework question - tutors are online