Chap 2 part 2

2.3. Graphical Method of solving Linear Programming Problems

2.3.1. Introduction
In the previous section, you have seen how to formulate a given problem as a Linear
Programming model. The next step, after the formulation of LP model is to devise effective
methods to solve the model and ascertain the optimal solution. Let’s start with the Graphical
Method of solving LPP and then move on to Simplex Algorithm for solving the Linear
Programming model.
Graphical linear programming is a relatively straightforward for determining the optimal solution
to certain linear programming problems involving only two decision variables. Although graphic
method is limited as a solution approach, it is very useful in the presentation of LP, in that it
gives a “picture” of how a solution is derived thus a better understanding of the solution.
Moreover, graphical methods provide a visual portrayal of many important concepts.
The graphic solution procedure is one of the methods of solving two variable linear
programming problems.
In this method, the two decision variables are considered as ordered pairs (X 1, X2), which
represent a point in a plane, i.e, X1 is represented on X-axis and X2 on Y-axis.

Graphical method has the following advantages:

 It is simple
 It is easy to understand, and
 It saves time.
2.3.2. Steps in graphic solution method:-
Step I Defining the problem. Formulate the problem mathematically. Express it in terms of
several mathematical constraints & an objective function. The objective function relates to the
optimization aspect, i.e. Maximization or minimization Criterion.

Step II Plot the constraints graphically. Each inequality in the constraint equation has to be
treated as an equation. An arbitrary value is assigned to one variable & the value of the other
variable is obtained by solving the equation. In the similar manner, a different arbitrary value is
again assigned to the variable & the corresponding value of other variable is easily obtained.
These 2 sets of values are now plotted on a graph and connected by a straight line. The same
procedure has to be repeated for all the constraints. Hence, the total straight lines would be equal
to the total no of equations, each straight line representing one constraint equation.

Step III: Locate the solution space. Solution space or the feasible region is the graphical area
which satisfies all the constraints at the same time. Such a solution point (x, y) always occurs at
the corner Points of the feasible Region the feasible region is determined as follows:
a) For "greater than" & "greater than or equal to" constraints, the feasible region or the solution
space is the area that lays above the constraint lines.
b) For" Less than" &" Less than or equal to" constraint, the feasible region or the solution space
is the area that lays below the constraint lines.

Step IV Selecting the graphic solution technique. Select the appropriate graphic technique to be
used for generating the solution. There are two graphic techniques to find solution;

13
 Chap 2 part 2

1. Corner Point Method and

2. Iso-profit (or Iso-cost) method may be used; however, it is easier to generate solution
by using the corner point method and we use this method to find solution.
2.3.3. Corner Point Method to find Solution for Graphics Method
I. Since the solution point (x, y) always occurs at the corner point of the feasible or solution
space, identify each of the extreme points or corner points of the feasible region by the
method of simultaneous equations.
II. By putting the value of the corner point's co-ordinates [e.g. (2, 3)] into the objective function,
calculate the profit (or the cost) at each of the corner points.
III. In a Maximize problem, the optimal solution occurs at that corner point which gives the
highest profit. In a minimization problem, the optimal solution occurs at that corner point
which gives the lowest profit.

Important Theorems in solving LPP

On the process of determining an optimum feasible solution to the linear programming problem,
the following four important theorems are used:-

Theorem I: The feasible solution spaces constitute a convex set.

Theorem II: Within the feasible solution space, feasible solution corresponds to the extreme (or Corner) points of
the feasible solution space.
Theorem III There is a finite number of basic feasible solutions, with the feasible solution space.
Theorem IV The optimum feasible solution, if it exists, will occur at one, or more, of the extreme points that are
basic feasible solutions.

Note. Convex set is a polygon "Convex" implies that if any two points of the polygon are
selected arbitrarily then straight line segment joining these two points lays completely within the
polygon. The extreme points of the convex set are the basic solution to the linear programming
problem.

Important Terms
Some of the important terms commonly used in linear programming are disclosed as follows:
a. Solution: Values of the decision variable satisfying the constraints of a
general linear programming model is known as the solution to that linear programming
model.
b. Feasible solution: Out of the total available solution a solution that also satisfies the non-
negativity restrictions of the linear programming problem is called a feasible solution.
c. Basic solution: For a set of simultaneous equations in Q unknowns (P, Q) a solution
obtained by setting (P - Q) of the variables equal to zero & solving the remaining P equation
in P unknowns is known as a basic solution. The variables which take zero values at any
solution are detained as non-basic variables & remaining are known as-basic variables, often
called basic solution.
d. Basic feasible solution: A feasible solution to a general linear programming problem which
is also basic solution is called a basic feasible solution.
e. Optimal feasible solution: Any basic feasible solution which optimizes (i.e. maximize or
minimizes) the objective function of a LP models is known as the optimal feasible solution
to that linear programming model.

14
Chap 2 part 2

f. Degenerate Solution: A basic solution to the system of equations is termed as degenerate if

one or more of the basic variables become equal to zero.

Example 1
XYZ Ltd. Co. Wishes to purchase a maximum of 3600 units of two types of product, A & B are
available in the market. Product A occupies a space of 3 cubic feet & cost Birr 9 whereas B
occupies a space of 1 cubic feet & cost Birr 13 per unit. The budgetary constraints of the
company do not allow spending more than Birr 39,000. The total availability of space in the
company's god-own is 6000 cubic feet. Profit margin of both the product A & B is Birr 3 & Birr
4 respectively. Formulate the above problem as a linear programming model and solve it by
using graphical method. You are required to ascertain the best possible combination of purchase
of A & B so that the total profits are maximized.

Solution

(a) The problem can be formulated as a linear programming model as follows:-

Let x1 = Number of units of product A &
x2 = Number of units of product B
Objective function,
Subject to: -
(Maximum unites constraint)

(Storage area constraint)

(Budgetary constraint)

(b) Find the solution by using graphics method

Step I: Treating all the constraints as equality,
The 1st constraint is: e this in to and find the X
and Y intercept as follows.
Put

Put

Draw the graph with x1 on x-axis & x2 on y-axis as shown in the following figure.

The 2nd constraint is: change this in to and find X

and Y intercept.
Put

Put

Draw the graph with x1 on x-axis & x2 on y-axis as shown in the following figure.

15
 Chap 2 part 2

The 3rd constraint is: e this in to

and find the X and Y intercept as follows.
Put

Put

Draw the graph with x1 on x-axis & x2 on y-axis as shown in the Figure 2.1.
Step II: Determine the set of the points which satisfy the constraint:

This can easily be done by verifying whether the origin (0, 0) satisfies the constraint.
Here, hence the solution is true; all the points below the line will satisfy
the constraint.
Like it’s in the above iteration, determine the set of points which satisfy the constraint

. At origin;

. Hence, all the points below the line will satisfy the constraint.
Like it’s in the above iteration, determine the set of points which satisfy the constraint.

At origin;

. Hence, all the points below the line will satisfy the constraint.
The intersection of the above graphic denotes the feasible region for the given problem.

B
of
s X
X12
ite
un
6000
of (Maximum unites constraint)
r
be
3600 (Storage area constraint)
m
u
B (Budgetary constraint)
3000 A
N

Feasible
region
O X1
(0, 0) C
2000 3600 16 39000/9

Number of unites of A
Chap 2 part 2

Figure 2.1. Graphical presentation of XYZ Ltd. Co. purchase problem

Step III: Finding feasible region by plotting the graph

Always keep in mind two things: -
a. For ≥ constraint the feasible region will be the area, which lays above the constraint lines,
and for ≤ constraints, it will lays below the constraint lines. This would be useful in
identifying the feasible region.
b. According to a theorem on linear programming, an optimal solution to a problem (if it
exists) is found at a corner point of the solution space.

Step IV. Find the optimal solution by the corner point method.
At corner points (O, A, B, C), find the profit value from the objective function. Those
points which maximize the profit are the optimal point.
Corner point Coordinates Objective function Value
O (0,0) Z=0+0 0
A (0,3000) Z=0+4x3000 12,000
Optimal
B (1300,2100) Z=3x1300 + 4 x2100 12,300
solution C (2000,0) 3 x 2000 + 0 6000

In order to get the value of point B apply simultaneous equation by taking the two
intersection lines. Solve the point.
(Maximum unit constraint)

(Budgetary constraint)
(∴ A+B these two lines are intersecting)
…1

…2
Multiply equation (1) by -9 on both sides:
-9x1 - 3x 2 -18000 …3
…4
__ __ __
10X2 = 21000 ∴ =2100
Put the Value of x2 in first equation:
⇒X1=1300
At point (1300, 2100)
Z  (3 * 1300)  (4 * 2100)  12,300
= 12,300 which is the maximum value

Result

17
Chap 2 part 2

The optimal solution is:

No of units of product A=1300
No of units of product B=2100
Total profit, = 12, 300 which is the maximum

Example 2:
Suppose that a machine shop has two different types of machines; machine 1 and machine 2,
which can be used to make a single product .These machine vary in the amount of product
produced per hour, in the amount of labor used and in the cost of operation.
Assume that at least a certain amount of product must be produced and that we would like to
utilize at least the regular labor force. How much should we utilize each machine in order to
utilize total costs and still meets the requirement? The resource used, the cost and the required
hour is given in the following table.

Resource used Minimum required hours

Constraints
Machine 1 Machine 2
Product produced/hr 20 15 100
(X1) (X2)
Labor/hr 2 3 15
Operation Cost Birr25 Birr30
1. Formulation of the linear programming model

Min.Z  25 X 130 X 2
Subjectto :
20 X 115 X 2 100
2 X 13 X 2 15 LPP Model
X1, X 2  0

The 1st constraint is: change this in to and find

X and Y intercept.

Put

Put

Draw the graph with x1 on x-axis & x2 on y-axis as shown in the following figure.
The 2nd constraint is 2X1+3X2≥15 change this in to 2X1+3X2=15 and find X and Y
intercept.
Put

Put

18
Chap 2 part 2

Draw the graph with x1 on x-axis & x2 on y-axis as shown in the following figure.
Determine the set of the points which satisfy the constraint:

This can easily be done by verifying whether the origin (0, 0) satisfies the constraint.
Here,
Hence the solution is false; all the points above the line will satisfy the
constraint.
Like it’s in the above iteration, determine the set of points which satisfy the constraint
2X1 + 3X2 ≥ 15 at origin;
. Hence, all the points above the line will satisfy the constraint.

Finding feasible region by plotting the graph

Always keep in mind two things:
i. For ≥ constraint the feasible region will be the area, which lays above the constraint lines,
and for ≤ constraints, it will lays below the constraint lines. This would be useful in
identifying the feasible region.
ii. According to a theorem on linear programming, an optimal solution to a problem (if it
exists) is found at a corner point of the solution space.

X2
X1 =0
A (0, 20/3) 2X1 + 3X2 = 15

Feasible Region
5

B (2.5, 3.33)
X2 =0

X1
5 C (7.5, 0)

Corner point Coordinates Objective function Value

Feasible solution

Minimize.Z  25 X 130 X 2
A (0,20/3) Z=0+20/3×30 201
B (2.5, 3.33) Z=2.5×25+3.33x30 150
C (7.5, 0) Z=7.5x25+0 187.5

19
Chap 2 part 2

Use the same stapes to find the value of B by using the simultaneous equation as
presented previously.
Result
The optimal solution is:
X1 =2.5, X2=3.33 and Minimum cost Z= 150

2.3.4. Special Cases in Graphics Methods

The following are the major special cases in graphics solution
o Alternative Optima
o Infeasible Solution
o Unbounded solution
a) Alternative Optimal solution
When the objective function is parallel to a binding constraint; (a constraint that is
satisfied in the equality sense by the optimal solution), the objective function will assume
the same optimal value at more than one solution point, for this reason they are called
alternative optima. Example 1 shows that normally there is infinity of such solutions.
The example also demonstrates the practical significance of encountering alternative
optima.

Example1

20
Chap 2 part 2

The above Figure demonstrates how alternative optima can arise in LP model when the objective
function is parallel to a binding constraint. Any point on the line segment BC represents an
alternative optimum with the same objective value z = 10. Mathematically, we can determine all
the points (x1, x2) on the line segment BC as a nonnegative weighted average of the points B and
C. That is, given 0, α, and 1 and
B: x1= 0, x2=5/2
C: x1= 3, x2= 1

Example 2:
The information given below is for the products A and B.
_______________________________________________________________________________________________________________
Machine hours per week Maximum available

Department Product A Product B per week

_____________________________________________________________________
Cutting 3 6 900
21
 Chap 2 part 2

Assembly 1 1 200

Profit per unit Birr 8 Birr 16

_____________________________________________________________________

Assume that the company has a marketing constraint on selling products B and therefore
it can sale a maximum of 125 units of this product.

Required:
a. Formulate the LPP of this problem?
b. Find the optimal solution?
Solution: Let X1 =The Number of units’ f product A produced per week
X2 = The number of units f product B produced per week
a) The LPP Model of the problem is:
Max.Z  8 X 116 X 2
Subjectto :
3 X 16 X 2 900
X 1 X 2 200
X 2  125
X1, X 2  0

X2=0
X2
(0, 200) X 1 X 2 200

(0,150) X2=125 Marketing equation

C (50, 125)
B (0, 125)
D (100,100)
Cutting: 3X1+6X2=900

FR X1=0

A (0, 0) X1
(200, 0) (300, 0)

Corners Coordinates Maximize Z=8 X1 + 16X2

A (0, 0) 0
B (0, 125) 2000
C (50, 125) 2400
D (100, 100) 2400
E (200, 100) 1600
Interpretation:
Both C and D are optimal solutions. Any point on the line segment CD will also lead to
the same optimal solution.
22
Chap 2 part 2

==>Multiple optimal solutions provide more choices for management to reach their
objectives.

b) 2. Infeasible Solution
A solution is called feasible if it satisfies all the constraints and the constraints and non-
negativity condition. However, it is sometimes possible that the constraints may be
inconsistent so that there is no feasible solution to the problem. Such a situation is called
infeasibility.

Example:
Maximize Z=20X1+30X2
Subject to:
2X1+X2< 40
4X1+X2< 60
X1 > 30 and X1, X2 > 0

Solution:
X2 X1=0
(0, 60) X1=30
4X1+X2= 60
(0, 40)

2X1+X2= 40
X2=0
X1
(15, 0) (20, 0) (30, 0)

Note:
- In the above graph, there is no common point in the shaded area.
- All constraints cannot be satisfied simultaneously and there is no feasible solution
to the problem.

c) Unbounded Solution
When the value of decision variables in LP is permitted to increase infinitely without
violating the feasibility condition, then the solution is said to be unbounded .Here, the
objective function value can also be increased infinitely. However, an unbounded feasible
region may yield some definite value of the objective function.

Example:
Use the graphical method to solve the following LPP.
1. Maximize Z=3X1+4X2
Subject to:
X1-X2<-1==> -X1+X2>1 since the quantity solution is positive
23
Chap 2 part 2

-X1+X2< 0

X1, X2 > 0

X2 X1-X2 =-1

X1+X2 =0

1 Unbounded
Feasible region

Feasible Region X1
2. Maximize Z=3X1+2X2

Subject to:
X1 - X2 <1
X1 +X2 ≥3
X1, X2 > 0
X2

A (0, 3) Unbounded

Feasible Region
X1-X2=1

B (2, 1)
X1+X2=3

X1

Note: here that the two corners of the region are A(0,3) and .B(2,1).The value of
Maximize Z(A)=6 and Maximize Z(B)=8. But there exist number of points in the shaded
region for which the value of the objective function is more than 8.For example, the point
(10, 12) lies in the region and the function value at this point is 70 which is more than 8.

Remark: An unbounded solution does not mean that there is no solution to the given
LPP, but implies that there exits an infinite number of solutions.

Exercise 1

Use graphical method to solve the following LPP.

1. Maximize Z=7/4X1+3/2X2 2. Maximize Z=X1+X2

24
 Chap 2 part 2

Subject to: Subject to:

8 X1+5X2 < 320 X1+X2 < 1
4X1+5X2 < 20 -3X1+X2>3
X1 > 15 X1, X2 >0
X2 > 10
X1, X2 > 0

Answer: No feasible solution Answer: Unbounded solution

3. Maximize Z=3X1+2X2 4. Maximize Z=6X1-4X2

Subject to: Subject to:

X1-X2 < 1 2X1+4X2 < 4
X1+X2> 3 4X1+8X2> 16
X1, X2> 2 X1, X2 > 0
Answer: Unbounded solution Answer: Infeasible solution

Exercise 2

I. Solve the following LP problems using the graphical method.

1. Maximize Z=15X1-10X2 2.MaximizeZ=2X1+X2
Subject to: Subject to:
4X1+6X2 < 360 X1+2X2 < 10
3X1+0X2< 180 X1 +X2 < 6
0X1+5X2< 280 X1 - X 2 < 2
X1, X2 > 0 X1 -2X2 < 1
Answer: X1=60, X2 =20 X 1,        X2    >0
and Maximize Z=1,100 Answer: X1=4, X2 =2
and Maximize Z=10
3. Maximize .Z=10X1+15X2 4.Min.Z=3X1+2X2
Subject to: Subject to:
2X1+ X2< 26 5X1+X2 > 10
2X1+4X2< 56 X1 +X2 > 6
-X1+ X2< 5 X1 + 4 X2 > 12
X1, X2 > 0 X1,    X2    >0
Answer: X1=4, X2 =2 Answer: X1=1, X2=5
and Maximize Z=230 and Minimize Z=13

II. A manufacturer produces two different models; X and Y, of the same product .The raw
materials r1 and r2 are required for production. At least 18 Kg of r1 and 12 Kg of r2 must be used
daily. Almost at most 34 hours of labor are to be utilized .2Kg of r1 are needed for each model
X and 1Kg of r1 for each model Y. For each model of X and Y, 1Kg of r2 is required. It takes 3
hours to manufacture a model X and 2 hours to manufacture a model Y. The profit realized is
$50 per unit from model X and $30 per unit from model Y. How many units of each model
should be produced to maximize the profit?
Answer: 10 units of model X, 2 units of model Y and the maximum profit is $ 560.

25
 Chap 2 part 2

III. A manufacturing firm produces two machine parts P1 and P2 using milling and grinding
machines .The different machining times required for each part, the machining times available
on different machines and the profit on each machine part are as given below:
_____________________________________________________________________________
Manufacturing time Maximum time
Required (min) available per week (minimum)
Machine P1 P2
_____________________________________________________________________________
Lathe 10 5 25,000
Milling Machine 4 10 2000
Grinding Machine 1 1.5 450
Profit per unit ($) $50 $100
_____________________________________________________________________
Determine the number of pieces of P1 and P2 to be manufactured per week to maximize
profit.
Answer: X1=187.5, X2 =125 and Maximize Z=21,875

26