LINEAR PROGRAMMING PROBLEMS

Total number of Questions in Linear Programming Problems is :

(i) In chapter Examples..................................................................... 06
(ii) Solved Examples.............................................................................. 09
Total no. of questions..........................................................................15
1. LINEAR INEQUATION Note :
In case of inequations ax + by  c and
If a,b,c  R, then the equation ax + by = c is ax + by  c points on the line are also a part of
called a linear equation in two variables x,y the shaded region while in case of ax + by < c
whereas inequalities of the form ax + by  c, and ax + by > c points on the line ax + by = c
ax + by  c, ax + by < c and ax + by > c are are not included in the shaded region.
called Linear Inequations in two variables
x & y. We know that the graph of the equation Examples
ax + by = c is a straight line which divides the based on Graphs of Linear Inequations
xy - plane into two parts (i) ax + by  c Ex.1 Shade the solution set of the inequation
(ii) ax + by  c. These two are known as the 3x + 2y  6.
half spaces. Sol. W rite the given inequation as equation
In set form {(x,y) : ax + by = c} is the straight 3x + 2y = 6.
line whereas, sets {(x,y) : ax + by  c} and Y

{(x,y) : ax + by  c} are closed half spaces and

B ( 0,3)
the sets {(x,y) : ax + by < c} and {( x,y) : ax +
by > c} are open half spaces. These half spaces
are also known as the solution sets of the
corresponding inequation.
X’ 0(0,0) A (2,0) X
2. GRAPHS OF LINEAR INEQUATIONS
Y’
Consider a linear inequation ax + by  c. Drawing A(2,0)
the graph of a linear inequation means finding its This meets the x- axis where y = 0
solution set.  3x = 6  x = 2
Steps to draw the graph :  Point is A (2, 0). Similarly it meets the
To draw the graph of an equation, following y - axis at B (0, 3). Join these points by a
thick line. Consider (0, 0) clearly (0, 0)
procedures are to be made-
satisfies the inequation
(i) Write the inequation ax + by  c into an
equation ax + by = c which represent a 3x + 2y  6
straight line in xy- plane. Hence the shaded portion containing ( 0, 0)
(ii) Put y = 0 in ax + by = c to get point where represents the solution set.
the line meets x- axis. Similarly, put x = 0 3. SIMULTANEOUS LINEAR INEQUATIONS IN
to obtain a point where the line meets
y- axis. Join these two points to obtain the TWO VARIABLES
graph of the line. Since the solution set of a system of
(iii) If the inequation is > or < , then the points simultaneous linear inequation is the set of all
lie on this line does not consider and line is points in two dimensional space which satisfy all
drawn dotted or discontinuous. the inequations simultaneously. Therefore to find
(iv) If the inequation is  or  , then the point lie the solution set we find the region of the plane
on the line consider and line is drawn black common to all the portions comprising the
solution sets of given inequations. In case there
(bold) or continuous.
is no region common to all the solution of the
(v) This line divides the plane XOY in two region. given inequations, we say that the solution set is
To find the region that satisfies the inequation, void or empty.
we apply the following rules-
(a) Choose a point [If possible (0,0)] not lying on Examples Simultaneous Linear Inequations
this line. based on in two variables
(b) Substitute its coordinates in the inequation.
If the inequation is satisfied, then shade the Ex.2 Graph the solution set of the following
portion of the plane which contains the inequations,
chosen point, otherwise shade the portion 5x + 10 y  50; x + y  2
which does not contain this point. The shaded
y  4; x  0 and y  0
portion represents the solution set.
Sol. Converting the inequations into equation, the a11 x1 + a12 x 2 +......+ a1n x n {, =, } b1
inequations reduce to a21 x1 + a22 x 2 + ......+ a2n xn {, =, } b2
5x + 10 y = 50, x + y = 2, y = 4, x = 0, ............................................................
y = 0, am1 x 1 + am2 x 2 +......+ amn x n {, =, } bn
and x1,x 2, x3,........, xn  0
where x1, x2, x3, ....xn are the variables whose
values are to be determined and are called the
decision variables. The inequation are called
constraints and the function to be maximized or
minimized is called the objective function.

6. SOME DEFINITIONS
(i) Solution : A set of values of the decision
variables which satisfy the constraints of a Linear
The line 5x + 10 y = 50 meets the coordinate Programming Problem (L.P.P.) is called a
axes at A (10,0) and B (0,5). Draw a thick solution of the L.P.P.
line joining these points. Clearly, the portion
containing the origin represents the solutions
(ii) Feasible Solution : A solution of L.P.P. which
set of the inequation 5x + 10 y  50.
also satisfy the non- negative restrictions of the
The line x + y = 2 meets the coordinates problem is called the feasible solution.
axes at A1 (2, 0) and B1 (0, 2). Draw the line
joining these two points. Clearly, the region (iii) Optimal Solution : A feasible solution which
not containing the origin represents the maximize or minimize i.e. which optimize the
solution set of the inequation x + y  2. objective function of L.P.P. called an optimal
Clearly x  0 and y  0 represent the first solution.
quadrant.
Note :
Hence, the shaded region given below
A Linear Programming Problem may have many
represents the solution set of the given
optimal solution. If a L.P.P. has two optimal
system of inequations.
solution, then there are an infinite number of
4. FEASIBLE REGION optimal solutions.

The limited ( bounded) region of the graph made (iv) Iso- Profit Line: The line is drawn in geometrical
by two inequations is called Feasible Region. area of feasible region of L.P.P. for which the
All the coordinates of the points in feasible region objective function remains constant at all the
constitutes the solutions of system of points lie on this line, is called iso- profit line.
inequations.
7. FORMULATION OF LINEAR PROGRAMMING
5. LINEAR PROGRAMMING PROBLEMS PROBLEMS

Linear Programming is a device to optimize Following example illustrate the formulation of

the results which occurs in business under some linear programming problems in various different
restrictions. A general Linear Programming situations.
problem can be stated as follows: Ex.3Two food stuffs F1 and F2 contain vitamins A,B,C.
Given a set of m linear inequalities or equations The minimum daily requirements of these vitamins
in n variables, we wish to find non- negative values for a certain diet are 3 mg of A, 50 mg of B and
of these variables which will satisfy these 40 mg of C. one unit of the food stuff F1 contains
inequalities or equations and maximize or 1 mg of A, 25 mg of B and 10 mg of C whereas
minimize some linear functions of the variables. one unit of the food- stuff F2 contains 1 mg of A,
The general form of Linear Programming Problems 10 mg of B and 20 mg of C. The cost of one unit
( L.P.P.) is- of food- stuff F1 is Re. 1 and that of F2 is Rs.2.
Formulate the problem as a linear programming
Maximize ( Minimize) z = c1 x 1 + c2x 2 + .....+
problem.
cn x n subjected to
Sol.Suppose that x units of F1 and y units of F2 are Examples Graphical method of Solution of
used in the diet. Since one unit of F1 contains 1 based on Linear Programming Problems
mg of A and one units of F2 contains 1 mg of A
and the minimum requirement of A is 3 mg., Ex.4 Solve the following L.P.P. by graphical
therefore method.
x + y  3 max. Z = 3x + 4y
Similarly for vitamins B and C, we have Subjected to 2x + 2y  80
25 x + 10 y  50 and 10 x + 20 y  40 2x + 4y  120 and x, y  0.
Also x, y  0. Sol. The feasible region consisting of all points
The cost of x units of F1 and y units of F2 is which simultaneously satisfy all constraints
x + 2y. Since the cost is to be minimized, and non- negativity restrictions is shown in
therefore the LPP is fig.
minimize Z = x + 2y
Subjected to x + y  3; 25x + 10 y  50
10 x + 20 y  40 and x, y  0.

8.GRAPHICAL METHOD OF SOLUTION OF

LINEAR PROGRAMMING PROBLEMS
The graphical method f or solv ing linear
programming problems is applicable to those
problems which involve only two variables. This
method is based upon a theorem, called extreme The corner points of the feasible region are
point theorem, which is stated as follows- O (0,0), A (40,0), D (0,30) and E (20,20). The
Extreme Point Theorem : If a L.P.P. admits an coordinates of E are obtained by solving
optimal solution, then at least one of the extreme 2x + 2y = 80 and 2x + 4y = 120
( or corner) points of the feasible region gives the simultaneously for x and y.
optimal solution. The v alues of the objectiv e f unction
Z = 3x + 4y at these corner points are given
Working Rule :
below.
(i) Find the solution set of the system of
At O (0,0) , Z = 3(0) + 4(0) = 0
simultaneous linear inequations given by
constraints and non- negativity restrictions. At A (40,0), Z = 3(40) + 4(0) = 120
(ii) Find the coordinates of each of corner points At D ( 0,30), Z = 3(0) + 4(30) = 120
of the feasible region. At E (20,20), Z = 3(20) + 4(20) = 140
(iii) Find the values of the objective function at The maximum value of Z is thus given by the
each of the corner points of the feasible coordinates of E. Hence the optimal solution
region. By the extreme point theorem one of occurs at x = 20 and y = 20. The maximum
the corner points will provide the optimal value value of Z is 140.
of the objective function. The coordinates of
that corner point determine the optimal Ex.5 A toy company manufactures two types of
solution of the L.P.P. doll; a basic version doll A and a deluxe
version - doll B.
Note :
Each doll of type B takes twice as long to
(i) If it is not possible to determine the point at produce as one of type A, and the company
which the suitable solution found, then the would have time to make a maximum of 2000
solution of problem is unbounded. per day if it produced only the basic version.
(ii) If feasible region is empty, then there is no The supply of plastic is sufficient to produce
solution for the problem. 1500 dolls per day (both A and B combined).
(iii) Nearer to the origin, the objective function is The deluxe version requires a fancy dress of
minimum and that of further from the origin which there are only 600 per day available. If
the objective function is maximum. the companymakes profit of Rs. 3.00 and
 Rs. 5.00 per doll respectively, on doll A and the feasible region i.e. their common solution
B ; how many of each should be produced space is the shaded area OABCD. Further
per day in order to maximize profit ? we find that the coordinates of the vertices of
Sol. Formulation of the problem : Let x 1 dolls the polygon OABCD are.
of type A and x2 dolls of type B should be O(0, 0); A(1500, 0) ; B(1000, 500) ; C(800,
produced per day. So the total profit is given by 600) ; D(0, 600)
z = 3x1 + 5x 2 Now the maximum value of z is at one of the
vertices of the polygon OABCD. But we have
Since total time per day consumed to prepare
At A(1500, 0); z = 3.1500 + 5.0 = 4500
x1 and x 2 dolls of type A and B is x 1 + 2x 2
and at the most 2000 dolls of type A may At B(1000, 500); z = 3.1000 + 5.500 = 5500
be produced in a day. At C(800, 600); z = 3.800 + 5.600 = 5400
 x1 + 2x2  2000 At D(0, 600); z = 3.0 + 5.600 = 3000
Further plastic is available to produce only Thus Z is maximum at B where x 1 = 1000
1500 dolls. and x2 = 500 hence the company should
produce 1000 dolls of Type A and 500 dolls
 x1 + x2  1500
of type B to gain the maximum profit which
Also fancy dress required for dolls of type B,
is equal to Rs.5500. Ans.
is available for 600 dolls per day only.
 x2  600 Hence the given LPP is as
follow 9. CONVEX SETS
Find x1, x2 which In linear programming problem mostly feasible
maximize z = 3x 1 + 5x2 (objective function) solution is a polygon in first quadrant this polygon
subject to the conditions is a convex. It means that if two points of polygon
are connecting by a line then the line must be
x1  2x2  2000  inside to polygon. For example-

x1  x2  1500 
 (constraints)
x2  600 
x1  0, x2  0 

Graphical Solution : First we draw the

bounding lines (i) (ii)
x1 + 2x2 = 2000
x1 + x 2 = 1500
x2 = 600
and x1 = 0, x2 = 0
X2

(iii) (iv)
1500
Figure (i) and (ii) are convex set while (iii) & (iv)
FEASIBLE REGION
1000 C x2 = 600 are not convex set. It can be easily seen that the
600 D
500 B intersection of two convex sets is a convex set
A and the set of all feasible solutions of a LPP is
O 500 1000 1500 2000
X1 also a convex set.
x x+
1 +x 2x
2 =2
2 = 000
15 Ex.6
00
(i) A triangle and its interior form a convex set.
in a two dimensional space which correspond
to the inequalities of the constraints. (ii) The set {(x,y) | x 2 + y2  1} is a convex set
Now on considering the solution space for (iii) The set {(x,y) | 2  x 2 + y2  3} is not a
each of the given inequalities, we find that convex set.
 SOLVED EXAMPLES
Ex.1 Graph the solution set of the following
inequations:
x + y  40
x + 2y  60
and x, y  0.
Sol. Write the given inequations into equations.
We have x + y = 40, x + 2y = 60 and
x = 0, y = 0.
The line x + y = 40 meets the x- axis at
A (40, 0) and y- axis at B (0, 40). The line
Hence the graph are disjoint. Ans.[A]
x + 2y = 60 meets the
x-axis at C (60,0) and y- axis at D (0,30).Draw
a line joining A and B and a line joining C Ex.3 A vertex of the linear inequalities 2x + 3y  6,
and D. x + 4y  4 and x, y  0, is-
(A) ( 1,0) (B) ( 1,1)
F
G12 2 I F2 12 I
(C) H5 , 5 JK (D) G
H5 , 5 JK
Sol. Write the given inequation into equation we
get 2x + 3y = 6 and x + 4y = 4, on solving
we get
12 2
x = , y = .
5 5

Let AB and CD meet at P. P will be (20, 20).

Then the shaded region OAPD, common to
all the solutions of the given inequation, will
be the solution set of the given inequations.

Ex.2 The true statement f or the graph of

F
G12 2 I
inequations 2x + 2y  6 and 6x + 4y  20,
is-
Hence a vertex is H5 , 5 JK Ans.[C]

(A) Both graphs are disjoint

Ex.4 Find the minimum value of z = 2x1 – 10x2
(B) Both do not contain origin
subjected to constraints x1 – x2  0, x1 – 5x2
(C) Both contain point (1, 1)  – 5 & x1 , x2  0
(D) None of these (A) 10 (B) – 10
Sol. The equations, corresponding to inequalities (C) 5 (D) None of these
3x + 2y  6 and 6x + 4y  20, are Sol. The bounding lines corresponding to the
3x + 2y = 6 and 6x + 4y = 20. So the lines inequalities of the given constraints are :
represented by these equations are parallel.
x1 – x2 = 0
x1 – 5x2 = – 5
& x1 = 0 , x2 = 0
Draw these lines in a two dimensional space
and consider the solution space for each
 given inequality. We find that the feasible
region i.e., their common solution space is
unbounded from one side.

It is clear from the figure that the objective We find that the coordinates of the vertices
function z attains its minimum value at the
 9 5  13 
point A which is the intersection of the two A, B, C are (3, 0),  4 , 4  ,  0, 5 
lines x1 – x 2 = 0 and – x1 + 5x2 = 0.
respectively. Now
5
Solving them we find that x 1 = x2 = . calculating the value of the objective function
4
at these points we have.
5
Hence z is minimum when x 1 = , At A.(3, 0) ; z = 6.3 + 10.0 = 18
4
5  9 5 9 
x2 = and then At B  4 , 4  ; z = 6. + 10. = 26
4 4 4
its minimum value is 2 x 5/4 – 10
x 5/4 = – 10 Ans.[B]  13  13
At C  0,  ; z = 6.0 + 10. = 26
 5  5
Note :
9 5
If we want to find max. z with these It is observed that z is maximum at B  , 
constraints then it is not possible in this 4 4
case, because the f easible region is  13 
as well as at C  0, 5  and its maximum
unbounded from one side.
value is 26. As a matter of fact every point
Ex.5 Find the maximum value of on the line segment BC gives this max. value;
Max. z = 6x1 + 10x 2 because in this case the line of objective
subject to 3x1 + 5x2  13 function lies along one boundary line of the
5x1 + 3x2  15 feasible region. In such a case the problem
has infinite number of optimal solutions.
and x1 , x2  0
Ans.[D]
(A) 10 (B) 20
(C) 40 (D) Infinite solution
Ex.6 Find the maximum value of
Sol. Drawing the bounding lines corresponding to
z = 3x1 + 2x 2
the given inequalities and considering their
common Subject to x1 + x2  1
solution space, we find that the feasible x2 – 5x1  0
region is given by the shaded area OABC. 5x2 – x1  0
Every point of this region gives a feasible x1 – x 2  –1
solution of the problem whereas its optimal x1 + x2  6
solution is attained at some corner p o i n t
x1  3
of the polygon OABC.
and x1  0 , x2  0
(A) 15 (B) 20
(C) 25 (D) None of these
Sol. Equalities corresponding to the given At C (3,3); z = 3.3 + 2.3 = 15
constraints are
 5 7 5 7 29
x1 + x2 = 1 At D  2 , 2  ; z = 3. + 2. =
x2 – 5x1 = 0 2 2 2
5x2 – x1 = 0
 1 5 1 5 13
x1 – x2 = –1 At E  4 , 4  ; z = 3. + 2. =
4 4 4
x1 + x2 = 6
Draw the straight lines represented by these  1 5 1 5 13
equations in a two dimensional space. These At F  6 , 6  ; z = 3. + 2. =
6 6 6
are the
bounding lines for the given inequalities. Now Thus z is maximum at C where x 1 = 3,
considering the solution space for each x2 = 3 and max. z = 15. Ans.[A]
inequality of the
given constraints, we find that the feasible Ex.7 Find the maximum value of
region i.e., their common solution space is Max. z = 5x1 + 7x 2
given by the subjected to x1 + x2 < 4
shaded region ABCDEF. Every point of this 3x1 + 8x2 < 24
region gives feasible solution of the
10x1 + 7x2 < 35
problem whereas the
and x1 > 0, x2 > 0
optimal solution is attained at one of the
(A) z = 24.8 (B) z = 25.8
vertices of the polygon ABCDEF. Coordinates
of the six (C) z = 23.8 (D) z = 21.8
vertices are : Sol Let us draw the lines
x1 + x2 = 4
 5 1  3  5 7 3x1 + 8x 2 = 24
(1)  6 , 6  ; (2)  3, 5  ; (3) (3,3) ;(4)  2 , 2  ;
10x1 + 7x2 = 35
 1 5  1 5 and x1 = 0, x2 = 0
E  4 , 4  ; F  6 , 6  .
10
x1
+

X2
7x 2
=
35

5
4 FEASIBLE REGION
3 D C(1.6, 2.4)
2 B (7/3, 5/3)
1
X
O 1 2 3 4 5 6 7 8 3x 1
1 +8
x = 24
A 2

which corresponds to the inequalities of

the given constraints. On considering the
solution space for each of the given
inequality, we find that the common solution
space, represented by the shaded area
So we find that
OABCD, is the feasible region. Now to search
 5 1 5 1 17 the maximum value of z which is at one of
At A  6 , 6  ; z = 3 . + 2. = the corners of the polygon OABCD, we find
6 6 6
that At A(3.5, 0) ; z = 5.3.5 + 7.0 = 17.5
 3 2 51  7 5 7 5
At B  3,  ; z = 3.3 + 2. = At B  ,  ; z = 5. + 7. = 23.3
5 5 5 3 3 3 3
At C(1.6, 2.4) ; z = 5.1.6 + 7.2.4 = 24.8
 At D(0, 3) ; z = 5.0 + 7.3 = 21 At C (30.7, 11.5) ;z=3x 30.7+4x11.5= 138.1
Thus z is maximum at C where x 1 = 1.6, At D (0, 30) ; z = 0 + 4 x 30 = 120
x2 = 2.4 and max. z = 24.8 Ans.[A] At E (0,25) ; z = 0 + 4 x 25 = 100
The z is maximum at C where x1 = 30.7 and
Ex.8 Find the maximum value of x2 = 11.5, maximum z = 138.1 Ans.[A]
max. z = 3x1 + 4x 2 Note:
subject to 5x1 + 4x2  200
It should be noted that the constraint
3x1 + 5x2  150 8x1 + 4x2  80 imposes no extra restriction
5x1 + 4x2  100 and hence it does not effect the solution.
8x1 + 5x2  80 Therefore it is redundant constraint.
and x1 , x2  0
Ex.9 A factory uses three different resources for
(A) 138.1 (B) 38.1 the manufacture of two different products, 20
(C) 183.1 (D) None of these units of the resources A, 12 units of B and
Sol. The bounding lines for the given inequalities 16 units of C being available. 1 unit of the
are first product requires 2, 2 and 4 units of the
5x1 + 4x2 = 200 respective resources and 1 unit of the second
3x1 + 5x2 = 150 product requires 4, 2 and 0 units of the
respective resources. It is known that the
5x1 + 4x2 = 100
first product gives a profit of 2 monetary units
8x1 + 5x2 = 80 per unit and the second 3. Formulate the
and x1 = 0 , x2 = 0 linear programming problem. How many units
of each product should be manufactured for
maximizing the profit ?
(A) 16 (B) 28 (C) 24 (D) 36
Sol. Formulation of the problem
The following table shows the given data. Let
x units of first product P1 and y units of
second product P2 should be manufactured
for maximizing the profit. So the total profit
is given by
z = 2x + 3y. ...(i)
Since 1 unit of the first product P1 requires
2, 2 and 4 units, 1 unit of the second product
P2 requires 4, 2 and 0 units of the respe-
ctive resources and the available units of the
three resources A, B, C are 20, 12 and 16
Draw these lines in a two dimensional space respectively. So we have the following
and consider the solution space for each constraints :
inequality of the given constraints.We find 2x + 4y < 20 i.e. x + 2y < 10 ...(ii)
that the shaded area ABCDE is their common 2x + 2y < 12 i.e. x + y < 6 ...(iii)
solution space (feasible region.)
4x + 0y < 16 i.e. x < 4 ...(iv)
Every point of this region gives a feasible
Moreover the units of the product can not be
solution of the problem and the optimal
negative, so x > 0, y > 0 ...(v)
solution is attained at one of the corners of
this polygon. We find that the coordinates
of the corner points A,B,C,D,E are (20,0) ;
(40,0) ; (30.7 , 11.5) ; (0, 30) (0,25)
respectively
At A (20,0) ; z = 3 x 20 + 0 = 60
At B (40,0) ; z = 3 x 40 + 0 = 120
 Y
Product
Available
Units
P1 P2

4)
2,
D

C(
A 2 4 20
(0,5) FEASIBLE REGION
B( x+
B 2 2 12 4, 2y
2) =1
0
C 4 0 16 x+ X
O A

x= 4
(4,0) y=
Profit per 6
2 3
unit

Thus our problem is to find x and y which which correspond to the inequalities of the
maximize z = 2x + 3y (objective function) given constraints. Now on considering the
subject to the conditions : solution space for each of the given inequality,
we find that the feasible region i.e., their
x  2 y  10  common solution space is given by the
 shaded area OABCD. Every point of this
xy6 
 (constraints) region gives a feasible solution of the problem
x4  whereas its optimal solution is attained at
x  0,y  0  one of the vertices of the area OABCD,
Coordinates of the five vertices are
Graphical solution : First we draw the A(4, 0) ; B (4, 2) ; C(2, 4) ; D(0, 5)
bounding lines :
So we find that
x + 2y = 10
At A ; z = 2.4 + 3.0 = 8
x + y = 6
At B ; z = 2.4 + 3.2 = 14
x = 4
At C ; z = 2.2 + 3.4 = 16
x = 0 ; y = 0
At D ; z = 2.0 + 3.5 = 15
Thus z is maximum at C where x = 2 and
y = 4. Hence 2 units of first product and 4
units of second product should be
manufactured to gain the maximum profit
which is equal to 16 monetary units.
Ans. [A]