This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math 482 (Lecture 18): Integer linear programming (introduction) This lecture discusses Chapter 13 of the textbook. Definition: An integer linear programming problem (ILP) is the optimization problem: min c'x Ax=b x 0 x is integral . * All transformations to/from standard to canonical form, that we introduced for LP's remain valid. * In general one cannot hope to come close to the correct solution to (ILP) by rounding, although this can be a useful strategy sometimes. Example/in class exercise: Consider the assignment problem: a software company has n employees and m tasks (say, owners of the software sending in an "SR"=service request). All of the owners have paid a one time fee for service, so the only difference is the time it takes to complete the job. Say c i,j is the time it takes for employee i to solve task j. The problem is to assign employees to tasks so that the total amount of time spent is as small as possible....
View
Full
Document
This note was uploaded on 02/19/2012 for the course MATH 482 taught by Professor Staff during the Spring '08 term at University of Illinois, Urbana Champaign.
 Spring '08
 Staff
 Linear Programming, Transformations

Click to edit the document details