Subject Name: Operations Research
Q.1
The Agricultural Research Institute suggested to a farmer to spread out at least
4800 kg of a special phosphate fertilizer and not less than 7200 kg of a special
nitrogen fertilizer to raise productivity of crops in his fields. There are two
sources for obtaining these-Mixture A & B. Both of these are available in the
bags weighing 100 kg each costing Rs. 40 & Rs. 24 respectively. Mixture A
contains phosphate & Nitrogen equivalent of 20 kg & 80 kg respectively, while
mixture B contains these ingredients equivalent of 50 kg each.
How many bags of each type the farmer should buy in order to obtain the
required fertilizer at minimum cost.
Unit-2 Linear Programming Problems (LPP) Centre for Distance and Online Education
Subject Name: Operations Research
Step-1 Decision variables Lets assume the farmer purchases X bags of Mixture
A and Y bags of Mixture B.
Step-2 Objective Function
Zmin = 40 X + 24 Y
Step-3 Constraints
20 X + 50 Y ≥ 4800 (Phosphate)
80 X + 50 Y ≥ 7200 (Nitrogen)
Step-4 Non Negativity restriction
X, Y ≥ 0
Unit-2 Linear Programming Problems (LPP) Centre for Distance and Online Education
Subject Name: Operations Research
Zmin= 40 X+ 24 Y
Subject to Constraints
20 X + 50 Y ≥ 4800
80 X + 50 Y ≥ 7200
X,Y ≥ 0
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
20 X + 50 Y ≥ 4800
First convert the inequalities into equalities
20 X + 50 Y = 4800
Now Put X = 0, we get Y = 96
Put Y = 0, we get X = 240
Hence we get two coordinates
(0, 96) & (240, 0)
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
80 X + 50 Y ≥ 7200
First convert the inequalities into equalities
80 X + 50 Y = 7200
Now put X = 0, we get Y = 144
Put Y = 0, we get X = 90
Hence we get two coordinates
(0, 144) & (90, 0)
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name:
120Operations Research
100
80
60
40 20 X + 50 Y ≥ 4800
20
0
0 50 100 150 200 250 300
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
160
80 X + 50 Y ≥ 7200
140
120
100
3 4 20 X + 50 Y ≥ 4800
80
60
40
20 1 2
0
0 50 100 150 200 250 300
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Feasible region is ABC to infinity
which satisfies both the constraints.
Now calculate the co-ordinates
of points A, B & C.
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Coordinates of point B
20 X + 50 Y = 4800
80 X + 50 Y = 7200
-------------------------------
- 60 X = - 2400
X = 40
Put X = 40 in any equation we get Y = 80
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Co-ordinates of Point A are (0, 144)
Coordinates of Point B are (40, 80)
Coordinates of Point C are (240, 0)
Note-Point B lies at the intersection of both
the lines hence solve these equations to get
the coordinates of point B.
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Put the values in Objective Function
Zmin = 40 X + 24 Y
A (0, 144) 40*0 + 24*144 = 3456 (Min.)
B (40, 80) 40*40 + 24*80 = 3520
C (240, 0) 40*240 + 24*0 =9600
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
The Minimum value is 3456
hence the solution is
X=0
Y = 144
and Z = 3456
The farmer should buy 144 bags of mixture B and no bags of mixture A.
The total minimum cost would be Rs. 3456
Unit 2 Linear Programming Problem Centre for Distance and Online Education
Dr. Parul Agrawal 9811880805
Subject Name: Operations Research
Q.2
A manufacturer produces two types of models M1 and M2.Each
model of the type M1 requires 4 hours of grinding and 2 hours of
polishing; where as each model of M2 requires 2 hours of grinding
and 5 hours of polishing. The manufacturer has 2 grinders and 3
polishers. Each grinder works for 40 hours a week and each polisher
works 60 hours a week. Profit on M1 model is Rs.3.00 and on model
M2 is Rs.4.00.Whatever produced in a week is sold in the market.
How should the manufacturer allocate his production capacity to the
two types of models, so that he makes maximum profit in a week?
Unit-2 Linear Programming Problems (LPP) Centre for Distance and Online Education
Subject Name: Operations Research
Step-1 Decision Variables Let’s assume that the manufacturer
produces X units of Model M1 and Y units of Model M2
Step-2 Objective Function
Zmax= 3 X+ 4 Y
Step-3 Constraints
4 X + 2 Y ≤ 80 (Grinding)
2 X + 5 Y ≤ 180 (Polishing)
Step-4 Non Negativity Restriction
X, Y ≥ 0
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Zmax= 3 X+ 4 Y
Subject to Constraints
4 X + 2 Y ≤ 80
2 X + 5 Y ≤ 180
X, Y ≥ 0
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
4 X + 2 Y ≤ 80
First convert the inequalities into equalities
4 X + 2 Y = 80
Now Put X = 0, we get Y = 40
Put Y = 0, we get X = 20
Hence we get two coordinates
(0, 40) & (20, 0)
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
2 X + 5 Y ≤ 180
First convert the inequalities into equalities
2 X + 5 Y = 180
Now put X = 0, we get Y = 36
Put Y = 0, we get X = 90
Hence we get two coordinates
(0, 36) & (90, 0)
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name:45Operations Research
40
35
30
25
20
15 4 X + 2 Y ≤ 80
10
0
0 5 10 15 20 25
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
45
2 X + 5 Y ≤ 180
40
35
30
4 X + 2 Y ≤ 80
25
20
15
10
0
0 10 20 30 40 50 60 70 80 90 100
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Feasible region is OABC.
which satisfies both the constraints.
Now calculate the co-ordinates
of points O, A, B & C.
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Coordinates of point B
4 X + 2 Y = 80
2 X + 5 Y = 180 *2
-------------------------------
- 8 Y = - 280
Y = 35
Put Y = 35 in any equation we get X = 2.5
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Co-ordinates of Point O are (0, 0)
Co-ordinates of Point A are (0, 36)
Coordinates of Point B are (2.5, 35)
Coordinates of Point C are (20, 0)
Note-Point B lies at the intersection of both the lines hence
solve these equations to get the coordinates of point B.
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Put the values in Objective Function
Zmax = 3 X + 4 Y
O (0, 0) 3*0 + 4*0 = 0
A (0, 36) 3*0 + 4*36 = 144
B (2.5, 35) 3*2.5 + 4*35 = 147.5 (Max.)
C (20, 0) 3*20 + 4*0 =60
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
The Maximum value is 147.5
hence the solution is
X = 2.5
Y = 35
and Z = 147.5
The company should manufacture 2.5 units of model M1 and 35 units
of model M2. The total maximum profit would be Rs. 147.5
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Q.3
A manufacturer produces two types of models M1 and M2.Each
model of the type M1 requires 4 hours of grinding and 2 hours of
polishing; where as each model of M2 requires 2 hours of grinding
and 5 hours of polishing. The manufacturer has 2 grinders and 3
polishers. Each grinder works for 40 hours a week and each polisher
works 60 hours a week. Profit on M1 model is Rs.3.00 and on model
M2 is Rs.4.00.Whatever produced in a week is sold in the market.
How should the manufacturer allocate his production capacity to the
two types of models, so that he makes maximum profit in a week?
Unit-2 Linear Programming Problems (LPP) Centre for Distance and Online Education
Subject Name: Operations Research
Step-1 Decision Variables Let’s assume that the manufacturer
produces X units of Model M1 and Y units of Model M2
Step-2 Objective Function
Zmax= 3 X+ 4 Y
Step-3 Constraints
4 X + 2 Y ≤ 80 (Grinding)
2 X + 5 Y ≤ 180 (Polishing)
Step-4 Non Negativity Restriction
X, Y ≥ 0
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Zmax= 3 X+ 4 Y
Subject to Constraints
4 X + 2 Y ≤ 80
2 X + 5 Y ≤ 180
X, Y ≥ 0
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
4 X + 2 Y ≤ 80
First convert the inequalities into equalities
4 X + 2 Y = 80
Now Put X = 0, we get Y = 40
Put Y = 0, we get X = 20
Hence we get two coordinates
(0, 40) & (20, 0)
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
2 X + 5 Y ≤ 180
First convert the inequalities into equalities
2 X + 5 Y = 180
Now put X = 0, we get Y = 36
Put Y = 0, we get X = 90
Hence we get two coordinates
(0, 36) & (90, 0)
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name:45Operations Research
40
35
30
25
20
15 4 X + 2 Y ≤ 80
10
0
0 5 10 15 20 25
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
45
2 X + 5 Y ≤ 180
40
35
30
4 X + 2 Y ≤ 80
25
20
15
10
0
0 10 20 30 40 50 60 70 80 90 100
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Feasible region is OABC.
which satisfies both the constraints.
Now calculate the co-ordinates
of points O, A, B & C.
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Coordinates of point B
4 X + 2 Y = 80
2 X + 5 Y = 180 *2
-------------------------------
- 8 Y = - 280
Y = 35
Put Y = 35 in any equation we get X = 2.5
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Co-ordinates of Point O are (0, 0)
Co-ordinates of Point A are (0, 36)
Coordinates of Point B are (2.5, 35)
Coordinates of Point C are (20, 0)
Note-Point B lies at the intersection of both the lines hence
solve these equations to get the coordinates of point B.
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
Put the values in Objective Function
Zmax = 3 X + 4 Y
O (0, 0) 3*0 + 4*0 = 0
A (0, 36) 3*0 + 4*36 = 144
B (2.5, 35) 3*2.5 + 4*35 = 147.5 (Max.)
C (20, 0) 3*20 + 4*0 =60
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
Subject Name: Operations Research
The Maximum value is 147.5
hence the solution is
X = 2.5
Y = 35
and Z = 147.5
The company should manufacture 2.5 units of model M1 and 35 units
of model M2. The total maximum profit would be Rs. 147.5
Unit 2 Linear Programing Problem Dr. Parul Agrawal 9811880805
Centre for Distance and Online Education
