Scribd
Upload
34 views1 page

QT 7

The document describes how to graphically solve linear programming problems (LPPs) with two decision variables by taking inequality constraints as equalities, drawing the feasible region defined by the constraints on a graph, and selecting the corner point that optimizes the objective function. It defines an optimal solution as one that satisfies all constraints and optimizes the objective function. It provides an example problem to maximize an objective function subject to two constraints over non-negative variables.

Uploaded by

Susmita Basu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views1 page

QT 7

The document describes how to graphically solve linear programming problems (LPPs) with two decision variables by taking inequality constraints as equalities, drawing the feasible region defined by the constraints on a graph, and selecting the corner point that optimizes the objective function. It defines an optimal solution as one that satisfies all constraints and optimizes the objective function. It provides an example problem to maximize an objective function subject to two constraints over non-negative variables.

Uploaded by

Susmita Basu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Graphical Solution to LPP

Linear programming problems involving two decision variables can be easily solved by the graphical method. The LPP can have any number of constraints, but there should be only two decision variables. An LPP can have more than one optimal solution. The methodology of solving the LPP graphically is explained below. Step 1: Take inequality constraints as equalities. Find out the x1 and x2 values. Step 2: Draw a graph that includes all the constraints/restrictions and identify the feasible region that is the solution space. Step 3: The feasible region obtained may be bounded or unbounded. Compute the coordinates of all the corner points of the feasible region. Step 4: Select the corner point obtained in step 3 that optimizes (maximizes or minimizes) the objective function. Step 5: Interpret the result.

Optimum Solution to an LPP


Any solution that satisfies all the constraints of the problem is a feasible solution. An optimal solution exists only when there is a feasible region. The feasible solution that optimizes the objective function is called as the optimum feasible solution.

Example
Solve graphically the following LPP: Maximize Z = 30x1+ 20x2 subject to the constraints 2x1+ x2 =800 and x1+2x2 = 1000 and x1, x2=0.

You might also like