Graphical Method of Solution of a Linear Programming Problem

So far we have learnt how to construct a mathematical model for a linear

programming problem. If we can find the values of the decision variables x1, x2,
x3, ..... xn, which can optimize (maximize or minimize the ob!ective function ", then
we sa# that these values of xi are the optimal solution of the $inear %rogram ($%.
&he graphical method is applicable to solve the $%% involving two decision
variables x1, and x2, we usuall# ta'e these decision variables as x, # instead of x1,
x2. &o solve an $%, the graphical method includes two ma!or steps.

a &he determination of the solution space that defines the feasible solution. (ote
that the set of values of the variable x1, x2, x3,....xn which satisf# all the constraints
and also the non)negative conditions is called the feasible solution of the $%.
b &he determination of the optimal solution from the feasible region.

a &o determine the feasible solution of an $%, we have the following steps.

Step 1: Since the two decision variable x and # are non)negative, consider onl# the
first *uadrant of x#)coordinate plane

+raw the line ax , b# - c (1

.or each constraint,
the line (1 divides the first *uadrant in to two regions sa# /1 and /2, suppose (x1,
0 is a point in /1. If this point satisfies the in e*uation ax , b# c or ( c, then
shade the region /1. If (x1, 0 does not satisf# the ine*ualit#, shade the region /2.

Step 3: 1orresponding to each constant, we obtain a shaded region. &he
intersection of all these shaded regions is the feasible region or feasible solution of
the $%.

$et us find the feasible solution for the problem of a decorative item dealer whose
$%% is to maximize profit function.

" - 20x , 13# (1
Sub!ect to the constraints



Step 1: Since x 0, # 0, we consider onl# the first *uadrant of the x# ) plane

Step 2: 4e draw straight lines for the e*uation

2x, # - 100 (2
x , # - 30

&o determine two points on the straight line 2x , # - 100

%ut # - 0, 2x - 100

x - 20

(20, 0 is a point on the line (2

put x - 0 in (2, # -100

(0, 100 is the other point on the line (2

%lotting these two points on the graph paper draw the line which represent the line
2x , # -100.
&his line divides the 1
st
*uadrant into two regions, sa# /1 and /2. 1hoose a point
sa# (1, 0 in /1. (1, 0 satisf# the ine*ualit# 2x , # 100. &herefore /1 is the
re*uired region for the constraint 2x , # 100.
Similarl# draw the straight line x , # - 30 b# !oining the point (0, 30 and (30, 0.
.ind the re*uired region sa# /15, for the constraint x , # 30.
&he intersection of both the region /1 and /15 is the feasible solution of the $%%.
&herefore ever# point in the shaded region 6781 is a feasible solution of the $%%,
since this point satisfies all the constraints including the non)negative constraints.

b &here are two techni*ues to find the optimal solution of an $%%.

Corner Point Method
&he optimal solution to a $%%, if it exists, occurs at the corners of the feasible
region.

&he method includes the following steps

Step 1: .ind the feasible region of the $$%.
Step 2: .ind the co)ordinates of each vertex of the feasible region.

&hese co)ordinates can be obtained from the graph or b# solving the e*uation of
the lines.
Step 3: 7t each vertex (corner point compute the value of the ob!ective function.
Step 4: Identif# the corner point at which the value of the ob!ective function is
maximum (or minimum depending on the $%

&he co)ordinates of this vertex is the optimal solution and the value of " is the
optimal value

Example: .ind the optimal solution in the above problem of decorative item dealer
whose ob!ective function is " - 20x , 13#.

In the graph, the corners of the feasible region are

6 (0, 0, 7 (0, 30, 8(20, 90, 1(20, 0

7t (0, 0 " - 0
7t (0, 30 " - 20 (0 , 13(30

- 1::0
7t (20, 90, " - 20 (20 ,13 (90

- 1000 , 1030 - /s.2030

7t (20, 0 " - 20 (20 , 13 (0

- 2200.

Since our ob!ect is to maximize " and " has maximum at (20, 0 the optimal
solution is x - 20 and # - 0.

&he optimal value is 2200.

If an $%% has man# constraints, then it ma# be long and tedious to find all the
corners of the feasible region. &here is another alternate and more general method
to find the optimal solution of an $%, 'nown as 5IS6 profit or IS6 cost method5
S!" P#!$% &!# S!"C!S%'

Method of Sol(ing Linear Programming Problem)

Suppose the $%% is to

6ptimize " - ax , b# sub!ect to the constraints



&his method of optimization involves the following method.

Step 1: +raw the half planes of all the constraints

Step 2: Shade the intersection of all the half planes which is the feasible region.

Step 3: Since the ob!ective function is " - ax , b#, draw a dotted line for the
e*uation ax , b# - ', where ' is an# constant. Sometimes it is convenient to ta'e '
as the $1; of a and b.

Step 4: &o maximise " draw a line parallel to ax , b# - ' and farthest from the
origin. &his line should contain at least one point of the feasible region. .ind the
coordinates of this point b# solving the e*uations of the lines on which it lies.

&o minimise " draw a line parallel to ax , b# - ' and nearest to the origin. &his line
should contain at least one point of the feasible region. .ind the co)ordinates of this
point b# solving the e*uation of the line on which it lies.

Step *: If (x1, #1 is the point found in step :, then

x - x1, # + #1, is the optimal solution of the $%% and

" - ax1 , b#1 is the optimal value.

&he above method of solving an $%% is more clear with the following example.

Example: Solve the following $%% graphicall# using IS6) profit method.

maximize " -100 , 100#.

Sub!ect to the constraints






Sugge)ted an),er:

since x 0, # 0, consider onl# the first *uadrant of the plane graph the following
straight lines on a graph paper

10x , 2# - 30 or 2x,# -19
9x , 9# - 99 or x ,# -11

:x, 3# - 2: or x, 2# - 9

2x , 9# - <0

Identif# all the half planes of the constraints. &he intersection of all these half
planes is the feasible region as shown in the figure.


=ive a constant value 900 to " in the ob!ective function, then we have an e*uation
of the line
120x , 100# - 900 (1

or 9x , 2# - 30 (+ividing both sides b# 20

%1>1 is the line corresponding to the e*uation 9x , 2# - 30. 4e give a constant
1200 to " then the %2>2 represents the line.

120x , 100# - 1200

9x , 2# - 90

%2>2 is a line parallel to %1>1 and has one point 5;5 which belongs to feasible
region and farthest from the origin. If we ta'e an# line %3>3 parallel to %2>2 awa#
from the origin, it does not touch an# point of the feasible region.

&he co)ordinates of the point ; can be obtained b# solving the e*uation 2x , # -
19

x , # -11 which give

x - 2 and # - 9
&he optimal solution for the ob!ective function is x - 2 and # - 9

&he optimal value of "

120 (2 , 100 (9 - 900 , 900

- 1200