Solution of Linear Programing Problems

Graphical Method.

STEPS FOR SOLVING GNERAL GRAPHICAL PROBLEM

 Choose The
Formulate
Identify
Locate
Plot thethe various
te problem
constraint
objective
thecorner
the area
points steps
offunction
points forthe
with
equation
feasible
where of solving
solution
on Graphical
mathematical
feasible
a graph
objective form
region
functions problems
by optimalare
have as follows
values
 Formulate the problem in mathematical form by
(Specifying the decision variables, identifying the objective function,
writing the constraint equations)
 Plot the constraint equation on a graph
 Identify the area of feasible solution or solution space that satisfies all
the constraints simultaneously. For ≥ type constraints, the area on or
above the constraint line i.e., away from the origin and for ≤ type
constraint, the area on or below the constraint line i.e., towards origin
will be considered. The area common to all the constraints is called
feasible region and is shown shaded.
 Locate the corner points of the feasible region
 Substitute the coordinates of the corner point in the objective function
to determine the corresponding value of Z
 An optimal solution occurs in a maximization problem at the corner
point yielding the highest value of Z and in a minimization problem at
the corner point yielding the lowest value of Z

Question:
A firm manufactures two products A and B on which the profits earned per unit
are Rs. 3 and Rs 4 respectively. Each product is processed on two machines M1
and M2. Product A requires 1 minute of processing time on M1 and 2 minutes
on M2 while B requires 1 minute on M1 and 1 minute on M2. Machine M1 is
available for not more than 7 hours 30 minutes. While machine M2 is available
for 10 hours during any working day. Find the number of units of products A
and B to be manufactured to get maximum profit.

Solution:
Formulation of linear programming Model

Let 𝑥 𝑎𝑛𝑑 𝑦 denote the number of units of product A and B

Objective is to maximize the profit
Z= 3𝑥 + 4𝑦
Subject to,
Time available for M1 𝑥 + 𝑦 ≤ 450

Time available for M2 2𝑥 + 𝑦 ≤ 600

𝑥, 𝑦 ≥ 0
1|Page
 Solution of L.P Model

Draw line 𝑥 + 𝑦 = 450 by joining two points (0, 450) and (450, 0).
Plot line 2𝑥 + 𝑦 = 600 by joining two points (0, 600) and (300, 0).

700

600

500

400
(0, 450)
300
(150, 300)
200

100

(300, 0)
0
0 100 200 300 400 500

To find the optimal solution

Z= 3𝑥 + 4𝑦 = 3(0) + 4(0) = 0
Z = 3𝑥 + 4𝑦 = 3(0) + 4(450) = 1800
Z= 3𝑥 + 4𝑦 = 3(150) + 4(300) = 1650
Z= 3𝑥 + 4𝑦 = 3(300) + 4(0) = 900
Answer
The maximum value of Z is Rs. 1800 and it occurs at the vertex (0, 450).
Hence the solution to the problem is
𝑥 = 0, 𝑦 = 450 𝑎𝑛𝑑 𝑍𝑚𝑎𝑥 = 𝑅𝑠. 1800

Question:
Find the maximum value of Z= 2𝑥 + 3𝑦
Subject to,
𝑥 + 𝑦 ≤ 30
𝑦≥3
𝑦 ≤ 12
𝑥−𝑦≥0
0 ≤ 𝑥 ≤ 20
2|Page
 𝑥, 𝑦 ≥ 0

Solution:
Plot line 𝑥 + 𝑦 = 30 by joining two points (0, 30) and (30, 0).
Plot line 𝑦 = 3
Plot line 𝑦 = 12
Plot line 𝑥 = 𝑦
Plot line 𝑥 = 20

35

30

25

20

15 B (12, 12) C(18, 12)

10
D(20, 10)
A (3,3)
5

(20, 3)
0
0 5 10 15 20 25 30 35

To find the optimal solution

The co-ordinates of the five vertices of the convex region ABCDE are
A(3,3), B(12,12), C(18,12), D(20,10), and E(20,3).
Values of the object function Z= 2𝑥 + 3𝑦 at these vertices are
𝑍(𝐴) = 15, 𝑍(𝐵) = 60, 𝑍(𝐶) = 72, 𝑍(𝐷) = 70 𝑎𝑛𝑑 𝑍(𝐸) = 49

Answer
The maximum value of Z is 72 and which occurs at the point C(18, 12).
Hence the solution to the given problem is
𝑥 = 18, 𝑦 = 12 𝑎𝑛𝑑 𝑍𝑚𝑎𝑥 = 72

3|Page
 Question:
Find the minimum value of Z= 5𝑥 − 2𝑦
Subject to,
2𝑥 + 3𝑦 ≥ 1
𝑥, 𝑦 ≥ 0
Solution:
1 1
Plot line 2𝑥 + 3𝑦 = 1 by joining two points (0, ) and ( , 0)
3 2

0.6

0.5 A(0, 1/3)

0.4

0.3

0.2

0.1
B(1/2,0)

0
0 0.05 0.1 0.15 0.2 0.25 0.3 0.35

Any point in the shaded region is a feasible solution to the given problem.

The coordinates of the vertices of the unbounded convex region are

1 1
𝐴 (0, ) and ( , 0).
3 2

Values of the object function Z= 5𝑥 − 2𝑦 at these vertices are

2 5
𝑍(𝐴) = − , 𝑍(𝐵) =
3 2

Answer
2 1
The minimum value of Z is − and which occurs at the point A(0, ).
3 3

Hence the solution to the given problem is

1 2
𝑥 = 0, 𝑦 = 𝑎𝑛𝑑 𝑍𝑚𝑖𝑛 = −
3 3

4|Page
 Some Exceptional Cases
We discussed a number of linear programming problems and optimal
solution for each of them was unique.
In general a linear programming problem may have.
 A definite and unique optimal solution.
 An infinite number of optimal solution (multiple optimal solution)
 An unbound solution
 No feasible solution (infeasible solution)
 A single solution

5|Page
 Practice Problems
Question:
A manufacturer of a line of patent medicines is preparing a production plan on
medicines A and B. There are sufficient ingredients available to make 20,000
bottles of A and 40,000 bottles of B but there are only 45,000 bottles in to
which both the medicines can be put. Furthermore, it takes 3 hours to prepare
enough material to fill 1000 bottles of A, it takes 1 hour to prepare enough
material to fill 1000 bottles of B and there are 66 hours available for this
operation. The profit is Rs. 8 per bottle for A and Rs. 7 per bottle for B.
Formulate the problem as linear programming problem to maximize the profit.

Question:
Find the maximum value of Z= 2𝑥 + 𝑦
Subject to,
𝑥 + 2𝑦 ≤ 10
𝑥+𝑦≤6
𝑥−𝑦≤2
𝑥 − 2𝑦 ≤ 1
𝑥, 𝑦 ≥ 0

Question:
Find the maximum value of Z= 3𝑥 + 4𝑦
Subject to,
5𝑥 + 4𝑦 ≤ 200
3𝑥 + 5𝑦 ≤ 150
5𝑥 + 4𝑦 ≥ 100
8𝑥 + 4𝑦 ≥ 80
𝑥, 𝑦 ≥ 0

Question:
Minimize the value of Z= 20𝑥 + 10𝑦
Subject to,
𝑥 + 2𝑦 ≤ 40
3𝑥 + 𝑦 ≥ 30
4𝑥 + 3𝑦 ≥ 60
𝑥, 𝑦 ≥ 0

Question:
Minimize the value of Z= 3𝑥 + 2𝑦
Subject to,
8𝑥 + 𝑦 ≥ 8
6|Page
 2𝑥 + 𝑦 ≥ 6
𝑥 + 3𝑦 ≥ 6
𝑥 + 6𝑦 ≥ 8
𝑥, 𝑦 ≥ 0

7|Page