Concept Map

This concept map shows how the chapter fits together. A linear programming problem is built from four ingredients — decision variables, an objective function, linear constraints and non-negativity conditions. Common types of LPP include manufacturing, diet, transportation and assignment problems. An LPP in two variables is solved graphically, either by the corner-point method (evaluating the objective at each vertex of the feasible region, which may be bounded or unbounded) or by the iso-profit / iso-cost method (sliding a line of constant objective value across the feasible region).