Unit VIII: Linear Programming (8 Marks)

1. Region represented by x ≥ 0 , y ≥0 lies in

(a) I quadrant (b) II quadrant (c) III quadrant (d) IV quadrant
2. The conditions x ≥ 0 , y ≥0 are called
(a) Constraints only (b) Non-negative constraints
(c) Trivial constraints (d) both (b) and
(c)
3. In the given figure, what is the LPP shaded region
known as?
(a) Feasible region
(b) Feasible solution
(c) Optimal region
(d) Objective region
4. The graph of the inequation 2 x+3 y > 6 is the:
(a) entire XOY-plane
(b) half-plane that contains the origin
(c) half-plane that neither contains the origin nor the points on the line 2 x+3 y =6
(d) whole XOY-plane excluding the points on the line 2 x+3 y =6
5. In an LPP, if the objective function Z=ax +by has same maximum value on two corner
points of the feasible region, then the number of points at which maximum value of Z
occurs is:
(a) 0 (b) 2 (c) finite (d) infinite
6. The number of solutions of an L.P.P. to minimize z=3 x +2 y under the constraints x + y ≥ 8 ,
3 x+ 5 y ≤ 15 and x ≥ 0 , y ≥0 , is :
(a) 2 (b) 5 (c) infinitely many (d) zero
7. The constraints of a linear programming problem along with their graphs is shown
below:
x +2 y ≥ 3 , x ≥ 10 , x ≥ 0 , y ≥ 0
Which of the following inequality may be removed so
that the
feasible region remains the same in
above graph?
(a) x +2 y ≥ 3
(b) x ≥ 1 0
(c) x ≥ 0
(d) y ≥ 0
8. Assertion (A): Feasible region is the set of points which
satisfy all of the given constraints.
Reason (R): The optimal value of the objective function is attained at the points
on X-axis only.
9. Write constraints for the given figure below:

10. For the feasible region (shaded) for a LPP as shown in figure, find maximum value of
Z=3 x+ 4 y
 11. Find the solution to the following linear programming
problem (if it exists) graphically.
Maximize z=x + y
subject to constraints: x− y ≤−1, −x + y ≤0 and
x ≥ 0, y ≥ 0
12. Maximize z=300 x +190 y
subject to constraints: x + y ≤ 24 , 2 x+ y ≤ 32 and
x ≥ 0 , y ≥0
13. Maximize z=3 x +9 y
subject to constraints: x +3 y ≥ 60, x + y ≥ 10 , x ≤ y and x ≥ 0 , y ≥0
14. Find the maximum and the minimum values of z=5 x +2 y
subject to constraints: −2 x−3 y ≤−6, x−2 y ≤2, 6 x +4 y ≤ 24 , −3 x+ 2 y ≤ 3, x ≥ 0 , y ≥0
Mathematical formulation of Linear Programming Problem
15. A manufacturing company makes two models A and B of a product. Each piece of
Model A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each
piece of Model B requires 12 labour hours for fabricating and 3 labour hours for
finishing. For fabricating and finishing, the maximum labour hours available are 180
and 30 respectively. The company makes a profit of ₹8000 on each piece of model A
and ₹12000 on each piece of Model B. How many pieces of Model A and Model B
should be manufactured per week to realise a maximum profit?
Formulate the linear programming problem to maximize the manufacturer profit?
16. A small firm manufactures necklaces and bracelets. The total number of necklaces and
bracelets that it can handle per day is at most 25. It takes one hour to make a bracelet
and half an hour to make a necklace. The maximum number of hours available per day
is 14. If the profit on a necklace is ₹ 100 and that on a bracelet is ₹ 300, formulate an
L.P.P. for finding how many of each should be produced daily to maximize the profit? It
is being given that at least one of each must be produced.
17. A furniture dealer deals in only two items: chairs and tables. He has ₹5,000 to invest
and a space to store at most 60 pieces. A table costs him ₹250 and a chair ₹50. He
sells a table at a profit of ₹50 and a chair at a profit of ₹15. Assuming that he can sell
all the items he buys, how should he invest his money in order that he may maximize
his profit?
Formulate the above as a linear programming problem.
18. A book publisher sells a hard cover edition of a book for ₹72 and a paperback edition
for ₹40. In addition to a fixed weekly cost of ₹9,600, the cost of printing hardcover and
paperback editions are ₹56 and ₹28 per book respectively. Each edition requires 5
minutes on the printing machine whereas hardcover binding takes 10 minutes and
paperback takes 2 minutes on the binding machine. The printing machine and the
binding machine are available for 80 hours each week. Formulate the linear
programming problem to maximize the publisher’s profit.
19. A Cooperative Society of farmers has 10 hectares of land to grow two crops A and B.
To control weeds, pesticide has to be used for crops A and B at the rate of 30 grams
per hectare and 15 grams per hectare respectively. Further, not more than 750 grams
of pesticide should be used. The profit from crops A and B per hectare are estimated
as ₹8000 and ₹9500.
Formulate the LPP, in order to allocate land to each crop for maximum total profit.
Different types of Linear Programming Problems
(Manufacturing Problem, Diet Problem, Transportation Problem)
20. A factory manufactures two types of screws, A and B. Each type of screw requires the
use of two machines, an automatic and a hand operated. It takes 4 minutes on the
automatic and 6 minutes on hand operated machines to manufacture a package of
screws A, while it takes 6 minutes on automatic and 3 minutes on the hand operated
machines to manufacture a package of screws B. Each machine is available for at the
most 4 hours on any day. The manufacturer can sell a package of screws A at a profit
of ₹7 and screws B at a profit of ₹10. Assuming that he can sell all the screws he
manufactures, how many packages of each type should the factory owner produce in a
day in order to maximize his profit? Determine the maximum profit.
21. An airplane can carry maximum of 200 passengers. A profit of ₹400 is made on each
first class ticket and a profit of ₹600 is made on each economy class ticket. The
airlines reserves at least 20 seats of first class. However, at least 4 times as many
passengers prefer to travel by economy class to the first class. Determine how many
each type of tickets must be sold in order to maximize the profit for the airline. What is
the maximum profit?
22. Rahul is at the whole sale market to purchase folding tables and chairs, to later sell
them at his furniture shop. He has only ₹ 5,760 to spend and his van has space to
carry at the most 20 items. A table costs him ₹ 360 and a chair costs ₹ 240. Back at his
shop, he plans to sell a table at a profit of ₹ 22 and a chair at a profit of ₹ 18. Given
that he can sell all the items that he purchases, how many tables and chairs shall he
purchase in order to maximise his profit?
23. If a young man rides his motorcycle at 25 km per hour, he has to spend ₹2 per km on
petrol. If he rides at a faster speed of 40 km per hour, the petrol cost increases to ₹5
per km. He has ₹100 to spend on petrol and wishes to find, what is the maximum
distance that he can travel within one hour? Express this as an LPP and then solve it.
24. A manufacturer has three machines I, II and III installed in his factory. Machines I and II
are capable of being operated for at most 12 hours whereas machine III must be
operated for at least 5 hours a day. He produces only two items M and N, each
requiring the use of all the three machines. The number of hours required for
producing 1 unit of M and N on three machines are given in the following table:
Number of hours required on
Items machines
I II III
M 1 2 1
N 2 1 1.25
He makes a profit of 600 and 400 on
one unit of items M and N respectively. Formulate the above problem as LPP and solve
it graphically to find how many units of each item be produced to maximize profit. Also
find the maximum profit.
25. A dietician has to develop a special diet using two foods P and Q. Each packet
(containing 30 g) of food P contains 12 units of calcium, 4 units of iron, 6 units of
cholesterol and 6 units of vitamin A. Each packet of the same quantity of food Q
contains 3 units of calcium, 20 units of iron, 4 units of cholesterol and 3 units of
vitamin A. The diet requires at least 240 units of calcium, at least 460 units of iron and
at most 300 units of cholesterol. How many packets of each food should be used to
minimize the amount of vitamin A? What is the minimum amount of vitamin A?
Formulate the above problem as an L.P.P. and solve it graphically.
26. Case Study: A factory manufactures tennis rackets and cricket bats. A tennis racket
1
takes 1 hours of machine time and 3 hours of craftsmanship in its making; while a
2
cricket bat takes 3 hours of machine time and 1 hour of craftsmanship. In a day, the
factory has availability of not more than 42 hours of machine time and 24 hours of
craftsmanship. Profit on a racket and on a bat are ₹ 20 and ₹ 10 respectively.
Based on the above information, answer the following questions:
 (i) If x and y are the numbers of bats and rackets manufactured by the factory, then
write the expression of total profit.
(ii) Write the constraint that relates the number of craftsmanship hours.
(iii) (a) Determine the maximum profit (in ₹ ) earned by the factory.
OR
(iii) (b) How many bats and rackets respectively, are to be manufactured to earn
maximum profit?
27. Case Study: A company has two factories located at P and Q and has three depots
situated at A, B and C. The weekly requirement of the depots at A, B and C is
respectively 5, 5 and 4 units, while the production capacity of the factories P and. Q
are respectively 8 and 6 units. The cost (in ₹ ) of transportation per unit is given below:

Cost (in ₹)
A B C
To
From
P 16 100 150
0
Q 10 120 100
0
Based on the above information, answer the following questions:
(i) Formulate the objective function and the constraints of the above Linear
programming problem.
(ii) How many units should be transported from each factory
to each depot in order that the transportation cost is
minimum?
28. Case Study:
The feasible region for an L.P.P is shown in the figure:
(i) Find the equation of the line AD.
(ii) Find the equation of the line BC.
(iii) Find the constraints for the L.P.P.
OR
Find the maximum value of the objective function z=3 x +4 y .
29. Case Study: In number theory, it is often important to find factors of an integer N.
The number N has two trivial factors, namely 1 and N. Any other factor, if exists, is
called non-trivial factor of N. Naresh has plotted a graph of some constraints (linear
inequations) with points A(0, 50), B(20, 40), C(50, 100), D(0, 200) and E (100,0). This
graph is constructed using three non-trivial constraints and two trivial constraints. One
of the non-trivial constraints is x +2 y ≥ 100.
 Based on the above information, answer the following questions:
(i) What are the two trivial constraints?
(ii) (a) If R1 is the feasible region, then what are the other two non-trivial constraints?
OR
(b) If R2 is the feasible region, then what are the other two non-trivial constraints?
(iii) If R1 is the feasible region, then find the maximum value of the objective function
z=5 x +2 y .
30. Solve the following Linear Programming Problem using Iso-Cost method.
Minimize z=18 x +10 y Subject to 4 x+ y ≥ 20 , 2 x +3 y ≥30 , x ≥ 0 and y ≥ 0.
31. Assertion (A): Feasible region is the set of points which satisfy all of the given constraints.
Reason (R): The maximum or minimum value of an objective function is known as optimal value of LPP.
All the Best