Skip to main content

Posts

Showing posts from March 17, 2015

Graphical Method to Solve a Linear Programming Problem

The graphical method is applicable to solve the LPP involving two decision variables x 1 , and x 2 , we usually take these decision variables as x, y instead of x 1 , x 2 . To solve an LPP, the graphical method includes two major steps: a)   The determination of the solution space that defines the feasible solution.  Note that the set of values of the variable x 1 , x 2 , x 3 ,....x n which satisfy all the constraints and also the non-negative conditions are called the feasible solutions of the LPP. b)   Finding the optimal solution from the feasible region. a)To determine the feasible solutions of an LPP, we have the following steps: Step 1: Consider only the first quadrant of xy-coordinate plane(because both the variables x 1 and x 2 are non-negative). Step 2: Each equation is of the form ax+by≤c or ax+by≥c. Draw the line ax+by=0. For each equation, the line divides the first quadrant into two regions say R 1 and