A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Polyhedral Approaches to Mixed Integer Linear Programming
[chapter]

2009
*
50 Years of Integer Programming 1958-2008
*

This survey presents tools from polyhedral theory that are used in integer programming. It applies them to the study of valid inequalities for mixed integer linear sets, such as Gomory's mixed integer cuts. . Solving the LP relaxation, we get the optimal tableau: z + 1.16x 3 + 1.52x 4 = 28.16 The corresponding basic solution is x 3 = x 4 = 0, x 1 = 1.3, x 2 = 3.3 with objective value z = 28.16. Since the values of x 1 and x 2 are not integer, this is not a solution of (3). We can generate a cut

doi:10.1007/978-3-540-68279-0_11
fatcat:zfpkhg5oyveajpzk746wnfzh5u