CHAPTER

4
Linear Programming - II
Graphic Method

Learning Objectives
After completing this chapter, you should be
able to:
1.

2.
Describe graphing procedure of linear
programming. Formulation of linear programming
problem.
3. Identify LP problems that are amenable to graphical
solutions. Graphically solve to maximization and
minimization problem.
4.

Chapter Outline
4.1
Introduction

4.2 Graphing procedure

4.3
Formulation of the linear programming problem
4.4

4.5

4.6
The graphic solution to a maximization problem The graphic solution to
a minimization problem Glossary
4.7
 Review questions
4.8
Exercises

This chapter presents various concepts in which some problems are being
solved graphically, and some are being solved algebraically. This chapter also
introduces such technical issues in linear programming as extreme points,
infeasibility, unboundedness, redundancy, and multiple optimal solutions and
demonstrates those using graphic procedures.
34
Management Science and Operations Research

4.1 Introduction

The graphical technique of linear programming (LP) problems

is a conventional technique for determining the optimal solution. It
is used mostly to illustrate definite characteristics of a linear
programming problem and to help in demonstrating the simplex
method (see chapter 5). Although parishioners of management
science use the graphic method is a good way to begin to develop
an understanding of this useful quantitative technique. Practically, this
technique can be used only to manufacturing Television sets that involve two
decision variables and only a few constraints, such as the TV set assemble,
 finishing and storage. At the same time, such an LP application is not useful for
solving problems with more than two variables. This is illustrated in the following
graphic technique, and the TV set produced may be specified as:

Z=5x1 +20x2

} Objective
function
Maximize,

Subject
to,

Assembl
y
Finishing
Storage
5x1 + 5x2 ≤ 50 hours 5x1
+10x2≤ 40 hours 15x1+ 5x2
≤ 45 TV sets
Structural constraints

X1, X2 ≥ 0

} Non-negativity
condition
4.2 Graphing
Procedure
There are four steps to solving a graphical linear programming problem. The following steps
are:

1. Formulate the problem mathematically: Formulate all the above-mentioned constraints

into the equations of a straight line by replacing inequality signs with
equalities.
5x1+ 5x2 ≤ 50 becomes 5x1 + 5X2
 5x1+10x2≤ 40 becomes 5x1 +10x2 15x1+
5x2 ≤ 45 becomes 15x1 + 5x2
= 50
=

40

45
2. Plotting the constraints: The coordinates or corner points can be found by solving the
two remaining equations of the lines intersecting (horizontal and vertical) at that point.
First, have to compute the coordinates of any two points from the equations and
identify the points on the graph paper, and draw these straight lines across them as
presented in Graph 4.1:
Linear Programming-II Graphic Method
35

Graph 4.1 The Graph Showing the Corner Points

X2

15-

10-

5-
Corner point
D (0,4)
C (2,3)

A (0,0)
B (3,0)
10
X
1
15

3. Identify the feasible solution area: This is the region or area of a feasible solution that
contains all the points that are satisfied all the constraints simultaneously. It is the intersection
of all the valid areas represented by all the constraints of the problem. The feasible region or area for
the above constraints and/or the non-negativity constraints then becomes the common shaded
portion presented in Graph 4.2.

Graph 4.2 The Feasible Region Based on Plotting the Constrains

X2

15-

10-

5-

D (0,4)
C
(2,3)

A
Feasible region or
feasibility polygon

(0,0) (3,0)
(3,0) 5
10
15
X1

4. Determine the optimal solution: Identify the coordinates of each extreme point of the
feasible solution area. After finding the coordinates of the extreme points of the
feasible solution area, then construct a table and determine which corner point
provides the best value of the objective function. Since the above exhibit is of the
maximization method, the solution to the largest value (lowest value for a
minimization problem) of the objective function is the optimal solution
for this graphic LP problem. We see in Table
4.1.
36
Management Science and Operations
 Research

Table 4.1
Calculation of Objective
Function

Coordinates or
Objective function
Profit
Corner points
Z= 5x1 +20x2

A (0, 0)
0+0=0
0

B (3, 0)
(5×3)+0=15
15

C (2, 3)
(5×2) + (20×3) = 10+60 = 70
70

D (0, 4)
0+ (20×4)=0+80=80
80
√

The profit at each corner point can be calculated by substituting the

coordinates of the point into the objective function. Point D (x1 = 0, x2 = 4) is the
optimal solution because it yields the maximum profit (Z = 80) for the coordinates.

48 Formulation of the Linear Programming

Problem
The formulation of the linear programming approach consists of the following three
steps:
i. Find the key decision, identify the variables and assign symbols such as X1, X2,
X3 ....
Xn.
 ii. Identify the profit or objective function.
iii. Identify the constraints or restrictions.
For the previously mentioned TV set problem, we have defined our variables as x1 and x2. Let
x1 be the number of units of product A and x2, the number of units of product B. With that
example, the objective is to maximize the total profit that the manufacturer gets after selling
the two types of products which are given by
Maximize (total profit): Z = 5x1 +20x2
In this problem, the constraints are the limited availability of the three
operational departments: Assembly, Finishing, and Storage. Now, to
produce these two products, A and B, the total number of hours
required at the assembly center is given by 5x + 5x2. The total
number of hours required at the finishing unit and storage department,
i.e., 5x1 + 10x2 and 15x1 + 5x2, respectively.
Since the manufacturer does not have more than 50 hours available in the
assembly center, 40 hours available in the finishing unit, and 45 hours in the
storage department,
have

5x1 + 5x2 ≤ 50; 5x1 + 10x2 ≤ 40; 15x1 +5x2 ≤

45
we must

We must also remember that the manufacturer can't produce a

negative number of products, so we must include the non-negativity constraints,
X1, X2 O

The arrangement of the objective function and all the constraints

of the linear programming
is present in the formulation
model for the given examples.
S

1
1
t

S
Linear Programming-II Graphic Method
37

4.4 Graphic Solution to a Maximization Problem

Example 4.1
Solve the following linear programming problem by the graphic
technique:

Maximize, Z=2x1+3x2 } Objective

function

Solution
Subject to,
2x1 + x2 ≤20 5x1+2x2 ≤30
Structural constraints

Non-negativity
X1 ≥0, X2
≥0
}
condition/constraints

Let us first consider the structural constraints as

equations:
=
 2x1 + x2 20
5x1 + 2x2 = 30
1
2

For the first equation, set one variable equal to zero and solve for the other variable,
then set the other variable equal to zero and solve for the first variable. Then, identify the
coordinates on the graph and connect those two corner points with a straight line. The
procedure is then repeated for another pair of values for the rest of the equations.

From equation
number
when x1 = 0, X2 = 20
X1 = 10, X2 =
0

.. The coordinates of equation number are (0, 20) and (10, 0)

From equation number

when x1 = 0, x2 = 15
X1=6, X2 = 0

.. The coordinates of the equation number are (0, 15) and (6, 0)
After all of the coordinates have been plotted, shade in the feasible solution area.
Now plot the coordinates of equations and are on graph paper. The plot is shown in
Graph 4.3. Graph 4.3 A Graph of a Solved Problem
X2

201

C (0,15) 15

10-

5-

A (0,0)
(6.0)
XI
5B
10
15
20

38
Management Science and Operations
Research
 In the graph paper, the polygon
ABC is the feasibility polygon. The
optimal solution lies at the corner points of
the polygon. From the above graph, we get the
three extremes
coordinates A, B, and C, are (0, 0), (6, 0), and (0, 15),
respectively.
Now calculate the value of the objective function at
each of the coordinates calculated from
the following table:

Table 4.2
Calculation of Objective Function for
Example 4.1
Coordinates
or Corner
points

A (0,0)

B (6,0)
Objective
function Z=2x1 +
3x2
Z=2×0+3×0=0

Z=2×6+0=12

Z=2×0+3×15 = 45 √
 C(0, 15)

The above table shows that objective function Z is the maximum at the point
(0, 15), the optimum solutionis x1 = 0 and x2 = 15, and the maximum value of Z = 45.

Example 42
X1

Given the linear programming

problem:
Maximize, Z = 6x1 +7x2
Subject to,
2x1 + x2≤ 8
2x1 +3x2≤ 12

and X1, X2 ≥ 0
a. Graph the constraints.
b. Find the optimal values of X1, X2, and z.

Solution

a. Let us first consider the structural constraints as

equations:
=

8
2x1 + x2
2x1 +
3x2
=

12

From equation no. D

when x1 = 0, X2=8
X1 = 4, X2=0

.. The coordinates of equation no. O are (0, 8)

and (4, 0)
 From equation no.
when x1 = 0, x2 = 4
X1=6,
X2=0

.. The coordinates of equation no. are (0,

4) and (6, 0)
1
Linear Programming-II Graphic Method
39

Now plot the coordinates of equations and are on graph paper.

Graph 4.4 A Graph of a Solved Problem
X2

10-

8-

D(0,4) 4-

2-

A(0,0)
2
Optimu
m

AC
(3,2)

B (4,0)

4
6
8
X1
 10

In the graph paper, the polygon ABCD is the feasibility polygon. The optimal solution lies at
the corner points of the polygon.
b. From the above graph, we get the coordinates A, B, and D, are (0, 0), (4, 0), and (0, 4),
respectively. The corner point C is intersected with the equations, D, and . Therefore,
point C is obtained by solving equations,, and .
=

8
2x1 + x2 7x1
+ 3x2 12
=

1
2

-4
(subtracting)
- 2x2 .. X2
=2

Putting the value of x2 in equation no. O we

have,
2x1 + x2 = 8 or, 2x1 =8-2=6
.. X1 =
3

. The coordinates of the point C is (3,2)

Now calculate the value of the objective function from the following
table:
Table 4.3
Calculation of Objective Function for Example 4.2

Objective function
Z=6x1+7x2
Coordinates
or Corner points
A (0,0)
Z=6×0+7×0
=
 0

B (4,0)
Z=6×4+7×0 = 24

C(3,2)
Z=6×3+7×2 = 32 √
D (0,4)
Z=6×0+7x4 = 28
40
Management Science and Operations Research

The table shows that the objective function Z is the maximum at x1 = 3

and x2 = maximum value of Z = 32.

Example 4.3

Solve this linear programming problem

graphically:
Maximize, Z = 3x+4y

Solution
Subject to,
2x + y ≤ 30
x + 2y ≤ 40
3x + 3y ≤ 45
x, y ≥ 0

Let us first consider the structural constraints as equations:

2x + y = 30
y=
1

x + 2y = 40
2

3x + 3y = 45
 3

From equation no.

℗
when x = 0, y=30
x = 15, y=0
.. The coordinates of equation no. O are (0, 30) and (15, 0)
From equation no.
when x = 0, y = 20
x=40, y = 0
.. The coordinates of equation no. are (0, 20) and (40, 0)
From equation no. 3
when x = 0, y = 15
x = 15, y = 0
.. The coordinates of equation no. 3 are (0, 15) and (15,
0)
Now plot the coordinate of
equations 0, Graph 4.5 A Graph of a
Solved Problem
and 3 are on graph
paper.
y

40

30

20

C(0, 15)

10-

A(0,0)
(15,0)
10 B
X
20
30
40
2 and the
Linear Programming-II Graphic Method
 41

In the graph paper, the polygon ABC is the feasibility polygon. The optimal solution
lies at the corner points of the polygon.
From the graph, we get the coordinates of the points A, B and C are (0, 0), (15, 0),
and (0, 15), respectively.
The value of the objective function at each of the corner points is as the following table:
Table 4.4
Calculation of Objective Function for Example
4.3

Coordinates

A (0, 0)
Objective
function Z=3x+4y
Z=0+0=0

B (15, 0)| Z = (3×15) + (4×0) = 45

C (0,15)
Z= (3×0)+(4×15) = 60
Since objective function Z is to be maximized from the above table, the maximum value
of Z = 60 occurs at the coordinates (0, 15). Therefore, the optimal solution is x = 0 and y
= 15, and Z = 60.

Example 4.4
Solve the following LP problem graphically:
Maximize, Z = 300x + 250y

Solution
Subject to,
 2x + y ≤ 40
x+3y ≤ 45
X
≤12
x, y ≥ 0

Let us first consider the structural constraints as

equations:

From equation
no.
2x + y y= 40
1

x + 3y = 45
2

X
=

12
3

when x = 0, y = 40
x = 20, y = 0

.. The coordinates of equation no. O are (0, 40) and

(20, 0)

From equation
no.
when x = 0, y = 15
x=45, y = 0

.. The coordinates of equation no. O are (0, 15) and (45,

0)
42
Management Science and
Operatio
From equation no. 3
when x 12, y=0
=

.. The coordinates of equation no. is

(12, 0) Now plot the coordinate of
equations,
Graph 4.6 A Graph of a Solved
Problem

40
y

and are on graph paper.

30-

20

C (12,11)
D (0,15)

10-

A (0,0)
B
X

10
(12,0)
20
30
40

In the graph paper, the polygon ABCD is the feasibility polygon. The optimal
solution lies at the corner points of the polygon.
From the graph, we get the coordinates of the points A, B and D are (0, 0), (12, 0), and
(0, 15), respectively.
 The coordinate of point C is obtained by solving equation no. and
x + 3y = 45
X
=

12
2

Now put the value of x in the equation

no.
x + 3y = 45
or, 3y= 45-12 = 33
..

y = 11
.. The coordinates of the point C is (12, 11)
Table 4.5
Calculation of Objective Function for Example
4.4
Objective
function
Z=300x +250y
Coordinates

A (0,0)
Z=0+0=0
B (12,0)
C (12, 11)
D (0, 15)
Z=300×12+0=3600
Z=300×12+ 250×11=6350 Z=300×0
+250×15=3750
From the table, Z is the maximum at x =
6350.
12 and y = 11, and the maximum
value of Z =
Example
4.5
Linear Programming-II Graphic Method
 43

Solve the following linear programming problem:

Maximize, Z = 8x1 + 6x2

Questions:
Subject to,
5x1+2x2 ≤ 60
2x1
+4x2 ≤ 48
3x1
≥ 15
5x1-4x2 < 40
X1, X2
0

a. Graphically display the feasible solution area.

b. Compute the coordinates of all interesting feasible corners.
c. Find out the optimal solution.
d. If the last constraint is changed to strict equality what will be the optimal
solution?

Solution

a. Let us first consider the structural constraints as equations:

5x1 + 2x2 60
=

2x1 + 4x2 3x1

=

48
=
 15
(3

5x14x2
=

40
(4

From equation no.

when X1 = 0,
X1 = 12, X2
0,
X
2
=

30
0

.. The coordinates of equation no.℗ are (0, 30) and (12,

0)

From equation
no.
when x1 = 0, x2 = 12
X1=24, X2 = 0
.. The coordinates of equation no. are (0, 12) and (24,
0)
From equation no.
3
when x1 = 5,
X2 = 0

.. The coordinate of
equation no. From the equation
no.
is (5, 0)

when x1 = 0,
X1 = 8,
x2 = -10 X2 = 0
.. The coordinates of equation no. O are (0, -10) and (8,
0)
44 Management Science and Operations
Research

Now plot the co-ordinate of equations 0, 2, 3, and 4 are on

graph paper.
Graph 4.7 A Graph of a Solved
Problem
X2
30-

25

20

15

E
10
(5,9.5)
D (9,7.5)
Feasibility polygon
(b)

5-
C

(+)
(5,0)
(10.67.3.33)

(-)
B(8,0) A
5
10
X1
15
.

20
25
30

10

In the graph paper, the polygon ABCDE is the feasibility polygon. The optimal
solution lies at the corner points of the polygon.
c. From the graph, we get the coordinates of points A and B are (5, 0) and (8, 0),
respectively.
The coordinates of the point C, D, and E are obtained by solving equations no. O and
0; equations no. and ; equations no. and respectively.
Solving equations no. O
and

when x2
=

20

6
=

60

5×1 +2x2
7x1 - 4x2 =
40
+

6x2
4

20
(subtracting)
3.33
.. X2 =

from the equation ℗ we

get,

5x1 +2x

or,

.. X1
20
 6

15x,
+20 3

=—

160

15
=

60

= 60 or, 15x1 = 180-20

= 10.67

.. The coordinates of the point C is

(10.67, 3.33)
Linear Programming-II Graphic Method
45

Solving equations no. O and we get,

10x1+4/2
=120
2x1 + 4x2

8x1
.. X1
=

48
2

72
(subtracting)
=

=9

we
get,
Putting the value of x1 in the equation
 5×9+2x2 = 60 or, 2x2 = 60-45 = 15

15
.. X2 =
= 7.5
2
.. The coordinates of the point D is (9, 7.5)

Solving the equations no. and

we get,

From equation no. 3

3x1
= 15

= .. X1 5
Putting the value of x, in the equation we get,
(2x5)+4x2 = 48 or, 4x2 = 48-10=38

:.X2
=

38 =— = 9.5
4

.. The coordinates of the point E is (5, 9.5)

Now calculate the objective function from the following table:

Table 4.6
Calculation of Objective Function for Example 4.5

Objective
function
Coordinates
or Corner points
Z= 8x1 + 6x2

A (5, 0)
Z= 8×5+ 6×0 = 40

B (8, 0)
Z=8×8+6×0 = 64

C (10.67, 3.33)
Z= 8×10.67 + 6×3.33 = 105.34

Z=8×9+6×7.5=117 √
 D (9, 7.5)

E (5, 9.5)
Z=8×5+6×9.5 = 97

From the table, Z is the maximum at x1= 9 and x2 = 7.5, and the maximum value of
Z is 117, and corner point D (9, 7.5) is the optimal feasible solution.
d. If the last constraint is changed to strict equality-
The equation will be
5x1-4x2 = 40
–
The optimal solution will be lies at the equation line 5x, - 4x2 = 40, and the
optimal solution will be B (8, 0) or C (10.67, 3.33).
46
Management Science and Operations Research

But here found that in points B and C. Z is maximum at point C

where x1 3.33, and the maximum value of Z is 105.34.
=

10.67 and x2 =
X2

Example
46
In a small electric market two types of lamps: energy and LED. The material and labor needed
to manufacture the lamps are limited. Each lamp requires the same amount of material,
and there is enough material to produce 100 lamps a week. The difference between the
two types of lamps is due to workmanship. Thus, while the energy lamp requires 1⁄2
hour of labor to be produced, the LED lamp requires 1 hour. The total number of workers
available per week is 65 hours (one full-time worker and one half-time worker). Assuming that
the gross profit per lamp for the energy and LED is Tk. 50 and Tk. 80, respectively,
how many units of each type of lamp should be produced? What is the total gross profit
per week?

Solution

Let
 x = number of energy lamps produced
y = number of LED lamps produced
z = total gross profit per week
Since there is enough material to produce 100 lamps per week, the restriction imposed
by the materials can be expressed by the linear inequality
x + y ≤ 100
1
Similarly, since each energy lamp requires 1⁄2 hour of labor and each LED lamp
requires 1 hour, the limited labor (60 hours per week) would impose the restriction
2x
1/2 x + y ≤65
-----------
2
Total gross profit to be maximized can be expressed by the function
Z= 50x + 80y
Thus, our simple production problem can be formulated in the following linear
programming model:

Maximize, Z= 50x + 80y

Subject to,
x + y ≤ 100 2x + y ≤ 65
Let us first consider the structural constraints as equations:
x + y = 100 /2x+y
= 65

From equation no.

when x = 0, y = 100
x = 100, y = 0
.. The co-ordinates of equation no. are (0, 100) and
(100, 0)
1

1
2
Linear Programming-II Graphic Method 47
From equation no.
when x =
y = 65
0, x = 130, y = 0

.. The coordinates of the equation no. O are (0, 65) and (130, 0)

Now plot the co-ordinate of

equations
and are on graph paper.
Graph 4.8 A Graph of a Solved Problem

120
y

90

D (0,65)
60

30-

A(0,0)
C (70, 30)

30
60

90'100,0)
120
X

In the above graph, the polygon ABCD is the feasibility polygon. The optimal solution lies at
the corner points of the polygon.
From the graph, we get the coordinates of the points A, B and D are (0, 0), (100, 0), and (0,
65), respectively.
The coordinates of point C are obtained by solving equation no. O and
Solving equations no. O
and
x+y 1/2x+/y 1⁄2 x +/y = 65
=100

1/2
X
=

35
1

(subtracting)
=

.. X 35x2=70

when x = 70, from the equation

we get,
70+ y = 100
..y = 100-70=30

.. The coordinates of the point C is (70, 30)

48
Management Science and Operations Research

Now calculate the objective function from the following table:

Table 4.7
Calculation of Objective Function for Example 4.6
Objective function
Z = 50x + 80y
Z=0+0=0
Coordinates

A (0, 0)
B (100, 0)
Z= (50×100)+0=5000
C (70, 30)
 Z= (50×70)+(80×30) = 5900 √
D (0,65)
Z=0+(80×65) = 5200
From the above table, Z (total gross profit) is the maximum when produced energy
lamp, x is 70 units and LED lamp, y is 30 units, and the highest total gross profit, Z =
Tk. 5900 per week.

4.5 The Graphic Solution to a Minimization Problem

The minimization problem of the graphical method works when there are two decision
variables. First, set up the feasible solution area and then find the values of the decision
variables (e.g., x, and y) that yield the least cost. We see that the graphic solution can be
used for minimization problems like the maximization problem. This difference is that the
optimum is the point that has the lowest possible value of the objective function instead of the
largest. And, also at least one of the constraints should be ≥ (greater-than-or-equal-to) type.
These differences are illustrated in the following examples. Example 4.7

Given the linear programming

model:
Minimize,
Z=3x+4y

Subject to,
2x + 4y ≥ 16
4x + 2y ≥ 24
x, y ≥ 0
Solve graphically.

Solution

Let us first consider the structural constraints as

equations:
2x + 4y 4x + 2y
=

16
=

24

From equation no.

when x = 0, y =
4
 x = 8, y = 0

.. The coordinates of the equation no. ℗

are (0, 4) and (8, 0)
1
From equation no.
Linear Programming-II Graphic
Method
49

when x = 0, y = 12
x = 6, y=0
. The coordinates of the equation
no.
Now plot the coordinate of
equations
O are (0, 12) and (6,
0)

and are on graph

paper.
Graph 4.9 A Graph of a Solved
Problem

X2 15-4

D (0,12)

10-

5.
 A (0,0)
(5.33, 1.33)

B (8,0)

10
5
X1
15

In the above graph, BCD is the apparent feasible solution area which is shown as a shaded
area in Figure 4.5. Here, these constraints do not form a unique boundary. The optimal
solution lies at the points of the BCD polygon.
From the graph, the coordinates of the points B and D are (8, 0) and (0, 12),
respectively.
The coordinate of point C is obtained by solving equation no. O
and .

Solving equations no. D×2

and
2x + 4y
4x + 2y

4x+8y 32 4+2y= 4x + 2y =
24
=

6y 8
=

16
=

24

1
2

(subtracting)
=
 .. У
8÷6=4/3 = 1.33

we
get,
1
2

when y = 4/3, from the

equation
4x + (2x4/3) = 24

or,
4x
=

24-8/324-2.67

.. x = 21.33/4 = 5.33

.. The coordinates of the point C is (5.33,

1.33)
50
Management Science and Operations
Research

Now calculate the objective function from the following

table:
Table 4.8
Calculation of Objective Function for Example 4.7
Objective function
Z=3x+4y
Z=0+4×12 = 48
 Coordinates

B (0, 12)

C (5.33, 1.33)
=

D (8,0)
Z=(3x5.33)+(4×1.33)
15.99 +5.32 = 21.31√ Z=3×8+0 = 24

From the table, the Z value is minimum in the coordinate C. Therefore, Z is the minimum
at x = 5.33 and y = 1.33, and the minimum value of Z = 21.31.

Example
4.8
Given:

Minimize, Z=4x+3y

Subject to,
x+3y ≥ 6 5x +
2y ≥ 10

Solve the linear programming problem graphically.

Solution
y ≤ 4 x, y ≥ 0

Let us first consider the structural constraints as equations:

From equation no.

x + 3y 5x + 2y
=

6
1
=

10
 y
4
3

when x = 0, y = 2
x=6, y=0
.. The coordinates of the equation no. ℗ are (0, 2)
and (6, 0)
From equation no.
when x = 0, y = 5
x = 2, y = 0

are (0, 5) and (2,

0)
.. The coordinates of the
equation no.
From equation no.
3
when x = 0, y=4

.. The coordinate of the equation no. is

(0, 4)
Linear Programming-II Graphic Method
51

Now plot the coordinate of equations 0, 2 and

3 are on graph paper. Graph 4.10 A Graph of
a Solved Problem
9
y

6+
 (0,5)

(0,4)
C (0.4, 4)

3+

(0,2)
.
B (1.38,
1.54)

(0,0)
(2,0)
3
TX
6
A (6,0)
9

In the graph, the polygon ABC is the feasible solution region which is shown as a
shaded area in Figure 4.6. Here, these constraints do not form a unique boundary. The
optimal solution lies at the points of the ABC polygon.
From the graph, the coordinate of point A is (6,
0).
The coordinate of point B is obtained by solving equations no. 0×5 and
5/x+15y $x + 2y
= 30
= 10

13y 20
(1)

(subtracting)
.. y = 20÷13=1.54

Now put the value of y in the equation

no.
5x+2(20/13)= 10
or, 5x = 10-3.08 = 6.92
 x = 1.38

:. The coordinates of the point B is (1.38,

1.54)
The coordinate of point C is obtained by solving equation no.
and
5x + 2y
=

10

= y
4

Now put the value of y in the equation no.

5x + 2x4 = 10
or, 5x = 10-8=2
..
x = 0.4

. The coordinates of the point C is (0.4, 4)

2

3
52
Management Science and Operations
Research

Now calculate the objective function from the

following table:
Table 4.9
Calculation of Objective Function for Example 4.8

Objective function
Z=4x+3y
Z=4×6+0=24
Coordinates

A (6, 0)
Z= (4×1.38) + (3×1.54)
B (1.38, 1.54)
= 5.52 + 4.62 = 10.14 √
 C (0.4, 4)
Z = (4×.4)+(3×4)
=

1.6+12= 13.6

From the table, Z is the minimum at x = 1.38 and y = 1.54, and the minimum value of
Z= 10.14.

Example 4.9

The manager of construction has developed this LP

model:
Z=45x + 12y (profit)
Minimize,

Subject to,
Time
Materials
x + y ≥ 300 3x ≥ 250
hours
metric tons
x, y ≥ 0

a. Graphically represent the constraints and shade in the feasible solution area. b.
Calculate the minimum cost for the optimal solution.
Solution

Let us first consider the structural constraints as

equations:

From equation no.

D
x + y 3x
= 300 =
250

when x = 0, y=300
= 300, y = 0
 are (0, 300) and (300,
0)
:. The co-ordinates of equation
no.
From equation no.
3x=250

.. x = 250/3 = 83.33

...The co-ordinate of the equation no. is

(83.33, 0)
1
Linear Programming-II Graphic Method
53

Now plot the coordinates of equations and are on

graph paper.
Graph 4.11 A Graph of a Solved
Problem
y

300-
A (0,300)

(83.33, 216.67)
D
200-

100-

(83.33,0)
(0,0)
B
100
X

200
C (300,0)
From the graph, the feasible solution lies at the straight-line AC, and the optimal
solution lies will be point 'D' or point in 'C'.
In the graph, the coordinates of the points C is
(300, 0)
The co-ordinate of the point D is obtained by solving equations no. and

From equation no.

2
3x = 250
x + y = 300
3x
= 250
1
2

.. x = 250/3 = 83.33

Putting the value of x in the

equation no.
83.33 + y = 300
..y = 300-83.33 = 216.67

.. The coordinates of the point D is (83.33, 216.67)

Now calculate the objective function from the following
table:
Table 4.10
Calculation of Objective Function for Example
4.9

Coordinates
Objective function
Z=45x + 12y
C (300, 0)
 D (83.33, 216.67)
=

= 6349.89
Z=45×300+ 12x0 = 13500ALTH Z=45×83.33 +
12×216.675
=

6350 V

The above table shows that Z is the minimum at x = 83.33 and y = 216.67, and the
minimum value of Z is 6350. Therefore, corner point D (83.33, 216.67) is the
optimal feasible solution.
54
Management Science and Operations
Research

Examp
le↓
A pharmaceutical company produces some types of drugs. Two
alternative production lines are available. Given the need to ensure
certain ingredients such as P, Q and R. Line 1 can produce drug A
contains 40 units of P, 5 units of Q, and 20 units of R. Line 2 can
produce drug B contains 10 units of P, 20 units of Q and 15 units of R. The
minimum requirement of P, Q and R is 120 units, 40 units, and 90 units
respectively. Drug A costs Tk. 30 per unit and drug B Tk 50 per unit.
Find the best production plan. Formulate the problem to minimize the
total cost and solve the problem graphically.
Solution

The above problem can be summarized in the following

table:
Decision variable
Drug
P
Ingredients
QR
Cost of drug
 X

y
A
40
5
20
30
B
10
20
15
50
120
40
90
Minimum requirement
From the above table we can formulate a linear programming method in the
following way:
Minimize (total cost), Z = 30x + 50y
Subject to
40x + 10y ≥ 120
1
5x + 20y ≥ 40 20x+15y ≥ 90
x, y ≥ 0
Let us first consider the structural constraints as equations:

40x + 10y = 120

3

1
5x + 20y
= 40
2
20x + 15y
= 90
3

From equation
no.
when x = 0, y = 12
x=3, y=0
 .. The coordinates of the equation no. O are (0, 12) and
(3, 0)
From equation no.
when x = 0, y=2
x = 8, y=0
.. The coordinates of the equation no. are (0, 2) and (8,
0)
From equation no.
when x = 0, y=6
x=4.5, y=0

.. The coordinate of the

equation no.
are (0, 6) and
(4.5, 0)
Linear Programming-II Graphic
Method
55

Now construct the graph by drawing a

horizontal axis, x, and vertical axes, y, and
plot the
coordinate of equations 0, and
3 are on graph paper.
Graph 4.12 A Graph of a
Solved Problem
y
12
D(0,12)
10-
 8

4
C(2.25, 3)

2.
B(3.69,1.08)
A(8,0)
(0,0)
TX
2
4
6
8
10 12

In the graph, the polygon ABCD is the feasible solution region which is shown as a shaded area
in Graph 4.10. Here, these constraints do not form a unique boundary. The optimal solution lies
at the points of the ABCD polygon.
From the graph, the coordinate of point A is (8, 0) and D is (0, 12).
The coordinate of point B is obtained by solving equations no. ©×4
and ®
20x +80y=160 20x +
15y = 90
=

2
3

(subtracting)
70÷65 = 1.08
65y 70
.. У
=

Now put the value of y in the equation

no.
5x + 20(70/65)= 40
or, 5x= 40-21.54 = 18.46
..

x = 3.69
.. The coordinates of the point B is (3.69, 1.08)
The coordinate of point C is obtained by solving equation no. O and 3×2
40x + 10y =
120
1
3

(subtracting)
60÷20=3
40x + 30y = 180
-20y =-60
.. У
=

56
Management Science and Operations
Research

Now put the value of y in the equation no.

20x + 15×3 = 90
or, 20x = 90-45 = 45
.. x = 2.25
.. The coordinates of the point C is (2.25,
3)
Now calculate the objective function from the following
table:
Table 4.11
Calculation of objective function for Example
4.10
Objective function
Coordinates

A (8,0)
B (3.69,1.08)
C (2.25, 3)
D (0, 12)
Z=30x + 50y
 Z=30×8+0 = 240

Z=(30×3.69)+(50×1.08) = 164.7 √
Z=(30×2.25)+(50×3) = 217.5
Z=0+(50×12) = 600
From the table, Z is the minimum at x = 3.69 and
y
=

164.70. Therefore, the producer should produce 1 unit (approx.) of drug and 4 units 1.08,
and the minimum cost of Tk. (approx.) of drug B to achieve the minimum cost of Tk. 164.70.
4.6 Glossary
Corner point: A extreme point of a feasible solution space is the intersection of two or
more constraints that touch the feasible solution lines.
Extreme point: See corner point.
Feasible solution: A solution which satisfies all constraints in the feasible area.
Feasible solution region: A solution space consisting of all the possible solutions to the
optimization problem, which satisfies all the constraints simultaneously in the LP
problem. Graphic technique: The graphic technique can only handle problems
involving two decision variables. The technique determines the optimal solution to a
graphic linear programming problem. Sometimes the solution can be solved straight
from the graph, but typically, it must be found mathematically using simultaneous
equations.
Maximization problem: A linear programming problem in which the goal is
to obtain values of the decision variables that will construct the highest possible value
of the objective function for a given set of constraints.
Minimization problem: The minimization problem of the LP solution is a
similar way to solved the maximization problem. The basic difference is that the
constraints generally are greater
than or equal to variety (the form x+y≥
10, as opposed to the form x+y≤ 10). Optimal feasible solution: A
feasible solution that satisfies all constraints with maximizes or
minimizes the objective function value is known as an optimal feasible
solution.
Linear Programming-II Graphic
Method
57
4.7 Review
Questions
1. Explain the steps in the graphic method to obtain an optimal solution to a
linear
programming problem.
2. What are the key advantages of using the graphic technique of linear
programming
problems?
3. Define the maximization and minimization problems of LP. What are the
differences
between the two approaches?
4. How can you solve the maximization and minimization LP problem
using the graphical
approach?
5. Describe how an unbounded solution can be identified on an LP
graph?
6. How many decision variables are required to solve a graphic method of
linear
programming problems?

4.8 Exercises

1. Given a problem:
Maximize, Z = 2x + 3y
Subject to,
x + 3y ≤ 12
3x + 4y ≤ 24
x≥0, y ≥ 0
Solve the linear programming problem
graphically. Ans. x = 4.8, y = 2.4, and z = 16.8.
2. Graph the following constrains:
a.
A

X1 X2 9
b.
C.

11x, +3x2 ≥ 33
 X1 X2 ≤ 8
3. Solve problem 1, adding a third constraint: x ≤ 6. Ans. x = 6, y = 2, and z
= 16.8.
4. Using graphic technique of the following linear programming problem, find the
maximum value of
Z=3x+2y

Ans. X = 5, y = 0 and z = 45.

Subject to, 4x+5y ≤ 60
2x + 2y ≤ 30
x≥0, y≥ 0

5. Using the graphic technique to solve the following LP

problem:
Maximize, Z = 24x1 + 8x2
Subject to,
2x1+5x240 4x1 +
x2 ≤ 20
10x1+5x2 ≤ 60
X1, X2 ≥ 0
6. A ceramic industry must produce 200 kg of a mixture consisting of ingredients x,
and x2 of a ceramic product. The ingredients x, cost Tk. 3 per kg. and x, and x2 cost Tk. 5
per kg. No more than 80 kg of x, can be used, and at least 60 kg of x2 must be
used. Find out the least cost of the mixture.
58
Management Science and Operations
Research

Hint. The above allocation problem of the producer can be

expressed in linear programming format as follows:
Minimize, Z = 3x1 +5x2

Subject to,
X1 + x2
+ x2 = 200
X1
 ≤80
X2 ≥ 60
X1,
X2
0

Ans. X1 = 0, X2= 60 and z = 300.

7. Given:

Maximize, Z = 8x1 + 10x2

Subject to,
2x1 + 2x2
=

2x1+3x2 ≥ 24
2220
6x1 +3x236
X1, X20
Solve
graphically. 8. Given:
Minimize, Z = 3x+5y (total cost)

Subject to,
x+y≤6
X
> 3
y≤2
x, y ≥ 0
Compute the minimum total cost. Ans. x = 3, y = 0, and z = 9.
9. Use the graphic method to solve the following linear programming problem:
Minimize, Z = 5x1 + 2x2
Subject to,
4x1+8x2 ≥ 32
2x1 + 2x2 ≥ 12
X2 ≤ 5 X1, X2
0
10. Use the graphic method to solve the following LP
problem:
Minimize,
Z=3x+2y
Subject to,
 4x+5y ≥ 60 2x
+ 2y ≥ 30
x, y ≥ 0
Questions:
a. What is the significance of the optimal solution?
b. What happens to the optimal solution if the objective function is a change to Z
=
8x + 10y?
c. If we add the new constraint 2x + 2y ≥ 40 what will be the optimal solution? 11. A
company wants to mix up 500 gms of special snacks. There are two major
components in the mixture, both sources of protein such as protein pi
source of protein p1 cost Tk. 5, and the second source of protein p2 cost Tk.
8 per gm and P2. The first chemical constraints dictate that the mixture should
contain no more than 400 and at least 200 gms p2. Calculate the
combination of proteins, p1, and p2, to have the desired mixture that will incur
the minimum cost.
gms
of pi
Linear Programming-II Graphic
Method
59

Hint: Therefore, the above problem of the company can be

put in the following form:
Minimize (cost),
subject to the constraints,
z = 5p1 +
8p2

Pi
P1 +
P2 = 500
P1
< 400
P2 ≥ 200
 with non-negative restrictions: P1,
P20
Ans. p1 = 300, p2 = 200, and z = 3100.
12. Solved the given LP problem
graphically:
Minimize, Z = 2x1+3x2
Subject to,
=

3x1 +5x2 45
X1
< 5
X2 ≥ 4
2x1+2x2 <40
X1, X2
0

Ans. x1 = 0, X2 = 4, and z = 12.

13. The manager of the bread factory hopes to reduced costs by using the
linear programming method to determine the optimal price of two ingredients it
uses, x and y. the manager has formulated this model:
Minimize (cost),
Subject to,
Z=3x+5y
x
+ y = 200
x ≤ 80
X

y≥ 60
x, y ≥ 0
Determine the optimal solution and compute the minimum cost at the
optimum.
14. Use the graphical method to solve the following LP
problem:
Maximize, Z=2x+y
Subject to the constraints,
i. x + y ≤ 6
iii. x-2y ≤ 1
x, y ≥0
Ans. x = 4, y = 2, and z = 10.
 ii. x + 2y ≤ 10
iv. x - y ≤ 2

15. The textile industry produces certain types of clothes in different two
plants. Each plant produces three different types of clothes P, Q, and R. The
daily production capacity of the two plants are as follows:
Product P
Product Q
Product R

Plant A
10,000
Plant B
2,500
2,000
2,000
4,000

8,000
The company decided from their previous experience for the next month
there will be the demand of 50,000 meters of P, 30,000 meters of Q, and 80,000
meters of R. The daily
production costs of plant A and plant B are
Tk. 4,000 and Tk. 9,000 respectively. Formulate the problem to
minimize the production cost and solve the problem graphically.
Hint. From the above data we can formulate a linear programming method
in the following way:
60
Management Science and Operations
Research

Minimize,
Subject to,
Z = 4000x + 9000y

10000x + 2500y > 50000

1
2000x + 2000y ≥
 30000
4000x + 8000y ≥ 80000
3

x, y ≥0

8,49,79,94
167,

Ans. x = 13.33, y= 1.67, and z = 68350

16. Solve problem 12 if deleting a third constraint: x2≥ 4. Ans. x1 =
0, x2 = 9, and z = 27. 17. Solve the given LP problem graphically:
Maximize, Z = -x+2y
Subject to the constraints,
x - y ≤ -1 -0.5x + y ≤ 2
x, y ≥ 0
Hint. The maximum value of the objective function, Z, is 4 occurs at two corner
points. This implies that every point between them on the feasible solution line also
gives the same value of Z. Therefore, the problem has multiple optimal solutions: x = and x =
2, y = 3, and maximum value, Z = 4.
= 0,
y = 2, 18. Solve the given LP problem graphically:
Minimize, Z=3x+2y
Subject to the constraints,
x+y≥6
5x + y ≥ 10

Ans. x = 1, y = 5, and min. z = 13.

19. Solve the given LP problem graphically:
x + 4y ≥ 12
x, y ≥ 0

Minimize, Z = 10x+5y
Subject to the constraints,
 x + 2y ≤ 20
x + y ≥ 15

Ans. x = 10, y = 5, and min. z = 125.

2x + 3y ≥ 30
x, y ≥ 0

20. Solve the following linear programming problem through

feasibility polygon:
Maximize, P = 12x + 14y
Subject to,
4x + 2y ≤ 64
4x+6y ≤ 96
y ≥ 12
x, y ≥ 0

MBA, RU, 2014

}