Linear Programming 190

09. Linear Programming

Revision points : These two parts are known as the closed half
spaces. The region represented by ax + by < c
LINEAR EQUATION IN TWO VARIABLE and ax + by > c are known as the open half
A first degree equation of the form ax + by spaces. These half spaces are known as the
+ c = 0, where a, b, c are real numbers and a, b solution sets of corresponding inequations.
are not both zero is called a linear equation in To find the solution set of linear inequalities
two variables x and y. in two variables, we use following steps.
The solution set of linear equation in x and y 1. Convert the inequation ax + by < c (or ax + by >
is the set of values of x and y satisfying the c) into the equation ax + by = c which represent
equation. a straight line in XY-plane.
The graph of the solution set of linear 2. Put y = 0 in the equation obtained in step 1 to get
equation is a straight line. the point where the line meets the X-axis.
In equation ax + by + c = 0, if c = 0, then the Similarly put x = 0 to get the point where the line
line passes through origin. meets the Y-axis.
In equation ax + by + c = 0, if c  0, then 3. Join the points obtained in step 2 to obtain the
graph of the line obtained from the given
 c  inequation. In case of strict in equally (ax + by <
the line intersect X-axis at point  ,0  and Y--
 a  c or ax + by > c) draw the dotted line, otherwise
axis at point mark it thick line.
The solution set of the linear equation 2x + 4. Choose a point, if possible (0, 0) not lying on this
5y = 10 is shown in figure 1. line and substitute its co-ordinates in the inequation.
If the inequation is satisfied.j then shade the
portion of the plane which contain the chosen
point.
If the inequation is not satisfied, then shade
the portion which does not contain the chosen
point.
The shaded region obtained in step 4
represents the desired solution set.
The region represented by inequality ax +
Fig. : 1 by < c which contain origin is as shown in figure
2.
LINEAR INEQUATIONS IN TWO
VARIABLE
Inequalities of the form ax + by + c < 0,
ax + by + c > 0, ax + by + c > 0, ax + by + c > 0,
where a, b, c are real numbers and a, b are not
both zero are called linear inequations in two
variables x and y.
In co-ordinate geometry, the graph of the
equation ax + by = c is a straight line which divides
the XY-plane into two parts which are Fig. : 2
represented by ax + by = c and ax + by = c.

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 191
The region represented by inequation LINEAR PROGRAMMING PROBLEM
ax + by < c which contain origin is as shown in
The word 'Programming' means planning
figure 3.
many practical problems arising in the field of
economics, business, the sciences and engineering
involve system of linear inequalities. The problem
finding the maximum or the minimum (optimum)
value of variables occurring in linear expression
subject to a set of constraints is called linear
programming' problem.
Linear programming is the process of
planning. This process is based on situations
where number of resources such as workers,
machines, raw materials etc. are available and
all these are combined to get one or more products
Fig.: 3 giving maximum profit and minimum cost.
The region represented by inequation
ax + by > c which does not contain origin is as DEFINITIONS
shown in figure 4. 1. CONVEX SET:
A set of points in the plane is said to be
convex set, if the line segment joining any two
points of the set entirely lies in the set.
Figure 6 shows conves sets.

Fig. : 6
Figure 7 shows non convex sets.
Fig. : 4
The region represented by inequation ax +
by > c which does not contain origin is as shown
in figure 5.

Fig. : 7
2. POLYGONAL CONVEX SET:
If the boundaries of the convex set are
formed by straight lines, then it is called polygonal
convex set.
Polygonal convex set may be bounded or
unbounded.
3. CONVEX POLYGON:
A bounded polygonal convex set is called
convex polygon.
Fig. : 5 4. CONVEX POLYGON THEOREM:
The objective function of LPP defined over

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 192
the convex set, attains its optimum value on atleast is called feasible region.
one of the corner points of the convex polygon. 14. INFEASIBLE REGION:
This is called convex polygon theorem. The region other than the feasible region is
5. CORNER POINT: called infeasible region of LPP.
The point of intersection of any two
FORMULATION OF LPP
boundaries of the half planes determined by a
system of linear inequalities is called corner point. The function to be optimized z = px + qy
6. OBJECTIVE FUNCTION: Subject to :
A linear function of variables which is to be a11x + a12y (<, >) b1
optimized is called objective function of LPP. a21x + a22y (<, >) b2
Objective function is denoted by z or cor p. a31x + a32y (<, >) b3 and
7. CONSTRAINTS: x > 0, y > 0
Conditions under which the objective Following steps are used to formulate LPP
function is to be optimized are called constraints. 1. Identify the variables and assign symbols such
These constraints are in the form of linear as x, y, which are known as decision variables.
inequations. 2. The decision variables in problem are always non-
8. NON-NEGATIVE CONSTRAINTS: negative i.e. x > 0, y > 0.
In some situations the values of the variables 3. Identify the objective function to be optimized and
under consideration may be positive or zero due express in as linear function of decision variables.
to the imposed constraints. Such constraints are 4. Identity the set of constraints and express them
known as non-negative constraints. as linear inequations in terms of the decision
9. SOLUTION OF LPP : variable.
The set of values of the decision variables SPECIAL CASES OF LPP
say x1, x2, ... which satisfies the constraints of
LPP is called a solution of LPP. 1. INFINITE NUMBER OF OPTIMAL
10. FEASIBLE SOLUTION: SOLUTIONS:
The co-ordinates of any point in the plane If the objective function has the same maximum
which satisfy the constraints is called a feasible or minimum value at two consecutive corner
solution. points of the feasible region, then the objective
11. OPTIMAL FEASIBLE SOLUTION: function has maximum or minimum value at all
points of the segment joining these points and the
A feasible solution which maximize or
LPP has infinite number of optimum solutions.
minimize the objective function as per the
requirements of LPP is called optimal feasible 2. UNBOUNDED SOLUTION:
solution. If the solution of LPP is not bounded, then the
12. OPTIMIZATION TECHNIQUE: value of the objective function increases
indefinitely and the LPP has unbounded solution.
The process of obtaining the optimal feasible
solution to LPP is called optimization technique. 3. INFEASIBLE SOLUTION:
13. FEASIBLE REGION: If the feasible region of LPP is empty, then the
LPP has no solution.
The common region determined by all the
constraints and non-negative constraints of LPP 

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 193

MULTIPLE CHOICE QUESTIONS

1. L.P.P. is a process of finding b) first and third equadrant

a) maximum value of objective c) only second quadrant
b) minimum value of objective function d) only first quadrant
c) opimum value of objective function. 9. L.P.P has constraints of
d) none of these. a) one variables
2. Optimization of the objective function is a process b) two variables
of c) one or two variables
a) maximizing the objective function d) two or more variables
b) maximizing or mimizing the objective function 10. If the constraints in a linear programming problem
c) minimizing the objective function arc changed, then
d) none of these a) the problem is to be re–evaluated
3. Objective function of L.P.P. is b) solution is not defined
a) a constraint c) the objective function has to be modifies
b) a function to be optimised d) the changes in constraints ignored
c) a relation between the variable n m
d) feasible region 11. Minimize z =  c x
j1 i 1
ij ij , subject to
4. Which of the following statement is correct?
a) A L. P. P. admits a unique solution n

b) Every L. P. P. admits an optimal solution x

j1
ij = ai, i = 1, 2, .... m and
c) If a L.P.P. admits two optimal solution, then it
has infinite number of optimal solution m

d) A L.P.P. admits two optimal solution. x

i 1
ij = bj, j = 1, 2, .... n
5. The optimal value of objective function is attained
is a L.P.P. with number of constraints
at the points
a) m+n b) m+n
a) given by intersection in equations with axes
only m
c) mn d)
b) given by intersection of inequations with X– n
axis only 12. Region represented by the inequalities x > 0, y >
c) given by corner points of the feasible region 0 is
d) none of these a) first quadrant b) second quadrant
6. The maximum or minimum of the objective c) third quadrant d) fourth quadrant
function occurs only at the corner points of the 13. Solution set of the inequality x > 0 is
feasible region. This theorem is known as a) half plane on the left of Y–axis
fundamental theorem of of
b) half plane on the right of Y–a:xis excluding Y–
a) Algebra b) Arithmetic axis
c) Calculus d) Extreme point c) half plane on the right of Y–axis including the
7. Corner points of fealible region of inequalities points on Y–axis
gives d) none of these
a) optiomal solution of L.P.P 14. Solution set of the inequality y < 0 is
b) objective function a) half plane below X–axis excluding the points
c) constraints. on X–axis
d) linear assumption. b) half plane below X–axis including the points
8. The feasible solution of L.P.P. belongs to on X–axis
a) first and second eqadrant c) half plane above X–axis

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 194
d) none of these c) 13.33 d) 16.33
15. Which of the following term is not used in a linear 25. The maximum value of z = 10x + 25y subject to
programming problem? 0 < x < 3, 0 < y < 3, x + y < 5 is
a) Slack variable b) Objective function a) 75 b) 80
c) Concave region d) Feasible region c) 95 d) 105
16. A set is said to be convex if 26. The maximum value of z = 75x + 50y subject to
a) all points except the end points of the segment 8x + 5y < 60, 4x + 5y < 40, x > 0, y > 0 is
inside the set lie inside the set a) 400 b) 562.5
b) it is concave c) 575.5 d) 575
c) all points on segment in the set lie inside the 27. The maximum value of z = 5x + 2y subject to
set 3x + 5y < 15, 5x + 2y < 10, x > 0, y > 0 is
d) none of these a) 10 b) 0
17. Which of the following set is convex? c) 6 d) 12
a) {(x,y) : x2 + y2 > 1} 28. The objective function z = 5x + 2y can be
b) ((x,y) : y2 > x) maximized subject to 3x + 5y < 15, 5x + 2y < 10,
c) {(x, y) : 3x2 + 4y2 < 5} x > 0, y > 0 is
d) {(x, y) : y < 2, y < 4} a) at one point only
18. Which of the following set is not a convex set b) at two points only
a) {(x, y) : 1 < x2 + y2 < 3} c) at infinite number of points
b) {(x, y) : x2 + y2 < 2} d) none of these
c) {(x,y) : x + y < 1} 29. The maximum value of z = 15x + 30y subject to
d) {(x, y) : 2x2 + 3y2 < 6} 3x + y < 12, x + 2y < io. x > 0, y > 0 is
19. Which of the follwoing is not a convex set? a) 60 b) 150
a) {(x, y) : 2x + 2y < 7} c) 160 d) 100
b) {(x, y)) : x2 + y2 < 4} 30. The objective function z = 15x + 30y can be
maximized subject to 3x + y < 12, x + 2y < 10, x
c) {x : 1 x 1 = 5}
> 0, y > 0 is
d) {(x, y) : 2x2 + 3y2 < 6}
a) at infinite number of points
20. The maximum value of z = 11x + 8y subject to
b) at two points only
x < 4, y < 6, x + y < 6, x > 0, y > 0 is
c) at one point only
a) 0 b) 48
d) none of these
c) 60 d) 44
31. The maximum value of z = x + y subject to
21. The maximum value of z = 3x + 5y subject to
x + y < 10, 3x – 2y < 15, x < 6, x > 0, y > 0 is
x + 4y < 24, 3x + y < 21, x + y < 9, x > 0, y > 0 is
a) 5 b) 7.5
a) 21 b) 37
c) 12 d) 10
c) 33 d) 30
32. The objective function z = x + y can be maximized
22. The maximum value of z = 4x + 6y subject to
subject to x + y < 10, 3x – 2y < 15, x < 6, x > 0,
3x + 2y > 12, x + y > 4, x > 0, y > 0 is
y > 0 is
a) 36 b) 16
a) at one point only
c) 24 d) 38
b) at two points only
23. The maximum value of z = 7x + 11y subject to
c) at infinite number of points
3x + 5y < 26, 5x + 3y < 30, x > 0, y > 0 is
d) none of these
a) 42 b) 57.2
33. The objective function z = 4x + 3y can be
c) 61.6 d) 59
maximised subject to the constraints 3x + 4y <
24. The maximum value of z = 6x + 4y subject to
24, 8x + 6y < 48, x < 5, y < 6, x > 0, y > 0
x < 2, x + y < 3, – 2x + y < 1, x > 0, y > 0 is
a) at only one point
a) 13 b) 16

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 195
b) at two points only 42. The minimum value of z = 6x + 2y subject to
c) at an infinite number of points 5x + 9y < 90, x + y < 4, y < 8, x > 0, y > 0 is
d) none of these a) 24 b) 6
34. The maximum value of z = 4x + 2y, subject to c) 8 d) 16
4x + 2y < 46, x + 3y < 24, x > 0, y > 0 occurs at 43. The minimum value of z = 4x + 5y subject to
a) exactly one point 2x + y > 7, 2x + 3y < 15, y < 3, x > 0, y > 0 is
b) two point a) 23 b) 27
c) three point c) 12 d) 14
d) infinite number of point 44. The minimum value of z = 3x + 5y subject to
35. The solution of LPP 2x + 3y > 12, – x + y < 3, x < 4, y > 3 is
Maximize z = 3x1 + 5x2 subject to a) 19.8 b) 19.5
3x1 + 2x2 < 18, x1 < 4, x2 < 6, x1 > 0, x2 > 0 c) 19.4 d) 19.6
a) x1 = 2, x2 = 0, z = 6 45. The minimum value of z = 8x + 4y subject to
b) x1 = 2, x2 = 6, z = 36 x + 2y > 2, 3x + y > 3, 4x + 3y > 6, x > 0, y > 0 is
c) x1 = 4, x2 = 3, z = 27 a) 9.8 b) 11.2
d) x1 = 4, x2 = 6, z = 42 c) 9.6 d) 12
36. The point for which the maximum value of 46. The minimum value of z = 2x + 4y subject to
z = x + y subject to the constraints 2x + 5y < 100, 2x + y > 3, x + 2y > 6, x > 0, y > 0 is
a) 4 b) 6
x y c) 3 d) 12
 < 1, x > 0, y > 0 is obtained at
25 50 47. The objective function z = 2x + 4y can be
a) (10,20) b) (25, 0) minimized subject to 2x + y > 3, x + 2y > 6, x > 0,
y>0
 75 25 
c) (0, 20) d)  ,  a) at infinite number of points
 4 2 
b) at two points only
37. The minimum value of z = 20x + 20y subject to c) at one point only
x + 2y > 8, 3x + 2y > 15, 5x + 2y > 20, x > 0,
d) none of these
y > 0 is
48. The minimum value of z = x + 2y subject to
a) 115 b) 125
x + 2y > 50, 2x – y < 0, 2x + y < 100, x > 0, y > 0
c) 105 d) 200 is
38. The minimum value of z = 6x + 21y subject to a) 10 b) 30
x + 2y > 3, x + 4y > 4, 3x + y > 3, x > 0, y > 0 is
c) 40 d) 50
a) 20.5 b) 28.8
49. The objective function z = x + 2y can be minimized
c) 24 d) 22.5 subject to x + 2y > 50, 2x – y < 0, 2x + y < 100, x,
39. The minimum value of z = 20x + 9y subject to y>0
2x + y > 36, 6x + y > 60, x > 0, y > 0 is a) at infinite number of points
a) 330 b) 336 b) at two points only
c) 360 d) 333 c) at one point only
40. The minimum value of z = 7x + y subject to d) none of these
5x + y > 5, x + y > 3, x > 0, y > 0 is
50. The minimum value of z = 6x + 2y subject to
a) 5 b) 2.5 3x + 2y > 12, x + y > 5, 0 < x < 4, 0 < y < 4 is
c) 6 d) 3.5 a) 22 b) 24
41. The minimum value of z = 8x + lay subject to c) 40 d) 28
2x + y > 7, 2x + 3y > 15, y > 2, x > 0, y > 0 is
51. The objective function z = 6x + 2y can be
a) 56 b) 52 minimized subject to 3x + 2y > 12, x + y > 5, 0 <
c) 51 d) 48 x < 4, a < y < 4

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 196
a) at one point only y > 0 and the objective function z = 7x – 3y has
b) at two points only a) unbounded solution b) no unique solution
c) at infinite number of pints c) bounded solution d) none of these
d) none of these 62. Solution set of inequations x – 2y > 0, 2x – y + 2
52. The co–ordinates of the point for mininum value < 0, x > 0, y > 0
of z = 7x – 8y subject to the condition x + y < 20, a) empty b) closed half plane
y > 5, x > 0, y > 0 is c) infinite d) first quadrant.
a) (20, 0) b) (15,5) 63. The region represented by the in equations
c) (0,5) d) (0,20) 2x + 3y < 18, x + y > 10, x > 0, y < 0 is
53. The constraints x + y > 5, x + 2y > 6, x > 3, y > 0 a) a polygon b) unbonded
and the objective function z = – x + 2y has c) bonded d) null region
a) unbounded solution b) no unique solution 64. Shaded, region of the constraints x + y < 5, 0 <
c) bounded solution d) none of these x < 4, 0 < y < 2 is
54. The constraints x – y < 1, x – y > 0, x > 0, y > 0
and the objective function z = x + y has
a) unbounded solution
b) no unique solution
c) bounded solution
d) none of these
55. The constraints 3x + 2y > 9, x – y > 3, x > 0, y >
0 and the objective function has
a) unbounded solution b) no unique solution
c) bounded solution d) none of these
56. The constraints x – y > 0, – x + 3y < 3, x > 0,
y > 0 and the objective function z = 6x + 8y has
a) unbounded solution b) no unique solution
c) bounded solution d) none of these
57. The constraints – x + y < 1, – x + 3y < 9, x > 0,
y > 0 define
a) bounded feasible region
b) unbounded feasible region
c) both bounded and unbounded region
d) none of these
58. The area of the feasible region for the following
constraints x + 3y > 3, x > 0, y > 0 will be
a) bounded b) unbounded
c) convex d) concave
59. The constraints x + y > 8, 3x + 5y > 15, x > 0,
y > 0 and the objective function z = 1.5x + y has
a) unbonded solution b) no unique solution
c) bounded solution d) none of these
60. The constraints x + y > 8, 2x + 3y < 12, x > 0,
y > 0 and the objective function z = 4x + 6y has
a) unbounded solution b) no unique solution
c) bounded solution d) none of these
61. The constraints x + 2y < 2, 2x + 4y > 8, x > 0,

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 197
65. Shaded, region of the constraints 4x + 3y < 12, y
– x + y < 2, x > 0, y > 0 is

67. Shaded, region of the constraints 10x + 2y > 20,

x + y > 6 is

66. Shaded, region of the constraints x + y > 5,

2x + 3y < 18, 4x + 3y < 24, x > 0, y > 0 is

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 198

69. The solution set of the inequation 2x + y > 5 is

a) half plane that contains the origin
b) open half plane not containing the origin
c) whole XY–plane except the points lying on
line 2x + y = 5
d) none of these
70. The solution set of the inequality x + 2y > 3 is
a) half plane containing the origin
b) half plane not containing the origin
c) the whole XY–plane except point lying on line
x + 2y – 3 = 0
d) none of these
71. The solution set of 3x + 2y < 6 is
a) half plane not containing origin
b) half plane containing the points lying on line 3x
68. Shaded, region of the constraints 4x + y > 4, + 2y = 6 and origin
x + 3y > 6, x + Y> 3, x > 0, y > 0 is c) XY–plane except points on line 3x + 2y = 6
d) none of these
72. The lines 5x + 4y > 20, x < 6, y < 4, x > 0, y > 0
form
a) a square b) a rhombus
c) a triangle d) a quadrilateral.
Feasible region is ACPQ which is a quadrilateral.
73. The cornman region represented by inequalities
y < 2, x + y < 3, – 2x + y < 1, x > 0, y > 0 is
a) a triangle b) a quadrilateral
c) a square d) a pentagon
74. The cornman region represented by inequalities
0 < x < 6, 0 < y < 4 is
a) a triangle b) a rectangle
c) a square d) a pentagon

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 199
75. Feasible region is represented by by selling one unitof A and one unit of B
respectively. If the entire production of A and B
is sold, then formulate the problem as LPP.
a) Maximize z = 350x + 400y subject to
3x + 2y > 120, 2x + 5y < 160, x > 0, y > 0
b) Maximize z = 350x + 400y subject to
3x + 2y > 120, 2x + 5y > 160, x > 0, y > 0
c) Maximize z = 350x + 400y subject to
3x + 2y > 120, 2x + 5y < 160, x > 0, y > 0
d) Maximize z = 350x + 400y subject to
3x + 2y > 120, 2x + 5y > 160, x > 0, y > 0
a) 2x + 5y > 80, x + Y < 20, x > 0, y > 0
80. A furniture manufacturer produces tables and
b) 2x + 5y > 80, x + Y > 20, x > 0, y > 0
bookshelves made up of wood and steel. The
c) 2x + 5y > 80, x + Y > 20, x > 0, y > 0 weekly requirement of wood and steel is given
d) 2x + 5y > 80, x + Y < 20, x > 0, y > 0 as below.
76. A vertex of the linear inequalities 2x + 3y > 6,
x + 4y > 4, x > 0, y > 0 is
a) (1,0) b) (1, 1)

 12 2   2 12 
c)  ,  d)  , 
 5 5 5 5 
77. The solution set of the constraints x + y < 11,
3x + 2y > 25, 2x + 5y > 20, x > 0, y > 0 includes
The weekly availability of wood and steel is 450
the point
and 100 units respectively. Profit on a table is Rs
a) (2,3) b) (3,2) 1000 and that on a book shelf is Rs 1200. To
c) (3,8) d) (4,3) determine the number of tables and book shelves
78. The corner points of common region are if to be produced every week in order to maximize
2x + y > 9, x + 2y > 9, x + y > 7 and x > 0, y > 0 the total profit, formulate the problem as L.P.P.
is a) Maximize z = 1000x + 1200y subject to
a) (0,9), (2,5) (0, 9) 8x + 11y > 450, 2x + 3y < 100, x > 0, y > 0
b) (0,9), (2,5) (2,5) b) Maximize z = 1000x + 1200y subject to
c) (0, 9), (2, 5) (0, 9) 8x + 11y > 450, 2x + 3y > 100, x > 0, y > 0
d) (9, 0), (5,2) (2, 5) (0, 9) c) Maximize z = 1000x + 1200y subject to
79. A company manufactures two types of chemicals 8x + 11y > 450, 2x + 3y > 100, x > 0, y > 0
A and B. Each chemical requires the types of d) Maximize z = 1000x + 1200y subject to
raw materials P and Q. The table below shows
8x + 11y > 450, 2.x + 3y > 100, x > 0, y > 0
number of units of P and Q required to
81. Diet of a sick person must contain at least 4000
manufacture one unit of A and one unit of B and
units of vitamins, 50 units of minerals and 2500
the total availability of P and Q.
calories. Two foods F1 and F2 cost Rs 50 and Rs
75 per unit respectively. Each unit of food F,
contains 200 units vitamins, 2 units of minerals
and 40 calories, where as each unit of food F2
conti an 100 units of vitamins, 3 units of–minerals
and 35 calories, formulate the above problem as
LPP to fulfil sick person's requirements at
minimum cost.
The company gets profits of Rs 350 and Rs 400 a) Minimize z = 50x + 75y subject to

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 200
200x + 100y > 4000, 2x + 3y > 50, 40x + 35y c) Maximize z = 70x + 90y subject to
> 50, x > 0, y > 0 750x + 900y > 57600, x + y > 40, x > 0, y > 0
b) Minimize z = SOx + 75y subject to d) Maximize z = 70x + 90y subject to
200x + 100y < 4000, 2x + 3y > 50, 40x + 35y 750x + 900y > 57600, x + y > 40, x > 0, y > 0
> 50, x > 0, y > 0 84. Shalmali wants to invest Rs 50,000 in saving
c) Minimize z = 50x + 75y subject to certificates and PPF. She wants to invest at least
200x + 100y > 4000, 2x + 3y < 50, 40x + 35y Rs 15,000 in saving certificates and at least Rs
> 50, x > 0, y > 0 20,000 in PPF. The rate of interest on saving
d) Minimize z = 50x + 75y subject to certificates is 8 % p.a. and on PPF is 9 % p.a.
200x + 100y > 4000, 2x + 3y > 50, 40x + 35 y Formulate the LPP for maximum yearly income.
> 50, x > 0, y > 0 a) Maximize z = 0.08x + 0.09y subject to
82. A printing company prints two types of magzines x + y > 50000, x > 15000, y > 20000, x > 0,
A and B. The company earns Rs 20 and Rs 30 y>0
on each copy of magzines A and B respectively. b) Maximize z = 0.08x + 0.09y subject to
The magazines are processed on three machines. x + y < 50000, x > 15000, y < 20000, x > 0,
Magazine A requires 2 hours on machine 1, 4 y>0
hours on machine II and 2 hours on machine III. c) Maximize z = 0.08x + 0.09y subject to
Magazine B requires 3 hours on machine I, 5 x + y < 50000, x > 15000, y > 20000, x > 0,
hours on machine II and 3 hours on machine III. y>0
Machines I, II, III are available for 35, 50 and 70
d) Maximize z = 0.08x + 0.09y subject to
hours per week respectively. Formulate the LPP
x + y < 50000,x > 15000, y > 20000, x > 0,
to determine weekly production of magazines A
y>0
and B, so that the total profit is maximum.
85. If a motor cyclist rides at a speed of 50 km/hr, he
a) Maximize z = 20x + 30y subject to
has to spend Rs 2 per km on petrol. If he rides at
2x + 3y > 35, 4x + 5y > 50, 2x + 3y > 70, x >
a faster speed of 70 km/hr, the petrol cost
0, y > 0
increases to Rs 2.5 per km. He has Rs 500 to
b) Maximize z = 20x + 30y subject to spend on petrol and wishes to travel maximum
2x + 3y < 35, 4x + 5y > 50, 2x + 3y < 70, x > distance with in an hour. Formulate as LPP.
0, y > 0 a) Maximize z = x + y subject to
c) Maximize z = 2 > x + 30y subject to
2x + 3y > 35, 4x + 5y > 50, 2x + 3y > 70, x > x y
 < 1, 2x + 205y > 500, x > 0, y > 0
0, y > 0 50 70
d) Maximize z = 20x + 30y subject to b) Maximize z = x + y subject to
2x + 3y > 35, 4x + 5y < 50, 2x + 3y < 70, x > x y
0, y > 0  < I, 2x + 205y > 500, x > 0, y > 0
50 70
83. A dealer wishes to purchase table fans and ceiling
c) Maximize z = x + y subject to
fans. He has Rs 57, 600 to invest, and has space
to store 40 times. A table fan costs Rs 750 and x y
 > 1, 2x + 205y < 500, x > 0, y > 0
ceiling fan costs Rs 900. He can make profits of 50 70
Rs 70 and Rs 90 by selling a table fan and a ceiling d) Maximize z = x + y subject to
fan respectively. If dealer sell all the fans that he
buy, then formulate this problem as LPP, to x y
 > 1, 2x + 205y > 500, x > 0, y > 0
maximize the profit. 50 70
a) Maximize z = 70x + 90y subject to 86. Two different, kinds of foods A and B are being
750x + 900y > 57600, x + y < 40, x > 0, y > 0 considered to form a weekly diet. The minimum
b) Maximize z = 70x + 90y subject to weekly requirement of fats, carbohydrates and
750x + 900y > 57600, x + y > 40, x > 0, y > 0 proteins are 17, 28 and 14 units respectively. One
kg of food A has 5 units of fat, 12 units of

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.

 Linear Programming 201
carbohydrates and 7 units of protein, one kg of 0.7x + 0.6y > 600, 0.2x + 0.3y > 400,
food B has 7 units of fat, 15 units of carbohydrates 0.1x + 0.2y > 250, x > 0, y > 0
and 9 units of protein. The price of food A is Rs 5 b) Minimize z = 145x + 160y sunject to
per kg and that of food B is Rs 7 per kg. Form 0.7x + 0.6y > 600, 0.2x + 0.3 y > 400,
the LPP to minimize the cost.
0.1x + 0.2y < 250, x > 0, y > 0
a) Minimize z = 5x + 7y subject to
c) Minimize z = 145x + 160y sunject to
5x + 7y < 17, 12x + 15y 228, 7x + 9y 2 14, x >
0.7x + 0.6y > 600, 0.2x + 0.3y > 400,
0, y > 0
0.1x + 0.2y > 250, x > 0, y > 0
b) Minimize z = 5x + 7y subject to
d) Minimize z = 145x + 160y sunject to
5x + 7y > 17, 12x + 15y > 28, 7x + 9y 2 14, x
0.7x + 0.6y > 600, 0.2x + 0.3 y > 400,
> 0, y > 0
0.1x + 0.2y > 250, x > 0, y > 0
c) Minimize z = 5x + 7y subject to
89. An aeroplane can carry a maximum of 250
5x + 7y > 17, 12x + 15y > 28, 7x + 9y > 14, x
passengers. A profit of Rs 1500 is made on each
> 0, y > 0
executive class ticket and a profit of Rs 900 made
d) Minimize z = 5x + 7y subject to
on each economy class ticket. The airline
5x + 7y > 17, 12x + 15y > 28, 7x + 9y > 14, reserves at least 30 seats for executive class.
x > 0, y > 0 However of least 4 times as many passengers
87. A shopkeeper sells two items, colour TV, sets prefer to travel by economy class than by
and DVD players. He can invest Rs 12,00,000 executive class. Formulate LPP in order to
and can store only 750 items. The cost of colour maximize the profit for the airline.
TV and DVD player is Rs 6500 and Rs 2800 a) Maximize z = 1500x + 900y subject to
respectively. He can sell these items at a price of
x + y > 250, x > 30, y > 4x, x > 0, y > 0
Rs 8600 and Rs 3900 respectively. Form the
b) Maximize z = 1500x + 900y subject to
LPP to maximize the profit.
x + y > 250, x > 30, y > 4x, x > 0, y > 0
a) Maximize z = 2100x + 1100y subject to
c) Maximize z = 1500x + 900y subject to
6500x + 2800y < 1200000, x + y < 750, x < 0,
y < 0. x + y > 250, x > 30, y > 4x, x > 0, y > 0
b) Maximize z = 2100x + 1100y subject to d) Maximize z = 1500x + 900y subject to
6500x + 2800y < 1200000, x + y < 750, x < 0, x + y > 250, x 230, y > 4x, x > 0, y > 0
y<0 90. Two tailors P and Q earn Rs 350 and Rs 450 per
c) Maximize z = 2100x+ 1100y subject to day respectively. Tailor P can stitch 6 shirts and
3 trousers while tailor Q can stitich 7 shirts and 3
6500x + 2800y < 1200000, x + y > 750, x < 0,
trousers per day. Formulate the LPP, if it is
y<0
desired to produce at least 51 shirts and 24
d) Maximize z = 2100x + 1100y subject to
trousers at a minimum labour cost? .
6500x + 2800y < 1200000, x + y < 750, x < 0,
a) Minimize z = 350 x + 450y subject to
y<0
6x + 7y > 51, 3x + 3y > 8, x > 0, y > 0
88. A factory makes two types of biscuits B1 and B2
b) Minimize z = 350 x + 450y subject to
that cost Rs 145 and Rs 160 per kg. respectively.
The minimum quantities of flour, sugar and butter 6x + 7y > 51, 3x + 3y > 8, x > 0, y > 0
to be ordered for the factory are 600 kg, 400 kg c) Minimize z = 350 x + 450y subject to
and 250 kg respectively to make the biscuits. 6x + 7y > 51, 3x + 3y > 8, x > 0, y > 0
Variety B1 requires 700 gms of flour, 200 gms of d) Minimize z = 350 x + 450y subject to
sugar and 100 gms of butter to prepare 1 kg of 6x + 7y < 51, 3x + 3y > 8, x > 0, y > 0
biscuits. The variety B2 requires 600 gms of flour,

300 gms of sugar and 200 gms of butter to prepare
1 kg of biscuits.
Formulate the above LPP to minimize the cost.
a) Minimize z = 145x + 160y sunject to

MATHEMATICS - I (PLPN) Nikita Publication Pvt. Ltd.