Linear Programming

‘Linear Programming’ is a scientific tool to handle (iv) If the inequation is > or <, then the points lying
optimization problems. Here, we shall learn about some on this line is not considered and line is drawn dotted or
basic concepts of linear programming problems in two discontinuous.
variables, their applications, advantages, limitations, (v) If the ineuqation is  or , then the points lying
formulation and graphical method of solution. on the line is considered and line is drawn bold or
continuous.
Linear inequations (vi) This line divides the plane XOY in two region.
(1) Graph of linear inequations To Find the region that satisfies the inequation, we
apply the following rules:
(i) Linear inequation in one variable: (a) Take an arbitrary point which will be in either
etc. are called linear inequations in region.
one variable. Graph of these inequations can be drawn (b) If it satisfies the given inequation, then the required
Y b
as follows : x  region will be the region in which the arbitrary point is
a located.
(c) If it does not satisfy the inequation, then the
a>0
other region is the required region.
X X (d) Draw the lines in the required region or make it
O
shaded.
ax+b<0 ax+b>0 (2) Simultaneous linear inequations in two
variables : Since the solution set of a system of
simultaneous linear inequations is the set of all points in
Y
two dimensional space which satisfy all the inequations
simultaneously. Therefore to find the solution set we
The graph of and are obtained
find the region of the plane common to all the portions
by dividing xy-plane in two semi-planes by the line comprising the solution set of given inequations. In case
there is no region common to all the solutions of the
(which is parallel to y-axis). Similarly for
given inequations, we say that the solution set is void
Y or empty.
and .
(3) Feasible region : The limited (bounded)
cy+d>0 d region of the graph made by two inequations is called
c>0 y 
c feasible region. All the points in feasible region
X constitute the solution of a system of inequations. The
X
feasible solution of a L.P.P. belongs to only first
cy+d<0
quadrant. If feasible region is empty then there is no
solution for the problem.
Y
Terms of linear programming
(ii) Linear Inequation in two variables : General The term programming means planning and refers
form of these inequations are . If to a process of determining a particular program.
any ordered pair satisfies an inequation, then it (1) Objective function : The linear function which
is to be optimized (maximized or minimized) is called
is said to be a solution of the inequation.
objective function of the L.P.P.
The graph of these inequations is given below (for c
(2) Constraints or Restrictions : The conditions
> 0) :
of the problem expressed as simultaneous equations or
Y inequations are called constraints or restrictions.
(3) Non-negative constraints : Variables applied in
ax+by=c
ax+by<c the objective function of a linear programming problem
X X are always non-negative. The inequations which represent
O
such constraints are called non-negative constraints.
ax+by>c
(4) Basic variables : The m variables associated
with columns of the m × n non-singular matrix which
Y
may be different from zero, are called basic variables.
Working Rule : To draw the graph of an
inequation, following procedure is followed : (5) Basic solution : A solution in which the vectors
associated to m variables are linear and the remaining
(i) Write the equation in place of
variables are zero, is called a basic solution. A
and .
Y basic solution is called a degenerate basic solution, if at
(ii) Make a table for the solutions of . least one of the basic variables is zero and basic
d solution is called non-degenerate, if none of the basic
(iii) Now draw a cy+d>0
line with ythe
  help of these points.
c variables is zero.
This is the graph of the line .
X X
(6) Feasible solution : The set of values of the
variables which satisfies the set of constraints of linear
cy+d<0

Y

1
 Linear Programming

programming problem (L.P.P) is called a feasible (v) Calculate the value of objective function at
solution of the L.P.P. these vertices.
(7) Optimal solution : A feasible solution for which (vi) Optimal value (minimum or maximum) is the
the objective function is minimum or maximum is called required solution.
optimal solution. (vii) If there is no possibility to determine the point
(8) Iso-profit line : The line drawn in geometrical at which the suitable solution found, then the solution of
area of feasible region of L.P.P. for which the objective problem is unbounded.
function (to be maximized) remains constant at all the
(viii) If feasible region is empty, then there is no
points lying on the line, is called iso-profit line.
solution for the problem.
If the objective function is to be minimized then
(ix) Nearer to the origin, the objective function is
these lines are called iso-cost lines.
minimum and that of further from the origin, the
(9) Convex set : In linear programming problems objective function is maximum.
feasible solution is generally a polygon in first quadrant.
This polygon is convex. It means if two points of polygon (2) Iso-profit or Iso-cost method : Various steps
are connected by a line, then the line must be inside the of the method are as follows :
polygon. For example, (i) Find the feasible region of the L.P.P.
(ii) Assign a constant value Z1 to Z and draw the
A A corresponding line of the objective function.
(iii) Assign another value Z2 to Z and draw the
B B corresponding line of the objective function.
(i) (ii) (iii) (iv)
(iv) If , then in case of
Fig. (i) and (ii) are convex set while (iii) and (iv) are maximization (minimization) move the line P1Q1
not convex set. corresponding to Z1 to the line P2Q2 corresponding to Z2
Mathematical formulation of a linear parallel to itself as far as possible, until the farthest point
programming problem within the feasible region is touched by this line. The
coordinates of the point give maximum (minimum) value
There are mainly four steps in the mathematical of the objective function.
formulation of a linear programming problem, as (v) The problem with more equations/inequations
mathematical model. We will discuss formulation of can be handled easily by this method.
those problems which involve only two variables.
(vi) In case of unbounded region, it either finds an
(1) Identify the decision variables and assign optimal solution or declares an unbounded solution.
symbols x and y to them. These decision variables are Unbounded solutions are not considered optimal
those quantities whose values we wish to determine. solution. In real world problems, unlimited profit or loss
(2) Identify the set of constraints and express them is not possible.
as linear equations/inequations in terms of the decision
variables. These constraints are the given conditions. To find the vertices of simple feasible
(3) Identify the objective function and express it as region without drawing a graph
a linear function of decision variables. It may take the
(1) Bounded region: The region surrounded by the
form of maximizing profit or production or minimizing
cost. inequations and in first quadrant
(4) Add the non-negativity restrictions on the is called bounded region. It is of the form of triangle or
decision variables, as in the physical problems, negative quadrilateral. Change these inequations into equations,
values of decision variables have no valid interpretation. then by putting and we get the solution.
Also by solving the equations we get the vertices of
Graphical solution of two variable linear bounded region.
programming problem The maximum value of objective function lies at one
vertex in limited region.
There are two techniques of solving an L.P.P. by (2) Unbounded region : The region surrounded by
graphical method. These are : the inequations and in first
(1) Corner point method (2) Iso-profit or Iso-cost quadrant, is called unbounded region.
method Change the inequation in equations and solve for
(1) Corner point method and . Thus we get the vertices of feasible
Working Rule: region.
(i) Formulate mathematically the L.P.P. The minimum value of objective function lies at one
(ii) Draw graph for every constraint. vertex in unbounded region but there is no existence of
maximum value.
(iii) Find the feasible solution region.
(iv) Find the coordinates of the vertices of feasible Advantages and limitations of L.P.P.
solution region.
(1) Advantages : Linear programming is used to
minimize the cost of production for maximum output. In

2
 Linear Programming

short, with the help of linear programming models, a 2. Which of the following is not a vertex of the
decision maker can most efficiently and effectively positive region bounded by the inequalities
employ his production factor and limited resources to , and
get maximum profit at minimum cost.
(a) (0, 2) (b) (0, 0)
(2) Limitations : (i) The linear programming can
(c) (3, 0) (d) None of these
be applied only when the objective function and all the
constraints can be expressed in terms of linear 3. The intermediate solutions of constraints must be
equations/inequations. checked by substituting them back into
(ii) Linear programming techniques provide solutions (a) Objective function (b) Constraint equations
only when all the elements related to a problem can be (c) Not required (d) None of these
quantified. 4. For the constraints of a L.P. problem given by
(iii) The coefficients in the objective function and in
, , and
the constraints must be known with certainty and
should remain unchanged during the period of study. , which one of the following points does
(iv) Linear programming technique may give fractional not lie in the positive bounded region
valued answer which is not desirable in some problems. (a) (1000, 0) (b) (0, 500)
(c) (2, 0) (d) (2000, 0)
5. A basic solution is called non-degenerate, if
(a) All the basic variables are zero
(b) None of the basic variables is zero
(c) At least one of the basic variables is zero
(d) None of these
 In some of the linear programming problems, 6. If the number of available constraints is 3 and the
constraints are inconsistent i.e. there does not exist number of parameters to be optimized is 4, then
any point which satisfies all the constraints. Such
(a) The objective function can be optimized
type of linear programming problems are said to
have infeasible solution. (b) The constraints are short in number
 If the constraints in a linear programming (c) The solution is problem oriented
problem are changed, the problem is to be re- (d) None of these
evaluated. 7. The solution of set of constraints
 The optimal value of the objective function is
attained at the point, given by corner points of the includes the point
feasible region.
[MP PET 1993]
 If a L.P.P. admits two optimal solutions, it has an (a) (2, 3) (b) (3, 2)
infinite number of optimal solutions.
(c) (3, 4) (d) (4, 3)
 If there is no possibility to determine the point at
which the suitable solution can be found, then the 8. The graph of and will be situated in the
solution of problem is unbounded. (a) First and second quadrant
 The maximum value of objective function lies at (b) Second and third quadrant
one vertex in limited region. (c) First and third quadrant
(d) Third and fourth quadrant
9. The feasible solution of a L.P.P. belongs to
(a) First and second quadrant
(b) First and third quadrant
(c) Second quadrant
Linear Programming (d) Only first quadrant
10. The position of points O (0,0) and P (2, – 2) in the
1. For the constraint of a linear optimizing function region of graph of inequation , will be
, given by and (a) O inside and P outside
(b) O and P both inside
(a) There are two feasible regions (c) O and P both outside
(b) There are infinite feasible regions (d) O outside and P inside
(c) There is no feasible region 11. The true statement for the graph of inequations
(d) None of these and , is
(a) Both graphs are disjoint

3
 Linear Programming

(b) Both do not contain origin (a) At the centre of feasible region
(c) Both contain point (1, 1) (b) At (0, 0)
(d) None of these (c) At any vertex of feasible region
(d) The vertex which is at maximum distance from
12. The vertex of common graph of inequalities
(0, 0)
and , is
20. The region represented by and
, is
(a) (0, 0) (b)
(a) Not in first quadrant
(b) Bounded in first quadrant
(c) (d) (c) Unbounded in first quadrant
(d) None of these
13. A vertex of bounded region of inequalities , 21. The region represented by the inequation system
and , is , , is

(a) (1, 1) (b) (0, 1) (a) Unbounded in first quadrant

(c) (3, 0) (d) (0, 0) (b) Unbounded in first and second quadrants
(c) Bounded in first quadrant
14. A vertex of the linear inequalities ,
(d) None of these
and , is
22. The solution set of the inequation , is
(a) (1, 0) (b) (1, 1)
(a) Half plane that contains the origin
(c) (d) (b) Open half plane not containing the origin
(c) Whole xy-plane except the points lying on the
15. A vertex of a feasible region by the linear line
constraints and (d) None of these
, is 23. If a point (h, k) satisfies an inequation ,
(a) (0, 2) (b) (4.8, 0) then the half plane represented by the inequation
is
(c) (0, 3) (d) None of these
(a) The half plane containing the point (h, k) but
16. In which quadrant, the bounded region for
excluding the points on
inequations and is situated
(b) The half plane containing the point (h, k) and
(a) I, II
the points on
(b) I, III
(c) Whole xy-plane
(c) II, III
(d) None of these
(d) All the four quadrants
24. Inequation represents
17. The necessary condition for third quadrant region
in xy-plane, is (a) The half plane that contains the positive x-axis
(b) Closed half plane above the line which
(a) (b)
contains positive y-axis
(c) (d) (c) Half plane that contains the negative x-axis
18. For the following feasible region, the linear (d) None of these
Y
constraints are 25. Objective function of a L.P.P. is
(a) A constraint
(b) A function to be optimized
(c) A relation between the variables
(d) None of these
O
X 26. The optimal value of the objective function is
3x+2y=1 x+3y=1 attained at the points [MP PET 1998]
2 1 (a) Given by intersection of inequations with axes
only
(a)
(b) Given by intersection of inequations with x-
(b) axis only
(c) (c) Given by corner points of the feasible region
(d) None of these (d) None of these
19. The value of objective function is maximum under 27. The objective function can be
linear constraints maximized subjected to the constraints

4
 Linear Programming

, , (d) A column in the simplex tableau that contains

all of the variables in the solution is called
pivot or key column
(a) At only one point
33. Which of the terms is not used in a linear
(b) At two points only
programming problem [MP PET 2000]
(c) At an infinite number of points
(a) Slack variables (b) Objective function
(d) None of these
(c) Concave region (d) Feasible solution
28. If the constraints in a linear programming problem
are changed 34. The graph of inequations and is
(a) The problem is to be re-evaluated located in
(b) Solution is not defined (a) II quadrant (b) I, II quadrants
(c) The objective function has to be modified (c) I, II, III quadrants (d) II, III, IV quadrants
(d) The change in constraints is ignored 35. The area of the feasible region for the following
29. Which of the following statements is correct constraints will be [DCE
(a) Every L.P.P. admits an optimal solution 2005]
(b) A L.P.P. admits a unique optimal solution (a) Bounded (b) Unbounded
(c) If a L.P.P. admits two optimal solutions, it has
(c) Convex (d) Concave
an infinite number of optimal solutions
(d) The set of all feasible solutions of a L.P.P. is not a 36. The feasible region for the following constraints
convex set in the diagram
30. Shaded region is represented by [MP PET 1997] shown is
Y [Kerala (Engg.) 2005]
Y
(0,20) x+y=20
 20 40 (a) Area DHF F
B ,  E L1 = 0
C(10,16  3 3 (b) Area AHC G
) D L3 = 0
(c) Line segment EG
Shaded 2x+5y=80 L2= 0
region (d) Line segment GI X
A B C
X (e) Line segment IC
A(20,0 (40,0)
37. A wholesale merchant wants to start the business
)
(a) of cereal with Rs. 24000. Wheat is Rs. 400 per
quintal and rice is Rs. 600 per quintal. He has
(b)
capacity to store 200 quintal cereal. He earns the
(c) profit Rs. 25 per quintal on wheat and Rs. 40 per
(d) quintal on rice. If he stores x quintal rice and y
quintal wheat, then for maximum profit the
31. The constraints
objective function is
(a) (b)

(c) (d)
define on [MP PET 1999]
(a) Bounded feasible space 38. Mohan wants to invest the total amount of Rs.
(b) Unbounded feasible space 15,000 in saving certificates and national saving
(c) Both bounded and unbounded feasible space bonds. According to rules, he has to invest at least
Rs. 2000 in saving certificates and Rs. 2500 in
(d) None of these
national saving bonds. The interest rate is 8% on
32. Which of the following is not true for linear saving certificate and 10% on national saving
programming problems [Kurukshetra CEE 1998] bonds per annum. He invest Rs. x in saving
(a) A slack variable is a variable added to the left certificates and Rs. y in national saving bonds.
hand side of a less than or equal to constraint Then the objective function for this problem is
to convert it into an equality
(a) (b)
(b) A surplus variable is a variable subtracted
from the left hand side of a greater than or
equal to constraint to convert it into an (c) (d)
equality
(c) A basic solution which is also in the feasible 39. A firm produces two types of products A and B.
region is called a basic feasible solution The profit on both is Rs. 2 per item. Every product
requires processing on machines and . For

5
 Linear Programming

A, machines and takes 1 minute and 2 maximum by manufacturing x and y units of A and
B type product respectively, then for the function
minute respectively and for B, machines and the constraints are
takes the time 1 minute each. The machines (a)
are not available more than 8 hours and (b)
10 hours, any of day, respectively. If the products (c)
made x of A and y of B, then the linear constraints (d)
for the L.P.P. except , are 46. A shopkeeper wants to purchase two articles A
(a) (b) and B of cost price Rs. 4 and 3 respectively. He
thought that he may earn 30 paise by selling
article A and 10 paise by selling article B. He has
(c) (d)
not to purchase total article worth more than Rs.
24. If he purchases the number of articles of A and
40. The objective function in the above question is B, x and y respectively, then linear constraints are
(a) (b) (a)
(c) (d) (b)
41. In a test of Mathematics, there are two types of (c)
questions to be answered–short answered and
(d)
long answered. The relevant data is given below
47. In the above question the iso-profit line is
Type of Time Mark Number (a) (b)
questions taken to s of
solve question (c) (d)
s 48. The sum of two positive integers is at most 5. The
Short 5 minute 3 10 difference between two times of second number
answered and first number is at most 4. If the first number is
questions x and second number y, then for maximizing the
Long 10 minute 5 14 product of these two numbers, the mathematical
answered formulation is
questions (a) ,
The total marks is 100. Students can solve all the (b) ,
questions. To secure maximum marks, a student (c) ,
solves x short answered and y long answered (d) None of these
questions in three hours, then the linear
49. For the L.P. problem Max such that
constraints except , are
(a) , , and ,
(b) , (a) 12 (b) 24
(c) 36 (d) 40
(c) ,
50. For the L.P. problem Min such that
(d) ,
42. The objective function for the above question is and
(a) (b)
,
(c) (d)
(a) 2 (b) 8
43. The vertices of a feasible region of the above (c) 10 (d) 12
question are
(a) (0, 18), (36, 0) (b) (0, 18), (10, 13) 51. For the L.P. problem Min such that
(c) (10, 13), (8, 14) (d) (10, 13), (8, 14), (12, and
12)
(a) There is a bounded solution
44. The maximum value of objective function in the
(b) There is no solution
above question is
(c) There are infinite solutions
(a) 100 (b) 92
(c) 95 (d) 94 (d) None of these
45. A factory produces two products A and B. In the 52. On maximizing subject to
manufacturing of product A, the machine and the and
carpenter requires 3 hour each and in ,
manufacturing of product B, the machine and
(a) 380 (b) 382
carpenter requires 5 hour and 3 hour respectively.
The machine and carpenter work at most 80 hour (c) 384 (d) None of these
and 50 hour per week respectively. The profit on A
and B is Rs. 6 and 8 respectively. If profit is

6
 Linear Programming

53. For the L.P. problem Min subject to (a) (b)

and , (c) (d)
61. The maximum value of subject to
(a) 0 (b) 1
constraints and
(c) 2 (d) 1/2
54. For the L.P. problem Min subject to is
and , [MP PET 1994; 95]

(a) –10 (b) –20 (a) 90 (b) 120

(c) 0 (d) 10 (c) 96 (d) 240
55. The point at which the maximum value of 62. The maximum value of such that
subject to the constraints , , , is [MP PET
is obtained, is 1995]
[MP PET 1993] (a) 10 (b) 60
(a) (0, 0) (b) (1.5, 1.5)
(c) 30 (d) None of these
(c) (2, 0) (d) (0, 2)
63. The maximum value of subject to the
constraints ; , is
[MP PET 2001]
(a) 36 (b) 40
56. The minimum value of objective function
(c) 20 (d) None of these
in the given feasible region, is
Y 64. being positive, under constraints
, , has
(a) Finite maximum
(b) Finite minimum
(c) An unbounded minimum solution
O X (d) An unbounded maximum solution
2x+3y=13 x+5y=200 65. By graphical method, the solution of linear
4 programming problem
(a) 134 (b) 40 Maximize
(c) 38 (d) 80
Subject to , , , ,
57. The minimum value of linear objective function
under linear constraints ,
and , is is [MP PET 1996]
(a) 10 (b) 12 (a) (b)
(c) 6 (d) 5
58. The solution for minimizing the function
(c) (d)
under a L.P.P. with constraints ,
, and , is
(a) 66. The point at which the maximum value of
(b) subject to the constraints ,

(c) There are infinitely solutions , is obtained, is

(d) None of these
59. The solution of a problem to maximize the (a) (10, 20) (b) (20, 10)
objective function under the constraints
(c) (15, 15) (d)
, and , is
(a) (b) 67. The maximum value of under the
(c) (d) constraints is
60. To maximize the objective function (a) 3 (b) 3.2
under the constraints (c) 2 (d) 4
and 68. The maximum value of under the
constraints is

7
 Linear Programming

(a) 20 (b) 50
(c) 53 (d) 70
69. The point at which the maximum value of ,
subject to the constraints
, is obtained, is
(a)
(a) (30, 25) (b) (20, 35)
(c) (35, 20) (d) (40, 15) (b)
(c)
70. If , ,
(d)
then the maximum value of , by
2. Inequations and [MP PET
graphical method is
2001]

(a) (b) (a) Have solution for positive x and y

(b) Have no solution for positive x and y
(c) Have solution for all x
(c) (d) 12 (d) Have solution for all y
3. Shaded region is represented by [MP PET 1997]
71. The maximum value of , subject to the Y
constraints , is
[AMU 1999]
(a) 10 (b) 26 Shaded 4x–2y=–3
region A(0,3/2)
(c) 35 (d) 70
72. The maximum value of subject to the
X
constraints and B O
is (-
3/4,0)
[MP PET 2002, 04]
(a) (b)
(a) 120 (b) 140
(c) (d)
(c) 100 (d) 160
4. A Firm makes pents and shirts. A shirt takes 2
73. The minimum value of subject to the hour on machine and 3 hour of man labour while a
constraints , , pent takes 3 hour on machine and 2 hour of man
labour. In a week there are 70 hour machine and
and is [MP PET 2003] 75 hour of man labour available. If the firm
(a) 14 (b) 20 determine to make x shirts and y pents per week,
then for this the linear constraints are
(c) 10 (d) 16
74. The co-ordinates of the point for minimum value of (a)
subject to the conditions (b)
, , is [DCE 2005] (c)
(a) (20, 0) (b) (15, 5)
(d)
(c) (0, 5) (d) (0, 20)
5. For the L.P. problem Min such that
75. The maximum value of , subject to the
conditions is and
[MP PET 2004]
(a) 130 (b) 120
(a) (b)
(c) 40 (d) 140
(c) (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
1. For the following shaded area, the linear respectively. If x units of A and y units of B be
produced, then two linear constraints and iso-
constraints except and , are
profit line are respectively
Y
(a)
x–y=1
2x+y=2

O X 8
x+2y=8
 Linear Programming

(b) 41 a 42 c 43 c 44 c 45 b
(c)
46 a 47 a 48 c 49 b 50 a
(d)
51 c 52 b 53 b 54 a 55 c
7. The L.P. problem Max such that
and 56 d 57 a 58 c 59 a 60 b

has 61 b 62 c 63 d 64 b,d 65 b
(a) One solution (b) Three solution
(c) An infinite no. of solution (d) None of these 66 d 67 b 68 c 69 d 70 a

8. The minimum value of the objective function 71 c 72 b 73 a 74 d 75 d

for linear constraints ,
, , is
(a) 10 (b) 15
Critical Thinking Questions
(c) 12 (d) 8
1 b 2 a 3 b 4 d 5 d
9. The maximum value of subject to the
constraints , 6 c 7 c 8 b 9 d 10 a
; is [MP PET 1998]
(a) 320 (b) 300
(c) 230 (d) None of these

10. Minimize

Subject to : Linear Programming

1. (c) Clearly from graph there is no feasible region.

X2

B(0,3)
is a (L.P.P.) with number of constraints [MP PET
x1+x2=1
1999]
(a) (b) A(0,1)
C(1,0)
X1
O
(c) mn (d)
3x1+x2=3
Y
2. (d)
(0,5)
5x+3y=15
2x+3y=6
(0,2)

(3,0)
Linear programming O
X

1 c 2 d 3 b 4 d 5 b Here (0, 2); (0, 0) and (3, 0) all are vertices of

feasible region. Hence option (d) is correct.
6 b 7 c 8 a 9 d 10 a 3. (b) It is obvious.
11 a 12 b 13 d 14 c 15 d 4. (d) Clearly point (2000, 0) is outside.
X2
16 d 17 b 18 a 19 d 20 b
x1+x2=1500
21 c 22 b 23 b 24 a 25 b (0,1500
)
26 c 27 c 28 a 29 c 30 c (0,1000
) (900,60
0) x2=600
31 b 32 d 33 c 34 c 35 b
(1000,50
0)
36 c 37 b 38 a 39 a 40 c (2000,0) X1
O
(1500,0) x1+2x2=2000

9
 Linear Programming

5. (b) It is fundamental concept.

6. (b) It is obvious.
7. (c) Y

(0,15/2
(0,6) )3x+4y=30
14. (c) Solving and , we get
(0,11/2
) .Y
2x+5y=30

x+2y=11 (15,0
) X 2x+3y=6
O (10,0 (11,0
) )
x+4y=4 (0,2
Obviously, solution set of constraints includes )
(0,1
(12/5,
the point (3, 4). 2/5) X
)O
(3,0 (4,0
Y ) )
8. (a)
Hence a vertex is .

Y
y=2 15. (d)
(0,4.5
) 3x+4y=1
2x+4y= 8
X 3
O (0,1)
x =2 O X
(3/2,0 (6,0)
9. (d) It is a fundamental concept. 16. (d) As shown in graph ) drawn for and
10. (a) Y
the origin included in the area.
Hence the bounded region situated in all four
Y
2x–3y=5 quadrant.
X x+y=1 (0,1
O )
(5/2,
0) x–y=1
(0,– X
5/3) O
(1,0
)

(0,–1)
11. (a) The equations, corresponding to inequalities
17. (b) It is obvious.
and , are 18. (a) It is obvious.
and . So the lines 19. (d) It is a fundamental concept.
represented by these equations are parallel. 20. (b) Y
Hence the graphs are disjoint.
Y
4x–
(0,5) 3y+2=0
2x+3y–
O 5=0 X

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

39. (a) Obviously and

25. (b) It is by definition. .

26. (c) It is a fundamental concept. 40. (c) It is obvious.
27. (c) Obviously, the optimal solution is found on the 41. (a) Obviously and .
line which is parallel to ‘isoprofit line’. Hence it 42. (c) It is obvious.
has infinite number of solution. 43. (c) Hence required feasible region is given by
Y
, and vertices are (8, 14), (10, 13), (10,
(0,8) 0) and (0, 14)
Y
y=6 y=14 (8,14)
(0,14)
(0,6) A B (10,1
x=5 3)

x=1
0
4x+3y=0
3x+4y=24
C
(8,0) X
X O (10,0)
O (5,0) (6,0)
8x+6y=48 44. (c) Max .
28. (a) It is obvious.
29. (c) It is obvious. 45. (b) Obviously
30. (c) In given all equations, the origin is present in .
shaded area, answer (c) satisfy this condition.
46. (a) Obviously and .
31. (b) X2
47. (a) On drawing graph for above question, we get
the isoprofit line .
(0,3) 48. (c) Obviously .
(0,1) 49. (b) Change the inequalities into equations and
(–9,0)
X1 draw the graph of lines, thus we get the
(–1,0) O required feasible region.
If is clear from the graph, the constraints X2
define the unbounded feasible space.
32. (d) It is obvious. x1+2x2=8
33. (c) In linear programming problem, concave  12 14 
(0,4)  , 
C 5 5 
region is not used. Convex region is used in
linear programming. A B
34. (c) The shaded area is the required area given in X1
O (1,0) (8,0)
graph as below. 2x1–x2=2
Y y =x+3

It is a bounded region, bounded by the

x =y

vertices and .
X
O
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
Hence it is in I, II and III quadrant. .
35. (b) Y
50. (a) are vertices of Min z for (2, 0)
X2

(0,6)
(0, 1)
X x1–x2=2
O (3, 0)
–x1+3x2=0
Hence, it is unbounded. (3,1) (9/2, 3/2)
36. (c) It is obvious. X1
37. (b) For maximum profit, z = 40x + 25y. O (2,0) (6,0)
38. (a) Objective function is given by profit function (0,–2) x1
+x2=6
.
Hence .

11
 Linear Programming

51. (c) As there may be infinite values of and

on line .
Max .
X2
60. (b) The objective function is Max .
x2=4
Y

x1+x2=1 B(0,1 x+y=3

x=20
)A(1,0 0 x–y=0
) X1
O
5x1+10x2= C B y=1
0 A
2
52. (b) Here, and D E y=3
X

Y The vertices are ,

and E (20,
3). Hence the maximum value of the objective
x+5y=200
C function will be at (18, 12).
A
(200,0 61. (b) Here,
) X
O B The shaded region represents the feasible
region, hence . Obviously it is
2x+3y=134 maximum atY(12, 6).
Maximum for i.e., z = 40 + 342 = 382.
53. (b) After drawing a graph we get the vertices of
feasible region are (1, 0), (10, 0), (2, 4), (0, 4) 2x+y=30
and (0, 1).
Thus minimum value of objective function is at (0,12 (12,6
(0, 1) ) )
X
O (15,0
Hence ) x+2y=24
54. (a) After drawing the graph, we get the minimum
value of z at points (–5, 0), (0, 1) and (5/4, 5/4) Hence, .
and Min .
62. (c) Obviously, will be maximum at (0,
55. (c) Hence maximum z is at (2, 0). 10).
Y
Y
(0,2) 2x+y=20
(0,20
x+y=2 )
x+2y=20  20 20 
 , 
(2,0) (0,10  3 3 
X
O ) (20,0
P O (10,0 ) X
56. (d) Min z .
)
57. (a) Min .
 .
Y
63. (d) After drawing the graph, we get the points on
the region are (9, 0), (0, 6), (10, 0),(0, 10) and
(0,6
(2,3 (12, –2). But there is no feasible point as no
)
) point satisfying all the inequations
X simultaneously.
O
3x+2y=1 x+3y=1 64. (b,d) It is obvious.
2 1
58. (c) Objective function is same as constraints so
there are infinite solutions possible. X2
65. (b)
x1=4
59. (a)
Y (0, 9)
(0,4 x+y=4 (2,6) x2=6
) (3,1 x–y=2 (0, 6)
) (4, 3)
(4,0
X
O (2,0 )
(0,–2) ) X1
(4, 0) (6, 0)
O
3x1+2x2=1
8
12
 Linear Programming

Max . Obviously it is maximum at (40,

15).
70. (a) The shaded region represent the feasible
Here feasible region has vertices (0, 0); (4, 0); region, hence
(4, 3); (2, 6) and (0, 6). X2

Max z at .
66. (d) Since the points given in(a),(b) and(c) does not 5x1+2x2=10
(0,5
satisfy the given inequalities. )

(0,3 (20/19,45/1
Y 9)
)
(49,0 49x+25y=12 (5,0
X1
) 25 O (2,0 )
3x1+5x2=15
)

(0,20 (50/3,40/3)
)
Obviously it is maximum at
2x+5y=10
0 X
O (25,0 (50,0
) )
Max
Hence, option (d) is correct.

67. (b) Max is at i.e. 3.2. .

Y

71. (c) Change the inequalities into equations and

draw the graph of lines, thus we get the
2x+3y=6
required feasible region.
(0,2)
The region bounded by the vertices
x+4y=4
(0,1) (12/5,2/
and .
5) Y
X
O (3,0) (4,0)
x+y=7
O
(0,7)

68. (c) Max is at i.e. 53. A(0,5) B(4,3)

Y
D(10,0
X
(0,15 O C(7,0) )
) x+2y=1
0
The objective function is maximum at
3x+y=15
and Max .
72. (b) Given,
(0,4)
Y
X
O (5,0) (8,0) x+y=40
x+2y=8
(0,40
)
69. (d) Y A(0,3 B(20,20
2x+y=95 0) )
(0,95
) (60,0
X
This graph O has been draw
C(40,0 ) from given
constraints and maximum
) x+2y=6
value of P will be at
0
A or B or C .
(0,3 (40,1
5) 5)
X
O (95/2,0
) x+2y=70
The shaded region represents feasible region X2
Therefore .
hence
73. (a) (0, 10)

(0, 6) (1, 5)
2x1+7x2=2
2/7 (0, (4, 2)
13
22/7) X1
0(2, 0) (6, 0) (11, 0)
5x1+x2=1 x1+x2=6
 Linear Programming

Clearly the common region of both is true for

positive value of (x, y). It is also true for
positive value of x and negative value of y.
3. (b) Origin is not present in given shaded area, so
satisfy this condition.
4. (d)
Type of Working Man
items time on labour
Obviously, at point (4, 2), the minimum value machine
of . Shirt (x) 2 hours 3 hours
Y
74. (d) Pent (y) 3 hours 2 hours
(0, Availabili 70 hours 75 hours
20) ty
(0, (15, Linear constraints are
y=5
5) 5)
X .
O (20,
0) 5. (d) The graph of linear programming problem is as
Obviously, will be minimum at given below
(0,20) X2
 Min z = 7 × 0 – 8 × 20 = –160.
–x1+2x2=4
75. (d) Y (0,6)
C
(0,3) B(4.5,
x+y=40 (0, 40) A
(1.2,2.6 1.5)
X1
(20,20) (–4,0) O ) (6,0 (9,0)
(0,30) x1+3x2=9
) x1+x2=6
(60,0)
X
O (40,0) Hence the required feasible region is given by
x+2y=60
the graph whose vertices are
Obviously, will be maximum at
and .

 Max = .
Thus objective function is minimum at
Critical Thinking Questions
So and
1. (b) To test the origin for and
.
in reference to shaded area,
6. (c) or
is true for . So for the
region does not include origin (0, 0), and .
. Again for , 7. (c) Objective function is same as constraint so
there are infinite solutions possible.

Similarly for ; 
.
2. (a) Following figure will be obtained on drawing
the graphs of given Yinequations.

X
O (1,0)

(0,–3)
(0,–4)
From

From

14
 Linear Programming

8. (b) Required region is unbounded whose vertex is

. Y

x – y=0

x – 5y = –5
(0,1)  5 5
 , 
 4 4
X

Hence the minimum value of objective

function is .

9. (d) Obviously, it is unbounded. Therefore its

maximum value does not exist.
Y
(0,
3x+2y=16 100)
0

(0, 40)
(80,0) X
x+2y=80
5x+2y=20
0
10. (a) Condition (i),

....................
constraints
Condition (ii),

....................

constraints
 Total constraints = .

15