Integral Linear Programs
A linear program in real variables is said to be integral if it has at least one optimal solution which is integral. Likewise, a polyhedron is said to be integral if for all bounded feasible objective functions c, the linear program has an optimum with integer coordinates. As observed by Edmonds and Giles in 1977, one can equivalently say that a polyhedron is integral if for every bounded feasible integral objective function c, the optimal value of the linear program is an integer.
Integral linear programs are of central importance in the polyhedral aspect of combinatorial optimization since they provide an alternate characterization of a problem. Specifically, for any problem, the convex hull of the solutions is an integral polyhedron; if this polyhedron has a nice/compact description, then we can efficiently find the optimal feasible solution under any linear objective. Conversely, if we can prove that a linear programming relaxation is integral, then it is the desired description of the convex hull of feasible (integral) solutions.
Note that terminology is not consistent throughout the literature, so one should be careful to distinguish the following two concepts,
- in an integer linear program, described in the previous section, variables are forcibly constrained to be integers, and this problem is NP-hard in general,
- in an integral linear program, described in this section, variables are not constrained to be integers but rather one has proven somehow that the continuous problem always has an integral optimal value (assuming c is integral), and this optimal value may be found efficiently since all polynomial-size linear programs can be solved in polynomial time.
One common way of proving that a polyhedron is integral is to show that it is totally unimodular. There are other general methods including the integer decomposition property and total dual integrality. Other specific well-known integral LPs include the matching polytope, lattice polyhedra, submodular flow polyhedra, and the intersection of 2 generalized polymatroids/g-polymatroids --- e.g. see Schrijver 2003.
A bounded integral polyhedron is sometimes called a convex lattice polytope, particularly in two dimensions.
Read more about this topic: Linear Programming
Famous quotes containing the words integral and/or programs:
“... no one who has not been an integral part of a slaveholding community, can have any idea of its abominations.... even were slavery no curse to its victims, the exercise of arbitrary power works such fearful ruin upon the hearts of slaveholders, that I should feel impelled to labor and pray for its overthrow with my last energies and latest breath.”
—Angelina Grimké (1805–1879)
“We attempt to remember our collective American childhood, the way it was, but what we often remember is a combination of real past, pieces reshaped by bitterness and love, and, of course, the video past—the portrayals of family life on such television programs as “Leave it to Beaver” and “Father Knows Best” and all the rest.”
—Richard Louv (20th century)