lect23 - ISE 536Fall03: Linear Programming and Extensions...

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

View Full Document Right Arrow Icon
ISE 536–Fall03: Linear Programming and Extensions November 26, 2003 Lecture 23: Integer Programming, Modeling Lecturer: Fernando Ord´o˜nez 1 Mixed Integer Programming Problem Here we study linear programming problems with some variables constrained to be integer. For example: min c t x + d t y s . t . Ax + By = b x, y 0 x integer Mixed integer programming problem: Integer programming problem: Binary programming problem: Example (zero-one knapsack problem). We are given n items, each has weight w j and value c j . Given a bound K on the weight that we can carry on the knapsack, we would like to select the items that maximize the total value. Formulate this as an integer programming problem. 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
Things that can be represented with integer variables: x y and x, y binary: x 1 + x 2 + x 3 1, x i binary: x 1 + x 2 + x 3 = 1, x i binary: The vectors a i 0, i = 1 , . . . , m and a t i x b i y i i = 1 , . . . , m m X i =1 y i k y i ∈ { 0 , 1 } i = 1 , . . . , m
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course ISE 536 taught by Professor Yy during the Spring '05 term at South Carolina.

Page1 / 4

lect23 - ISE 536Fall03: Linear Programming and Extensions...

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

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