LINEAR

PROGRAMMING

CHAPTER – 12

LINEAR PROGRAMMING
LINEAR INEQUATION
(iv) If the inequation is  or  , then the point lie on the line
If a, b, c  R, then the equation ax + by = c is called a linear
consider and line is drawn black (bold) or continuous.
equation in two variables x, y whereas inequalities of the form
ax + by  c, ax + by  c, ax + by < c & ax + by > c are called Linear (v) This line divides the plane XOY in two region.
Inequations in two variables x & y. We know that the graph of
the equation ax + by = c is a straight line which divides the xy- To find the region that satisfies the inequation, we apply the
plane into two parts following rules-
(i) ax + by  c (ii) ax + by  c. These two are known as the half (a) Choose a point [If possible (0, 0)] not lying on this line.
spaces.
In set form {(x, y) : ax + by = c} is the straight line whereas, (b) Substitute its coordinates in the inequation. If the
sets {(x, y) : ax + by  c} and {(x, y) : ax + by  c} are closed inequation is satisfied, then shade the portion of the plane
half spaces and the sets {(x, y) : ax + by < c} and {(x, y) : ax + which contains the chosen point, otherwise shade the
by > c} are open half spaces. These half spaces are also portion which does not contain this point. The shaded
known as the solution sets of the corresponding inequation. portion represents the solution set.

GRAPHS OF LINEAR IN EQUATIONS Note

Consider a linear inequation ax + by  c. Drawing the graph of a linear
In case of inequations ax + by  c and ax + by  c points
inequation means finding its solution set.
on the line are also a part of the shaded region while
Steps to draw the graph:
in case of ax + by < c and ax + by > c points on the line
To draw the graph of an equation, following procedures are to be
made- ax + by = c are not included in the shaded region.
(i) Write the inequation ax + by  c into an equation ax +
SIMULTANEOUS LINEAR INEQUATION IN TWO
by = c which represent a straight line in xy-plane.
VARIABLES
(ii) Put y = 0 in ax + by = c to get point where the line meets Since the solution set of a system of simultaneous linear
x- axis. Similarly, put x = 0 to obtain a point where the inequation is the set of all points in two dimensional space which
line meets y- axis. Join these two points to obtain the satisfy all the inequations simultaneously. Therefore to find the
graph of the line. solution set we find the region of the plane common to all the
(iii) If the inequation is > or <, then the points lie on this line portions comprising the solution sets of given inequations. In
does not consider and line is drawn dotted or case there is no region common to all the solution of the given
discontinuous. inequations, we say that the solution set is void or empty.
FEASIBLE REGION This method is based upon a theorem, called extreme point
The limited (bounded) region of the graph made by two theorem, which is stated as follows-
inequations is called Feasible Region. All the coordinates of the
Extreme Point Theorem: If a L.P.P. admits an optimal solution,
points in feasible region constitutes the solutions of system of
then at least one of the extreme (or corner) points of the
inequations.
feasible region gives the optimal solution.
LINEAR PROGRAMMING PROBLEMS Working Rule:
Linear Programming is a device to optimize the results which (i) Find the solution set of the system of simultaneous linear
occurs in business under some restrictions. A general Linear inequations given by constraints and non- negativity
Programming problem can be stated as follows: restrictions.
Given a set of m linear inequalities or equations in n variables, (ii) Find the coordinates of each of corner points of the
we wish to find non- negative values of these variables which will feasible region.
satisfy these inequalities or equations and maximize or minimize
(iii) Find the values of the objective function at each of the
some linear functions of the variables.
corner points of the feasible region.
The general form of Linear Programming Problems ( L.P.P.) is-
(ii) Find the coordinates of each of corner points of the
Maximize (Minimize) z = c1x1 + c2x2 + .....+ cnxn subjected to
feasible region.
a11 x1 + a12 x2 +......+ a1n xn {, =, } b1 (iii) Find the values of the objective function at each of the
a21 x1 + a22 x2 + ......+ a2n xn {, =, } b2 corner points of the feasible region. By extreme point
......................................................... theorem one of the corner points will provide the optimal
am1 x1 + am2 x2 +......+ amn xn{, =, } bn value of the objective function. The coordinates of that
corner point determine the optimal solution of the L.P.P.
and x1,x2, x3,........, xn  0
(i) If it is not possible to determine the point at which the
where x1, x2, x3, ....xn are the variables whose values are to suitable solution found, then the solution of problem is
be determined and are called the decision variables. unbounded.
The inequation are called constraints and the function to be (ii) If feasible region is empty, then there is no solution for the
maximized or minimized is called the objective function. problem.
(iii) Nearer to the origin, the objective function is minimum and
SOME DEFINITIONS
that of further from the origin the objective function is
(i) Solution : A set of values of the decision variables which
maximum.
satisfy the constraints of a Linear Programming Problem
(L.P.P.) is called a solution of the L.P.P. CONVEX SETS
(ii) Feasible Solution : A solution of L.P.P. which also satisfy In linear programming problem mostly feasible solution is a
the non- negative restrictions of the problem is called the polygon in first quadrant this polygon is a convex. It means
feasible solution. that if two points of polygon are connecting by a line then
(iii) Optimal Solution : A feasible solution which maximize or the line must be inside to polygon.
minimize i.e. which optimize the objective function of
L.P.P. called an optimal solution. Example

Note

A Linear Programming Problem may have many (i) (ii)

optimal solution. If a L.P.P. has two optimal solution,
then there are an infinite number of optimal A

solutions. A
(iii) (iv)
B B
(iv) Iso-Profit Line: The line is drawn in geometrical area of
feasible region of L.P.P. for which the objective function
remains constant at all the points lie on this line, is called
iso-profit line. Figure (i) and (ii) are convex set while (iii) & (iv) are not
GRAPHICAL METHOD OF SOLUTION OF LINEAR convex set. It can be easily seen that the intersection of two
PROGRAMMING PROBLEMS convex sets is a convex set and the set of all feasible
The graphical method for solving linear programming problems solutions of a LPP is also a convex set..
is applicable to those problems which involve only two variables.
 QUESTIONS
(c) A relation between the variables
MCQ (d) None of these

Q1. Which of the following is true for the LPP Q7. A set of values of decision variables which satisfies the
5𝑥 + 2𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0 : linear constraints and non-negativity conditions of a L.P.P.
(a) The region is bounded is called its
(b) The region is unbounded (a) Unbounded solution (b) Optimum solution
(c) Feasible solution, (d) None of these
(c) Can’t be determined
(d) None Q8. A small firm manufactures necklaces and bracelets. The
total number of necklaces and bracelets that it can handle
Q2. Solve the LPP:
per day is at most 24. It takes one hour to make a bracelet
Minimize 𝑍 = 200𝑥 + 500𝑦 subjected to
and half an hour to make a necklace. The maximum
𝑥 + 2𝑦 ≥ 10
3𝑥 + 4𝑦 ≤ 24 number of hours available per day is 16.If the profit on a
𝑥 ≥ 0, 𝑦 ≥ 0 necklace is ₹100 and that on a bracelet is ₹300. Formulate
(a) 2000 (b) 2500 an LPP for finding how many of each should be produced
(c) 2300 (d) 3000 daily to maximize the profit? It is being given that at least
one of each must be produced.
Q3. Old hens can be bought for Rs 2.00 each and young ones (a) 𝑀𝑎𝑥 𝑍 = 100𝑥 + 300𝑦 , 𝑠. 𝑡 𝑥 + 𝑦 ≤ 24 , 2𝑥 + 𝑦 ≤
at Rs 5.00 each. The old hens lay 32 , 𝑥 + 1 ≥ 0 , 𝑦 + 1 ≥ 0
3 eggs per week and the young hens lay 5 eggs per week, (b) 𝑀𝑎𝑥 𝑍 = 100𝑥 + 300𝑦 , 𝑠. 𝑡 𝑥 + 𝑦 ≤ 24 ,2𝑥 + 𝑦 ≥
each egg being worth 30 paise. A hen costs ₹ 1.00 per 32 , 𝑥 − 1 ≥ 0 , 𝑦 − 1 ≥ 0
week to feed. A man has only ₹ 80" to spend for hens. (c) 𝑀𝑎𝑥 𝑍 = 100𝑥 + 300𝑦 , 𝑠. 𝑡 𝑥 + 𝑦 ≤ 24 ,2𝑥 + 𝑦 ≤
Formulate the problem for maximum profit per week, 32 , 𝑥 ≥ 0 , 𝑦 ≥ 0
assuming that he cannot house more than 20 hens. (d) 𝑀𝑎𝑥 𝑍 = 100𝑥 + 300𝑦 , 𝑠. 𝑡 𝑥 + 𝑦 ≤ 24 2𝑥 + 𝑦 ≤
5𝑦−𝑥 32 , 𝑥 − 1 ≥ 0 , 𝑦 − 1 ≥ 0
(a) Maximize 𝑍 = s t: 𝑥 ≥ 0, 𝑦 ≥ 0, 𝑥 + 𝑦 ≤
10
20 and 2𝑥 + 5𝑦 ≤ 80 Q9. Minimize Z=3x+2y subject to the constraints:
5𝑦+𝑥
(b) Maximize 𝑍 = s t: 𝑥 + 𝑦 ≤ 20 and 2𝑥 + 5𝑦 ≤ 𝑥 + 𝑦 ≥ 8,3𝑥 + 5𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0
10
80 The point at which the optimal solution will exist is:
5𝑦−𝑥 (a) (0,8) (b) (0,3)
(c) Maximize 𝑍 = s t: 𝑥 ≥ 0, 𝑦 ≥ 0, 𝑥 − 𝑦 ≤
10 (c) (0,0) (d) None
20 and 2𝑥 + 5𝑦 ≤ 80
5𝑦−𝑥
(d) Maximize 𝑍 = 10 s t: 𝑥 + 𝑦 ≤ 20 and 2𝑥 + 5𝑦 ≤ Q10. Minimize and Maximize 𝑧 = 5𝑥 + 2𝑦 subject to :
𝑥 − 2𝑦 ≤ 2, 3𝑥 + 2𝑦 < 12, − 3𝑥 + 2𝑦 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥
80 0
Q4. Feasible region in the set of points which satisfy The optimal solutions for the above LPP is:
(a) The objective functions (a) 0 , 10 respectively (b) 3, 15 respectively
(b) Some the given constraints (c) 0 , 19 respectively (d) 3 , 19 respectively
(c) All of the given constraints Q11. A manufacturer produces nuts and bolts. It takes 1 hour
(d) None of these of work on machine A and 3 hours on machine B to
produce a package of nuts. It takes 3 hours on machine A
Q5. Of all the points of the feasible region for maximum or and 1 hour on machine B to produce a package of bolts.
minimum of objective function the points He earns a profit of ₹ 35 per package of nuts and ₹ 14 per
(a) Inside the feasible region package of bolts. How many packages of each should be
(b) At the boundary line of the feasible region produced each day so as to maximize his profit, if he
(c) Vertex point of the boundary of the feasible region operates each machine for at most 12 hours a day?
(d) None of these Convert it into an LPP and solve graphically. How many
nuts and bolts should be produced daily to maximize the
Q6. Objective function of a linear programming problem is
profit?
(a) a constraint
(a) 4 nuts and 4 Bolts (b) 3 nuts and 3 Bolts
(b) function to be optimized
(c) 5 nuts and 5 Bolts (d) 2 nuts and 2 Bolts
Q12. Two tailors A and B earn ₹ 150 and ₹ 200 per day (c) 19 (d) 25
respectively. A can stitch 6 shirts and 4 pants per day,
Q19. Maximize Z = 4x + 9y, subject to the constraints 𝑥 ≥
while B can stitch 10 shirts and 4 pants per day. Form a
0, 𝑦 ≥ 0, 𝑥 + 5𝑦 ≤ 200,2𝑥 + 3𝑦 ≤ 134.
L.P.P. to minimize the labour cost.
(a) 𝑀𝑎𝑥 𝑧 = 150𝑥 + 200𝑦 s.t 𝑥 ≥ 0, 𝑦 ≥ 0 , 3𝑥 + 5𝑦 ≥ (a) 360 (b) 0
30, 𝑥 + 𝑦 ≥ 8 (c) 268 (d) 382
(b) 𝑀𝑖𝑛 𝑧 = 150𝑥 + 200𝑦 s.t 𝑥 ≥ 0, 𝑦 ≥ 0 , 3𝑥 + 5𝑦 ≥ Q20. Find the minimum value of Z = 3x + 5y, subject to the
30, 𝑥 + 𝑦 ≥ 8 constraints −2𝑥 + 𝑦 ≤ 4, 𝑥 + 𝑦 ≥ 3, 𝑥 − 2𝑦 ≤ 2, 𝑥 ≥
(c) 𝑀𝑎𝑥 𝑧 = 150𝑥 + 200𝑦 s.t 3𝑥 + 5𝑦 ≥ 30, 𝑥 + 𝑦 ≥ 0, 𝑦 ≥ 0
8 (a) 20 (b) 15
(d) 𝑀𝑎𝑥 𝑧 = 150𝑥 + 200𝑦 s.t 𝑥 ≤ 0, 𝑦 ≤ 0 , 3𝑥 + 5𝑦 ≤ 29
(c) 3 (d) None
30, 𝑥 + 𝑦 ≤ 8
Q13. Solve the following problem graphically: Maximize 𝑍 = Q21. Maximize Z = 3x + 5y, subject to the constraints 𝑥 + 2𝑦 ≤
5𝑥 + 2𝑦 subject to the constraints 3𝑥 + 5𝑦 ≤ 15,5𝑥 + 2000, 𝑥 + 𝑦 ≤ 1500, 𝑦 ≥ 0, 𝑦 ≤ 600, 𝑥 ≥ 0
2𝑦 ≤ 10, 𝑥, 𝑦 ≥ 0 (a) 0 (b) 3000
(a) 𝑍 = 0 𝑎𝑡 (0,0) (b) 𝑍 = 10 𝑎𝑡 (2,0) (c) 5400 (d) 5500
20 45
(c) 𝑍 = 10 𝑎𝑡 ( , ) (d) None Q22. Mr. Das wants to invest ₹12000 in public provident fund
19 19
(PPF) and in national bonds. He has to invest at least
Q14. Solve the following problem graphically: Minimize 𝑍 =
₹1000 in PPF and at least ₹2000in bonds. If the rate of
3𝑥 + 5𝑦 subject to the constraints 𝑥 + 𝑦 = 6, 𝑥 ≤ 4, 𝑦 ≤
interest on PPF is 12% per annum and that on bonds is
5, 𝑥 ≥ 0, 𝑦 ≥ 0
(a) 20 (b) 21 15% per annum, how should he invest the money to earn
(c) 28 (d) 25 maximum annual income?
(a) Rs.1000 in PPF and Rs.11000 in national bonds
Q15. Solve the following problem graphically: Maximize 𝑍 = (b) Rs.1000 in PPF and Rs.2000 in national bonds
2𝑥 + 3𝑦 subject to the (c) Rs.10000 in PPF and Rs.2000 in national bonds
constraints 𝑥 + 𝑦 ≤ 1,2𝑥 + 2𝑦 ≥ 6, 𝑥 ≥ 0, 𝑦 ≥ 0 (d) None
(a) Unbounded region (b) No feasible region
(c) 9 (d) 6 Q23. A small firm manufactures necklace and bracelets. The
total number of necklace and bracelet that it can handle
Q16. Solve the following problem graphically: Maximize 𝑍 = per day is at most 24. It takes 1 hour to make a bracelet
𝑥 + 2𝑦 subject to the constraints 𝑥 − 𝑦 ≥ 0,2𝑦 ≤ 𝑥 +
and half an hour to make a necklace. The maximum
2, 𝑥, 𝑦 ≥ 0
number of hours available per day is 16. If the profit on a
(a) Unbounded region (b) No feasible region
necklace is ₹100 and that on a bracelet is ₹300, how many
(c) 0 (d) 6
of each should be produced daily to maximize the profit?
Q17. A manufacturer produces two types of steel trunks. He It is being given that at least one of each must be
has two machines A and B. The first type of trunk requires produced.
3 ours on machine A and 3 hours on machine B. The (a) 2 necklaces and 2 bracelets
second type of trunk requires 3 hours on machine A and (b) 2 necklaces and 15 bracelets
2 hours on machine B. Machines A and B can work at most (c) 16 necklaces and 8 bracelets
for 18 hours and 15 hours per day respectively. He earns (d) 23 necklaces and 1 bracelet
a profit of ₹30 and ₹25 per trunk of the first type and
second type respectively. Form an LPP for how many Q24. A firm is engaged in breeding pigs. The pigs are fed on
trunks of each type must he make each various products grown on the farm. They need certain
day to make maximum profit? nutrients, named as X,Y,Z. the pigs are fed on two
(a) Max Z=30x+25y s.t x +y≤ 6,3𝑥 + 2𝑦 ≤ 15 , 𝑥 ≥ products, A and B. One unit of product A contain 36 unit
0 ,𝑦 ≥ 0 of X, 3 units of Y and 20 units of Z, while one unit of
(b) M in Z=30x+25y s.t x +y≤ 6,3𝑥 + 2𝑦 ≤ 15 , 𝑥 ≥ product B contain 6 units of X, 12 units of Y and 10 units
0 ,𝑦 ≥ 0 of Z. the minimum requirement of X, Y, Z are 108 units, 36
(c) Max Z=30x+25y s.t x +y≥ 6,3𝑥 + 2𝑦 ≥ 15 , 𝑥 ≥ units and 100 units respectively. Product A costs ₹20 per
0 ,𝑦 ≥ 0 unit and product B costs ₹40 per unit. How many units of
(d) Min Z=30x+25y s.t x +y≥ 6,3𝑥 + 2𝑦 ≥ 15 , 𝑥 ≤ each product must be taken to minimize the cost?
0 ,𝑦 ≤ 0 (a) 0 units of fertilizer A and 18 units of fertilizer B
Q18. Find the maximum value of Z = 7X + 7Y,subject to the (b) 4 units of fertilizer A and 2 units of fertilizer B
constraints. x ≥ 0, y ≥ 0, x + y ≥ 2 and 2x + 3y ≤ 6. (c) 2 units of fertilizer A and 6 units of fertilizer B
(a) 21 (b) 20 (d) 12 units of fertilizer A and 0 units of fertilizer B
Q25. A dietician wishes to mix two types of food, X and Y, in and that rice contains 100 grams of protein and 30
such a way that the vitamin contents of the mixture milligrams of iron per kilogram, find the minimum cost
contains at least 8 units of vitamin A and 10 units of producing this new cereal if bran costs ₹5 per kilogram
vitamin C. Food X contains 2 units/kg of vitamin A and 1 and rice costs ₹4 per kilogram.
unit /kg of vitamin C, while food Y contains 1 unit/kg of (a) 4.8 (b) 5.1
vitamin A and 2 units/kg of vitamin C. It costs ₹5 per kg to (c) 4.6 (d) 5.5
purchase the food X and ₹7 per kg to purchase the food
Q30. Maximize = 60x + 15y, subject to the constraints 𝑥 + 𝑦 ≤
Y. Determine the minimum cost of such a mixture.
50,3𝑥 + 𝑦 ≤ 90, 𝑥, 𝑦 ≥ 0
(a) 56 (b) 28
(a) 1500 (b) 750
(c) 58 (d) 38
(c) 0 (d) 1800
Q26. A diet for a sick person must contain at least 4000 units
SUBJECTIVE QUESTIONS
of vitamins, 50 units of mineral and 1400 calories. Two
food, A and B, are available at a cost of ₹4 and ₹3 per unit
Q1. Graph the solution set of the following inequations:
respectively. If one unit of A contains 200 units of
x + y  40
vitamins, 1 unit of mineral and 40 calories, and 1 unit of B
contains 100 units of vitamins, 2 units of mineral and 40 x + 2y  60
calories, find what combination of foods should be used and x, y  0.
to have the least cost. Q2. A vertex of the linear inequalities 2x + 3y  6, x + 4y  4
(a) 0 units of food A and 140 units of food B and x, y  0, is-
(b) 20 units of food A and 30 units of food B
(c) 5 units of food A and 30 units of food B Q3. Find the minimum value of z = 2x1 – 10x2 subjected to
(d) None constraints x1 – x2  0, x1 – 5x2  – 5 & x1 , x2  0
Q27. A housewife wishes to mix together two kinds of food, X Q4. Find the maximum value of Max. z = 6x1 + 10x2
and Y, in such a way that the mixture contains at least 10
subject to 3x1 + 5x2  13
units of vitamin A, 12 units of vitamin B and 8 units of
vitamin C. The vitamin contents of 1 kg of each food are 5x1 + 3x2  15 And x1, x2  0
given below.
Q5. Find the maximum value of z = 3x1 + 2x2 , Subject to x1 +
Vitamin A Vitamin B Vitamin C x2  1 x2 – 5x1  0
Food X 1 2 3
5x2 – x1  0 x1 – x2  –1
Food Y 2 2 1
x1 + x2  6 x1  3
If 1 kg of food X cost ₹6 and 1 kg of food Y costs ₹10, find and x1  0 , x2  0
the minimum cost of the mixture which will produce the
diet. NUMERICAL TYPE QUESTIONS
(a) 80 (b) 56
(c) 60 (d) 52
Q1. The maximum value of Max. z = 5x1 + 7x2 subjected to
Q28. A manufacture produces two types of steel trunks. He has x1 + x2 < 4 , 3x1 + 8x2 < 24 ,10x1 + 7x2 < 35 and x1 > 0,
two machines, A and B. The first type of trunk requires 3 x2 > 0 ______.
hours on machine A and 3 hours on machine B. The
second type required 3 hours on machine A and 2 hours Q2. The maximum value of max. z = 3x1 + 4x2 subject to
on Machine A and 2 hours on machine B. Machine A and 5x1 + 4x2  200 , 3x1 + 5x2  150 , 5x1 + 4x2  100 , 8x1
B can work at most for 18 hours and 15 hours per day
respectively. He earns a profit of ₹30 and ₹25 per trunk of + 5x2  80 and x1 , x2  0 __________.
the first type and second type respectively. How may
Q3. The minimum value of P = 6x + 16 y subject to constraints
trunks of each type must he make each day to make the
x  40, y  20 and x ,y  0 is _______.
maximum profit?
(a) 3 trunks of each type (b) 5 trunks of each type Q4. If 3x1 + 5x2  15 , 5x1 + 2x2  10 , x1, x2  0 , then the
(c) 6 trunks of each type (d) 2 trunks of each type maximum value of 5x1 + 3x2 _________-.
Q29. Kellogg is a new cereal formed of a mixture of bran and
Q5. To maximize the objective function z = 2x + 3y under the
rice, that contains at least 88 grams of protein and at least
constraints x + y  30, x – y  0, y  12, x  20, y  3 and
36 milligrams of iron. Knowing that bran contains 80
x, y  0, is at (x , y) then x + y = ______.
grams of protein and 40 milligrams of iron per kilograms,
 (d) A is false but R is true
TRUE AND FALSE
Q1. Assertion (A) : The graph of inequations 3x + 2y  6
Q1. A solution of L.P.P. which also satisfy the non- negative and 6x + 4y  20, are disjoint.
restrictions of the problem is called the non feasible Reason(R):The equations, corresponding to
solution. inequalities 3x + 2y  6 and 6x + 4y  20, are 3x + 2y = 6
Q2. A feasible solution which maximize or minimize i.e. which and 6x + 4y= 20. So the lines represented by these
optimize the objective function of L.P.P. called an optimal equations are parallel.
solution.
Q2. Assertion (A) : Inequation y – x  0 represents the half
Q3. The line is drawn in geometrical area of feasible region of plane that contains the negative x-axis
L.P.P. for which the objective function remains constant Reason (R): The position of points O (0,0) and P (2, –2)
at all the points lie on this line, is called iso-profit line. in the region of graph of inequations 2x – 3y < 5, will be
inside and outside respectively.
Q4. is convex set Q3. Assertion (A) : The solution set of the inequation 2x +
y > 5 is open half plane not containing the origin.
Q5. The linear inequations or inequalities or Reason(R): The vertex of common graph of inequalities
restriction on the variables of a linear 5 4
2x + y  2 and x – y  3, is  , − 
programming problem are constraints.
3 3
Q4. Assertion (A) : The region represented by the
ASSERTION AND REASONING inequation system x, y  0, y  6, x + y  3, is unbounded
in first quadrant
Directions: (Q1 -5) In the following questions , A Reason (R): In equations 3x – y > 3 and 4x – y > 4 is true
statement of Assertion (A) is followed by a statement for positive value of x and negative value of y .
of Reason (R).
(a) Both A and R are true but R is the correct Q5. Assertion (A) : The bounded region for inequations x
explanation of A + y  1 and x – y  1 is situated all the four quadrants
(b) Both A and R are true but R is Not the correct Reason(R): The graph of inequations x  y and y > x +
explanation of A 3 located in II, III quadrants
(c) A is true but R is false
HOMEWORK
(b) bounded in first quadrant
MCQ (c) unbounded in first quadrant
(d) None of these
Q1. For the following feasible region, the linear constraints
are- Q3. A wholesale merchant wants to start the business of
cereal with Rs.24,000. Wheat is Rs.400 per quintal and
Y
rice is Rs.600 per quintal. He has capacity for store 200
quintal cereal. He earns the profit Rs.25 per quintal on
wheat and Rs.40 per quintal on rice. If he store x quintal
rice and y quintal wheat, then for maximum profit the
objective function is -
O X (a) 25x + 40y (b) 40x + 25y
x + 3y = 11
400 600
3x + 2y = 12 (c) 400x + 600y (d) x+ y
40 25
(a) x  0, y  0, 3x + 2y  12, x + 3y  11
Q4. For the constraint of a linear optimizing function z = x1 +
(b) x  0, y  0, 3x + 2y  12, x + 3y  11
(c) x  0, y  0, 3x + 2y  12, x + 3y  11 x2, given by x1 + x2  1, 3x1 + x2  3 and x1, x2  0-
(d) None of these (a) There are two feasible regions
Q2. The region represented by 2x + 3y – 5  0 and 4x – 3y + 2 (b) There are infinite feasible regions
 0, is- (c) There is no feasible region
(a) not in first quadrant (d) None of these
Q5. On maximizing z = 4x + 9y subject to x + 5y  200, 2x + 3y x y
+  1, x, y  0 is obtained is-
 134 and x, y  0, then z = 25 40
(a) 380 (b) 382
(c) 384 (d) None of these Q5. The solution of a problem to maximize the objective
function z = x + 2y under the constraints x –y  2, x + y  4
Q6. For the L.P. problem Min. z = – x1 + 2x2 such that – x1 + and x, y  0, is-
3x2  0, x1 + x2  6, x1 – x2  2 and x1, x2  0, then x1 =
(a) 2 (b) 8 NUMERICAL TYPE QUESTIONS
(c) 10 (d) 12
Q1. Maximize Z= 3x + 4y subject to 2x + 2y ≤ 80 ,
Q7. The intermediate solutions of constraints must be
2x + 4y ≤ 120 ______.
checked by substituting them back into-
(a) object function (b) constraint equations Q2. Minimize Z = 2x + 4y subject to x + y ≥ 8 , x +
(c) not required (d) None of these 4y ≥ 12 , x ≥ 3 , y ≥ 2 _________-
Q8. The maximum value of Z = 4x + 2y subjected to the Q3. Minimize Z = 30x + 20y subject to x + y ≤ 8 , x
constraints 2x + 3y  18, x + y  10; x, y  0, is- + 4y ≥ 12 , 5x + 8y = 20 , x ,y ≥ 0.______.
(a) 36 (b) 40
Q4. Maximize Z = 3x + 3y , if possible , subject to
(c) 20 (d) None of these
the constraints x – y ≤ 1 , x + y ≥ 3 , x , y ≥
Q9. For the L.P. problem Min z = 2x1 + 3x2 such that –x1 + 2x2 0________-.
 4, x1 + x2  6, x1 + 3x2>9 and x1, x2  0 Q5. The minimum value of 3 x + 5y subject to the
(a) x1 = 1.2 (b) x2 = 2.6 constraints -2x + y ≤ 4 , x + y ≥ 3 , x – 2y ≤2 ,x
(c) z = 10.2 (d) All the above , y ≥ 0 _______.

Q10. For the L.P. problem Min z = x1 + x2 such that 5x1+10x2 TRUE AND FALSE
 0, x1+ x2  1, x2  4 and x1, x2  0
(a) there is a bounded solution Q1. A set of values of the decision variables which
(b) there is no solution satisfy the constraints of a linear programming
©there are infinite solutions problem (LPP) is called a solution of the LPP.
(d) None of these Q2. There is a method to solved a linear
programming problem graphically i.e., Non
SUBJECTIVE QUESTIONS corner – point method.
Q3. The linear function Z which is to be maximized
Q1. For the constraints of a L.P. problem given by x1 + 2x2  or minimized is called the objective function.
2000, x1 + x2  1500, x2  600 and x1, x2  0, which one Q4. A solution of a LPP is an infeasible solution, if
of the following points does not lie in the positive it does not satisfy the non- negativity
bounded region- restriction.
Q2. A firm makes pants and shirts. A shirt takes 2 hours on Q5. An optimal solution of a LPP , if it exists ,
machine and 3 hours of man labour while a pent takes 3 occurs at one of the extreme (corner ) points
hours on machine and 2 hours of man labour. In a week of the convex polygon of the set of all feasible
there are 70 hours machine and 75 hours of man labour solution.
available. If the firm determine to make x shirts and y
pants per week, then for this the linear constraints are-
Q3. Mohan wants to invest the total amount of Rs. 15,000 in ASSERTION AND REASONING
saving certificates and national saving bonds. According
to rules, he has to invest at least Rs. 2000 in saving Directions: (Q1 -5) In the following questions , A
certificates and Rs. 2500 in national saving bonds. The statement of Assertion (a) is followed by a
interest rate is 8% on saving certificate and 10% on statement of Reason (R).
national saving bonds per annum. He invest Rs. x in saving (a) Both A and R are true but R is the correct
certificates and Rs. y in national saving bonds. Then the explanation of A
objective function for this problem is (b) Both A and R are true but R is Not the correct
explanation of A
Q4. The point at which the maximum value of x + y subject to (c) A is true but R is false
the constraints 2x + 5y  100, (d) A is false but R is true
 A Q4. Assertion (a): there is no region common to all the
Q1. Assertion (a): is not a convex set solution of the given inequations, we say that the solution
B set is non empty
Reason (R): The limited (bounded) region of the graph
made by two inequations is called Feasible Region.
Reason(R): is not a convex set Q5. Assertion (a): The general form of Linear
Programming Problems ( L.P.P.) is-
Q2. Assertion (a): A set of values of the decision variables Maximize (Minimize) z = c1x1 + c2x2 + .....+ cnxn
which satisfy the constraints of a Linear Programming subjected to
Problem (L.P.P.) is called a solution of the L.P.P. a11 x1 + a12 x2 +......+ a1n xn {, =, } b1
Reason (R): A Linear Programming Problem have only a21 x1 + a22 x2 + ......+ a2n xn {, =, } b2
two optimal solution.
.........................................................
Q3. Assertion (a): The graph of the equation ax + by = c is am1 x1 + am2 x2 +......+ amn xn{, =, } bn
a straight line which divides the xy-plane into two parts and x1,x2, x3,........, xn  0
known as the half spaces.
Reason(R): In set form {(x, y) : ax + by = c} is the straight Reason(R): Where x1, x2, x3, ....xn are the variables
line whereas, sets {(x, y) : ax + by  c} and {(x, y) : ax + by whose values are to be determined and are called the
 c} are closed half spaces and the sets {(x, y) : ax + by < c} decision variables. The inequation are called constraints
and {(x, y) : ax + by > c} are open half spaces and the function to be maximized or minimized is called
the objective function.

SOLUTIONS
(0,6) 3000
MCQ Hence, the minimum value of Z is 2300" is at the point
(4,3).
S1. (a)
S3. (a) Let ‘ x" ‘ be the number of old hens and ‘ y ‘ the
number of young hens.
30
Profit =(3x+5y)100 − (𝑥 + 𝑦) … (1)
9𝑥 3
= 10 + 2 𝑦x − y
𝑦 𝑥 5𝑦−𝑥
= 2 − 10 = 10
∴LPP is:
5𝑦−𝑥
Maximize 𝑍 = 10 subject to:
𝑥 ≥ 0, 𝑦 ≥ 0, 𝑥 + 𝑦 ≤ 20 and 2𝑥 + 5𝑦 ≤ 80
S4. (c) (c) All of the given constraints
S5. (c) (c) Vertex point of the boundary of the feasible
region
The above region is bounded.
S6. (b) (b) function to be optimized
S2. (c) Let us draw the graph of x+2y=10 and 3x+4y=24
S7. (c) Feasible solution
S8. (d) Let ‘x’ necklaces and ‘y’ bracelets be manufactured
per day.
Then LPP problem is:
Maximize Z = 100x+300y
Subject to the constraints: 𝑥 + 𝑦 ≤ 24,
1
𝑥 + (2) 𝑦 ≤ 32 ⇒ 2𝑥 + 𝑦 ≤ 32
And 𝑥 ≥ 1 , 𝑦 ≥ 1 ⇒ 𝑥 − 1 ≥ 0 , 𝑦 − 1 ≥ 0
S9. (d) The graph for the LPP:
Corner Point Value of Z Minimize Z=3x+2y subject to the constraints:
(0,5) 2500 𝑥 + 𝑦 ≥ 8,3𝑥 + 5𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0
(4,3) 2300(Minimum)
 Corner Point Value of Z
(0,0) 0
(4,0) 140
(3,3) 147(Maximum)
(0,4) 56
Hence, the minimum value of Z is 147 is at the point
(3,3)i.e 3 nuts and 3 Bolts
S12. (a) Let the tailor A work for ‘x’ days and B for ‘y’ days.

Clearly, there is no feasible region thus there is no

solution. We have the following constraints:
𝑥 ≥ 0 … (1)
S10. (c) The graph of the LPP is:
𝑦 ≥ 0 … (2)
6𝑥 + 10𝑦 ≥ 60
i.e. 3𝑥 + 5𝑦 ≥ 30 … (3)
4𝑥 + 4𝑦 ≥ 32
i.e. 𝑥 + 𝑦 ≥ 8 … (4)
The objective function, or the cost Z is:
Z = 150x + 200 y s.t constraint (1)-(4) follow.
S13. (d) Plotting the given LPP we get:

Corner Point Value of Z

O (0,0) 0(Minimum)
A (2,0) 10
7 3
H(2 , 4) 19(Maximum)
3 15
G(2 , 4 ) 15
3
F(0, 2) 3
7 3
Hence, 𝑍𝑚𝑎𝑥 = 19 at (2 , 4) and 𝑍𝑀𝑖𝑛 = 0 at (0,0) Calculating 𝑍 at different corner points we get:
𝑍 = 0 𝑎𝑡 (0,0) , 𝑍 = 10 𝑎𝑡 (2,0) , 𝑍 = 10 𝑎𝑡
S11. (b) Let ‘x’ and ‘y’ be the number of packages of nuts 20 45
( , ) , 𝑍 = 6 𝑎𝑡 (0,3)
19 19
and bolts respectively.
Thus, we have multiple optimal solutions.
We have the following constraints:
𝑥 ≥ 0 … (1) S14. (c) The graph of the LPP is:
𝑦 ≥ 0 … (2)
𝑥 + 3𝑦 ≤ 12 … (3)
3𝑥 + 𝑦 ≤ 12 … (4)
Now the profit= 35x+ 14y …. (5)
We are to maximize P subject to constraints (1) -(4).
The graph of the above LPP is:

Here the feasible region in the line segment AB,

with corner points A (1,5) and B (4,2).
At these corner points the value of Z is 28 and 22
respectively.
Hence the optimal solution is 28 at x=4, y=2.
S15. (b) The graph for the LPP:

The corner points of the feasible region is A (0,2), B

(2,0), C (3,0). The values of Z at the following points
As there is no point satisfying the given conditions, are
the problem is infeasible.
Corner point Z = 7x + 7y
S16. (a) The graph of the LPP is: A(0 , 2) 14
B(2 , 0) 14
C(3,0) 21 Maximum

The maximum value of Z is 21 at point C (3,0).

S19. (d) The feasible region determined by the constraints

𝑥 ≥ 0, 𝑦 ≥ 0, 𝑥 + 5𝑦 ≤ 200,2𝑥 + 3𝑦 ≤ 134 is given
by

We note that the feasible region is unbounded.

At the corner points
(0,0) Z=0
(2,2) Z=6
But as the feasible region is unbounded, we cannot
say whether the largest value 6 is maximum or not.
S17. (a) Let x and y be the number of steel trunks of first
type and second type produced by the
manufacturer. As the profit on the first type of trunk
is ₹30 and on the second type of trunk is ₹25, so the
total profit " Z=30x+25y(₹). The corner points of feasible region are A(10,38),
Hence, the problem can be formulated as an B(0,40) ,C(0,0), D(67,0) . The values of Z at the
L.P.P. as follows : following points are
Maximize 𝑍& = 30𝑥 + 25𝑦
Corner point Z = 4x + 9y
3𝑥 + 3𝑦& ≤ 18 i.e. 𝑥 + 𝑦 ≤ 6
3𝑥 + 2𝑦& ≤ 15 A(10 , 38) 382 Maximum
𝑋 ≥ 0, ≥ 0 B(0 ,40) 360
C(0.0) 0
S18. (a) The feasible region determined by the constraints x ≥ D(67 , 0) 268
0, y ≥ 0, x + y ≥ 2 and 2x + 3y ≤ 6 is given by
The maximum value of Z is 382 at point A(10,38) .
S20. (c)The feasible region determined by the The maximum value of Z is 5500 at point D(1000,500).
−2𝑥 + 𝑦 ≤ 4, 𝑥 + 𝑦 ≥ 3, 𝑥 − 2𝑦 ≤ 2, 𝑥 ≥ 0, 𝑦 ≥ 0 is
given by S22. (a) Let the invested money in PPF be x and in national
bonds be y.
∴According to the question,
𝑥 + 𝑦 ≤ 12000
𝑥 ≥ 1000, 𝑦 ≥ 2000
Maximize Z = 0.12x + 0.15y
The feasible region determined by 𝑥 + 𝑦 ≤
12000, 𝑥 ≥ 1000

Here the feasible region is unbounded. The vertices

8 1
of the region are A(0,4),B(0,3),C(3 , 3).
The values of Z at the following points are

Corner Point Z = 3x + 5y
A(0 , 4) 20
B(0 , 3) 15
8 1
C(3 , 3) 29 Minimum
3
29 9 1
The minimum value of Z is 3 at point 𝐶 (3 , 3)
S21. (d) The feasible region determined by 𝑥 + 2𝑦 ≤
2000, 𝑥 + 𝑦 ≤ 1500, 𝑦 ≥ 0, 𝑦 ≤ 600, 𝑥 ≥ 0 is given
by The corner points of the feasible region are
A(1000,11000) , B(1000,2000) and C(10000,2000) .
The value of Z at the corner point are

Corner point Z = 0.12x + 0.15y

A(1000 , 1770 Maximum
11000)
B(1000 , 2000) 420
C(10000,2000) 1500

The maximum value of Z is 1770 at point

A(1000,11000).

So, he must invest Rs.1000 in PPF and Rs.11000 in

The corner points of the feasible region are A(0,0), national bonds.
B(0,600), C(800,600), D(1000,500), E(1500,0). The The maximum annual income is Rs.1770 .
value of Z at the corner points are
S23. (b) Let the firm manufacture x number of necklaces and
Corner point Z = 3x + 5y y number of bracelets a day.
A(0,0) 0 ∴According to the question,
B(0,600) 3000 𝑥 + 𝑦 ≤ 24,0.5𝑥 + 𝑦 ≤ 16, 𝑥 ≥ 1, 𝑦 ≥ 1
C(800 , 600 ) 5400 Maximize Z = 100x + 300y
D(1000 , 500) 5500 Maximum The feasible region determined by 𝑥 + 𝑦 ≤
E(1500 , 0) 4500 24,0.5𝑥 + 𝑦 ≤ 16, 𝑥 ≥ 1, 𝑦 ≥ 1 is given by
 of fertilizer B to achieve minimum expense of
Rs.160.
S25. (d) Let x and y be number of units of X and Y.
∴According to the question,
2𝑥 + 𝑦 ≥ 8, 𝑥 + 2𝑦 ≥ 10, 𝑥 ≥ 0, 𝑦 ≥ 0
The feasible region determined by 2𝑥 + 𝑦 ≥ 8, 𝑥 +
2𝑦 ≥ 10, 𝑥 ≥ 0, 𝑦 ≥ 0 is given by

The corner points of the feasible region are A(1,1),

B(1,15.5) , C(16,8) , D(23,1).The number of bracelets
should be whole number. Therefore, considering
point (2,15). The value of Z at corner point is
Corner point Z = 100x+ 300y
A(1 ,1) 400 The feasible region is unbounded. The corner points
B(2 , 15) 4700 Maximum of feasible region are A(0,8) , B(2,4) , C(10,0). The
C(16 , 8) 4000 value of Z at corner points are
D(23 , 1) 2600 Corner point Z = 5x + 7y
The maximum value of Z is 4700 at point B (2,15). A(0,0) 56
∴ The firm should make 2 necklaces and 15 B(2 ,4) 38 Minimum
bracelets. C(0,0) 50
S24. (b) Let x and y be number of units of products of A and
The minimum value of Z is 160 at point (4,2). Hence,
B.
the dietician should mix 2 units of X and 4 units of Y
∴According to the question,
to meet the requirements at minimum cost of Rs.38.
36𝑥 + 6𝑦 ≥ 108,3𝑥 + 12𝑦 ≥ 36,20𝑥 + 10𝑦 ≥
100, 𝑥 ≥ 0, 𝑦 ≥ 0 S26. (c) Let x and y be number of units of food A and B.
Minimize Z = 20x + 40y ∴ According to the question, 200x + 100y ≥
The feasible region determined 36𝑥 + 6𝑦 ≥ 4000, x + 2y ≥ 50,40𝑥 + 40𝑦 ≥ 1400, 𝑥 ≥ 0, 𝑦 ≥
108,3𝑥 + 12𝑦 ≥ 36,20𝑥 + 10𝑦 ≥ 100, 𝑥 ≥ 0, 𝑦 ≥ 0 Minimize Z = 4x + 3y
0 Is given by The feasible region determined 200x + 100y ≥
4000, x + 2y ≥ 50,40𝑥 + 40𝑦 ≥ 1400, 𝑥 ≥ 0, 𝑦 ≥
0 is given by

The feasible region is unbounded. The corner points

of feasible region are A(0,18) , B(2,6) , C(4,2),
D(12,0). The feasible region is unbounded. The corner points
The value of Z at corner points are of feasible region are A(0,40) , B(5,30) , C(20,15),
D(50,0).The value of Z at corner points are
Corner point Z = 20x + 40y Corner point Z = 4x + 3y
A(0,18) 720 A(0 , 40) 120
B(2 , 6) 280 B(5 , 30) 110 Minimum
C(4 ,2) 160 Maximum
C(20,15) 125
D(12 ,0) 240
D(50,0) 200
The minimum value of Z is 160 at point (4,2). Hence, The minimum value of Z is 110 at point (5,30).
the firm should buy 4 units of fertilizer A and 2 units Hence, the diet should contain 5 units of food A and
30 units of food B for the least cost.
S27. (d) Let x and y be number of kilograms of food x and y.
Corner point Z = 30x + 25y
∴According to the question,
A(0 ,0) 0
𝑥 + 2𝑦 ≥ 10,2𝑥 + 2𝑦 ≥ 12,3𝑥 + 𝑦 ≥ 8, 𝑥 ≥ 0, 𝑦 ≥
0 B(0,6) 150
Minimize Z = 6x + 10y C(3,3) 165 Maximum
The feasible region determined 𝑥 + 2𝑦 ≥ 10,2𝑥 + D(5,0) 150
2𝑦 ≥ 12,3𝑥 + 𝑦 ≥ 8, 𝑥 ≥ 0, 𝑦 ≥ 0 is given by
The maximum value of Z is 165 and occurs at point
(3,3). The manufacturer should manufacture 3
trunks of each type to earn maximum profit of
Rs.165.
S29. (c) Let x and y be number of kilograms of bran and rice.
∴According to the question, 80x + 100y ≥
88,40x + 30y ≥ 36, 𝑥 ≥ 0, 𝑦 ≥ 0 Minimize Z = 5x +
4y The feasible region determined 80x + 100y ≥
88,40x + 30y ≥ 36, 𝑥 ≥ 0, 𝑦 ≥ 0 is given by

The feasible region is unbounded. The corner points

of feasible region are A(0,8) , B(1,5) , C(2,4), D(10,0).
The value of Z at corner points are
Corner point Z = 6x + 10y
A(0 , 8) 80
B(1 , 5) 56
C(2 ,4) 52
D(10 ,0) 60 Minimum The feasible region is unbounded. The corner points
of feasible region are A(0,1.2) , B(0.6,0.4) , C(1.1,0).
The minimum value of Z is 52 at point (2,4). Hence,
the diet should contain 2 kgs of food X and 4 kgs of The value of Z at corner points are
food Y for the least cost of Rs. 52.
Corner point Z = 5x + 4y
S28. (a) Let the manufacturer manufacture x and y numbers A(0 , 1.2) 4.8
of type 1 and type 2trunks. B(0.6 , 0.4) 4.6 Minimum
∴According to the question, C(1.1 , 0) 5.5
3𝑥 + 3𝑦 ≤ 18,3𝑥 + 2𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0
Maximize Z = 30x + 25y The minimum value of Z is 4.6 at point (0.6,0.4).
The feasible region determined 3𝑥 + 3𝑦 ≤ 18,3𝑥 + Hence, the diet should contain 0.6 kgs of bran and 0.4
2𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0 is given by kgs of rice for achieving minimum cost of Rs.4.6.
S30. (d) The feasible region determined by the constraints
𝑥 + 𝑦 ≤ 50,3𝑥 + 𝑦 ≤ 90, 𝑥, 𝑦 ≥ 0. is given by

The corner points of feasible region are A(0,0),

B(0,6) , C(3,3) , D(5,0).The value of Z at corner point
is
 The corner points of feasible region are We find that the feasible region i.e., their common
A(0,0),B(0,50), C(20,30), D(30,0) . The values of Z at solution space is unbounded from one side.
X2
the following points is

Corner point Z = 60 x + 15y x1– x2 = 0

A(0 , 0) 0 (5/4, 5/4) x1+ 5x2 = 0

B(0 , 50) 750 A
feasible reason
C(20 , 30) 1650 O X1
D(30 , 0) 1800 Maximum
It is clear from the figure that the objective function
The maximum value of Z is 1800 at point A(30,0) z attains its minimum value at the point A which is
the intersection of the two lines x1 – x2 = 0 and – x1
SUBJECTIVE QUESTIONS + 5x2 = 0.
5
S1. Write the given inequations into equations. We Solving them we find that x1 = x2 = . Hence z is
4
have x + y = 40, x + 2y = 60 and x = 0, y = 0. 5 5
The line x + y = 40 meets the x-axis at A(40, 0) and y- minimum when x1 = , x2 = and then its
4 4
axis at B(0, 40). The line x + 2y = 60 meets the
5 5
x-axis at C (60,0) and y-axis at D (0,30).Draw a line minimum value is 2 × – 10 × = – 10
joining A and B and a line joining C and D. 4 4
Y S4. Drawing the bounding lines corresponding to the
given inequalities and considering their common
B(0, 40)
solution space, we find that the feasible region is
given by the shaded area OABC. Every point of this
(0,30) D P(20, 20) region gives a feasible solution of the problem
X=0 whereas its optimal solution is attained at some
C(60,0) corner point of the polygon OABC.
X
X (0,0) O Y = 0 A(40,0) X2

Y 5x1+ 3x2 = 15
Let AB and CD meet at P. P will be (20, 20). Then the Feasible reason
C B (9/4, 5/4)
shaded region OAPD, common to all the solutions of (0, 13/5)
the given inequation, will be the solution set of the
O X1
given inequations. A 3x1+ 5x2 = 13
(3, 0)
S2. Write the given inequation into equation we get 2x +
3y = 6 and x + 4y = 4, on solving we get We find that the coordinates of the vertices A, B, C
12 2 9 5  13 
x= ,y= . are (3, 0),  ,  ,  0,  respectively. Now
5 5 4 4  5
Y calculating the value of the objective function at
(0, 2) these points we have.
2x + 3y = 6 9 5 9
(0, 1) At A.(3, 0) ; z = 6.3 + 10.0 = 18 At B ( , ) ; z = 6. +
4 4 4
x + 4y = 4
5
X
10. = 26
(3, 0) (4, 0) 4
13 13
 12 2  At C(0, 5 ) ; z = 6.0 + 10. 5 = 26
Hence a vertex is  ,  9 5
 5 5 It is observed that z is maximum at B(4 , 4) as well as
S3. The bounding lines corresponding to the inequalities 13
at C(0, 5 ) and its maximum value is 26. As a matter
of the given constraints are :
x1 – x2 = 0 x1 – 5x2 = – 5 of fact every point on the line segment BC gives this
max. value; because in this case the line of objective
& x1 = 0, x2 = 0
function lies along one boundary line of the feasible
Draw these lines in a two dimensional space and region. In such a case the problem has infinite
consider the solution space for each given inequality. number of optimal solutions.
S5. Equalities corresponding to the given constraints are
10x1+7x2= 35
x1 + x2 = 1 x2 – 5x1 = 0
X2
5x2 – x1 = 0 x1 – x2 = –1
x1 + x2 = 6 5
4 Feasible region
Draw the straight lines represented by these 3 D C (1.6, 2.4)
equations in a two dimensional space. These are the 2 B (7/3, 5/3)
bounding lines for the given inequalities. Now 1
X1
considering the solution space for each inequality of O 1 2 3 4 5 6 7 8
A
the given constraints, we find that the feasible region 3x1+8x2= 24
i.e., their common solution space is given by the which corresponds to the inequalities of the given
shaded region ABCDEF. Every point of this region gives constraints. On considering the solution space for
feasible solution of the problem whereas the optimal each of the given inequality, we find that the
solution is attained at one of the vertices of the common solution space, represented by the shaded
polygon ABCDEF. Coordinates of the six vertices are : area OABCD, is the feasible region. Now to search the
5 1 3
(A) (6 , 6); (B) (3, 5); maximum value of z which is at one of the corners of
5 7 the polygon OABCD, we find that At A(3.5, 0) ; z =
(c) (3,3) ; (D) (2 , 2); 5.3.5 + 7.0 = 17.5
1 5 1 5
(E) (4 , 4); (F) (6 , 6).  7 5 7 5
x1– x2 = 0 At B  ,  ; z = 5. + 7. = 23.3
X2 x1= 3  3 3  3 3
At C (1.6, 2.4) ; z = 5.1.6 + 7.2.4 = 24.8
x1– x2 = 0 At D (0, 3) ; z = 5.0 + 7.3 = 21
Thus z is maximum at C where x1= 1.6, x2 = 2.4 and
max. z = 24.8
D Feasible region
E C
S2. (138.1) The bounding lines for the given inequalities are
5x2– x1 = 0
F B x1+ x2 = 6 5x1 + 4x2 = 200 3x1 + 5x2 = 150
A X1
O 5x1 + 4x2 = 100 8x1 + 5x2 = 80
And x1 = 0 , x2 = 0
x1+ x2 = 1
So we find that X2
5 1 5 1 17
At A ( , ) ; z = 3. + 2. = D(0, 30)
6 6 6 6 6
2 51 Feasible region
3
At B (3, 5); z = 3.3 + 2. = C(30.7, 11.5)
5 5 E(0, 25)
At C (3, 3); z = 3.3 + 2.3 = 15
5 7 5 7 29 X1
At D (2 , 2) ; z = 3. + 2. = O A B(40, 0) 3x1+ 5x2= 150
2 2 2 (20, 0)
 1 5 1 5 13 5x1+ 4x2= 200
At E  ,  ; z = 3. + 2. = 8x1+5x2= 80 5x1+4x2= 100
 4 4 4 4 4
Draw these lines in a two dimensional space and
 1 5 1 5 13
At F  ,  ; z = 3. + 2. = consider the solution space for each inequality of the
 6 6  6 6 6
given constraints. We find that the shaded area
Thus z is maximum at C where x1 = 3, x2 = 3 and max. ABCDE is their common solution space (feasible
z = 15. region.)
Every point of this region gives a feasible solution of
NUMERICAL TYPE QUESTIONS the problem and the optimal solution is attained at
one of the corners of this polygon. We find that the
S1. (24.8) Let us draw the lines coordinates of the corner points A, B, C, D, E are (20,
x1 + x2 = 4 3x1 + 8x2 = 24 0) ; (40,0) ; (30.7 , 11.5) ; (0, 30) (0,25) respectively
10x1 + 7x2 = 35 and x1 = 0, x2 = 0 At A (20, 0) ; z = 3 × 20 + 0 = 60
At B (40, 0) ; z = 3 × 40 + 0 = 120
At C (30.7, 11.5) ;z =3× 30.7 + 4×11.5= 138.1
At D (0, 30) ; z = 0 + 4 × 30 = 120
 At E (0, 25) ; z = 0 + 4 × 25 = 100
TRUE AND FALSE
The z is maximum at C where x1 = 30.7 and
x2 = 11.5, maximum z = 138.1 S1. (False) A solution of L.P.P. which also satisfy the non-
S3. (0) negative restrictions of the problem is called the
feasible solution.
S2. (True) A feasible solution which maximize or minimize i.e.
which optimize the objective function of L.P.P. called
an optimal solution.
S3. (True) The line is drawn in geometrical area of feasible region
of L.P.P. for which the objective function remains
constant at all the points lie on this line, is called iso-
profit line.
Clearly feasible region is OABCOOABCO S4. (True) In linear programming problem mostly feasible
Now value of objective function at points solution is a polygon in first quadrant this polygon is
O(0,0 ) O (0,0 ) P=6 (0)+16 (0)=0P=6 (0)+16 (0)=0
a convex. It means that if two points of polygon are
A(40,0 ) A (40,0 ) P = 6 (40 ) + 16 (0) =240 P= 6 (40
connecting by a line then the line must be inside to
) + 16 (0) = 240
B(40,20 ) B(40,20 ) P=6(40 )+16 (20 )=560P=6 (40 polygon.
)+16 (20 )=560
C(0.20 ) C (0.20 ), P=6 (0)+16 (20)=320P=6 (0)+16 is convex set
(20)=320
∴ Minimum value of PP is 0 . S5. (True) The linear inequations or inequalities or restriction
𝟕 on the variables of a linear programming problem are
S4. (12𝟏𝟗 ) The shaded region represent the feasible region,
constraints.
hence
p = 5 x1+ 3x2 obviously it is maximum
ASSERTION AND REASONING
 20 45 
 , 
at  19 19  S1. (a) The equations, corresponding to inequalities 3x + 2y
20 45  6 and 6x + 4y  20, are 3x + 2y = 6 and 6x + 4y = 20.
Max 𝑝 = 5𝑥1 + 3𝑥2 = 5 (19 ) + 3 (19)
So the lines represented by these equations are
100 135 235 7 parallel.
= + = = 12 Y
19 19 19 19 .
S5. (30) The objective function is Max z = 2 x + 3 y.
The vertices are A(20,10), B(18,12), C(12,12),
D(3,3) and E ( 20, 3) .
Hence the maximum value of the objective function X
X
will be at (18, 12 ) . 6x + 4y = 20

Y 3x + 2y = 6
Hence the graphs are disjoint.
Thus, both A and R are true and R is correct
explanation of A.
S2. (d) (A)The half plane that contains the positive x-axis

⇒ 𝑥 = 18 , 𝑦 = 12 , then x + y = 30
 A is not true. Thus A is not true.
(R) O inside and P outside (R) Following figure will be obtained on drawing the
graphs of given inequations.
x y
From 3 x − y  3, + − =1
1 −3
x y
From 4 x − y  4, + =1
1 −4
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 .

Thus R is true.
S3. (b) (A)

R is true.
S5. (c) (A) As shown in graph drawn for x + y = 1 and
x − y = 1 the origin included in the area. Hence the
bounded region situated in all four quadrant.
Thus the solution set is the open half plane not
containing the origin.
A is true. (R)

A is true. (R)
The shaded area is the required area given in graph
as below.

5 4
Then correct ans is (3 , − 3 ) . R is true.
S4. (d) (a) The given region is bounded in first quadrant.

Hence, it is in I, II and III quadrant.

R is false.
 HOMEWORK

MCQ

S1. (a) For the line 3x + 2 y = 12; origin is not included in

the region hence the constraint corresponding to this
line is 3x + 2 y  12. similarly for the line
x + 3 y = 11; origin is not included in the region
hence the constraint corresponding to this line is
x + 3 y  11.
S2. (b) Bounded in first quadrant
S7. (b) The intermediate solutions of constraints must be
checked by substituting them back into Constraint
equations. Constraint equations means the
Constraint Equation is an equation representing any
constraints that you are given in the problem.
S8. (d) Z = 4 x + 2 y
Subject to constraints
2 x + 3 y  18,
x + y  10 and
x, y  0
S3. (b) Given that: 40 x + 25 y
Let, the quantity of the rice is x quintal and wheat is
y quintal.
According to question profit: rice per quintal is 40
rupees per quintal and for wheat is 25 rupees per
quintal.
Therefore, Net profit is 40 x + 25 y .

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

There is no common area in the first quadrant. Hence,

the objective function Z cannot be maximized.
S9. (d) The graph of linear programming problem is as given
below,
Hence the required feasible region is given by the
graph whose vertices are
S5. (b) Here, A=(0,40),B=(67,0) and C=(10,38) . A(1.2, 2.6), B (4.5,1.5) and C (38, 310)
Maximum for C i.e. z = 40+342 = 382. Thus objective function is minimum at A(1.2, 2.6)
so x_1 =1.2,x_2 =2.6 and z=2×1.2+3×2.6=10.2

S6. (a) (3,1),(2,0) are vertices of Min z for ( 2, 0 ) ,

Hence x1 = 2.
S10. (c) As there may be infinite values of x1 and x2 on line
x1 + x2 = 1

NUMERICAL TYPE QUESTIONS

SUBJECTIVE QUESTIONS

S1. Clearly point (2000, 0) is outside.

S1. (140)

2x +2y ≤ 80; when x = 0 , y = 40 and when

y = 0 , x = 40

S2. 2x +4y ≤ 120; when x = 0 , y = 30 and when

Type of items Working time Man labour y = 0 , x =60
on machine
The intersection of the two plotted lines
Shirt (x) 2 hours 3 hours
gives ( 20 , 20 ) .
Pant (y) 3 hours 2 hours Feasible area is 30 – C - 40
Availability 70 hours 75 hours

Linear constraints are 𝑥 ≥ 0, 𝑦 ≥ 0,2𝑥 + 3𝑦 ≤

70,3𝑥 + 2𝑦 ≤ 75.
8
S3. Objective function is given by profit function −𝑥. 100
10 The maxima is obtained at x = 20 , y = 20
+𝑦× − 0.08𝑥 + 0.10𝑦.
100 and is 140
S4. Since the points given in (a), (b) and (c) does not S2. (0)
satisfy the given inequalities.

2x +2y ≥ 8 ; when x = 0 , y = 4 and when y

= 0 , x = 4 line AB
S5. z = x + 2y
x + 4y ≥ 12 ; when x = 0 , y = 3 and when y
Max z = 0 + 4(2) = 8
= 0 , x = 12 line CD
 x ≥ 3 , y ≥ 2 are the lines parallel to y -axis
and x-axis respectively.
The diverging shaded area in red lines is the
area of feasible solution. This area is So, optimal solution does not exist.
unbounded .
S5. (0)
Z = 2x + 4y at ( 3 , 2) = 14
Plot 2x + 4y > 14 line CJ to see if there is
any common region. There is no common
region so there is no optimal solution.
S3. (226.66)

-2x + y ≤ 4 ; or y = 2x + 4 ; when x = 0 , y =
4 and when y = 0 , x = -2 line EF
x+ y ≥ 3 ; or y = -x + 3 ; when x = 0 , y = 3
when y = 0 ,x = 3 ; line AB
x – 2y ≤ 2 ; or y = 0.5 x -1 ; when x = 0 , y =
-1 and when y = 0 , x = 2 line CD
The feasible solution is the unbounded area
with F – E -A -G -D
x + y ≤ 8 ; when x = 0 , y = 8 and when y =
0 , x= 8 , line 8 – 8
x + 4y ≥ 12 ; when x = 0 , y = 3 and when y
= 0 , x = 12 line A – 12
5
5x + 8 y = 20 ; when x = 0 , y = 2 and when To check whether it is the minimal value
plot the objective function with a value less
y=0,x=4 than 9 .66 or y = - 0.6x -1.932
The shaded area in red is the area of
feasible solution. It can be seen that the value of x and y are
always negative. So , there is no optimal
solution.

TRUE AND FALSE

The maxima is obtained at x = 6.66 , y = 1 . S1. (true) A set of values of the decision variables
33 and is 226 .66 which satisfy the constraints of a linear
S4. (0) programming problem (LPP) is called a
solution of the LPP.
S2. (False)There is a method to solved a linear
programming problem graphically i.e.,
corner – point method.
S3. (True) The linear function Z which is to be
maximized or minimized is called the
objective function.
S4. (True) A solution of a LPP is an infeasible
x – y ≤ 1 ; when x = 0 , y = 1 and when y = 0 solution, if it does not satisfy the non-
,x=2 negativity restriction.

x + y ≥ 3 ; when x = 0 , y = 3 and when y = S5. (True) An optimal solution of a LPP , if it exists

0 , x= 3 , line AB a unbounded region A- C- , occurs at one of the extreme (corner )
D is obtained using the constraints. points of the convex polygon of the set
of all feasible solution.
 y) : ax + by < c} and {(x, y) : ax + by > c} are open half
ASSERTION AND REASONING
spaces
Both A and R are true and R is correct
A
explanation of A.
S1. (c) ……..(i) ………..(ii)
B S4. (d) (A) is false
There is no region common to all the solution of the
Figure (i) is not convex set while (ii) is convex set. It
given inequations, we say that the solution set is void
can be easily seen that the intersection of two convex
or empty.
sets is a convex set and the set of all feasible solutions
(R) is true
of a LPP is also a convex set.
The limited (bounded) region of the graph made by
A is true but R is false.
two inequations is called Feasible Region.
S2. (c) Assertion (A): A set of values of the decision
S5. (a) Assertion (A) : The general form of Linear
variables which satisfy the constraints of a Linear
Programming Problem (L.P.P.) is called a solution of Programming Problems ( L.P.P.) is-
Maximize (Minimize) z = c1x1 + c2x2 + .....+ cnxn
the L.P.P.
A is true subjected to
Reason (R): A Linear Programming Problem have a11 x1 + a12 x2 +......+ a1n xn {, =, } b1
only two optimal solution. a21 x1 + a22 x2 + ......+ a2n xn {, =, } b2
R is False , since A Linear Programming Problem may
.........................................................
have many optimal solution. If a L.P.P. has two
am1 x1 + am2 x2 +......+ amn xn{, =, } bn
optimal solution, then there are an infinite number
of optimal solutions. and x1,x2, x3,........, xn  0

S3. (a) Assertion (A) : The graph of the equation Reason(R): Where x1, x2, x3, ....xn are the
ax + by = c is a straight line which divides the xy-plane variables whose values are to be determined and are
into two parts known as the half spaces. called the decision variables. The inequation are
Reason(R): In set form {(x, y) : ax + by = c} is the called constraints and the function to be maximized
straight line whereas, sets {(x, y) : ax + by  c} and {(x, or minimized is called the objective function.
y) : ax + by  c} are closed half spaces and the sets {(x, Both A and R are true and R is correct explanation of
A.