rahman Sir

[Date]
LINEAR PROGRAMMING

1.A linear programming problems is one that is concerned with finding Optimal value (maximum or
minimum) of a linear function of several variables (called objective function) subject to conditions
that the variables are non-negative and satisfy a set of linear inequalities (called linear constraints)
2.Objective Function: A linear function = ax +by , where a , bare constants, which has to be maximised
or minimised is called a linear objective function. Variables x , y are called decision variable.
3.Constraints: The linear inequalities or equations or restriction on the variables of a linear
programming problem are called constraints. The condition x ≥ 0 , y ≥0 are called non-negative
constraints.
4. Linear programming problems and its Mathematical Formulation
Example: A furniture dealer deals in only two items-table and chair. He has ₹ 50,000 to invest and
have a storage space for at most 60 pieces. A table costs ₹ 2500 and a chair ₹ 500.He estimates that
from the sale of one table, he can make a profit of ₹ 250 and from sale of one chair a profit of ₹ 75. He
wants to know how many tables and chair he must buy from available money so as to maximise his
profit, assuming that he can sell all the items he buys.
Mathematical formulation of the problem.
Let x be the number of tables and y be the number of chairs that the dealer buys.
Obviously, x∧ y must be non- negative,
i .e . , x ≥0 , y ≥ 0
Maximise Z=250 x+75 y
Subjects to constraints;
2500 x+ 500 y ≤ 50,000(investment constraints)
¿ 5 x+ y ≤ 100 …(1)
x + y ≤ 60 … (2)(storage constraints)
x ≥ 0 , y ≥0 …(3)
¿ the above example Z=250 x+75 y is linear objective function. Variables x∧ y are called decision
variables. The set of inequalities (1) to (3) are constraints
5. A few important linear programming problems are:
I. Diet problems: In these problems, we determine the amount of different kinds of constituents /
nutrients which should be included in a diet such that it contains a certain minimum amount of each
constituents/nutrients.
II. Manufacturing Problems: In these problems, we determine the number of units of different
products which should be produced and sold by a firm when each product requires a fixed man
power, machine hours, labour hour per unit of product, warehouse per unit of the output etc.. in
order to make maximum profit.

1
 rahman Sir
[Date]
LINEAR PROGRAMMING
III. Allocation Problems: In these problems, the firm has to allocate the different resource to
different units in order to maximise the profit.
IV. Transportation Problems: In these problems, we determine the transportation schedule in order
to find the cheapest way of transporting a product from plants/factories situated at different locations
to different markets.
Note: At most means ≤ and at least means ≥
6.Feasible region or ( solution region):The common region determined by all constraints including the
non- negative constraints x ≥ 0 , y ≥0 of a linear programming problem is called the feasible region (or
feasible solution) for the problem.
7. The points within the boundary of the feasible region represents feasible solutions of the constraints.
8. Any point outside of the feasible region is infeasible solution
9. Any point in the feasible region that gives the optimal value (maximum or minimum) of the
objective function is called the optimal solution.
10. The following theorem is fundamental in solving the linear programming problems:
Theorem 1:
Let R be the feasible region for a linear programming problem and let Z = ax +by be the
objective function. When Z has optimal value (maximum or minimum), where x and y is subject to
constraints described by linear inequalities, this optimal value must occur at corner points (vertex) of R
Theorem 2: Let R be the feasible region for a linear programming problem and let Z = ax +by be the
objective function.
(a) If R is bounded, then the objective function Z has both maximum and minimum value on R and
each of these occurs at a corner point (vertex) of R.
(b) If the feasible region is unbounded, then the maximum or minimum may or may not exist.
However, if it exists, it must occur at corner points of R
11.Corner points method:
For solving a linear programming problem. The method comprises of the following steps.
(i) Find the feasible region of the linear programming and determine its corner points(vertices).
(ii) Evaluate the objective function Z = ax +by at each corner point. Let M and m respectively be the
largest and smallest values at these points.
(iii) If the feasible region is bounded, M and m respectively are the maximum and minimum values of
the objective function.
If the feasible region is unbounded, then
(i) M is maximum value if open half plane determine by ax +by > M has no point in common in the
feasible region. Otherwise, Z has no maximum value.
(ii) m is the minimum value if open half plane determine by ax +by < m has no point in common in the
feasible region. Otherwise, Z has no minimum value.
12. If two corner points of the feasible region are both optimal solutions of same type, i.e., both
produce same maximum or minimum, then any point on the line segment joining these two points is
also an optimal solution of the same type.
Graphical method of solving linear programming problems:
We will now illustrate these steps of Corner Point Method by considering some examples:

2
 rahman Sir
[Date]
LINEAR PROGRAMMING
Example 1 Solve the following linear programming problem graphically:
Maximise Z = 4x + y ... (1)
subject to the constraints:
x + y ≤ 50 ... (2)
3x + y ≤ 90 ... (3)
x ≥ 0, y ≥ 0 ... (4)

Solution The shaded region in Fig 12.2 is the feasible region determined by the system of constraints
(2) to (4). We observe that the feasible region OABC is bounded. So, we now use Corner Point
Method to determine the maximum value of Z.
The coordinates of the corner points O, A, B and C are
(0, 0), (30, 0), (20, 30) and (0, 50) respectively. Now
we evaluate Z at each corner point.

Corner
Points Z = 4x +y

O (0, 0) Z=0
A (30,0) Z = 120 + 0 = 120 (maximum)
B (20,30) Z = 80 + 30 = 110
C (0,50) Z = 0 + 50 = 50

Hence, maximum value of Z is 120 at the point (30, 0).

Example 2 Solve the following linear programming problem graphically:
Minimise Z = 200 x + 500 y ... (1)
subject to the constraints:

x + 2y ≥ 10 ... (2)
3x + 4y ≤ 24 ... (3)
x ≥ 0, y ≥ 0 ... (4)

3
 rahman Sir
[Date]
LINEAR PROGRAMMING
x + 2y = 10
x 0 10
y 5 0

3x +4 y = 24
x 0 8
y 6 0
Solving eqn. (2) and (3) we get x = 4 and y = 3

Solution: The shaded region in Fig. is

the feasible region ABC determined by
the system of constraints (2) to (4),
which is bounded. The coordinates of
corner points A, B and C are (0,5), (4,3)
and (0,6) respectively.

Now we evaluate Z = 200x + 500y at these points.

Corner Points Z = 200 x+ 500 y
A (0,5) Z = 0+2500=2500
B (4,3) Z = 800+1500=2300 (minimum)
C (0,6) Z = 0 + 3000 = 3000
Hence, minimum value of Z is 2300 attained at the point (4, 3)

Example 3 Solve the following problem graphically:

Minimise and Maximise Z = 3x + 9y ... (1)
subject to the constraints: x + 3y ≤ 60 ... (2)
x + y ≥ 10 ... (3)
x ≤ y ... (4)
x ≥ 0, y ≥ 0 ... (5)

Solution First of all, let us graph the feasible region of the system of linear inequalities (2) to (5).
The feasible region ABCD is shown in the Fig. Note that the region is bounded.
4
 rahman Sir
[Date]
LINEAR PROGRAMMING
The coordinates of the corner points A, B, C and D are (0, 10), (5, 5), (15,15) and (0, 20) respectively.
We now find the minimum and maximum
value of Z. From the table, we find that the
minimum value of Z is 60 at the point B (5, 5)
of the feasible region. The maximum value of Maximum
Z on the feasible region occurs at the two
corner points C (15, 15) and D (0, 20) and it is
180 in each case.

Remark Observe that in the above example,

the problem has multiple
optimal solutions at the corner Corner points Z = 3 x+ 9 y
points C and D, i.e. the both A (0,10) Z = 0+ 90 = 90
points produce same maximum B (5,5) Z = 15 + 45 = 60 (Minimum)
value 180. In such cases, you C (15,15) Z = 45 + 135 = 180
can see that every point on the D (0,20) Z = 0 + 180 = 180
line segment CD joining the
two corner points C and D also give the same maximum value. Same is also true in the case if the two
points produce same minimum value.
Example 4 Determine graphically the minimum value of
the objective function
Z = – 50x + 20y ... (1)
subject to the constraints:
2x –y ≥ – 5 ... (2)
3x + y ≥ 3 ... (3)
2x –3 y ≤ 12 ... (4)
x ≥ 0, y ≥ 0 ... (5)
Solution:
First of all, let us graph the feasible region of the system of inequalities (2) to (5).
The feasible region (shaded) is shown in the Fig. Observe that the feasible region is unbounded. We
now evaluate Z at the corner points.
Corner points Z = – 50x + 20y
(0, 5) Z = 100
(0, 3) Z = 60
(1, 0) Z = −50
(6, 0) Z = −300(smallest)

5
 rahman Sir
[Date]
LINEAR PROGRAMMING
From this table, we find that (– 300) is the smallest value of Z at the corner point (6, 0). Can we say
that minimum value of Z is – 300? Note that if the region would have been bounded, this smallest
value of Z is the minimum value of Z (Theorem 2). But here we see that the feasible region is
unbounded. Therefore, – 300 may or may not be the minimum value of Z. To decide this issue, we
graph the inequality
– 50x + 20y < – 300 (see Step 3(ii) of corner Point Method.)
i.e., – 5x + 2y < – 30
and check whether the resulting open half plane has points in common with feasible region or not. If it
has common points, then –300 will not be the minimum value of Z. Otherwise, –300 will be the
minimum value of Z.
As shown in the Fig above, it has common points. Therefore, Z = –50 x + 20 y has no minimum value
subject to the given constraints. In the above example, can you say whether z = – 50 x + 20 y has the
maximum value 100 at (0,5)? For this, check whether the graph of – 50 x + 20 y > 100 has points in
common with the feasible region. We notice that graph of −5 x+ 2 y >10 has no point in common in
the feasible region, hence it has the maximum value at (0,5).
Example 5
Minimise Z = 3x + 2y
subject to the constraints:
x + y ≥ 8 ... (1)
3x + 5y ≤ 15 ... (2)
x ≥ 0, y ≥ 0 ... (3)
Solution
Let us graph the inequalities (1) to (3) (Fig 12.6). Is there any feasible region?

From Fig. you can see that there is no point

satisfying all the constraints simultaneously.
Thus, the problem is having no feasible region
and hence no feasible solution.
Remarks from the examples which we have
discussed so far, we notice some general
features of linear programming problems:
(i) The feasible region is always a
convex region. (ii) The maximum
(or minimum)
(ii) solution of the objective function occurs at the vertex (corner) of the feasible region. If
two corner points produce the same maximum (or minimum) value of the objective

6
 rahman Sir
[Date]
LINEAR PROGRAMMING
function, then every point on the line segment joining these points will also give the
same maximum (or minimum) value
EXERCISE 12.1
Solve the following Linear Programming Problems graphically:
1. Maximise Z = 3x + 4y
subject to the constraints: x + y ≤ 4, x ≥ 0, y ≥ 0.
Solution:
The feasible region determined by the
constraints, x + y ≤ 4, x ≥ 0, y ≥ 0, is as
shown in figure. The corner points of the
feasible region are O (0, 0), A (4, 0), and B
(0, 4). The values of Z at these points are
as follows.
Corner Points Z = 3 x+ 4 y
O(0 , 0) Z=0
A(4 , 0) Z = 12
B(0 , 4 ) Z = 16(maximum)

Therefore, the maximum value of Z is 16 at

the point B (0, 4).

2. Minimise Z = – 3x + 4 y
subject to the constraints:
x + 2y ≤ 8
3x + 2y ≤ 12
x ≥ 0, y ≥ 0.
Solution:
The feasible region determined by the system of constraints, x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0.
Is as shown in the figure.
The corner points of the feasible region are O (0, 0), A (4, 0),
B (2, 3), and C (0, 4).

Corner Points Z = −3 x+ 4 y
O(0 , 0) Z=0
A(4 , 0) Z = −12(minimum)
B(2 , 3) Z = −6+12=6
C (0,4) Z = 16

Therefore, the minimum value of Z is −12 at the point

(4, 0).

3. Maximise Z = 5x + 3y
subject to the constraints: 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0

7
 rahman Sir
[Date]
LINEAR PROGRAMMING
Solution: The feasible region determined by the system of
constraints; 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0, are as
shown in the figure alongside. The corner points of the

feasible region are O (0, 0), A (2, 0), B (0, 3), and C ( 2019 , 4519 )
The values of Z at these corner points are as follows.

Corner Points Z = 5 x+ 3 y
O(0 , 0) Z=0
A(2, 0) Z = 10
B(0 , 3) Z=9

C (
20 45
,
19 19 )
Z=5
20
19
+3 ( ) ( )
45
19
235
¿ (maximum)
19
Therefore, the maximum value of Z is
235
19
, at , (
20 45
19 19 )
4. Minimise Z = 3x + 5y
such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
Solution:
The feasible region determined by the system of
constraints, x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.are as shown in the
figure. It can be seen that the feasible region is
unbounded. The corner points of the feasible region are,

A ( 3 , 0) , B ( 32 , 12 )∧C(0 ,2)
The values of Z at these corner points are as follows.

Corner Points Z = 3 x+ 5 y
A(4 , 0) Z = 12

( )
3 1 9 5 14
B , Z = + = =7 (minimum)
2 2 2 2 2
C (0,4) Z = 20
As the feasible region is unbounded, therefore, 7 may or may not be the minimum value of Z.
For this, we draw the graph of the inequality, 3x + 5y < 7, and check whether the resulting half plane has
points in common with the feasible region or not. It can be seen that the feasible region has no common point

with 3x + 5y < 7 Therefore, the minimum value of Z is 7 at B ( 32 , 12 ).

5. Maximise Z = 3x + 2y
subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0
Solution: The feasible region determined by the
constraints, x + 2y ≤ 10, 3x + y ≤ 15, x ≥ 0, and y ≥ 0,
is as shown in figure alongside.
The corner points of the feasible region are

8
 rahman Sir
[Date]
LINEAR PROGRAMMING
O (0,0), A (5, 0), B (4, 3) and C (0, 5).

The values of Z at these corner points are as follows.

Corner Points Z = 3 x+ 2 y
O(0 , 0) Z=0
A(5 ,0) Z = 15
B(4 , 3) Z = 12+6=18
C ( 0 , 5) Z = 10
Therefore, the maximum value of Z is 18 at the point (4, 3).

6. Minimise Z = x + 2y
subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0.
Solution:
The feasible region determined by the constraints,
2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, and y ≥ 0, is as shown in the
figure alongside. The corner points of the feasible region
are A (6, 0) and B (0, 3)
The values of Z at these corner points are as follows

Corner points Z=x+2y

A (6, 0) Z=6+0=0
B(0 , 3) Z= 0+6=6
It can be seen that the value of Z at points A and B is
same. If we take any other point such as (2, 2) on line x +
2y = 6, then Z = 6 Thus, the minimum value of Z occurs for
more than 2 points. Therefore, the value of Z is minimum at every point on the line, x + 2y = 6

Show that the minimum of Z occurs at more than two point.

7.Minimise and Maximise Z = 5x + 10 y
subject to x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0.
Solution: The feasible region determined by the constraints, x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0, x ≥ 0,
and y ≥ 0, is as follows.

The corner points of the feasible region are

A (60, 0), B (120, 0), C (60, 30), and D (40,20)

The values of Z at these corner points are as

follows.

Corner points Z = 5x + 10 y
A (60, 0) Z = 300 (Minimum)
B (120, 0) Z = 600 (maximum)
C (60,30) Z = 600 (maximum)

9
 rahman Sir
[Date]
LINEAR PROGRAMMING
D (40,20) Z =400

The minimum value of Z is 300 at (60, 0) and the maximum value of Z is 600 at all the points on the line
segment joining (120, 0) and (60, 30).

8. Minimise and Maximise Z = x + 2y

subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.
Solution:
The feasible region determined by the constraints, x + 2y ≥ 100, 2x − y ≤ 0, 2x + y ≤ 200, x ≥ 0, and y ≥ 0, is
as follows.

The corner points of the feasible region are A (0, 50), B (20, 40), C (50, 100), and D (0,200)
Corner Points Z = x+2y
A (0,50) Z = 100 (Minimum)
B (20,40) Z = 100 (Minimum)
C (50,100) Z = 250
D (0,200) Z = 400 (maximum)
The maximum value of Z is 400 at (0, 200) and the minimum value of Z is 100 at all the points on the line
segment joining the points (0, 50) and (20, 40).

9.Maximise Z = – x + 2y,
subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0.
Solution: The feasible region determined by the constraints, x ≥ 3, x + y ≥ 5, x + 2y ≥ 6, y ≥ 0, s as
follows;

10
 rahman Sir
[Date]
LINEAR PROGRAMMING

It can be seen that the feasible region is unbounded.

Corner Points Z = −x +2 y
A (6,0) Z = −6
B (4,1) Z = −4+2=−2
C (3,2) Z = −3+ 4=1
As the feasible region is unbounded, therefore, Z = 1 may or may not be the maximum value. For this, we
graph the inequality, −x + 2y > 1, and check whether the resulting half plane has points in common with the
feasible region or not. The resulting feasible region has points in common with the feasible region. Therefore,
Z = 1 is not the maximum value. Z has no maximum value.

10. Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.

Solution:
The region determined by the constraints, x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0 is as follows.

There is no feasible region and thus, Z has no maximum value.

Example 6 (Diet problem): A dietician wishes to mix two types of foods in such a way that vitamin
contents of the mixture contain at least 8 units of vitamin A and 10 units of vitamin C. Food ‘I’
contains 2 units/kg of vitamin A and 1 unit/kg of vitamin C. Food ‘II’ contains 1 unit/kg of vitamin A
and 2 units/kg of vitamin C. It costs ₹ 50 per kg to purchase Food ‘I’ and Rs.70 per kg to purchase
Food ‘II’. Formulate this problem as a linear programming problem to minimise the cost of such a
mixture.
Solution:
Let the mixture contain x kg of Food ‘I’ and y kg of Food ‘II’. Clearly, x ≥ 0, y ≥ 0. We make the following table
from the given data:

11
 rahman Sir
[Date]
LINEAR PROGRAMMING
Resources Food Requirement
I II
(x) (y)
Vitamin A 2 1 8
(units/kg)
Vitamin C 1 2 10
(units/kg)
Cost¿ /kg) 50 70
Since the mixture must contain at least 8 units of vitamin A and 10 units of vitamin C, we have the
constraints: 2x + y ≥ 8, x + 2y ≥ 10

Total cost Z of purchasing x kg of food ‘I’ and y kg of Food ‘II’ is Z = 50x + 70y

Hence, the mathematical formulation of the problem is:

Minimise Z = 50x + 70y ... (1)

subject to the constraints: 2x + y ≥ 8 ... (2)

x + 2y ≥ 10 ... (3)

x, y ≥ 0 ... (4)

Let us graph the inequalities (2) to (4).

The feasible region determined by the system is shown in the Fig.

Here again, observe that the feasible region is unbounded Let us
evaluate Z at the corner points A (0,8), B (2,4) and C (10,0).

The values of Z at these corner points are as follows.

Corner points Z = 50x + 70 y

A (0, 8) Z =560
B (2, 4) Z = 100 + 280 = 380(minimum)
C (10,0) Z = 500 +0 = 500

In the table, we find that smallest value of Z is 380 at the point (2,4). Can we say that the minimum
value of Z is 380? Remember that the feasible region is unbounded. Therefore, we have to draw the
graph of the inequality 50x + 70y < 380 i.e., 5x + 7y < 38 to check whether the resulting open half plane
has any point common with the feasible region. From the Fig., we see that it has no points in common.
Thus, the minimum value of Z is 380 attained at the point (2, 4). Hence, the optimal mixing strategy for
the dietician would be to mix 2 kg of Food ‘I’ and 4 kg of Food ‘II’, and with this strategy, the minimum cost of
the mixture will be Rs.380.
Example 7 (Allocation problem) A cooperative society of farmers has 50 hectare of land to grow two
crops X and Y. The profit from crops X and Y per hectare are estimated as ₹ 10,500 and₹ .9,000
respectively. To control weeds, a liquid herbicide has to be used for crops X and Y at rates of 20 litres
and 10 litres per hectare. Further, no more than 800 litres of herbicide should be used in order to protect
fish and wild life using a pond which collects drainage from this land. How much land should be
allocated to each crop so as to maximise the total profit of the society?
Solution
Let x hectare of land be allocated to crop X and y hectare to crop Y. Obviously, x ≥ 0, y ≥ 0.

12
 rahman Sir
[Date]
LINEAR PROGRAMMING
Profit per hectare on crop X = Rs.10500
Profit per hectare on crop Y = Rs.9000
Therefore, total profit = ₹ (10500x + 9000y)
The mathematical formulation of the problem is as follows:
Maximise Z = 10500 x + 9000 y
subject to the constraints:
x + y ≤ 50 (constraint related to land) ... (1)
20x + 10y ≤ 800 (constraint related to use of herbicide) i.e. 2x + y ≤ 80 ... (2)
x ≥ 0, y ≥ 0 (non - negative constraint) ... (3)

Let us draw the graph of the system of inequalities (1) to (3) The
feasible region OABC is shown (shaded) in the Fig. Observe that
the feasible region is bounded. The coordinates of the corner
points O, A, B and C are (0, 0), (40, 0), (30, 20) and (0, 50)
respectively.
Let us evaluate the objective function Z = 10500 x + 9000y at
these vertices to find which one gives the maximum profit.

Corner points Z =10500x + 9000 y

O (0,0) Z =0
A (40, 0) Z = 420000
B (30, 20) Z = 495000 (Maximum)
C (0,50) Z = 450000
Hence, the society will get the maximum profit of Rs.4,95,000 by allocating 30 hectares for crop X
and 20 hectares for crop Y.
Example 8 (Manufacturing problem) A manufacturing company makes two models A and B of a product.
Each piece of Model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each
piece of Model B requires 12 labour hours for fabricating and 3 labour hours for finishing. For
fabricating and finishing, the maximum labour hours available are 180 and 30 respectively. The
company makes a profit of Rs.8000 on each piece of model A and Rs.12000 on each piece of Model B.
How many pieces of Model A and Model B should be manufactured per week to realise a maximum
profit? What is the maximum profit per week?
Solution Suppose x is the number of pieces of Model A and y is the number of pieces of Model B.
Then Total profit (in Rs . ¿= 8000 x + 12000 y
Let Z = 8000 x + 12000 y
We now have the following mathematical model for the given problem.
Maximise Z = 8000 x + 12000 y ... (1)
subject to the constraints:
9x + 12y ≤ 180 (Fabricating constraint) i.e. 3x + 4y ≤ 60 ... (2)
x + 3y ≤ 30 (Finishing constraint) ... (3)
x ≥ 0, y ≥ 0 (non-negative constraint) ... (4)

The feasible region (shaded) OABC determined by the

linear inequalities (2) to (4) is shown in the Fig. Note that
the feasible region is bounded.

The values of Z at these corner points are as follows.

Corner Z = 8000 x + 12000 y

13
 rahman Sir
[Date]
LINEAR PROGRAMMING
points
A (20, 0) Z =160000
B (12, 6) Z = = 168000 (maximum)
C (0,10) Z = 120000

We find that maximum value of Z is 1,68,000 at B (12, 6). Hence, the company should produce 12 pieces of
Model A and 6 pieces of Model B to realise maximum profit and maximum profit then will be Rs.1,68,000.

Exercise 12.2
Question 1:
Reshmawishes to mix two types of food P and Q in such a way that the vitamin contents of the mixture
contain at least 8 units of vitamin A and 11 units of vitamin B. Food P costs Rs.60/kg and Food Q costs
Rs.80/kg. Food P contains 3 units /kg of vitamin A and 5 units /kg of vitamin B while food Q contains 4 units/kg
of vitamin A and 2 units /kg of vitamin B. Determine the minimum cost of the mixture?

Solution: Let the mixture contain x kg of food P and y kg of food Q. Therefore, x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

Vitamin A (units/kg) Vitamin B (units/kg) Cost (Rs./kg)

Food P 3 5 60
Food Q 4 2 11
Requirement 8 11
(units/kg)
The mixture must contain at least 8 units of vitamin A and 11 units of vitamin B.

Therefore, the constraints are 3x + 4y ≥ 8 5x + 2y ≥ 11

Total cost, Z, of purchasing food is, Z = 60x + 80y
The mathematical formulation of the given problem is,
Minimise Z = 60x + 80y … (1)
subject to the constraints,
3x + 4y ≥ 8 … (2)
5x + 2y ≥ 11 … (3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.
It can be seen that the feasible region is unbounded.

The corner points of the feasible region are A ( 83 , 0) B (2 , 12 )

11
and C (0 , )
2
The values of Z at these corner points are as follows.

14
 rahman Sir
[Date]
LINEAR PROGRAMMING
Corner points Z = 60 x + 80 y
8 Z = 160
A( ,0) Minimum
3
1 Z = 160
B(2 , )
2
11 Z = 440
C (0 , )
2
As the feasible region is unbounded, therefore, 160 may or may not be the minimum value of Z.

For this, we graph the inequality, 60x + 80y < 160 or 3x + 4y < 8,

and check whether the resulting half plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 3x + 4y < 8

Therefore, the minimum cost of the mixture will be Rs.160 at the line segment joining A ( 83 , 0)∧B (2 , 12 )
Question 2:
One kind of cake requires 200g flour and 25g of fat, and another kind of cake requires 100g of flour
and 50g of fat. Find the maximum number of cakes which can be made from 5 kg of flour and 1 kg of
fat assuming that there is no shortage of the other ingredients used in making the cakes?
Solution: Let there be x cakes of first kind and y cakes of second kind. Therefore, x ≥ 0 and y ≥ 0
The given information can be compiled in a table as follows.

Flour (g) Fat (g)

Cakes of first kind, x 200 25
Cakes of second kind, y 100 50
Availability ≤5000 ≤1000
∴ 200 x +100 y ≤5000
⇒ 2 x + y ≤ 50
25 x+ 50 y ≤ 1000
⇒ x +2 y ≤ 40
Total numbers of cakes, Z, that can be made are, Z = x + y

The mathematical formulation of the given problem is,

Maximize Z = x + y … (1)

subject to the constraints,

2 x+ y ≤ 50 …(2)
x +2 y ≤ 40 … ( 3 )
x ≤ 0 , y ≤0 … (4 )

15
 rahman Sir
[Date]
LINEAR PROGRAMMING
The feasible region determined by the system of constraints
is as shown in the fig. alongside.
The corner points are A (25, 0), B (20, 10), O (0, 0), and C (0, 20).

The values of Z at these corner points are as follows.

Corner points Z=x+y

A (25, 0) Z = 25
B (20, 10) Z = 30
O (0,0) Z=0
C (0,20) Z = 20

Thus, the maximum numbers of cakes that can be made are 30 (20 of one kind and 10 of the other kind).

Question 3:
A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3
hours of craftsman’s time in its making while a cricket bat takes 3 hour of machine time and 1 hour of
craftsman’s time. In a day, the factory has the availability of not more than 42 hours of machine time
and 24 hours of craftsman’s time.
(i) What number of rackets and bats must be made if the factory is to work at full capacity?
(ii) If the profit on a racket and on a bat is Rs.20 and Rs.10 respectively, find the maximum profit of the
factory when it works at full capacity.

Solution: (i) Let the number of rackets and the number of bats to be made be x and y respectively.
The machine time is not available for more than 42 hours.

The craftsman’s time is not available for more than 24 hours. The factory is to work at full capacity.

Therefore, 1.5x + 3y = 42

3x + y = 24

On solving these equations, we obtain x = 4 and y = 12

Thus, 4 rackets and 12 bats must be made.

(i) The given information can be complied in a table as follows.

Tennis Racket Cricket Bat Availability

Machine Time (h) 1.5 3 42

Craftsman’s Time (h) 3 1 24
∴1.5x + 3y ≤ 42
3x + y ≤ 24
x, y ≥ 0
The profit on a racket is Rs.20 and on a bat is Rs.10.
∴ Z=20 x +10 y
16
 rahman Sir
[Date]
LINEAR PROGRAMMING
The mathematical formulation of the given problem is,
Maximize Z=20 x+10 y … (1)
subject to the constraints,
1.5x + 3y ≤ 42 … (2)
3x + y ≤ 24 … (3)
x, y ≥ 0 … (4)
The feasible region determined by the system of
constraints is as shown in figure alongside. The corner
points are A (8, 0), B (4, 12), C (0, 14), and O (0, 0)

The values of Z at these corner points are as follows.

Corner points Z =20 x +10 y

A (8, 0) Z = 160
B (4, 12) Z = 200 (maximum)
C (0,14) Z = 140
O(0,0) Z=0

Thus, the maximum profit of the factory when it works to its full capacity is Rs.200.

Question 4:
A manufacturer produces nuts and bolts. It takes 1 hour of work on machine A and 3 hours on machine
B to produce a package of nuts. It takes 3 hours on machine A and 1 hour on machine B to produce a
package of bolts. He earns a profit, of Rs.17.50 per package on nuts and Rs.7.00 per package on bolts.
How many packages of each should be produced each day so as to maximize his profit, if he operates
his machines for at the most 12 hours a day?
Solution:
Let the manufacturer produce x packages of nuts and y packages of bolts. Therefore, x ≥ 0 and y ≥ 0

The given information can be complied in a table as follows.

Nuts Bolts Availability (hours)

(x) (y)
Machine A(h) 1 3 At most 12
Machine B (h) 3 1 At most 12

The profit on a package of nuts is Rs.17.50 and on a package of bolts is Rs.7.

Therefore, the constraints are Total profit, Z = 17.5x + 7y
The mathematical formulation of the given problem is
Maximise Z = 17.5x + 7y … (1)

17
 rahman Sir
[Date]
LINEAR PROGRAMMING
subject to the constraints,
x + 3y ≤ 12 … (2)
3x + y ≤ 12 … (3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.

The corner points are A (4, 0), B (3, 3), and C (0, 4).

The values of Z at these corner points are as follows.

Corner points Z = 17.5x + 7y

O (0,0) Z=0
A (4, 0) Z = 70
B (3, 3) Z = 52.5+21= 73.5
C (0, 4). Z = 28
The maximum value of Z is Rs.73.50 at (3, 3).

Thus, 3 packages of nuts and 3 packages of bolts should be produced each day to get the maximum profit of
Rs.73.50.

Question 5:

18
 rahman Sir
[Date]
LINEAR PROGRAMMING
A factory manufactures two types of screws, A and B. Each type of screw requires the use of two machines, an
automatic and a hand operated. It takes 4 minutes on the automatic and 6 minutes on hand operated machines
to manufacture a package of screws A, while it takes 6 minutes on automatic and 3 minutes on the hand
operated machines to manufacture a package of screws B. Each machine is available for at the most 4 hours on
any day. The manufacturer can sell a package of screws A at a profit of Rs.7 and screws B at a profit of Rs10.
Assuming that he can sell all the screws he manufactures, how many packages of each type should the factory
owner produce in a day in order to maximize his profit? Determine the maximum profit.

Solution:
Let the factory manufacture x screws of type A and y screws of type B on each day. Therefore, x ≥ 0 and y ≥ 0

given information can be compiled in a table as follows.

(ii) The given information can be complied in a table as follows.

Screw A Screw B Availability

(x) (y)

Automatic Machine (min) 4 6 4 ×60=240

Hand Operated Machine (min) 6 3 4 ×60=240
∴ 4 x +6 y ≤240
And 6 x +3 y ≤ 240, Total profit, Z = 7x + 10y
The mathematical formulation of the given problem is Maximize Z = 7x + 10y … (1)

subject to the constraint,

2 x+3 y ≤ 120 …(2)

2 x+ y ≤ 80 … (3)
x ≥ 0 , y ≥0 …(4 )
The feasible region determined by the system of
constraints is shown in the figure.

The corner points are A (40, 0), B (30, 20), and C (0, 40)
and O (0,0)

The values of Z at these corner points are as follows.

Corner points Z = 7x + 10y

O (0,0) Z=0
A (40, 0) Z = 280
B (30, 20) Z = 410 Maximum)
C (0, 40). Z = 400
The maximum value of Z is 410 at (30, 20).

Thus, the factory should produce 30 packages of screws A and 20 packages of screws B to get the maximum
profit of Rs.410.

Question 6:

19
 rahman Sir
[Date]
LINEAR PROGRAMMING
A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of a
grinding/cutting machine and a sprayer. It takes 2 hours on grinding/cutting machine and 3 hours on the sprayer
to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to
manufacture a shade. On any day, the sprayer is available for at the most 20 hours and the grinding/cutting
machine for at the most 12 hours. The profit from the sale of a lamp is Rs.5 and that from a shade is Rs.3.
Assuming that the manufacturer can sell all the lamps and shades that he produces, how should he schedule his
daily production in order to maximize his profit?

Solution:
Let the cottage industry manufacture x pedestal lamps and y wooden shades. Therefore, x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

Lamps Shades Availability (hours)

(x) (y)
Grinding/Cutting Machine (h) 2 1 At most12
Sprayer (h) 3 2 At most 20
The profit on a lamp is Rs.5 and on the shades is Rs.3. Therefore, the constraints are

2 x+ y ≤ 12
3 x+ 2 y ≤ 20
Total profit, Z = 5x + 3y

The mathematical formulation of the given problem is Maximize

Z = 5x + 3y … (1)

subject to the constraints,

2 x+ y ≤ 12 … (2)
3 x+ 2 y ≤ 20 … (3)

x ≥ 0 , y ≥0 …(4 )
The feasible region determined by the system of constraints is
as shown in the figure. The corner points are A (6, 0), B (4, 4),

C (0, 10) and O (0,0).

The values of Z at these corner points are as follows.

Corner points Z = 5x +3 y
O (0,0) Z=0
A (6, 0) Z = 30
B (4,4) Z =32 Maximum)
C (0, 10). Z =30
The maximum value of Z is 32 at (4, 4).

Thus, the manufacturer should produce 4 pedestal lamps and 4 wooden shades to maximize his profits.

Question 7:

20
 rahman Sir
[Date]
LINEAR PROGRAMMING
A company manufactures two types of novelty souvenirs made of plywood. Souvenirs of type A require 5
minutes each for cutting and 10 minutes each for assembling. Souvenirs of type B require 8 minutes each for
cutting and 8 minutes each for assembling. There are 3 hours 20 minutes available for cutting and 4 hours of
assembling. The profit is Rs.5 each for type A and Rs.6 each for type B souvenirs. How many souvenirs of each
type should the company manufacture in order to maximize the profit?

Solution:
Let the company manufacture x souvenirs of type A and y souvenirs of type B. Therefore, x ≥ 0 and y ≥ 0

The given information can be complied in a table as follows.

Type A Type B Availability

(x) (y)
Cutting (min) 5 8 3 ×60+ 20=200
Assembling (min) 10 8 4 ×60=240
The profit on type A souvenirs is Rs.5 and on type B souvenirs is Rs.6.

Therefore, the constraints are

5 x+ 8 y ≤ 200
10 x+ 8 y ≤ 240
Total profit, Z = 5x + 6y

The mathematical formulation of the given problem is

Maximize Z = 5x + 6y … (1)

subject to the constraints,

5 x+ 8 y ≤ 200 … (2)
10 x+ 8 y ≤ 240 … (3)
x ≥ 0 , y ≥0 …(4 )
The corner points are A (24, 0), B (8, 20), C (0, 25) and

O (0.0).

The values of Z at these corner points are as follows.

Corner points Z = 5x +6 y
O (0,0) Z=0
A (24, 0) Z = 120
B (8,20) Z =160 Maximum)
C (0, 25). Z =150
The maximum value of Z is 160 at (8, 20).

Thus, 8 souvenirs of type A and 20 souvenirs of type B should be produced each day to get the maximum
profit of Rs.160.

Question 8.

21
 rahman Sir
[Date]
LINEAR PROGRAMMING
A merchant plans to sell two types of personal computers − a desktop model and a portable model that will cost
Rs.25000 and Rs.40000 respectively. He estimates that the total monthly demand of computers will not exceed
250 units. Determine the number of units of each type of computers which the merchant should stock to get
maximum profit if he does not want to invest more than Rs.70 lakhs and if his profit on the desktop model is
Rs.4500 and on portable model is Rs.5000.

Solution:
Let the merchant stock x desktop models and y portable models. Therefore, x ≥ 0 and y ≥ 0

The cost of a desktop model is Rs.25000 and of a portable model is Rs.4000. However, the merchant can invest
a maximum of Rs.70 lakhs.

∴ 25000 x + 40000 ≤70,00000

5 x+ 8 y ≤ 1400
The monthly demand of computers will not exceed 250 units.
∴ x+ y ≤ 250
The profit on a desktop model is Rs.4500 and the profit on a portable model is Rs.5000.

Total profit, Z = 4500x + 5000y

Thus, the mathematical formulation of the given problem is

Maximise Z = 4500x + 5000y … (1)

Subject to constraints,

5 x+ 8 y ≤ 1400 … (2)
x + y ≤ 250 … (3)
x ≥ 0 , y ≥0 …(4 )
The feasible region determined by the system of
constraints is as shown in the figure. The corner
points are

A (250, 0), B (200, 50), C (0, 175) and O (0,0) The

values of Z at these corner points are as follows.

Corner Z = 4500x +5000 y

points
O (0,0) Z=0
A (250, 0) Z = 1125000
B (200,50) Z = 1150000 (maximum)
C (0, 175). Z = 875000
The maximum value of Z is 1150000 at (200, 50).

Thus, the merchant should stock 200 desktop models and 50 portable models to get the maximum profit of

22
 rahman Sir
[Date]
LINEAR PROGRAMMING
Rs.1150000.

Question 9.
A diet is to contain at least 80 units of vitamin A and 100 units of minerals. Two foods F1and F2 are available.
Food F1 costs Rs.4 per unit food and F2 costs Rs.6 per unit. One unit of food F1 contains 3 units of vitamin A and
4 units of minerals. One unit of food F2 contains 6 units of vitamin A and 3 units of minerals. Formulate this as a
linear programming problem. Find the minimum cost for diet that consists of mixture of these two foods and
also meets the minimal nutritional requirements?

Solution:
Let the diet contain x units of food F1 and y units of food F2. Therefore, x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

Vitamin A (units) Mineral (units) Cost per unit
in Rupees.
Food F1 (x) 3 4 4
Food F 2 6 3 6
Requirement 80 100
The cost of food F1 is Rs.4 per unit and of Food F2 is Rs.6 per unit. Therefore,

the constraints are 3x + 6y ≥ 80; 4x + 3y ≥ 100; x, y ≥ 0

The mathematical formulation of the given problem is

Minimise Z = 4x + 6y … (1)

subject to the constraints,

3x + 6y ≥ 80 … (2)

4x + 3y ≥ 100 … (3)

x, y ≥ 0 … (4)

The feasible region determined by the constraints is as

shown in the figure alongside. It can be seen that the
feasible region is unbounded. The corner points of the

feasible region are A ( 803 , 0), B (24 , 43 )∧C (0 , 1003 )

The values of Z at these corner points are as follows.

Corner points Z = 4x + 6y
80 320
A ( , 0) Z= = 106.67
3 3
4 Z =104
B (24 , ¿)
3
100 Z =200 Maximum)
C (0 , )
3
As the feasible region is unbounded, therefore, 104 may or may not be the minimum value of Z.

23
 rahman Sir
[Date]
LINEAR PROGRAMMING
For this, we draw a graph of the inequality, 4x + 6y < 104 or 2x + 3y < 52, and check whether the resulting half
plane has points in common with the feasible region or not. It can be seen that the feasible region has no
common point with 2x + 3y < 52 Therefore, the minimum cost of the mixture will be Rs.104.

Question 10.
There are two types of fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid and F2 consists
of 5% nitrogen and 10% phosphoric acid. After testing the soil conditions, a farmer finds that she needs at least
14 kg of nitrogen and 14 kg of phosphoric acid for her crop. If F1 cost Rs.6/kg and F2 costs Rs.5/kg, determine
how much of each type of fertilizer should be used so that nutrient requirements are met at a minimum cost.
What is the minimum cost?

Solution:
Let the farmer buy x kg of fertilizer F1 and y kg of fertilizer F2. Therefore, x ≥ 0 and y ≥ 0

The given information can be compiled in a table as follows.

Nitrogen( %) Phosphoric Acid (% ) Cost( Rs / Kg)

Food F1 (x) 10 6 6
Food 2F ( y) 5 10 6
Requirement (kg) 14 14
F 1 consists of 10 % nitrogen∧¿ F 2 consists of 5% nitrogen. However, the farmer requires at least 14 kg of
Nitrogen. ∴ 10 % of x+ 5 % of y ≥14

x y
+ ≥ 14
10 20
¿ 2 x+ y ≥ 280
F 1 consists of 6 % phospheric acid∧¿ F 2 consists of 10% phospheric acid . However, the farmer requires at
least 14 kg of phospheric acid . ∴ 6 % of x +6 % of y ≥ 14

6 x 10 y
+ ≥ 14
100 100
¿ 3 x+ 5 y ≥ 700
Total cost of fertilizers, Z = 6x + 5y

The mathematical formulation of the given problem is

Minimize Z = 6x + 5y … (1)

subject to the constraints,

2x + y ≥ 280 … (2)

3x + 5y ≥ 700 … (3)

x, y ≥ 0 … (4)

The feasible region determined by the system of constraints is as follows.

24
 rahman Sir
[Date]
LINEAR PROGRAMMING

It can be seen that the feasible region is unbounded.

The corner points are A ( 7003 , 0) , B ( 100 , 80 )∧C(0,280)

The values of Z at these corner points are as follows.

Corner points Z = 6x + 5y
700 Z = 1400
A( , 0)
3
B (100 , 80 ¿) Z =1000 (minimum)
C (0,280 ) Z =1400
As the feasible region is unbounded, therefore, 1000 may or may not be the minimum value of Z. For this,
we draw a graph of the inequality, 6x + 5y < 1000, and check whether the resulting half plane has points
in common with the feasible region or not. It can be seen that the feasible region has no common point
with 6x + 5y < 1000 Therefore, 100 kg of fertiliser F1 and 80 kg of fertilizer F2 should be used to minimize
the cost. The minimum cost is Rs.1000.

Question 11:
The corner points of the feasible region determined by the following system of linear inequalities:

2 x+ y ≤ 10 , x +3 y ≤15 , xy ≥ 0 are ( 0 ,0 ) , ( 5 , 0 ) , ( 3 , 4 )∧(0 ,5)

Let Z = px qy where p , q>0.

Condition on p and q so that the maximum of Z occurs at both (3,4) and (0,5) is

(A) P = q (B) p = 2q (C) p = 3q (D) q = 3q

Solution:

25
 rahman Sir
[Date]
LINEAR PROGRAMMING
The maximum value of Z is unique. It is given that the maximum value of Z occurs at two points, (3, 4)
and (0, 5).

∴ Value of Z at (3, 4) = Value of Z at (0, 5)

⇒ p (3) + q(4) = p(0) + q(5) ⇒ 3p + 4q = 5q ⇒ q = 3p Hence, the correct answer is D.

Miscellaneous Examples
Example 9 (Diet problem) A dietician has to develop a special diet using two foods P and Q. Each
packet (containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of
cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q contains 3 units
of calcium, 20 units of iron, 4 units of cholesterol and 3 units of vitamin A. The diet requires at
least 240 units of calcium, at least 460 units of iron and at most 300 units of cholesterol. How
many packets of each food should be used to minimise the amount of vitamin A in the diet? What
is the minimum amount of vitamin A?
Solution Let x and y be the number of packets of food P and Q respectively. Obviously x ≥ 0, y ≥ 0.
Mathematical formulation of the given problem is as follows:

Minimise Z = 6x + 3y (vitamin A)
subject to the constraints:
12x + 3y ≥ 240 (constraint on calcium), i.e. 4x + y ≥ 80 ... (1)
4x + 20y ≥ 460 (constraint on iron), i.e. x + 5y ≥ 115 ... (2)
6x + 4y ≤ 300 (constraint on cholesterol), i.e. 3x + 2y ≤ 150 ... (3)
x ≥ 0, y ≥ 0 ... (4)
Let us graph the inequalities (1) to (4).
The feasible region (shaded) determined by the constraints (1) to (4) is shown in Figure and note
that it is bounded.

The coordinates of the corner points L, M and N are (2, 72), (15, 20) and (40, 15) respectively.

The values of Z at these corner points are as follows.

Corner points Minimise Z = 6x + 3y (vitamin A)

L (2,72) Z = 228
M (15 , 20 ¿) Z =150 (minimum)

26
 rahman Sir
[Date]
LINEAR PROGRAMMING
N (40 ,15) Z =285
From the table, we find that Z is minimum at the point (15, 20). Hence, the amount of vitamin A under
the constraints given in the problem will be minimum, if 15 packets of food P and 20 packets of food
Q are used in the special diet. The minimum amount of vitamin A will be 150 units.
Example 10 (Manufacturing problem) A manufacturer has three machines I, II and III installed in his
factory. Machines I and II are capable of being operated for at most 12 hours whereas machine III
must be operated for at least 5 hours a day. She produces only two items M and N each requiring the
use of all the three machines. The number of hours required for producing 1 unit of each of M and N
on the three machines are given in the following table:
Items Number of hours required on machines
I II III
M 1 2 1
N 2 1 1.25

She makes a profit of Rs.600 and Rs.400 on items M and N respectively. How many of each item
should she produce so as to maximise her profit assuming that she can sell all the items that she
produced? What will be the maximum profit?
Solution: Let x and y be the number of items M and N respectively.
Total profit on the production = Rs(600x +400y )
Mathematical formulation of the given problem is as follows:
Maximise Z = 600 x + 400 y
subject to the constraints:

x + 2y ≤ 12 (constraint on Machine I) ... (1)

2x + y ≤ 12 (constraint on Machine II) ... (2)

x + 5 4 y ≥ 5 (constraint on Machine III) ... (3)

x ≥ 0, y ≥ 0 ... (4)

Let us draw the graph of constraints (1) to (4). ABCDE is the feasible region (shaded) as shown in Fig
12.11 determined by the constraints (1) to (4). Observe that the feasible region is bounded, coordinates
of the corner points A, B, C, D and E are (5, 0) (6, 0), (4, 4), (0, 6) and (0, 4) respectively

27
 rahman Sir
[Date]
LINEAR PROGRAMMING

The values of Z at these corner points are as follows.

Corner points Ma Maximise Z = 600 x + 400 y

A (5, 0) Z =3000
B (6, 0 ) Z = 3600
C (4,4) Z = 4000 Maximum)
D (0, 6) Z = 2400
E (0,4) Z = 1600

We see that the point (4, 4) is giving the maximum value of Z. Hence, the manufacturer has to
produce 4 units of each item to get the maximum profit of Rs.4000.
Example 11. (Transportation problem) There are two factories located one at place P and the other
at place Q. From these locations, a certain commodity is to be delivered to each of the three depots
situated at A, B and C. The weekly requirements of the depots are respectively 5, 5 and 4 units of the
commodity while the production capacity of the factories at P and Q are respectively 8 and 6 units.
The cost of transportation per unit is given below:

From /To Cost (in Rs .)

A B C
P 160 100 150
Q 100 120 100
How many units should be transported from each factory to each depot in order that the
transportation cost is minimum. What will be the minimum transportation cost?
Solution
The problem can be explained
diagrammatically as shown in the
figure alongside. Let x units and y
units of the commodity be transported

28
 rahman Sir
[Date]
LINEAR PROGRAMMING
from the factory at P to the depots at A and B respectively. Then (8 – x – y) units will be transported
to depot at C.
Hence, we have x ≥ 0, y ≥ 0 and
8–x–y≥0
i.e. x ≥ 0, y ≥ 0 and x + y ≤ 8
Now, the weekly requirement of the depot at A is 5 units of the commodity. Since x units are
transported from the factory at P, the remaining (5 – x) units need to be transported from the factory
at Q. Obviously, 5 – x ≥ 0, i.e. x ≤ 5.
Similarly, (5 – y) and 6 – (5 – x + 5 – y) = x + y – 4 units are to be transported from the factory at Q
to the depots at B and C respectively.
Thus, 5 – y ≥ 0, x + y – 4 ≥0

i.e. y ≤ 5, x+y≥4

Total transportation cost Z is given by

Z = 160 x + 100 y + 100 ( 5 – x) + 120 (5 – y) + 100 (x + y – 4) + 150 (8 – x – y)

= 10 (x – 7 y + 190)

Therefore, the problem reduces to,

Minimise Z = 10 (x – 7y + 190)
subject to the constraints:
x ≥ 0, y ≥ 0 ... (1)
x + y ≤ 8 ... (2)
x ≤ 5 ... (3)
y ≤ 5 ... (4)
and x + y ≥ 4 ... (5)
The shaded region ABCDEF represented by the constraints (1) to (5) is the feasible region as shown
in the figure above. Observe that the feasible region is bounded. The coordinates of the corner points
of the feasible region are (0, 4), (0, 5), (3, 5), (5, 3), (5, 0) and (4, 0).
The values of Z at these corner points are as follows.

Corner points Ma Minimise Z = 10 (x – 7y + 190)

A (0,4) Z = 1620
B (0,5 ) Z = 1550 (minimum)
C (3,5) Z = 1580
D (5,3) Z =1740
E (5,0) Z = 1950

29
 rahman Sir
[Date]
LINEAR PROGRAMMING
F (4,0) Z = 1940
From the table, we see that the minimum value of Z is 1550 at the point (0, 5).
Hence, the optimal transportation strategy will be to deliver 0, 5 and 3 units from the factory at P and
5, 0 and 1 units from the factory at Q to the depots at A, B and C respectively. Corresponding to this
strategy, the transportation cost would be minimum, i.e., Rs.1550.
Miscellaneous Exercise
Question 1.
A dietician has to develop a special diet using two foods P and Q. Each packet (containing 30 g)
of food P contains 12 units of calcium, 4 units of iron, 6 units of cholesterol and 6 units of vitamin
A. Each packet of the same quantity of food Q contains 3 units of calcium, 20 units of iron, 4 units
of cholesterol and 3 units of vitamin A. The diet requires at least 240 units of calcium, at least 460
units of iron and at most 300 units of cholesterol. How many packets of each food should be used
to maximise the amount of vitamin A in the diet? What is the maximum amount of vitamin A?
Solution Let x and y be the number of packets of food P and Q respectively. Obviously x ≥ 0, y ≥ 0.
Mathematical formulation of the given problem is as follows:

Maximise Z = 6x + 3y (vitamin A)
subject to the constraints:
12x + 3y ≥ 240 (constraint on calcium), i.e. 4x + y ≥ 80 ... (1)
4x + 20y ≥ 460 (constraint on iron), i.e. x + 5y ≥ 115 ... (2)
6x + 4y ≤ 300 (constraint on cholesterol), i.e. 3x + 2y ≤ 150 ... (3)
x ≥ 0, y ≥ 0 ... (4)
Let us graph the inequalities (1) to (4).
The feasible region (shaded) determined by the constraints (1) to (4) is shown in Figure and note
that it is bounded.

The coordinates of the corner points L, M and N are (2, 72), (15, 20) and (40, 15) respectively.

The values of Z at these corner points are as follows.

Corner points Maximise Z = 6x + 3y (vitamin A)

L (2,72) Z = 228

30
 rahman Sir
[Date]
LINEAR PROGRAMMING
M (15 , 20 ¿) Z =150
N (40 ,15) Z =285 (maximum)
From the table, we find that Z is maximum at the point (40, 15). Hence, the amount of vitamin A
under the constraints given in the problem will be maximum, if 40 packets of food P and 15 packets of
food Q are used in the special diet. The maximum amount of vitamin A will be 285 units.

Question 2.
A farmer mixes two brands P and Q of cattle feed. Brand P, costing Rs 250 per bag contains 3 units of
nutritional element A, 2.5 units of element B and 2 units of element C. Brand Q costing Rs 200 per bag
contains 1.5 units of nutritional elements A, 11.25 units of element B, and 3 units of element C. The
minimum requirements of nutrients A, B and C are 18 units, 45 units and 24 units respectively. Determine
the number of bags of each brand which should be mixed in order to produce a mixture having a minimum
cost per bag? What is the minimum cost of the mixture per bag?

Solution
Let farmer mix x bags of brand P and y bags of brand Q.

The given information can be compiled in a table as follows.

Vitamin A (units/kg) Vitamin B (units/kg) Cost ( Rs ./ kg)

Food P 3 5 60
Food Q 4 2 80
Requirement 8 11
(units/kg)
The given problem can be formulated as follows.

Minimize z = 250x + 200y … (1)

Subject to the constraints,

3 x+ 1.5 y ≥ 18 … ( 2 )
2.5 x+ 11.25 y ≥ 45 …(3)
2 x+3 y ≥ 24 … ( 4 )
x ≥ 0 , y ≥0 …(5)
The feasible region determined by the system of constraints is as follows.

31
 rahman Sir
[Date]
LINEAR PROGRAMMING

The corner points of the feasible region are A (18, 0), B (9, 2), C (3, 6), and D (0, 12).

Corner points Ma Minimise Z = 250 x + 200y

A (18, 0) Z = 4500
B ( 9,2) Z =2650
C (3,6) Z = 1950(minimum)
D (0,12) Z = 2400

As the feasible region is unbounded, therefore, 1950 may or may not be the minimum value of Z.
For this, we draw a graph of the inequality, 250x + 200y < 1950 or 5x + 4y < 39, and check
whether the resulting half plane has points in common with the feasible region or not.
It can be seen that the feasible region has no common point with 5x + 4y < 39
Therefore, the minimum value of Z is 2000 at (3, 6).
Thus, 3 bags of brand P and 6 bags of brand Q should be used in the mixture to minimize the cost
to Rs.1950.
Question 3.
A dietician wishes to mix together two kinds of food X and Y in such a way that the mixture contains
at least 10 units of vitamin A, 12 units of vitamin B and 8 units of vitamin C. The vitamin content of
one kg food is given below:
Food Vitamin A Vitamin B Vitamin C
X 1 2 3
Y 2 2 1
One kg of food X costs Rs.16 and one kg of food Y costs Rs.20. Find the least cost of the mixture which will
produce the required diet?

Solution Let the mixture contain x kg of food X and y kg of food Y.

The mathematical formulation of the given problem is as follows.

Minimize z = 16x + 20y … (1)

subject to the constraints,

x +2 y ≥ 10 … ( 2 )
x + y ≥ 6 … (3 )
3 x+ y ≥ 8 … ( 4 )

x , y ≥ 0 …(5)

32
 rahman Sir
[Date]
LINEAR PROGRAMMING
The feasible region determined by the system of constraints is as shown in the figure.

The corner points of the feasible region are A (10, 0), B (2, 4), C (1, 5), and D (0, 8).

The values of Z at these corner points are as follows.

Corner Z = 16x +20 y

points
A (10,0) Z = 160
B (2 , 4 ¿ ) Z =112(minimum)
C (1,5) Z = 116
D (0,8) Z = 160
As the feasible region is unbounded, therefore, 112 may or may not be the minimum value of Z.

For this, we draw a graph of the inequality, 16x + 20y < 112 or 4x + 5y < 28, and check whether the resulting half
plane has points in common with the feasible region or not.

It can be seen that the feasible region has no common point with 4x + 5y < 28 Therefore, the minimum value of
z is 112 at (2, 4).

Thus, the mixture should contain 2 kg of food X and 4 kg of food Y. The minimum cost of the mixture is Rs.112.

Question 4.
A manufacturer makes two types of toys A and B. Three machines are needed for this purpose and the time
(in minutes) required for each toy on the machines is given below:

Type of toys Machines

I II III
A 12 18 6
B 6 0 9
Each machine is available for a maximum of 6 hours per day. If the profit on each toy of type A is Rs.7.50 and
that on each toy of type B is Rs.5, show that 15 toys of type A and 30 of type B should be manufactured in a
day to get maximum profit.

Solution:
Let x and y toys of type A and type B respectively be manufactured in a day.

The given problem can be formulated as follows.

Maximize z = 7.5x + 5y … (1)

subject to the constraints,

2 x+ y ≤ 60 …(2)
x ≤ 20 … ( 3 )
2 x+3 y ≤ 120 … ( 4 )
x , y ≥ 0 …(5)
The feasible region determined by the constraints is as follows.

33
 rahman Sir
[Date]
LINEAR PROGRAMMING

The corner points of the feasible region are A (20, 0), B (20, 20), C (15, 30), and D (0, 40).

Corner points Ma Maximise Z = 7.5 x + 5y

A (20, 0) Z = 150
B ( 20,20) Z =250
C (15,30) Z =262.5 (maximum)
D (0,40) Z = 200
The maximum value of z is 262.5 at (15, 30).

Thus, the manufacturer should manufacture 15 toys of type A and 30 toys of type B to maximize the profit.

Question 5.
An aeroplane can carry a maximum of 200 passengers. A profit of Rs.1000 is made on each
executive class ticket and a profit of Rs.600 is made on each economy class ticket. The airline
reserves at least 20 seats for executive class. However, at least 4 times as many passengers prefer to
travel by economy class than by the executive class. Determine how many tickets of each type must
be sold in order to maximize the profit for the airline. What is the maximum profit?
Solution:
Let the airline sell x tickets of executive class and y tickets of economy class.
The mathematical formulation of the given problem is as follows.
Maximize z = 1000x + 600y … (1)
subject to the constraints,
x + y ≤ 200 … ( 2 )

x ≥ 20 … (3)
y−4 x ≥0 … (4)
x , y ≥ 0 …(5)
The feasible region determined by the
constraints is as shown in the figure
alongside.

34
 rahman Sir
[Date]
LINEAR PROGRAMMING
The corner points of the feasible region are
A (20, 80), B (40, 160), and C (20, 180).

The values of Z at these corner points are as follows.

Corner points Maximise Z =1000 x +600 y

A (20, 80) Z = 68000
B (40 ,60 ¿) Z =136000 (maximum)
C (20 , 80) Z =12800
The maximum value of z is 136000 at (40, 160).

Thus, 40 tickets of executive class and 160 tickets of economy class should be sold to maximize the profit and
the maximum profit is Rs.136000.

Question 6.
Two godownsA and B have grain capacity of 100 quintals and 50 quintals respectively. They supply
to 3 ration shops, D, E and F whose requirements are 60, 50 and 40 quintals respectively. The cost of
transportation per quintal from the godownsto the shops are given in the following table:
Transportation cost per quintal (in Rs.)
From/To A B
D 6 4
E 3 2
F 2.50 3
How should the supplies be transported in order that the transportation cost is minimum? What is
the minimum cost?
Solution:
Let godown A supply x and y quintals
of grain to the shops D and E
respectively. Then, (100 − x − y) will be
supplied to shop F. The requirement at
shop D is 60 quintals since x quintals
are transported from godown A.
Therefore, the remaining (60 −x)
quintals will be transported from
godownB.
Similarly, (50 − y) quintals and

35
 rahman Sir
[Date]
LINEAR PROGRAMMING
40 − (100 − x − y) = (x + y − 60) quintals will be transported from godown B to shop E and F
respectively.
The given problem can be represented diagrammatically as shown in the figure along-side.
x , y ≥ 0∧100−x− y ≥ 0
⇒ x , y ≥ 0∧x+ y ≤ 100
60−x ≥ 0 , 50− y ≥ 0∧x + y−60≥ 0
⇒ x ≤60 , y ≤50∧x + y ≥ 60
Total transportation cost z is given by,

Z = 6 x 3 y 2.5 ( 100−x − y )+ 4 ( 60−x ) +2 (50− y ) +3 ( x+ y−60 )

= 6 x +3 y +250−2.5 x−2.5 y +240−4 x+100−2 y +3 x +3 y−180

¿ 2.5 x+ 1.5 y+ 410

The given problem can be formulated as
Minimize z = 2.5x + 1.5y + 410 … (1)
subject to the constraints,
x + y ≤ 100 …(2)
x ≤ 60 … (3)
y ≤50 … (4)
x + y ≥ 60 … (5)
x , y ≥ 0 …(6)
The feasible region determined by the system of constraints is as follows.

36
 rahman Sir
[Date]
LINEAR PROGRAMMING

The corner points are A (60, 0), B (60, 40), C (50, 50), and D (10, 50).

The values of Z at these corner points are as follows.

Corner points Minimize Z = 2.5x + 1.5y + 410

A (60, 0) Z = 560
B (60 , 00 ¿) Z = 620
C (50 , 50) Z = 610
D (10,50) Z = 510 (minimum)
The minimum value of z is 510 at (10, 50).
Thus, the amount of grain transported from A to D, E, and F is 10 quintals, 50 quintals, and 40 quintals
respectively and from B to D, E, and F is 50 quintals, 0 quintals, and 0 quintals respectively.
Question 7.
An oil company has two depots A and B with capacities of 7000 L and 4000 L respectively. The
company is to supply oil to three petrol pumps, D, E and F whose requirements are 4500L, 3000L
and 3500L respectively. The distance (in km) between the depots and the petrol pumps is given in the
following table:
Distance in (km)
From/To A B
D 7 3
E 6 4
F 3 2
Assuming that the transportation cost of 10 litres of oil is Re 1 per km, how should the delivery be
scheduled in order that the transportation cost is minimum? What is the minimum cost?
Solution: Let x and y litres of oil be supplied from A to the petrol pumps, D and E. Then, (7000 − x −
y) will be supplied from A to petrol pump F. The requirement at petrol pump D is 4500 L. Since x L
are transported from depot A, the remaining (4500 −x) L will be transported from petrol pump B.
Similarly, (3000 − y) L and 3500 − (7000 − x − y) = (x + y − 3500) L will be transported from depot B to petrol
pump E and F respectively.

The given problem can be represented

diagrammatically as follows.

37
 rahman Sir
[Date]
LINEAR PROGRAMMING

x , y ≥ 0∧(7000−x − y)≥ 0
⇒ x , y ≥ 0∧x+ y ≤ 7000
4500−x ≥ 0 , 3000− y ≥ 0 andx + y−3500 ≥ 0
⇒ x ≤ 4500 , y ≤ 3000 ,∧x + y ≥3500
Cost of transporting 10 L of petrol = Re 1

1
Cost of transporting 1 L of petrol = Rs .
10
Therefore, total transportation cost is given by,

7 6 3 3 4 2
Z= x + y + ( 7000−x− y )+ ( 4500− x ) + ( 3000− y ) + ( x+ y−3500 )
10 10 10 10 10 10
¿ 0.3 x +0.1 y+ 3950
The problem can be formulated as follows ,
Minimise Z = 0.3 x +0.1 y+ 3950 … (1)

Subject to constraints,

x + y ≤ 7000 …(2)
x ≤ 4500 …(3)
y ≤3000 … (4)
x + y ≥ 3500 … (5)
x , y ≥ 0 …(6)
The feasible region determined by the
constraints is as follows.

38
 rahman Sir
[Date]
LINEAR PROGRAMMING

The corner points of the feasible region are A (3500, 0), B (4500, 0), C (4500, 2500), D (4000, 3000),
and E (500, 3000).
The values of Z at these corner points are as follows.

Corner points Minimize Z = 0.3 x +0.1 y+ 3950

A (3500, 0) Z = 5000
B (4500 ,0 ¿) Z = 5300
C (4500,2500 ) Z = 5550
D (4000,3000) Z =5450
E (500, 3000) Z = 4400 (minimum)

The minimum value of z is 4400 at (500, 3000). Thus, the oil supplied from depot A is 500 L, 3000 L,
and 3500 L and from depot B is 4000 L, 0 L, and 0 L to petrol pumps D, E, and F respectively. The
minimum transportation cost is Rs.4400.
Question 8.
A fruit grower can use two types of fertilizer in his garden, brand P and brand Q. The amounts (in
kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table.
Tests indicate that the garden needs at least 240 kg of phosphoric acid at least 270 kg of potash and at
most 310 kg of chlorine. If the grower wants to minimize the amount of nitrogen added to the garden,
how many bags of each brand should be used? What is the minimum amount of nitrogen added in the
garden?

Kg per bag
Brand P Brand Q
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2

Solution:
Let the fruit grower use x bags of brand P and y bags of brand Q.
The problem can be formulated as follows.

39
 rahman Sir
[Date]
LINEAR PROGRAMMING
Minimize z = 3x + 3.5y … (1)
subject to the constraints,
x +2 y ≥ 240 …(2)
x +0.5 y ≥ 90 … (3)
1.5 x 2 y ≤310 … ( 4 )
x . y ≥ 0 …(5)
The feasible region determined by the system of constraints is as follows.

The corner points are A (240, 0), B (140, 50), and C (20, 140)
The values of Z at these corner points are as follows.

Corner points Minimise Z =3x + 3.5y

A (240,50) Z = 595
B (20,140 ¿) Z = 550
C (40,100 ) Z = 470 (minimum)
The minimum value of Z is 470 at (40, 100).
Thus, 40 bags of brand P and 100 bags of brand Q should be added to the garden to minimize the
amount of nitrogen. The minimum amount of nitrogen added to the garden is 470 kg.
Question 9.
A fruit grower can use two types of fertilizer in his garden, brand P and brand Q. The amounts (in
kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table.

40
 rahman Sir
[Date]
LINEAR PROGRAMMING
Tests indicate that the garden needs at least 240 kg of phosphoric acid at least 270 kg of potash and at
most 310 kg of chlorine. If the grower wants to maximise the amount of nitrogen added to the
garden, how many bags of each brand should be used? What is the maximum amount of nitrogen
added in the garden?

Kg per bag
Brand P Brand Q
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2

Solution:
Let the fruit grower use x bags of brand P and y bags of brand Q.
The problem can be formulated as follows.
Maximize z = 3x + 3.5y … (1)
subject to the constraints,
x +2 y ≥ 240 …(2)
x +0.5 y ≥ 90 … (3)
1.5 x 2 y ≤310 … ( 4 )
x . y ≥ 0 …(5)
The feasible region determined by the system of constraints is as follows.

The corner points are A (240, 0), B (140, 50), and C (20, 140)

41
 rahman Sir
[Date]
LINEAR PROGRAMMING
The values of Z at these corner points are as follows.

Corner points Maximise Z =3x + 3.5y

A (240,50) Z = 595 Maximum)
B (20,140 ¿) Z = 550
C (40,100 ) Z = 470
The maximum value of Z is 595 at (240, 50).
Thus, 240 bags of brand P and 50 bags of brand Q should be added to the garden to maximise the
amount of nitrogen. The maximum amount of nitrogen added to the garden is 595 kg.

Question 10
A toy company manufactures two types of dolls, A and B. Market tests and available resources have
indicated that the combined production level should not exceed 1200 dolls per week and the demand
for dolls of type B is at most half of that for dolls of type A. Further, the production level of dolls of
type A can exceed three times the production of dolls of other type by at most 600 units. If the
company makes profit of Rs.12 and Rs.16 per doll respectively on dolls A and B, how many of each
should be produced weekly in order to maximize the profit?
Solution: Let x and y be the number of dolls of type A and B respectively that are produced per week.
The given problem can be formulated as follows.
Maximize z = 12x + 16y … (1)
subject to the constraints,
x + y ≤ 1200 …(2)
x
y ≤ ⇒ x ≥2 y … ( 3 )
2
x−3 y ≤600 … ( 4 )

x . y ≥ 0 …(5)
The feasible region determined by the system of constraints is as follows

42
 rahman Sir
[Date]
LINEAR PROGRAMMING

The corner points are A (600, 0), B (1050, 150), and C (800, 400).

The values of z at these corner points are as follows.

Corner points Maximise Z =12x + 16y

A (600,0) Z = 7200
B (1050,150 ¿) Z = 15000
C (800,400 ) Z = 16000 (maximum)
The maximum value of z is 16000 at (800, 400).
Thus, 800 and 400 dolls of type A and type B should be produced respectively to get the maximum
profit of Rs.16000.

43
 rahman Sir
[Date]
LINEAR PROGRAMMING

44