Online Chapter Tests

12. LINEAR PROGRAMMING

50

26 and consists 50

once your

Multiple Choice Questions [1 Mark each]

1. The solution set of the equation x + y > 10 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 the line 2x + y = 5
(d) None of the above
2. Objective function of a LPP is
(a) a constraint (b) a function to be optimized
(c) a relation between the variables (d) None of these
3. The corner points of the feasible region determined by the following system of linear inequalities :
2x + y ≤ 10, x + 3 y ≤ 15, x , y ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5).
Let z = px + qy, where p, q > 0. Condition on p and q so that maximum of Z occurs at both (3, 4) and (0, 5) is
(a) p = q (b) p = 2 q
(c) p = 3q (d) q = 3 p
4. Which of the following statements is correct?
(a) Every LPP admits an optimal solution
(b) A LPP admits unique optimal solution
(c) If a LPP admits two optimal solution it has an infinite number of optimal solutions.
(d) The set of all feasible solutions of a LPP is not a converse set.
5. Which of the following is not a convex set ?
(a) {( x , y ) : 2x + 5 y < 7} (b) {( x , y ) : x 2 + y 2 ≤ 4}
(c) { x :|x| = 5} (d) {( x , y ) : 3x 2 + 2 y 2 ≤ 6}
Fill in the Blanks [1 Mark each]

6. In a LPP, the linear inequalities or restrictions on the variables are called …………
7. The feasible region for an LPP is always a ………… polygon.
8. The method to solved LPP based on the fundamental extreme point theorem is called …………
9. A corner point of a feasible region is a point in the region which is the ………… of two boundary lines.
10. The feasible solution for a LPP is shown below
(4, 10)
(6, 8)
(0, 8)

(6, 5)

(0, 0) (5, 0)

Let z = 3x − 4 y be the objective function. Minimum of z occurs at …………

True or False [1 Mark each]

11. A set of values of the variables x1 , x2 , … , xn is called a feasible solution of a LPP, if it do not satisfies the
constraints of the problem.
12. The set of all feasible solutions of a LPP is a convex set.
13. If C1 , C2 , … Cn , are constants and x1 , x2 , … xn , are variables, then the linear function z = t c1 x1 + c2x2 + …+ cn xn which
is to be maximized only is called the objective function.
14. Maximum value of the objective function z = ax + by in a LPP always occurs at only one corner point of the
feasible region.
15. In a LPP, the maximum value of the objective function z = ax + by is always infinite.

Match the Columns [2 Marks each]

16. Consider the given LPP.

Z = 5x + 2 y
subject to − 2x − 3 y ≤ − 6
x − 2y ≤ 2
3x + 2 y ≤ 12
− 3x + 2 y ≤ 3
x, y ≥ 0
Match the Column I with Column II
Column I Column II
A. Maximum value of z I. 15
B. Minimum value of z II. 19
3 15 63
C. Value of z at   III.
 2, 4  13

Codes
A B C A B C
(a) I II III (b) II III I
(c) I III II (d) III II I
17. Match the Column I and Column II.

Column I Column II
(Problem) (Objective function)

A. A firm manufactures two types of products, A and B, and sells them at a profit of ` 2 on I. Z = 8x + 7y
type A and ` 2 on type B. Each product is processed on two machines, M 1 and M 2. Type A
requires one minute of processing time on M 1 and two minutes on M 2. Type B requires
one minute on M 1 and one minute on M 2. The machine M 1 is available for not more than
6 hours 40 minutes while M 2 is available for at most 10 hours a day.
Find how many products of each type the firm should produce each day in order to get
maximum profit.

B. A manufacturer of a line of patent medicines is preparing a production plan on medicines II. Z = 15x + 10 y
A and B. There are sufficient ingredients available to make 20000 bottles of A and 40000
bottles of B but there are only 45000 bottles into which either of the medicines can be
put. Furthermore, it takes 3 hours to prepare enough material to fill 1000 bottles of B, and
there are 66 hours available for this operation. The profit is ` 8 per bottle for A and ` 7 per
bottle for B.
How should the manufacturer schedule the production in order to maximize his profit?
Also, find the maximum profit.

C. A small manufacturer has employed 5 skilled men and 10 semiskilled men and makes an III. Z = 2x + 2y
article in two qualities, a deluxe model and an ordinary model. The making of a deluxe
model requires 2 hours work by a skilled man and 2 hours work by a semi-skilled. The
ordinary model requires 1 hour by a semi-skilled man and 3 hours by a semi-skilled man.
By union rules, no man can work more than 8 hours per day. The manufacturer gains
` 15 on the deluxe model and ` 10 on the ordinary model. How many of each type should
be made in order to maximize his total daily profit? Also, find the maximum daily profit.

Codes
A B C A B C
(a) I III II (b) II I III
(c) III I II (d) III II I

Very Short Answer Type Questions [1 Mark each]

18. Determine the maximum value of Z = 4x + 3 y, if the feasible region for an LPP is shown below.

(0, 40)

(0, 24)
(16, 16)

O (25, 0) (48, 0)

19. Maximise the function Z = 11x + 7 y, subject to the constraints :

x ≤ 3, y ≤ 2, x ≥ 0, y ≥ 0.
20. The feasible region for a LPP is shown below. Find the minimum values of
Z = 11x + 7 y.
Y

(0, 5)

(0, 3)
(3, 2)

X′ X
O

Y′ x+3y=9

x+y=5

Short Answer Type Questions [4 Marks each]

21. A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can
handle per day is at most 30. It takes are hour to make a bracelet and half an hours to make a necklace. The
maximum number of hours available per day is 20. If the profit on a necklace is ` 150 and that on a bracelet is
` 450. Formulate linear programming problem for finding how many, each should be produced for finding how
many, each should be produced daily to maximise the profit if it is being given that atleast one of each must be
produced?
22. An airplane can carry a maximum of 350 passengers. A profit of ` 2000 is made on each executive class ticket
and a profit of ` 1500 is made on each economy class ticket. The airline reserves atleast 30 seats for executive
class. However, atleast 3 times as many passengers prefer to travel by economy class than by executive class.
Form the linear programming problem to determine how many tickets of each type must be sold in order to
maximise the profit for the airline?
23. Two tailors A and B earn ` 500 and ` 600 per day, respectively. A can stitch 10 shirts and 5 pair of trousers
while B can stitch 6 shirts and 5 pairs of trousers per day. To find how many days should each of them work and
if it is desired to produce atleast 60 shirts and 30 pairs of trousers at a minimum labours cost, formulate this as
an LPP.
24. A firm has to transport atleast 1500 packages daily using large vans which carry 300 packages each and small
vans which can take 120 packages each. The cost for engaging each large van is ` 500 and each small van is
` 250. Not more than ` 3000 is to be spent daily an the job and the number of large vans cannot exceed the
number of small vans. Formulate this problem as an LPP given that the objective is to minimise cost.
Long Answer Type Questions [6 Marks each]

25. A chemical industry produces two compounds, A and B. The following table gives the units of ingredients C and
D (per kg.) of compounds A and B as well as minimum requirements of C and D, and costs per kg of A and B.

Compound in
Units Minimum requirement

A B

Ingredient C (per kg) 1 2 80

Ingredient D (per kg) 3 1 75

Cost per kg (in `) 4 6

Find the quantities of A and B which would minimize the cost.

26. A brick manufacturer has two depots, A and B, with stocks of 30000 and 20000 bricks respectively. He receives
orders from three builders P, Q and R for 15000, 20000 and 15000 bricks respectively. The cost in ` transporting
1000 bricks from the depots are given below.

To
P Q R
From

A 40 20 30

B 20 60 40

How should the manufacturer fulfill the orders so as to keep the cost of transportation minimum?