Scribd
Upload
6 views

Lecture 2 (Solving A LPP Graphically

Uploaded by

sakshamr179
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
6 views

Lecture 2 (Solving A LPP Graphically

Uploaded by

sakshamr179
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

GRAPHICAL SOLUTION OF AN

LPP
Solving a maximization LPP
Solving a minimization LPP
STEPS TO SOLVING AN LPP GRAPHICALLY
 Step 1: Modify each constraint by replacing the
inequality sign (≤ ≥ ) with the equal to sign (=)
 Step 2: Solve each equation to obtain two points
such that the equation can be plotted on the graph
paper.
 This can be done by finding the value of ‘y’ when x = 0
and then the value of ‘x’ when y = 0.
 A minimum of 2 points are needed to draw a line.
 Step 3: Taking an appropriate scale for the ‘x’ & ‘y’
axis, draw the constraint equations on the graph
paper.
STEPS TO SOLVING AN LPP GRAPHICALLY
 Step 4: Identify the solution region for each
constraint equation.
 If the original constraint was ≤ type, the solution to
the constraint lies between its line and the origin.
This means the solution includes the origin (0,0).
 If the original constraint was ≥ type, the solution to
the constraint lies between its line and infinity. This
means the solution does not include the origin (0,0).
 If the original constraint was = type, all points on the
line are a part of its solution.
 Step 5: Identify the common solution region that
satisfies all given constraints.
STEPS TO SOLVING AN LPP GRAPHICALLY
 Step 6: Name the corner points of the feasible
region and read their values from the graph.
 Step 7: Now find the value of the objective
function at each of these points.
 Step 8: The optimum solution is the one that
gives largest (for Max Z) and least (for Min Z)
value of the objective function.
 Step 9: The values of the identified corner point
is the optimum value of the decision variable of
the LPP.
MAXIMIZATION CASE
An example of graphical solution of LPP
THE COMPLETED LPP (FROM LECTURE 1)
Objective function
Max Z = 40 x + 35 y
Subject to:
raw material 2 x + 3 y ≤ 60
labor hours 4 x + 3 y ≤ 96
NNC x ≥ 0, y ≥ 0
SOLVE TO OBTAIN 2 POINTS PER
CONSTRAINT

Material constraint 2x + 3y = 60
When x=0, y = 60/3 = 20 hence the point is (0, 20)
When y=0, x=60/2 = 30 hence the point is (30, 0)

labor hours constraint 4x + 3y = 96


When x=0, y = 96/3 = 32 hence the point is (0, 32)
When y=0, x= 96/4 = 24 hence the point is (24, 0)

Drawing these on the graph paper will give us the


following graph:
THE GRAPH OF LPP
35

30

25

20
material constarint

15 labor hours constraint

10

0
0 5 10 15 20 25 30 35
The feasible region of each equation
The feasible solution region- ABCD
THE CORNER POINTS OF THE SOLUTION
REGION – A-B-C-D

 A (0, 0)
 B (0, 20)

 C (18, 8)

 D (24, 0)

Now calculate the value of the objective function at


each of these points:
THE OBJECTIVE FUNCTION IS
MAX Z = 40 X + 35 Y
 A (0, 0) = 40 (0) + 35 (0) = 0
 B (0, 20) = 40 (0) + 35 (20) = 700

 C (18, 8) = 40 (18) + 35 (8) = 1000

 D (24, 0) = 40 (24) + 35 (0) = 960

as can be observed, the largest value of objective


function is obtained at point C (18, 8).

SOLUTION:
The optimum solution of the LPP:
The firm should manufacture18 units of product A
and 8 units of product B at a profit of Rs 1000.
MINIMIZATION CASE
An example of formulation of LPP
COMPLETE LPP (FROM LECTURE 1)
Objective function
Min Z = 40 x + 24 y
Subject to:
20 x + 50 y ≥ 4800 (Ph requirement)
80 x + 50 y ≥ 7200 (N requirement)
x ≥ 0, y ≥ 0
SOLVE TO OBTAIN 2 POINTS PER
CONSTRAINT

(Ph constraint) 20x + 50y = 4800


When x=0, y =4800/50 = 96 hence the point is (0, 96)
When y=0, x=4800/20 =240 hence the point is (240,0)

(N constraint) 80x + 50y = 7200


When x=0, y=7200/50 =144 hence the point is (0,144)
When y=0, x= 7200/80 = 90 hence the point is (90, 0)

Drawing these on the graph paper will give us the


following graph:
THE GRAPH OF LPP
160

140

120

100

80 Ph Constraint
N constraint

60

40

20

0
0 50 100 150 200 250 300
IDENTIFY THE FEASIBLE REGION OF EACH
CONSTRAINT
THE FEASIBLE AREA AND ITS CORNER
POINTS – A-B-C
THE CORNER POINTS OF THE SOLUTION
REGION – A-B-C

 A (0,144)
 B (40,80)

 C (240,0)

Now calculate the value of the objective function at


each of these points:
OBJECTIVE FUNCTION
MIN Z = 40 X + 24 Y
 A (0,144) = 40 (0) + 24 (144) = 3456
 B (40,80) = 40 (40) + 24 (80) = 3520

 C (240,0) = 40 (240) + 24 (0) = 9600

as can be observed, the smallest value of objective


function is obtained at point A (0, 144).
SOLUTION:
The optimum solution of the LPP:
The farmer should purchase 0 bags of mixture A
and 144 bags of mixture B at a cost of Rs 3456.

You might also like