QUANTITATIVE TECHNIQUES

Module 1
LPP – Graphical Method
Introduction
• Once the Linear programming model has been formulated on the
basis of the given objective & the associated constraint functions, the
next step is to solve the problem & obtain the best possible or the
optimal solution using various mathematical & analytical techniques
can be employed for solving the Linear-programming model.
• Graphical method of linear programming is used to solve problems by
finding the highest or lowest point of intersection between the
objective function line and the feasible region on a graph.
Problem 1 - Maximization
• Use the graphical method to solve the following LPP.

Maximize Z = 40X1 + 35X2

Subject to constraints:

2X1 + 3X2 ≤ 60

4X1 + 3X2 ≤ 96

X1 , X2 ≥ 0
Solution - Problem 1
• Equate the constraints as below:

2X1 + 3X2 = 60

4X1 + 3X2 = 96
Solution - Problem 1
• Substitute X1 and X2 with zero, one at a time in both the constraints and
get the value of the other:
Constraint 1: 2X1 + 3X2 = 60
   
2(0) + 3X2 = 60 2X1 + 3(0)= 60
3X2 = 60 2X1 = 60
X2 = = 20 X1 = = 30
(X1 = 0, X2 = 20) (X1 = 30, X2 = 0)
Coordinates: (0, 20) Coordinates: (30, 0)

Coordinates for the first constraint: (0, 20) and (30, 0)

Solution - Problem 1
• Substitute X1 and X2 with zero, one at a time in both the constraints and
get the value of the other:
Constraint 2: 4X1 + 3X2 = 96
   
4(0) + 3X2 = 96 4X1+ 3(0)= 96
3X2 = 96 4X1 = 96
X2 = = 32 X1 = = 24
(X1 = 0, X2 = 32) (X1 = 24, X2 = 0)
Coordinates: (0, 32) Coordinates: (24, 0)

Coordinates for the first constraint: (0, 32) and (24, 0)

 34
(0, 32)
32
30
28
26

4X 1
24

+3
22

X2
B 20 (0, 20)

=9
2X

6
18 1 +3
X
16 2 =6
0
14
12
10 C (18, 8)
8
6
4
2 D
(0, 0) 2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32
A (24, 0) (30, 0)
Feasible Region
Evaluation of the objective Function:

Coordinates Objective Function

Points Value of Z
(X1, X2) Z = 40X1 + 35X2
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

Z is maximum at X1 = 18 and X2 = 8
Problem 2 - Maximization
• A furniture manufacturer makes two products: chairs and tables. A
chair requires 2 hours on machines A and 6 hours on machine B. A
table requires 5 hours on machine A and no time on machine B. There
are 16 hours per day available on machine A and 30 hours on machine
B. The profit gained by the manufacturer from chair is Rs.2 and from a
table is Rs.10 Solve this problem to find daily production of each of
the two products.
Solution Problem 2

LPP Formulation: Equating the Constraints

Max Z = 2X1 + 10X2 2X1 + 6X2 = 16
Constraints: 5X1 = 30
2X1 + 6X2 ≤ 16
5X1 ≤ 30 Coordinates:
X1, X2 ≥ 0 (0, 2.7) (8, 0)
6
 5X1 ≤ 30

3 A
(0, 2.67)
2 2X +
1 6X ≤
2 16
(6, 1.5)
1 B
C
1 2 3 4 5 6 7 8
(6) (8, 0)
Feasible Region
Evaluation of the objective Function:

Coordinates Objective Function

Points Max Z = 2X1 + 10X2 Value of Z
(X1, X2)
A (0, 2.67) 2(0) + 10(2.67) 26.7
B (6, 1.5) 2(6) + 10(1.5) 27
C (6, 0) 2(6) + 10(0) 12

Z is maximum at X1 = 6 and X2 = 1.5

Minimization Problem 3
• A firm produces three different products, viz., R, S, and T through two different
plants, viz., P1 and P2 the capacities of which in number of products per day are as
follow:
Plants Product R Product S Product T
P1 3000 1000 2000
P2 1000 1000 6000

The operating cost per day of running the plants P1 and P2 are ₹600 and ₹400
respectively. The expected minimum demands during any month for the products
R, S and T are 24000 units, 16000 units and 48000 units respectively. Show, by the
graphic method, how many days should the firm run each plant during a month so
that the production cost is minimized while still meeting the market demand.
Solution - Problem 3
Let Z be the Minimum Total Cost.
X1, X2 be the number of working days of plant 1 and plant 2
respectively.
Decision Table:
Plants Decision Constraints of the Products Cost Per
Variables R Units S Units T Units Day (₹)

P1 X1 3000 1000 2000 600

P2 X2 1000 1000 6000 400
Minimum Demands 24000 16000 48000
Solution - Problem 3
LPP Formulation:
Min Z = 600X1 + 400X2
Constraints:
3000X1 + 1000X2 ≥ 24000
1000X1 + 1000X2 ≥ 16000
2000X1 + 6000X2 ≥ 48000
X1, X2 ≥ 0
Solution - Problem 3
Equating the Constraints:

3000X1 + 1000X2 = 24000

1000X1 + 1000X2 = 16000

2000X1 + 6000X2 = 48000

Solution - Problem 3
Finding Coordinates by replacing X1 and X2 with 0, one after the
another:

3000X1 + 1000X2 = 24000 (0, 24) and (8, 0)

1000X1 + 1000X2 = 16000 (0, 16) and (16, 0)

2000X1 + 6000X2 = 48000 (0, 8) and (24, 0)

 34
32
30
28
26
(0, 24) A 24
22
20
18
(0, 16) 16 (4, 12)
3000 1

14 B
X +
10

12
00
1000 2

X1
+1

10
00
X =

0X

(0, 8) 8
2
=1
2400

6 C (12, 4)
60

2000
00

X
0

4 1 + 60
00X
2 = 4800
2 0 D
2 4 6 8 10 12 14 16 18 20 22 24 26 28 30 32
(8, 0) (24, 0)
(16, 0)
Feasible Region
Evaluation of the objective Function:

Coordinates Objective Function

Points Value of Z
(X1, X2) Z = 600X1 + 400X2
A (0, 24) 600(0) + 400(24) 9600
B (4, 12) 600(4) + 400(12) 7200
C (12, 4) 600(12) + 400(4) 8800
D (24, 0) 600(24) + 400(0) 14400

Z is minimum at X1 = 4 and X2 = 12
• Conclusion:

Plant 1 should run for 4 days and Plant 2 for 12 days a month so that
the production cost is minimized while still meeting the market
demand.
Problem 4 - Maximization
• Solve the following LPP graphically
Objective function
Maximize Z =100x + 100y.
Subject to the constraints
10x + 5y ≤ 80 (0,16) (8,0)
6x + 6y ≤ 66 (0,11) (11,0)
4x + 8y ≥ 24( 0,3) (6,0)
5x + 6y ≤ 90 (0,15) (18,0)
and
x,y≥0
Evaluation of the objective Function:

Coordinates Objective Function

Points Value of Z
(X1, X2) Z = 100X+100Y
A (0,3) 100(0) + 100(3) 300
B (6,0) 100(6) + 100(0) 600
C (8,0) 100(8) + 100(0) 800
D (6,7) 100(6) + 100(7) 1300
100(0) + 100(11)
E (0,11) 1100
Problem 5 - Maximization
• A firm proposes to purchase some fans and sewing machines. It has
only ₹5760 to invest and a space for at most 20 items. A fan costs
₹360 and a sewing machine ₹240. Profit expected from a fan is ₹22
and from a sewing machine is ₹18. Using graphic method of solution
to determine the number of fans and sewing machines, he should
purchase to maximize his profit. Also, ascertain the maximum possible
profit he can earn.
Evaluation of the objective Function:

Coordinates Objective Function

Points Value of Z
(X1, X2) Z = 100X+100Y
A 0,3 100(0) + 100(3) 300
B 6,0 100(6) + 100(0) 600
C 8,0 100(8) + 100(0) 800
D 6,5 100(6)+100(5) 1100
E 0,11 100(0) + 100(11) 1100
Problem 6 – Mixed Constraints
• Use the graphical method to solve the following LPP.

Maximize Z = 2X1 + X2

Subject to constraints:
X1 + 2X2 ≤ 10
X1 + X2 ≤ 6
X1 - X2 ≤ 2
X1 - 2X2 ≤ 1 and
X1 , X2 ≥ 0
Problem 7 – Mixed Constraints
• Use the graphical method to solve the following LPP.

Maximize Z = -X1 + 2X2

Subject to constraints:
-X1 + 3X2 ≤ 10
X1 + X2 ≤ 6
X1 - X2 ≤ 2 and
X1 , X2 ≥ 0
Problem 8 – Mixed Constraints
• Use
  the graphical method to solve the following LPP.
Maximize Z = 7X1+ 3X2

Subject to constraints:
X1 + 2X2 ≥ 3
X1+ X2≤ 4
0 ≤ X1≤
0 ≤ X2≤ and
X1, X2 ≥ 0
Problem 9 – Mixed Constraints
• Use the graphical method to solve the following LPP.

Maximize Z = 2X1 + 3X2

Subject to constraints:
X1 + X2 ≤ 30
X2 ≥ 3
0 ≤ X1 ≤ 20
0 ≤ X2 ≤ 12
X1 - X 2 ≥ 0
and
X1 , X 2 ≥ 0
Problem 9 – Mixed Constraints
• Use the graphical method to solve the following LPP.

Maximize Z = 2X1 + 3X2

Subject to constraints:
X1 + X2 =30-----1
X2 = 3---------2
0 ≤ X1 ≤ 20 X1 values lies between ( 0 to 20)---------3
0 ≤ X2 ≤ 12 X2 values lies between ( 0 to 12)-----4
X1 - X2 = 0-------------------------------------------------5
and
X1 , X 2 ≥ 0
Problem 10 – Mixed Constraints
• Use the graphical method to solve the following LPP.

Maximize Z = 20X1 + 10X2

Subject to constraints:
X1 + X2 ≤ 40
3X1 + X2 ≥ 30
4X1 + 3X2 ≥ 60 and
X1 , X2 ≥ 0
Problem 11
• A company produces 2 types of hats. Every hat A requires as much
labor time as the second hat B. If the company produces only hat B
then it can produce a total of 500 hats a day. The market limits daily
sales of the hat A and hat B to 150 and 250 hats. The profits on hat A
and B are ₹ 8 and ₹5 respectively. Solve graphically to get the optimal
solution.
Problem 12 – Multiple Optimal Solutions
• Use the graphical method to solve the following LPP.

Maximize Z = 8X1 + 16X2

Subject to constraints:
X1 + X2 ≤ 200
X2 ≤ 125
3X1 + 6X2 ≤ 900 and
X1 , X2 ≥ 0
Problem 13 – Infeasibility
• Use the graphical method to solve the following LPP.

Maximize Z = 20X1 + 30X2

Subject to constraints:
2X1 + X2 ≤ 40
4X1 - 6X2 ≤ 20
X1 ≥ 30 and
X1 , X2 ≥ 0
Problem 13 –
Infeasibility
Problem 14 – Unboundedness
• Use the graphical method to solve the following LPP.

Maximize Z = 10X1 + 20X2

Subject to constraints:
2X1 + 4X2 ≥ 16
X1 + 5X2 ≥ 15 and
X1 , X2 ≥ 0
Problem 14 – Unboundedness