1450 Linear Programming

ax+by=c
ax+by<c
X X
O
ax+by>c

Y

Chapter

32
Linear Programming
‘Linear Programming’ is a scientific tool to handle optimization
problems. Here, we shall learn about some basic concepts of linear
programming problems in two variables, their applications,
advantages, limitations, formulation and graphical method of solution.
Linear inequations
(1) Graph of linear inequations
(i) inequation in one variable: ax  b  0,
Linear
Working Rule : To draw the graph of an inequation, following
ax  b  0, cy  d  0 etc. are called linear inequations in one procedure is followed :
variable. Graph of these inequations canbbe drawn as follows : (i) Write the equation ax  by  c in place of ax  by  c
Y x 
a and ax  by  c .
(ii) Make a table for the solutions of ax  by  c .
a>0 (iii) Now draw a line with the help of these points. This is the
X X graph of the line ax  by  c .
O
(iv) If the inequation is > or <, then the points lying on this line is
ax+b<0 ax+b>0 not considered and line is drawn dotted or discontinuous.
(v) If the ineuqation is  or , then the points lying on the line is
considered and line is drawn bold or continuous.
Y
The graph of ax  b  0 and ax  b  0 are obtained by (vi) This line divides the plane XOY in two region.
To Find the region that satisfies the inequation, we apply the
b
dividing xy-plane in two semi-planes by the line x   (which is following rules:
a (a) Take an arbitrary point which will be in either region.
parallel to y-axis). Similarly for cy Yd  0 and cy  d  0 . (b) If it satisfies the given inequation, then the required region will be the
region in which the arbitrary point is located.
cy+d>0 (c) If it does not satisfy the inequation, then the other region is the
c>0 d
y required region.
c (d) Draw the lines in the required region or make it shaded.
X X (2) Simultaneous linear inequations in two variables : Since
cy+d<0 the solution set of a system of simultaneous linear inequations is the
set of all points in two dimensional space which satisfy all the
Y
inequations simultaneously. Therefore to find the solution set we find
the region of the plane common to all the portions comprising the
(ii) Linear Inequation in two variables : General form of these solution set of given inequations. In case there is no region common to
inequations are ax  by  c, ax  by  c . If any ordered pair all the solutions of the given inequations, we say that the solution set is
 x 1 , y1  satisfies an inequation, then it is said to be a solution of the void or empty.
(3) Feasible region : The limited (bounded) region of the graph
inequation.
made by two inequations is called feasible region. All the points in
The graph of these inequations is Ygiven below (for c > 0) :

cy+d>0 d
y
c

X X
cy+d<0

Y

feasible region constitute the solution of a system of inequations. The
feasible solution of a L.P.P. belongs to only first quadrant. If feasible
region is empty then there is no solution for the problem.
Terms of linear programming
The term programming means planning and refers to a process of
determining a particular program.
(1) Objective function : The linear function which is to be
optimized (maximized or minimized) is called objective function of
the L.P.P.
(2) Constraints or Restrictions : The conditions of the problem
expressed as simultaneous equations or inequations are called
constraints or restrictions.
(3) Non-negative constraints : Variables applied in the objective
function of a linear programming problem are always non-negative. The
inequations which represent such constraints are called non-negative
constraints.
(4) Basic variables : The m variables associated with columns of
the m × n non-singular matrix which may be different from zero, are
called basic variables.
(5) Basic solution : A solution in which the vectors associated to
m variables are linear and the remaining (n  m ) variables are
zero, is called a basic solution. A basic solution is called a degenerate
basic solution, if at least one of the basic variables is zero and basic
solution is called non-degenerate, if none of the basic variables is zero.
(6) Feasible solution : The set of values of the variables which
satisfies the set of constraints of linear programming problem (L.P.P)
is called a feasible solution of the L.P.P.
(7) Optimal solution : A feasible solution for which the
objective function is minimum or maximum is called optimal solution.
(8) Iso-profit line : The line drawn in geometrical area of
feasible region of L.P.P. for which the objective function (to be
maximized) remains constant at all the points lying on the line, is
called iso-profit line.
If the objective function is to be minimized then these lines are
called iso-cost lines.
(9) Convex set : In linear programming problems feasible
solution is generally a polygon in first quadrant. This polygon is
convex. It means if two points of polygon are connected by a line, then
the line must be inside the polygon. For example,
A corresponding to Z2 parallel to itself as far as possible, until the farthest
A
B B
(i) (ii) (iii) (iv)
Fig. (i) and (ii) are convex set while (iii) and (iv) are not convex
set.
Mathematical formulation of a linear programming
problem
There are mainly four steps in the mathematical formulation of a
linear programming problem, as mathematical model. We will discuss
formulation of those problems which involve only two variables.
(1) Identify the decision variables and assign symbols x and y to
them. These decision variables are those quantities whose values we
wish to determine.
(2) Identify the set of constraints and express them as linear
equations/inequations in terms of the decision variables. These
constraints are the given conditions.
Linear Programming 1451
(3) Identify the objective function and express it as a linear
function of decision variables. It may take the form of maximizing
profit or production or minimizing cost.
(4) Add the non-negativity restrictions on the decision variables,
as in the physical problems, negative values of decision variables have
no valid interpretation.
Graphical solution of two variable linear programming
problem
There are two techniques of solving an L.P.P. by graphical
method. These are :
(1) Corner point method (2) Iso-profit or Iso-cost method
(1) Corner point method
Working Rule:
(i) Formulate mathematically the L.P.P.
(ii) Draw graph for every constraint.
(iii) Find the feasible solution region.
(iv) Find the coordinates of the vertices of feasible solution
region.
(v) Calculate the value of objective function at these vertices.
(vi) Optimal value (minimum or maximum) is the required
solution.
(vii) If there is no possibility to determine the point at which the
suitable solution found, then the solution of problem is unbounded.
(viii) If feasible region is empty, then there is no solution for the
problem.
(ix) Nearer to the origin, the objective function is minimum and
that of further from the origin, the objective function is maximum.
(2) Iso-profit or Iso-cost method : Various steps of the method
are as follows :
(i) Find the feasible region of the L.P.P.
(ii) Assign a constant value Z1 to Z and draw the corresponding
line of the objective function.
(iii) Assign another value Z2 to Z and draw the corresponding line
of the objective function.
(iv) If Z1  Z 2 , ( Z1  Z 2 ) , then in case of maximization
(minimization) move the line P1Q1 corresponding to Z1 to the line P2Q2
point within the feasible region is touched by this line. The coordinates of
the point give maximum (minimum) value of the objective function.
(v) The problem with more equations/inequations can be handled
easily by this method.
(vi) In case of unbounded region, it either finds an optimal
solution or declares an unbounded solution. Unbounded solutions are
not considered optimal solution. In real world problems, unlimited
profit or loss is not possible.
To find the vertices of simple feasible region
without drawing a graph
(1) Bounded region: The region surrounded by the inequations
ax  by  m and cx  dy  n in first quadrant is called bounded
region. It is of the form of triangle or quadrilateral. Change these
inequations into equations, then by putting x  0 and y  0 , we
get the solution. Also by solving the equations we get the vertices of
bounded region.
The maximum value of objective function lies at one vertex in
limited region.
 1452 Linear Programming
(2) Unbounded region : The region surrounded by the (b) There are infinite feasible regions
inequations ax  by  m and cx  dy  n in first quadrant, is (c) There is no feasible region
called unbounded region. (d) None of these
Change the inequation in equations and solve for x  0 and 2. Which of the following is not a vertex of the positive region
y  0 . Thus we get the vertices of feasible region. bounded by the inequalities 2 x  3y  6 ,
The minimum value of objective function lies at one vertex in 5 x  3 y  15 and x , y  0
unbounded region but there is no existence of maximum value. (a) (0, 2) (b) (0, 0)
Advantages and limitations of L.P.P. (c) (3, 0) (d) None of these
3. The intermediate solutions of constraints must be checked by
(1) Advantages : Linear programming is used to minimize the substituting them back into
cost of production for maximum output. In short, with the help of (a) Objective function (b) Constraint equations
linear programming models, a decision maker can most efficiently and
(c) Not required (d) None of these
effectively employ his production factor and limited resources to get
maximum profit at minimum cost. 4. For the constraints of a L.P. problem given by
(2) Limitations : (i) The linear programming can be applied only x 1  2 x 2  2000 , x 1  x 2  1500 , x 2  600 and
when the objective function and all the constraints can be expressed in x 1 , x 2  0 , which one of the following points does not lie
terms of linear equations/inequations.
in the positive bounded region
(ii) Linear programming techniques provide solutions only when all the
elements related to a problem can be quantified. (a) (1000, 0) (b) (0, 500)
(iii) The coefficients in the objective function and in the (c) (2, 0) (d) (2000, 0)
constraints must be known with certainty and should remain 5. A basic solution is called non-degenerate, if
unchanged during the period of study. (a) All the basic variables are zero
(iv) Linear programming technique may give fractional valued (b) None of the basic variables is zero
answer which is not desirable in some problems.
(c) At least one of the basic variables is zero
(d) None of these
6. If the number of available constraints is 3 and the number of
parameters to be optimized is 4, then
(a) The objective function can be optimized
(b) The constraints are short in number
(c) The solution is problem oriented
 In some of the linear programming problems, constraints are (d) None of these
inconsistent i.e. there does not exist any point which satisfies all the
constraints. Such type of linear programming problems are said to 7. The solution of set of constraints x  2 y  11 ,
have infeasible solution. 3 x  4 y  30 , 2 x  5 y  30 , x  0, y  0
 If the constraints in a linear programming problem are includes the point
changed, the problem is to be re-evaluated. [MP PET 1993]
 The optimal value of the objective function is attained at the point, (a) (2, 3) (b) (3, 2)
given by corner points of the feasible region. (c) (3, 4) (d) (4, 3)
 If a L.P.P. admits two optimal solutions, it has an infinite 8. The graph of x  2 and y  2 will be situated in the
number of optimal solutions.
(a) First and second quadrant
 If there is no possibility to determine the point at which the (b) Second and third quadrant
suitable solution can be found, then the solution of problem is
unbounded. (c) First and third quadrant
(d) Third and fourth quadrant
 The maximum value of objective function lies at one vertex in
limited region. 9. The feasible solution of a L.P.P. belongs to
(a) First and second quadrant
(b) First and third quadrant
(c) Second quadrant
(d) Only first quadrant
10. The position of points O (0,0) and P (2, – 2) in the region of
graph of inequation 2 x  3 y  5 , will be
Linear Programming
(a) O inside and P outside
(b) O and P both inside
1. For the constraint of a linear optimizing function z  x 1  x 2
(c) O and P both outside
, given by x 1  x 2  1, 3 x 1  x 2  3 and x 1 , x 2  0
(d) O outside and P inside
(a) There are two feasible regions
 Linear Programming 1453
11. The true statement for the graph of inequations 19. The value of objective function is maximum under linear
3 x  2 y  6 and 6 x  4 y  20 , is constraints
(a) At the centre of feasible region
(a) Both graphs are disjoint
(b) At (0, 0)
(b) Both do not contain origin
(c) At any vertex of feasible region
(c) Both contain point (1, 1)
(d) The vertex which is at maximum distance from (0, 0)
(d) None of these 20. The region represented by 2 x  3 y  5  0 and
12. The vertex of common graph of inequalities 2 x  y  2 and 4 x  3 y  2  0 , is
x  y  3 , is (a) Not in first quadrant
5 4 (b) Bounded in first quadrant
(a) (0, 0) (b)  ,   (c) Unbounded in first quadrant
3 3
(d) None of these
5 4  4 5 21. The region represented by the inequation system x , y  0 ,
(c)  ,  (d)   , 
3 3  3 3 y  6, x  y  3 , is
(a) Unbounded in first quadrant
13. A vertex of bounded region of inequalities x0,
x  2 y  0 and 2 x  y  4 , is (b) Unbounded in first and second quadrants
(c) Bounded in first quadrant
(a) (1, 1) (b) (0, 1)
(d) None of these
(c) (3, 0) (d) (0, 0)
22. The solution set of the inequation 2 x  y  5 , is
14. A vertex of the linear inequalities 2 x  3y  6 ,
(a) Half plane that contains the origin
x  4 y  4 and x , y  0 , is
(b) Open half plane not containing the origin
(a) (1, 0) (b) (1, 1)
(c) Whole xy-plane except the points lying on the line
 12 2   2 12  2x  y  5
(c)  ,  (d)  , 
 5 5 5 5  (d) None of these
15. A vertex of a feasible region by the linear constraints 23. If a point (h, k) satisfies an inequation ax  by  4 , then the
3 x  4 y  18 , 2 x  3 y  3 and x , y  0 , is half plane represented by the inequation is
(a) The half plane containing the point (h, k) but excluding the
(a) (0, 2) (b) (4.8, 0)
points on ax  by  4
(c) (0, 3) (d) None of these
(b) The half plane containing the point (h, k) and the points on
16. In which quadrant, the bounded region for inequations ax  by  4
x  y  1 and x  y  1 is situated
(c) Whole xy-plane
(a) I, II
(d) None of these
(b) I, III
24. Inequation y  x  0 represents
(c) II, III
(a) The half plane that contains the positive x-axis
(d) All the four quadrants
(b) Closed half plane above the line y  x which contains
17. The necessary condition for third quadrant region in
positive y-axis
xy-plane, is
(c) Half plane that contains the negative x-axis
(a) x  0, y  0 (b) x  0, y  0
(d) None of these
(c) x  0, y  0 (d) x  0, y  0 25. Objective function of a L.P.P. is
18. For the following feasible region, the linear constraints are (a) A constraint
Y (b) A function to be optimized
(c) A relation between the variables
(d) None of these
26. The optimal value of the objective function is attained at the
points [MP PET 1998]
(a) Given by intersection of inequations with axes only
X
O (b) Given by intersection of inequations with x-axis only
3x+2y=12 x+3y=11
(c) Given by corner points of the feasible region
(a) x  0, y  0, 3 x  2 y  12, x  3 y  11
(d) None of these
(b) x  0, y  0, 3 x  2 y  12, x  3 y  11 27. The objective function z  4 x  3 y can be maximized
(c) x  0, y  0, 3 x  2 y  12, x  3 y  11 subjected to the constraints 3 x  4 y  24 ,
(d) None of these 8 x  6 y  48 , x  5, y  6 ; x , y  0
 1454 Linear Programming
(a) At only one point 34. The graph of inequations x  y and y  x  3 is located
(b) At two points only in
(c) At an infinite number of points (a) II quadrant (b) I, II quadrants
(d) None of these (c) I, II, III quadrants (d) II, III, IV quadrants
28. If the constraints in a linear programming problem are changed
35. The area of the feasible region for the following constraints
(a) The problem is to be re-evaluated 3 y  x  3, x  0, y  0 will be [DCE 2005]
(b) Solution is not defined
(a) Bounded (b) Unbounded
(c) The objective function has to be modified
(d) The change in constraints is ignored (c) Convex (d) Concave
29. Which of the following statements is correct 36. The feasible region for the following constraints
(a) Every L.P.P. admits an optimal solution L1  0, L 2  0, L 3  0, x  0, y  0 in the diagram
(b) A L.P.P. admits a unique optimal solution shown is
(c) If a L.P.P. admits two optimal solutions, it has an infinite [Kerala (Engg.) 2005]
number of optimal solutions Y
(d) The set of all feasible solutions of a L.P.P. is not a convex set F
(a) Area DHF
30. Shaded region is represented by [MP PET 1997] E L1 = 0
(b) Area AHC G
Y D L3 = 0
(c) Line segment EG
(0,20) x+y=20 L2= 0
(d) Line segment GI X
 20 40  A B C
B , 
C(10,16)  3 3  (e) Line segment IC
37. A wholesale merchant wants to start the business of cereal with
Shaded 2x+5y=80 Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per
region quintal. He has capacity to store 200 quintal cereal. He earns
X the profit Rs. 25 per quintal on wheat and Rs. 40 per quintal on
A(20,0) (40,0) rice. If he stores x quintal rice and y quintal wheat, then for
(a) 2 x  5 y  80 , x  y  20 , x  0, y  0 maximum profit the objective function is

2 x  5 y  80 , x  y  20 , x  0, y  0 (a) 25 x  40 y (b) 40 x  25 y
(b)
(c) 2 x  5 y  80 , x  y  20 , x  0, y  0 400 600
(c) 400 x  600 y (d) x y
(d) 2 x  5 y  80 , x  y  20 , x  0, y  0 40 25
31. The constraints 38. Mohan wants to invest the total amount of Rs. 15,000 in saving
certificates and national saving bonds. According to rules, he
x1  x 2  1 has to invest at least Rs. 2000 in saving certificates and Rs.
x1  3 x 2  9 2500 in national saving bonds. The interest rate is 8% on saving
certificate and 10% on national saving bonds per annum. He
x 1 , x 2  0 define on [MP PET 1999] invest Rs. x in saving certificates and Rs. y in national saving
bonds. Then the objective function for this problem is
(a) Bounded feasible space
x y
(b) Unbounded feasible space (a) 0 . 08 x  0 . 10 y (b) 
(c) Both bounded and unbounded feasible space 2000 2500
(d) None of these x y
(c) 2000 x  2500 y (d) 
32. Which of the following is not true for linear programming 8 10
problems [Kurukshetra CEE 1998]
39. A firm produces two types of products A and B. The profit on
(a) A slack variable is a variable added to the left hand side of both is Rs. 2 per item. Every product requires processing on
a less than or equal to constraint to convert it into an machines M 1 and M 2 . For A, machines M 1 and M 2
equality
takes 1 minute and 2 minute respectively and for B, machines
(b) A surplus variable is a variable subtracted from the left M 1 and M 2 takes the time 1 minute each. The machines
hand side of a greater than or equal to constraint to convert
it into an equality M 1 , M 2 are not available more than 8 hours and 10 hours,
(c) A basic solution which is also in the feasible region is any of day, respectively. If the products made x of A and y of B,
called a basic feasible solution then the linear constraints for the L.P.P. except
x  0, y  0 , are
(d) A column in the simplex tableau that contains all of the
variables in the solution is called pivot or key column (a) x  y  480 , 2 x  y  600 (b)
33. Which of the terms is not used in a linear programming x  y  8 , 2 x  y  10
problem [MP PET 2000] (c) x  y  480 , 2 x  y  600 (d)
(a) Slack variables (b) Objective function x  y  8 , 2 x  y  10
(c) Concave region (d) Feasible solution 40. The objective function in the above question is
 Linear Programming 1455
(a) 2x  y (b) x  2y most 4. If the first number is x and second number y, then for
maximizing the product of these two numbers, the
(c) 2 x  2 y (d) 8 x  10 y
mathematical formulation is
41. In a test of Mathematics, there are two types of questions to be
(a) x  y  5 , 2 y  x  4 , x  0, y  0
answered–short answered and long answered. The relevant data
is given below (b) x  y  5 , 2 x  y  4 , x  0, y  0
Type of Time taken Marks Number of (c) x  y  5 , 2 y  x  4 , x  0, y  0
questions to solve questions (d) None of these
Short answered 5 minute 3 10 49. For the L.P. problem Max z  3 x 1  2 x 2 such that
questions
Long answered 10 minute 5 14
2 x 1  x 2  2 , x 1  2 x 2  8 and x 1 , x 2  0 , z
questions (a) 12 (b) 24
(c) 36 (d) 40
The total marks is 100. Students can solve all the questions. To
secure maximum marks, a student solves x short answered and 50. For the L.P. problem Min z   x 1  2x 2 such that
y long answered questions in three hours, then the linear  x 1  3 x 2  0, x 1  x 2  6, x 1  x 2  2 and
constraints except x  0, y  0 , are
(a) 5 x  10 y  180 , x  10 , y  14 x1, x 2  0 , x1 
(b) x  10 y  180 , x  10 , y  14 (a) 2 (b) 8
(c) 10 (d) 12
(c) 5 x  10 y  180 , x  10 , y  14
51. For the L.P. problem Min z  x 1  x 2 such that
(d) 5 x  10 y  180 , x  10 , y  14
42. The objective function for the above question is 5 x 1  10 x 2  0, x 1  x 2  1, x 2  4 and
(a) 10 x  14 y (b) 5 x  10 y x1, x 2  0
(c) 3 x  5 y (d) 5 y  3 x (a) There is a bounded solution
43. The vertices of a feasible region of the above question are (b) There is no solution
(a) (0, 18), (36, 0) (b) (0, 18), (10, 13) (c) There are infinite solutions
(c) (10, 13), (8, 14) (d) (10, 13), (8, 14), (12, 12) (d) None of these
44. The maximum value of objective function in the above question 52. On maximizing z  4 x  9 y subject to x  5 y  200 ,
is
2 x  3 y  134 and x , y  0 , z 
(a) 100 (b) 92
(c) 95 (d) 94
45. A factory produces two products A and B. In the manufacturing (a) 380 (b) 382
of product A, the machine and the carpenter requires 3 hour (c) 384 (d) None of these
each and in manufacturing of product B, the machine and 53. For the L.P. problem Min z  2 x  y subject to
carpenter requires 5 hour and 3 hour respectively. The machine 5 x  10 y  50 , x  y  1, y  4 and x , y  0 ,
and carpenter work at most 80 hour and 50 hour per week
respectively. The profit on A and B is Rs. 6 and 8 respectively. z
If profit is maximum by manufacturing x and y units of A and B (a) 0 (b) 1
type product respectively, then for the function 6 x  8 y the (c) 2 (d) 1/2
constraints are 54. For the L.P. problem Min z  2 x  10 y subject to
(a) x  0, y  0, 5 x  3 y  80 , 3 x  2 y  50 x  y  0, x  5 y  5 and x , y  0 , z 
(b) x  0, y  0, 3 x  5 y  80 , 3 x  3 y  50 (a) –10 (b) –20
x  0, y  0, 3 x  5 y  80 , 2 x  3 y  50 (c) 0 (d) 10
(c)
55. The point at which the maximum value of (3 x  2 y )
(d) x  0, y  0, 5 x  3 y  80 , 3 x  2 y  50
subject to the constraints x  y  2, x  0, y  0 is
46. A shopkeeper wants to purchase two articles A and B of cost
price Rs. 4 and 3 respectively. He thought that he may earn 30 obtained, is
paise by selling article A and 10 paise by selling article B. He [MP PET 1993]
has not to purchase total article worth more than Rs. 24. If he (a) (0, 0) (b) (1.5, 1.5)
purchases the number of articles of A and B, x and y (c) (2, 0) (d) (0, 2)
respectively, then linear constraints are 56. The minimum value of objective function c  2 x  2 y in
(a) x  0, y  0, 4 x  3 y  24 the given feasible region, is
Y
(b) x  0 , y  0, 30 x  10 y  24
(c) x  0, y  0, 4 x  3 y  24
(d) x  0, y  0, 30 x  40 y  24
47. In the above question the iso-profit line is
(a) 3 x  y  30 (b) x  3 y  20
O X
(c) 3 x  y  20 (d) 4 x  3 y  24 2x+3y=134 x+5y=200
48. The sum of two positive integers is at most 5. The difference
between two times of second number and first number is at (a) 134 (b) 40
 1456 Linear Programming
(c) 38 (d) 80 Subject to 3 x 1  2 x 2  18 , x 1  4 , x 2  6 , x 1  0 ,
57. The minimum value of linear objective function x2  0
c  2 x  2 y under linear constraints 3 x  2 y  12 ,
x  3 y  11 and x , y  0 , is is [MP PET 1996]

(a) 10 (b) 12 (a) x 1  2, x 2  0, z  6 (b)

(c) 6 (d) 5 x 1  2, x 2  6, z  36
58. The solution for minimizing the function z  x  y under a (c) x 1  4 , x 2  3, z  27 (d)
L.P.P. with constraints x  y  1 , x  2 y  10 , y  4
x 1  4 , x 2  6, z  42
and x , y  0 , is
66. The point at which the maximum value of ( x  y ) subject to
(a) x  0, y  0 , z  0
x y
(b) x  3, y  3, z  6 the constraints 2 x  5 y  100 ,   1,
25 49
(c) There are infinitely solutions x , y  0 is obtained, is
(d) None of these
(a) (10, 20) (b) (20, 10)
59. The solution of a problem to maximize the objective function
z  x  2 y under the constraints x  y  2 , x  y  4  50 40 
(c) (15, 15) (d)  , 
and x , y  0 , is  3 3 
(a) x  0, y  4 , z  8 (b) x  1, y  2, z  5 67. The maximum value of ( x  2 y ) under the constraints
x  1, y  4 , z  9 x  0 , y  3, z  6 2 x  3 y  6, x  4 y  4 , x , y  0 is
(c) (d)
(a) 3 (b) 3.2
60. To maximize the objective function z  2 x  3 y under the
(c) 2 (d) 4
constraints x  y  30 , x  y  0, y  12 , x  20 ,
y  3 and x , y  0 68. The maximum value of 10 x  5 y under the constraints
3 x  y  15 , x  2 y  8 , x , y  0 is
(a) x  12 , y  18 (b) x  18 , y  12
(a) 20 (b) 50
(c) x  12 , y  12 (d) x  20 , y  10
(c) 53 (d) 70
61. The maximum value of P  6 x  8 y subject to constraints 69. The point at which the maximum value of ( x  y ) , subject
2 x  y  30 , x  2 y  24 and x  0, y  0 is to the constraints x  2 y  70 , 2 x  y  95 ,
[MP PET 1994; 95] x , y  0 is obtained, is
(a) 90 (b) 120 (a) (30, 25) (b) (20, 35)
(c) 96 (d) 240 (c) (35, 20) (d) (40, 15)
62. The maximum value of P  x  3y such that 70. If 3 x 1  5 x 2  15 , 5 x 1  2 x 2  10 , x 1 , x 2  0
2 x  y  20 , x  2 y  20 , x  0, y  0 , is [MP
PET 1995] then the maximum value of 5 x 1  3 x 2 , by graphical method
(a) 10 (b) 60 is
(c) 30 (d) None of these 7 1
(a) 12 (b) 12
63. The maximum value of z  4 x  2 y subject to the 19 7
constraints 2 x  3 y  18 , x  y  10 ; x , y  0 , is 3
(c) 12 (d) 12
[MP PET 2001] 5
(a) 36 (b) 40 71. The maximum value of z  5 x  2 y , subject to the
(c) 20 (d) None of these constraints x  y  7, x  2 y  10 , x , y  0 is [AMU
64. z  ax  by , a, b being positive, under constraints 1999]
y  1 , x  4 y  8  0 , x , y  0 has (a) 10 (b) 26
(a) Finite maximum (c) 35 (d) 70
(b) Finite minimum 72. The maximum value of z  3 x  4 y subject to the
(c) An unbounded minimum solution constraints x  y  40 , x  2 y  60 , x  0 and
(d) An unbounded maximum solution y  0 is
65. By graphical method, the solution of linear programming [MP PET 2002, 04]
problem (a) 120 (b) 140
Maximize z  3 x 1  5 x 2 (c) 100 (d) 160
 Linear Programming 1457

73. The minimum value of z  2 x 1  3 x 2 subject to the 4. A Firm makes pents and shirts. A shirt takes 2 hour on machine
and 3 hour of man labour while a pent takes 3 hour on machine
constraints 2 x 1  7 x 2  22 , x 1  x 2  6 , and 2 hour of man labour. In a week there are 70 hour machine
5 x 1  x 2  10 and x 1 , x 2  0 is [MP PET 2003] and 75 hour of man labour available. If the firm determine to
make x shirts and y pents per week, then for this the linear
(a) 14 (b) 20 constraints are
(c) 10 (d) 16 (a) x  0, y  0, 2 x  3 y  70 , 3 x  2 y  75
74. The co-ordinates of the point for minimum value of x  0, y  0, 2 x  3 y  70 , 3 x  2 y  75
(b)
z  7 x  8 y subject to the conditions x  y  20  0 ,
y  5, x  0 , y  0 is (c) x  0, y  0, 2 x  3 y  70 , 3 x  2 y  75
[DCE 2005]
(a) (20, 0) (b) (15, 5) (d) x  0, y  0, 2 x  3 y  70 , 3 x  2 y  75
(c) (0, 5) (d) (0, 20) 5. For the L.P. problem Min z  2 x 1  3 x 2 such that
75. The maximum value of   3 x  4 y , subject to the  x1  2 x 2  4 , x 1  x 2  6, x 1  3 x 2  9 and
conditions x  y  40 , x  2 y  60 , x , y  0 is
x1, x 2  0
[MP PET 2004]
(a) 130 (b) 120 (a) x 1  1 .2 (b) x 2  2 .6
(c) 40 (d) 140
(c) z  10 . 2 (d) All the above
6. A company manufactures two types of products A and B. The
storage capacity of its godown is 100 units. Total investment
amount is Rs. 30,000. The cost price of A and B are Rs. 400 and
Rs. 900 respectively. If all the products have sold and per unit
profit is Rs. 100 and Rs. 120 through A and B respectively. If x
units of A and y units of B be produced, then two linear
constraints and iso-profit line are respectively
1. For the following shaded area, the linear constraints except (a)
x  0 and y  0 , are x  y  100 ; 4 x  9 y  300 , 100 x  120 y  c
Y
(b) x  y  100 ; 4 x  9 y  300 , x  2 y  c

x–y=1 (c)
2x+y=2 x  y  100 ; 4 x  9 y  300 , 100 x  120 y  c
(d) x  y  100 ; 9 x  4 y  300 , x  2 y  c
X
O
x+2y=8 7. The L.P. problem Max z  x 1  x 2 such that
2 x 1  x 2  1, x 1  2, x 1  x 2  3 and x 1 , x 2  0
(a) 2 x  y  2, x  y  1, x  2 y  8
has
(b) 2 x  y  2, x  y  1, x  2 y  8
(a) One solution (b) Three solution
(c) 2 x  y  2, x  y  1, x  2 y  8 (c) An infinite no. of solution (d) None of these
(d) 2 x  y  2, x  y  1, x  2 y  8 8. The minimum value of the objective function
z  2 x  10 y for linear constraints x  0, y  0 ,
2. Inequations 3 x  y  3 and 4 x  y  4 [MP PET 2001]
x  y  0 , x  5 y  5 , is
(a) Have solution for positive x and y
(b) Have no solution for positive x and y (a) 10 (b) 15
(c) Have solution for all x (c) 12 (d) 8
(d) Have solution for all y 9. The maximum value of z  4 x  3y
subject to the
3. Shaded region is represented by [MP PET 1997] constraints 3 x  2 y  160 , 5 x  2 y  200 ,
Y x  2 y  80 ; x , y  0 is [MP PET 1998]
(a) 320 (b) 300
4x–2y=–3 (c) 230 (d) None of these
Shaded
region A(0,3/2) n m
10. Minimize z   c
j 1 i 1
ij x ij
X
B O n
(-3/4,0) Subject to : x
j 1
ij  a i , i  1,......., m
(a) 4 x  2y  3 (b) 4 x  2 y  3
m
(c) 4 x  2y  3 (d) 4 x  2 y  3
x
i1
ij  b j , j  1,......, n
 1458 Linear Programming
is a (L.P.P.) with number of constraints [MP PET 1999]
(a) m n (b) m n Y
2. (d)
m (0,5)
(c) mn (d)
n 5x+3y=15
2x+3y=6
(0,2)

(3,0)
X
O

Here (0, 2); (0, 0) and (3, 0) all are vertices of feasible
Linear programming region. Hence option (d) is correct.
3. (b) It is obvious.
1 c 2 d 3 b 4 d 5 b
4. (d) Clearly point (2000, 0) is outside.
6 b 7 c 8 a 9 d 10 a X2
11 a 12 b 13 d 14 c 15 d x1+x2=1500
(0,1500)
16 d 17 b 18 a 19 d 20 b

21 c 22 b 23 b 24 a 25 b (0,1000)
(900,600)
x2=600
26 c 27 c 28 a 29 c 30 c (1000,500)
(2000,0)
31 b 32 d 33 c 34 c 35 b X1
O (1500,0)
x1+2x2=2000
36 c 37 b 38 a 39 a 40 c 5. (b) It is fundamental concept.
41 a 42 c 43 c 44 c 45 b 6. (b) It is obvious.
7. (c) Y
46 a 47 a 48 c 49 b 50 a
(0,15/2)
51 c 52 b 53 b 54 a 55 c (0,6)
3x+4y=30
56 d 57 a 58 c 59 a 60 b (0,11/2)
61 b 62 c 63 d 64 b,d 65 b 2x+5y=30

66 d 67 b 68 c 69 d 70 a x+2y=11 (15,0)
X
O (10,0) (11,0)
71 c 72 b 73 a 74 d 75 d

Obviously, solution set of constraints includes the point (3,

Critical Thinking Questions 4).

Y
1 b 2 a 3 b 4 d 5 d 8. (a)

6 c 7 c 8 b 9 d 10 a

y=2

X
O
x =2
9. (d) It is a fundamental concept.
10. (a) Y
Linear Programming
2x–3y=5
1. (c) Clearly from graph there is no feasible region.
X
X2 O (5/2, 0)

B(0,3) (0,–5/3)
x1+x2=1
A(0,1)
C(1,0)
X1
O
3x1+x2=3
 Linear Programming 1459
11. (a) The equations, corresponding to inequalities 18. (a) It is obvious.
3 x  2y  6 and 6 x  4 y  20 , are 19. (d) It is a fundamental concept.
20. (b) Y
3 x  2 y  6 and 6 x  4 y  20 . So the lines
represented by these equations are parallel. Hence the
graphs are disjoint. 4x–3y+2=0
Y
2x+3y–5=0
(0,5) O X

21. (c)
(3,0) Y
y=6
(10/3,0)
X
O (2,0)
3x+2y=6 6x+4y=20 (0,3) x+y=3
Y
12. (b) 2x+y=2 X
22. (b) It is obvious.
O (3,0)
23. (b) It is obvious.
(0,2) 24. (a) Y
x–y=3
(1,0)
X
O (3,0)
(5/3,–4/3)
(0,–3)

Y O X
y–x0
13. (d) (0,4) 25. (b) It is by definition.
2x+y=4 26. (c) It is a fundamental concept.
(2,0)
27. (c) Obviously, the optimal solution is found on the line which
X is parallel to ‘isoprofit line’. Hence it has infinite number
O
of solution.
x+2y=0 Y
14. (c) Solving 2 x  3 y  6 and x  4 y  4 , we get (0,8)
12 2
x  , y  Y. y=6
5 5 (0,6)
x=5
2x+3y=6
4x+3y=0
(0,2) 3x+4y=24
x+4y=4
(12/5, 2/5) (8,0)
(0,1) X
X O (5,0) (6,0)
O (3,0) 8x+6y=48
(4,0) 28. (a) It is obvious.
 12 2  29. (c) It is obvious.
Hence a vertex is  , . 30. (c) In given all equations, the origin is present in shaded area,
 5 5 answer (c) satisfy this condition.
Y 31. (b) X 2
15. (d)
(0,4.5)
3x+4y=18
2x+4y=3
(0,3)
(0,1)
O X (–9,0) (0,1)
(3/2,0) (6,0)
16. (d) As shown in graph drawn for x  y  1 and (–1,0) O
X1
x  y  1 the origin included in the area. Hence the
If is clear from the graph, the constraints define the
bounded region situated in all four quadrant. unbounded feasible space.
Y
(0,1) 32. (d) It is obvious.
x+y=1
33. (c) In linear programming problem, concave region is not
x–y=1 used. Convex region is used in linear programming.
X 34. (c) The shaded area is the required area given in graph as
O
(1,0) below.
Y y =x+3

17. (b) It is obvious. (0,–1)

x =y

X
O
 1460 Linear Programming
Now by evaluation of the objective function for the
vertices of feasible region it is found to be maximum at
(8,0). Hence the solution is z  3  8  0  2  24 .
50. (a) (3, 1), (2, 0 ) are vertices of Min z for (2, 0)
X2
Hence it is in I, II and III quadrant.
35. (b) Y (0,6)
x1–x2=2
–x1+3x2=0
(3,1) (9/2, 3/2)
X1
(0, 1) O (2,0) (6,0)
X
O (3, 0) (0,–2) x1 +x2=6
Hence, it is unbounded.
36. (c) It is obvious. Hence x 1  2 .
37. (b) For maximum profit, z = 40x + 25y.
38. (a) Objective function is given by profit function 51. (c) As there may be infinite values of x 1 and x 2 on line
8 10 x1  x 2  1 .
 x y  0 . 08 x  0 .10 y .
100 100 X2

39. (a) Obviously x  y  (8  60  480 ) and x2=4

2 x  y  (10  60  600 ) .
40. (c) It is obvious. x1+x2=1 B(0,1)
41. (a) Obviously x  10 , y  14 and 5 x  10 y  180 . A(1,0)
X1
O
42. (c) It is obvious.
5x1+10x2=0
43. (c) Hence required feasible region is given by ABCD , and
vertices are (8, 14), (10, 13), (10, 0) and (0, 14) 52. (b) Here, A   0, 40 , B  (67 , 0 ) and
Y
y=14 (8,14) C  (10 , 38 )
(0,14) A B (10,13)
Y
x=10

x+5y=200
C C
O X
(10,0) A
(200,0)
44. (c) Max z  3(10 )  5(13 )  95 . X
O B
45. (b) Obviously x , y  0,3 x  5 y  80 ,3 x  3 y  50 .
46. (a) Obviously x , y  0 and 4 x  3 y  24 . 2x+3y=134
Maximum for C i.e., z = 40 + 342 = 382.
47. (a) On drawing graph for above question, we get the isoprofit 53. (b) After drawing a graph we get the vertices of feasible
line 3 x  y  30 . region are (1, 0), (10, 0), (2, 4), (0, 4) and (0, 1).
Thus minimum value of objective function is at (0, 1)
48. (c) Obviously x  y  5, 2 y  x  4 , x  0 y  0 .
Hence z  0  2  1  1  1
49. (b) Change the inequalities into equations and draw the graph
of lines, thus we get the required feasible region. 54. (a) After drawing the graph, we get the minimum value of z at
points (–5, 0), (0, 1) and (5/4, 5/4) and Min
X2
z  2(0 )  10 (1)  10 .
x1+2x2=8 55. (c) Hence maximum z is at (2, 0).
 12 14 
C  5 5 
(0,4) , Y
(0,2)
A B
X1 x+y=2
O (1,0) (8,0)
2x1–x2=2
(2,0)
X
O
It is a bounded region, bounded by the vertices P
56. (d) Min z  2(0 )  2(40 )  80 .
 12 14 
A(1,0 ), B (8 ,0 ) and C  , . 57. (a) Min z  2(2)  2(3)  c  10 .
 5 5 
Y

(0,6)
(2,3)

X
O
3x+2y=12 x+3y=11
 Linear Programming 1461
no feasible point as no point satisfying all the inequations
simultaneously.
64. (b,d) It is obvious.

X2
65. (b)
x1=4
58. (c) Objective function is same as constraints so there are (0, 9)
infinite solutions possible. (2,6) x2=6
59. (a) z  x  2 y (0, 6)
Y
(4, 3)
(0,4) x+y=4
(3,1) x–y=2
X1
(4, 0) (6, 0)
(4,0)
X
O
O (2,0) 3x1+2x2=18
(0,–2) Here feasible region has vertices (0, 0); (4, 0); (4, 3); (2,
6) and (0, 6).
Max z  0  4 (2)  8 .
Max z at (2, 6 )  3(2)  5 (6 )  36 .
60. (b) The objective function is Max z  2 x  3 y .
66. (d) Since the points given in(a),(b) and(c) does not satisfy the
Y
given inequalities.
x+y=30
Y
x=20

x–y=0
(49,0) 49x+25y=1225
C B y=12
A
D E y=3
X (0,20) (50/3,40/3)
2x+5y=100
The vertices are A(20 , 10 ) , X
O (25,0) (50,0)
B(18 , 12 ), C (12, 12 ), D (3, 3) and E (20,
Hence, option (d) is correct.
3). Hence the maximum value of the objective function
will be at (18, 12).  12 2 
67. (b) Max ( x  2 y ) is at  ,  i.e. 3.2.
61. (b) Here, 2 x  y  30 , x  2 y  24 , x , y  0  5 5
Y
The shaded region represents the feasible region, hence
P  6 x  8 y . Obviously it is maximum at (12, 6).
Y 2x+3y=6
(0,2)
2x+y=30 x+4y=4
(0,1) (12/5,2/5)
(0,12) (12,6) X
O (3,0) (4,0)
X
O (15,0)
x+2y=24
 22 9 
Hence, P  12  6  8  6  120 . 68. (c) Max z  10 x  5 y is at  ,  i.e. 53.
 5 5
62. (c) Obviously, P  x  3 y will be maximum at (0, 10). Y
Y (0,15)
2x+y=20
(0,20)
 20 20  3x+y=15
x+2y=20  , 
(0,10)  3 3 
(20,0) (0,4)
X
O (10,0)
X
O (5,0) (8,0)
x+2y=8
 P  0  3  10  30 .
63. (d) After drawing the graph, we get the points on the region 69. (d) Y
2x+y=95
are (9, 0), (0, 6), (10, 0),(0, 10) and (12, –2). But there is (0,95)

(0,35) (40,15)

X
O (95/2,0)
x+2y=70
 1462 Linear Programming
PB  P(20 , 20 )  3  20  4  20  140
PC  P(40 , 0 )  3  40  0  120
Therefore Pmax  140 .
X2
73. (a)

(0, 10)
The shaded region represents feasible region hence
Max z  x  y . Obviously it is maximum at (40, 15). (0, 6) (1, 5)
2x1+7x2=22/7
70. (a) The shaded region represent the feasible region, hence (4, 2)
(0, 22/7)
p  5 x1  3 x 2 X1
X2 0 (2, 0) (6, 0) (11, 0)
5x1+x2=10 x1+x2=6
Obviously, at point (4, 2), the minimum value of
5x1+2x2=10
(0,5) z  2 x 1  3 x 2  2(4 )  3(2)  14 .
Y
74. (d)
(0,3) (20/19,45/19)
(0, 20)
(5,0)
X1 (0, 5)
O (2,0) (15, 5) y=5
3x1+5x2=15
X
O (20, 0)
 20 45 
Obviously it is maximum at  ,  Obviously, z  7 x  8 y will be minimum at (0,20)
 19 19 
 Min z = 7 × 0 – 8 × 20 = –160.
 20   45 
Max p  5 x 1  3 x 2  5    3  75. (d) Y
 19   19 
100 135 235 7
    12 . x+y=40 (0, 40)
19 19 19 19
(0,30) (20,20)

71. (c) Change the inequalities into equations and draw the graph (60,0)
X
of lines, thus we get the required feasible region. O (40,0)
x+2y=60
The region bounded by the vertices
A(0, 5 ), B(4 , 3) and C (7, 0 ) . Obviously,   3x  4y will be maximum at
(20 , 20 )
Y

x+y=7  Max   3  20  4  20 = 60  80  140 .

(0,7) O Critical Thinking Questions

A(0,5) B(4,3)
1. (b) To test the origin for 2 x  y  2, x  y  1 and
D(10,0) x  2 y  8 in reference to shaded area, 0  0  2 is
X
O C(7,0) true for 2 x  y  2 . So for the region does not include
x+2y=10
origin (0, 0), 2x  y  2 . Again for
The objective function is maximum at C (7 ,0 ) and Max
x  y  1, 0  0  1 ,  x y 1
z  5  7  2  0  35 .
Similarly for x  2 y  8 ,0  0  8 ; 
72. (b) Given, P  3 x  4 y
Y x  2y  8 .
x+y=40 2. (a) Following figure will be obtained on drawing the graphs of
(0,40) given inequations. Y

A(0,30) B(20,20)
X
O (1,0)
(60,0)
This graph O
has beenC(40,0) X
draw from given constraints and
x+2y=60
maximum value of P will be at A or B or C . (0,–3)
PA  P(0 , 30 )  3  0  4  30  120 x
(0,–4) y
From 3 x  y  3,  1
1 3
 Linear Programming 1463
x y
From 4 x  y  4 ,  1
1 4 5 5
8. (b) Required region is unbounded whose vertex is  , .
Clearly the common region of both is true for positive 4 4
Y
value of (x, y). It is also true for positive value of x and
negative value of y. x – y=0
3. (b) Origin is not present in given shaded area, so
4 x  2 y  3 satisfy this condition. x – 5y = –5
(0,1) 5 5
4. (d)  , 
4 4
Type of Working time Man labour
X
items on machine
Shirt (x) 2 hours 3 hours Hence the minimum value of objective function is
Pent (y) 3 hours 2 hours 5 5
Availability 70 hours 75 hours  2  10   15 .
4 4
Linear constraints are 2 x  3 y  70 , 3 x  2 y  75 9. (d) Obviously, it is unbounded. Therefore its maximum value
. does not exist.
5. (d) The graph of linear programming problem is as given Y
below (0, 100)
X2 3x+2y=160

–x1+2x2=4
(0,6)
(0, 40)
C
(0,3) (80,0) X
A B(4.5, 1.5)
(1.2,2.6) x+2y=80
X1 5x+2y=200
(–4,0) O (6,0) (9,0)
x1+3x2=9 10. (a) Condition (i),
x1+x2=6
Hence the required feasible region is given by the graph i  1, x 11  x 12  x 13  .....  x 1n
whose vertices are A (1 . 2, 2 . 6 ), B(4 . 5, 1 . 5 ) i  2, x 21  x 22  x 23  ......  x 2 n
 8 10  i  3, x 31  x 32  x 33  ......  x 3 n
and C  , .
3 3  ....................
Thus objective function is minimum at i  m , x m 1  x m 2  x m 3  ..... x mn  constraints
A (1 . 2, 2 . 6 )
Condition (ii),
So x 1  1 . 2, x 2  2 . 6 and
j  1, x 11  x 21  x 31  ......  x m 1
z  2  1 . 2  3  2 . 6  10 . 2 .
j  2, x 12  x 22  x 32  ......  x m 1
6. (c) x  y  100 ,400 x  900 y  30000 or
4 x  9 y  300 and 100 x  120 y  c . ....................

7. (c) Objective function is same as constraint so there are j  n, x 1n  x 2 n  x 3 n  ......  x mn  n constraints

infinite solutions possible.
 Total constraints = m n.