cc PRIME WORKSHEET

XII ISC
LINEAR PROGRAMMING

Multiple Choice Question

[Link] solution set of the inequation 3x + 5y > 13 is Ans. (b)

(a) Half plane than contains origin (b) open half plane not containing origin
(c) xy = plane except the points lying on 3x + 5y = 13 (d) none of these

2. Which of the following statements is incorrect? Ans. (b)

(a) If the feasible region R is bounded then both maximum and minimum occur at a corner point of R
(b) If the feasible region R is bounded then both maximum and minimum does not occur at a corner point of R
(c) If the two corner point of the feasible region R are optimal then they are called as multiple optimal points
(d) If the feasible region R is unbounded then a maximum or a minimum may or may not exist

[Link] region is the set of all points which satisfy the following Ans. (a)
(a) all the given constrains (b) some of the given constrains
(c) objective function (d) none of these

4. Objective function of LPP is Ans. (c)

(a) a relation between the variables (b) a linear constraint
(c) a function to be optimized (d) none of these

5. If the constraints in LPP are changed then Ans.(b)

(a) the objective function has to be modified (b) the LPP has to be re – evaluated
(c) solution is not defined (d) none of these

6. The point which does not lie in the half – plane 3x + 7y ≤ 32 is Ans.(a)
(a) (3, 4) (b) (-3, 4) (c) (3, -4) (d) (2, 3)

7. The optimal value of an objective function is Ans.(d)

(a) the maximum value of an objective function
(b) the minimum value of an objective function
(c)the maximum or minimum value of an objective function
(d) none of the above

8. The variable x and y in a LPP are called as Ans. (d)

(a) constraints variables (b) strict variable (c) slack variables (d) decision variable

9. The corner point of a feasible region is Ans.(c)

(a) point of intersection of all the constraints
(b) point of intersection of some of the constraints
(c) Point of intersection of all constraints including non – negative constraint
(d) none of the above

[Link] optimal solutions occur at when points of the convex region? Ans.(c)
(a) one point (b) no point (b) more than one (d) none of these

1. A manufacturer manufactures two types of tea-cups, A and B. Three machines are needed for manufacturing the tea-cups. The
time in minutes required for manufacturing each cup on the machines is given following:
Times in Minutes
Types of Cup
Machine I Machine II Machine II
A 12 18 6
B 6 0 9
Each machine is available for a maximum of 6 hr per day. If the profit on each cup of type A is ₹ 1.50 and that on each cup of type
B is ₹ 1.00, find the number of cups of each type that should be manufactured in a day to get maximum profit. [ISC 2011]

[Link] tailors P and Q earn ₹150 and ₹ 200 per day respectively. P can stitch 6 shirts and 4 trousers a day, while Q can stitch 10
shirts and 4 trousers per day. How many days should each work to produce at least 60 shirts and 32 trouser at minimum labour
cost? [ISC 2012]

3. A mill owner buys two types of machines A and B for his mill. Machine A occupies 1000 sq. m of area and required 12 men to
operate it; while machine B occupies 1200 sq. m of area and required 8 men to operate it. The owner has 7600 sq. m of

[Link]@[Link] 8115718718 8115719719

cc PRIME WORKSHEET
XII ISC
LINEAR PROGRAMMING

areaavailable and 72 men to operate the machines. If machine A produces 50 units and machine 8 produces 40 units daily, how
many machines of each type should he buy to maximize the daily output? Use linear programming to find the solution.[ISC 2013]

4. A company manufactures two types B. A toy of type A requires 5 minutes for cutting and 10 minutes for assembling. A toy of
type B requires 8 minutes for cutting and 8 minutes for assembling. There are 3 hours available for cutting and 4 hours available
for assembling the toys in a day. The profit is ₹ 50 each on a toy A and ₹ 60 each on a toy of type B. How many toys of each type
should the company manufacture in a day to maximize the profit? Use linear programming to find the solution. [ISC 2014]

5. A dietician wishes to mix two kinds of food X and Y in such a way that the mixture contains at least 10 units of vitamin A, 12
units of vitamin B and 8 units of vitamin C. The vitamin contents of one kg food is given below:
Food Vitamin A Vitamin B Vitamin C
X 1 unit 2 units 3 units
Y 2 units 2 units 1 unit

6. A company manufactures two types of products A and B. Each unit of A requires 3 grams of nickel and 1 gram of chromium,
while each unit of B requires 1 gram of nickel and 2 grams of chromium. The firm can produce 9 gram of nickel and 8 grams of
chromium. The profit is 40 on each unit of product of type A and ₹50 on each unit of type B.
How many units of each type should the company manufacture so as to earn maximum profit? Use linear programming to find the
solution. [ISC 2016]

7. A farmer has a supply of chemical fertilizer of type A which contains 10% nitrogen and 6% phosphoric acid and type B
fertilizer which contains 5% nitrogen and 10% phosphoric acid. After testing the soil conditions of a field, it is found that at least
7 kg of nitrogen and same quantity of phosphoric acid is required for a good crop. The fertilizer type A costs ₹ 5.00 per kg and
type B costs ₹ 8.00 per kg. How many kilogram of each fertilizer should be used to meet the requirement and the cost be
minimum? Find the feasible region in the graph. [ISC 2017]

8. A manufacturing company makes two types of teaching aids of Mathematics for class X. Each type of A requires 9 labour hours
for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for
finishing. For fabricating and finishing, the maximum labour hours available per week are 180 and 30 respectively. The company
makes a profit of ₹ 80 on each piece of type A and ₹120 on each piece of type B. How many pieces of type A and type B should
be manufactured per week to get a maximum profit? Formulate this as Linear Programming Problem and solve it. Identify the
feasible region from the rough sketch. [ISC 2018]

9. A carpenter has 90, 80 and 50 running feet of teakwood, plywood and rosewood which is used to produce products A and
products B. Each unit of product A requires 2, 1 and 1 running feet and each unit of 8 requires 1, 2 and running feet of teakwood,
plywood and rosewood respectively. If product A is sold for ₹ 48 per unit and product & is solid for ₹ 40 per unit, how many units
of product A and product B should be produced and sold by the carpenter, in order to obtain the maximum gross income?
Formulate above as a Linear Programming Problem and solve it, indicating clearly the feasible region in the graph. [ISC 2013]

10. A company user three macines to manufacture two types of shirts, half sleeves and full sleeves. The number of hours required
per week on machine M1, M2 and M3 for one shirt of each type is given in the following table
M1 M2 M3
Half sleeves 1 2 8/5
Full sleeves 2 1 8/5
None of the machines can be in operation for more than 40 hours per week. The profit on each half sleeve shirt is ₹ 1 and the
profit on each full sleeve shirt is ₹ 1.50. How many of each type of shirts should be made per week to maximixe the company’s
profit? [ISC 2020]

11. A manufacturer has two machines X and Y that may run at the most 360 minutes in a day to produce tec types of toys A and
B.
To produce each toy A, machines X and Y need to run at the most 12 minutes and 6 minutes respectively.
To produce each toy B machines X and Y need to run at the most 6 minutes and 9 minutes respectively.
By selling the toys A and B, the manufacturer makes the profits of ₹30 and ₹ 20 respectively.
Formulate a linear programming problem and find the number of toys A and B that should be manufactured in a day to get
maximum profit. [ISC 2022]
12. Solve the following linear programing problem graphically
Maximize z = 5x + 2y
x – 2y ≤ 2
3x + 2y ≤ 12
− 3 x + 2y ≤ 3
x,y ≥ 0 [ISC 2023]

[Link]@[Link] 8115718718 8115719719

cc PRIME WORKSHEET
XII ISC
LINEAR PROGRAMMING

13. A manufacturer produces two types of steel trunks. He has two machines, A and B. The first type of trunk requires 3 hours on
machine A and 3 hours on machine B. The second type requires 3 hours on machine A and 2 hours on machine B. Machine A and
B can work at next for 18 hours and 15 hours per day respectively. He earned a profit of ₹30 per trunk on the first type of trunk
and ₹ 25 per trunk on the second type. Formulate a Linear Programming Problem to find out how many trunk of each type he
must make each day to maximize profit. [ISC 2008]

14. A new cereal, formed of mixture of bran and rice contains at least 88 grams of protein and at least 36 milligrams of iron.
Knowing that bran contains 80 grams of protein and 40 milligrams of iron per kilogram, find the minimum cost of producing a
kilogram of this new cereal if bran cost is ₹ 28 per kilogram and rice costs ₹ 25 per kilogram. [ISC 2009]

15. A company produces two types of items P and Q. Manufacturing of both items requires the metals gold and copper. Each unit
of item P requires 3 gm of gold and 1 gm of copper while that of item Q requires 1 gm of gold and 2 gm of copper. The company
has 9 gm of gold and 8 gm of copper in its store. If each unit of item P makes a profit of ₹ 50 and each unit of item Q makes a
profit of ₹ 60, determine the number of units of each item that the company should produce to maximize profit. What is the
maximum profit? [ISC 2010]

Ans. 1. 𝑥1 = 15, 𝑥2 = 30 2. Labour cost Z = 1350 is minimum at Z (5,3), i.e., at x 1 = 5 and x2 = 3

3. 𝑥1 = 4, 𝑥2 = 3 4. 𝑥1 = 12, 𝑥2 = 15 5. ₹ 192
6. ₹230 7. ₹570 8. ₹1680
9. no. of units = 40 of A and 10 of B 10. ₹ 32.5.
11. ₹ 1050 12. Max value is 19 at x = 3.5 and y = 0.75 13. ₹ 165
14. ₹ 26.80 15. Maximum profit P = ₹ 280 at x1 = 2, x2 = 3.

1. Find the minimum value of 3xx + 5y subject to the constraints:

−2𝑥 + 𝑦 ≤ 4
𝑥+𝑦≥3
𝑥 − 2𝑦 ≤ 2
𝑥 − 2𝑦 ≤ 2
𝑥, 𝑦 ≥ 0
2. Solve linear programming problem graphically
Maximum Z = 4x + 3y
2x + y ≤ 23
𝑥 + 3𝑦 ≤ 24
𝑥 ≥ 0, 𝑦 ≥ 0
3. Solve: Minimum Z = 3x + 4y
𝑥+𝑦≥3
2𝑥 + 𝑦 ≥ 4
𝑥, 𝑦 ≥ 0

4. A manufacturer has 3 machines installed in his factory. Machines I and II are capable of being operated for at most 12 hours
whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of the three
machines. The number of hours required for producing 1 unit each of the items on the three machines is given in the following
table:
Number of Hours Required by the Machine
Items
I II II
A 1 2 1
B 2 1 5/4

He makes a profit of ₹6.00 on item A and ₹ 4.00 on item B. Assuming that he can sell all that he produces, how many of each item
should he produce so as to maximize his profit. Determine his maximum profit. Formulate this LPP mathematically and then solve
it.

5. A company manufactures two types of toys A and B. Type A requires 5 minutes each for cutting and 10 minutes each for
assembling. Type B requires 8 minutes each for cutting and mutes each of assembling. There are 3 hours available for cutting and
4 hours for assembling in a day The profit is ₹5 each on type and each A and ₹60 each on type B. How many toys of each type
should the company manufacture in a day to maximize the profit?

6 A firm manufactures two types of products A and B and sells them at a profit of ₹ 5 per unit of type A and ₹ 3 unit of type B.
Each product is processed on two machines M 1 and M2. One unit of type B requires one minute of processing time on M₁ and two

[Link]@[Link] 8115718718 8115719719

cc PRIME WORKSHEET
XII ISC
LINEAR PROGRAMMING

minutes of processing time on M2; whereas one unit of type B requires one minute of processing time on M₁ and one minute on
M2. Machines M₁ and M₂ are respectively available for at most 5 hours and
6 hours in a day. Find out how many units of each type of product should the firm produce a day in order to maximize the profit.
Solve the problem graphically.

7.. A grain dealer has ₹ 3000 for purchase of rice and wheat. A bag of rice and a bag of wheat cost ₹ 90 and ₹60 respectively. He
has a storage capacity of 40 bags only. He earns a profit of ₹ 6 and ₹ 5 per bag of rice and wheat respectively. How many bags of
each must he buy to make a maximum profit? Find the maximum profit also.
1
8. A library has to accomodate two different types of books on a shelf. The books are 6 cm and 4 cm thick and weight 1 kg and 1
2
kg each respectively. The shelf is 96 cm long and at most can support a weight of 21 kg. How should the shelf be filled with the
books of two types to include the greatest number of books? Make it as an [Link]. and solve graphically.

9. If a young man rides his motorcycle at 25 km per hour, he has to spend ₹ 2 per km on petrol; if he rides it 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 he can travel within one hour. Express this as a linear programming problem and then solve it.

10. Solve the following LPP graphically:

Maximize 𝑍 = 𝑥 + 𝑦
Subject to the constraints:
2𝑥 + 𝑦 = 3, 2𝑥 − 𝑦 ≥ 0, 𝑥 ≥ 0, 𝑦 ≥ 0.

11. Solve the following LPP graphically:

Maximize Z = 2x – 5y
Subject to the constraints:
3𝑥 + 3𝑦 ≤ 7, 4𝑦 − 3𝑥 ≤ 0, 𝑦 ≥ 1, 𝑥 ≥ 0, 𝑦 ≥ 0.

12. A shopkeeper manufactures gold rings and chains. The combined number of rings and chains manufactured per day is at most
24. It takes one hour to make a ring and half an hour for a chain. The maximum number of hours available per day is 16. If the
profit on a ring is ₹ 300 and on a chain is ₹190, how many of each should be manufactured daily, so as at maximize profit?

13. A factory owner purchases two types of machines, A and B for his factory. The requirements and the limitations for the
machine are as following :
Machine Area occupied Labour face Daily output (in unit)
A 1000 m2 12 min 60
B 1200 m2 8 min 40
He has maximum area of 9000 m2 available and 72 skilled labours which can operated both the machines. How many machines of
each types should he buy to maximize daily output

29
Ans. 1. ₹ 2. 𝑥 = 9, 𝑦 = 5, 𝑀𝑎𝑥 . 𝑍 = 51 3. 𝑥 = 3, 𝑦 = 0
3
4. 4 units of type A and 4 units of type B and max. profit = ₹ 40 5. 12 toys of type A, 15 toys of type B
6. 60 units of type A and 240 units of type B 7. 20 bags of wheat, Max. profit = ₹220
50
8. 12 books of first type and 6 of second type. 9. Max. distance = 30 km when rides km at the speed of 25
3
40 9 3 3
km/hr and km at the speed of 40 km/hr. 10. Max. value = 𝑎𝑡 𝑥 = , 𝑦 =
3 4 4 2
−7
11. Max.= min = at same point A 12. Max profit = 5440 when 8 rings and 16 chains are
3
manufactured, 13. Machines of type A = 6 and of type B = 0.

14. Aman has ₹ 1500 to purchase rice and wheat for his grocery shop. Each sack of rice and wheat costs ₹ 180 and
₹ 120 respectively. He can store a maximum number of 10 bags in his shop. He will earn a profit of ₹ 11 per bag of rice and ₹ 9
per bag of wheat.
(i) Formulate a Linear Programming Problem to maximise Aman’s profit.
(ii) Calculate the maximum profit. [ISC 2024]

15. A cooperative society of farmers has 50 hectares of land to grow two crops, X and Y. The profits from crops, X and Y per
hectare are estimated as ₹ 10500 and ₹ 9000 respectively. To control weeds, a liquid herbicide has to be used on crops X and Y in
the quantity of 20 litres and 10 litres per hectare respectively.
Further, the quantity of herbicide to be used on both the crops should not exceed 800 litres to protect the environment.
How much land should be allocated to each crop to maximise the total profit of the society? Formulate the above Linear
Programming Problem mathematically and then solve it graphically. [ISC 2025]

[Link]@[Link] 8115718718 8115719719