File:Linear programming polytope.png

The area surrounded by the blue line is the feasible region of the linear programming problem min { 300 x 1 + 500 x 2 | x 1 + 2 x 2 ≤ 170 , x 1 + x 2 ≤

DescriptionIP polytope with LP relaxation.png Polytopes of all feasible integer points and of the LP relaxation to the integer linear program max \{ y |

DescriptionIP polytope with LP relaxation.svg English: Polytopes of all feasible integer points and of the LP relaxation to the integer linear program max \{

DescriptionBranch-and-bound-polytopes.png English: Polytopes obtained by branching on variable x while solving the integer linear program max { y ∣ − x + y ≤

DescriptionSimplex-method.png Shows a linear programming polytope (blue) together with an objective function c (black) and a possible path (red) taken