This Demonstration illustrates the graphical solution to several linear programming problems, all of which have the same set of constraints; you can vary the objective function. When two corner points are optimal, so are all the points on the line segment connecting them. The region shaded in blue is the feasible region and the colored lines correspond to the constraints. The black line represents the chosen objective function set to the slider value.