Roll No : Name of School : Time : 02:30

Date : 2025-02-09 RAMAMOORTHY KRISHNARAJ

Name of Assessment : REVISION

TEST

Subject : PHYSICS
Class : 12

1A manufacturer makes two types of furniture, chairs and tables. Both the 2
products are processed on three machines A 1, A2 and A3. Machine A1
requires 3 hours for a chair and 3 hours for a table, machine A2 requires 5
hours for a chair and 2 hours for a table and machine A3 requires 2 hours

for a chair and 6 hours for a table. Maximum time available on machine A1,

A2 and A3 is 36 hours, 50 hours and 60 hours respectively. Profits are 20

per chair and 30 per table. Formulate the above as a linear programming

problem to maximise the profit.

Ans :

Let x chairs and y tables are manufactured.

Then LPP is

x
Ma imise P = 20x + 30y
subject to the constraints , x ≥ 0, y ≥ 0, 3x + 3y ≤ 36, 5x + 2y ≤ 50, 2x +
6y ≤ 60.

2One kind of cake requires 200 g of flour and 25 g of fat and another kind 2
of cake requires 100 g of flour and 50 g of fat, 5 kg of flour and 1 kg of fat
, formulate the problem to find the maximum number of cakes
is available

which can be made, assuming that there is no shortage of the other

ingredients used in making the cakes.

Let x cakes of kind I and y cakes of kind II are made.

Then LPP is

x
Ma imise Z = x+y
Subject to the constraints x ≥ 0, y ≥ 0
200x + 100y ≤ 5000
Ans : 25x + 50y ≤ 1000

3Two tailors A and B earn 150 and 200 per day respectively. A can stich 6 2
shirts and 4 pants per day while B can stich 10 shirts and 4 pants per day.
Form a linear programming problem to minimise the labour cost to

produce at least 60 shirts and 52 pants.

Let A works for x days and B works for y days
Then LPP is

To Minimise cost Z 150x + 200y

=

subject to constraints,

x ≥ 0, y ≥ 0
6x + 10y ≥ 60
Ans : 4x + 4y ≥ 52

4A small firm manufactures necklaces and bracelets. The total number of 2

necklaces and bracelets that it can handle per da y is at most 24. It takes
one hour to make a bracelet and half an hour to make a necklace . The
x
ma imum number of hours available per da y is 16. If the profit on a
necklace is ` 100 and that on a bracelet is ` 300. Formulate an LPP for
finding how man y of each should be produced daily to maximise the
profit ? It is being given that at least one of each must be produced.
Ans : Let x necklaces and y bracelets be produced. Then LPP is
To maximise profit Z = 100x + 300y subject to constraints x ≥ 1, y ≥ 1

x + y ≤ 24; x+ y ≤ 16

5Two tailors, A and B, earn ₹300 and ₹400 per day respectively. A can stitch 2
6 shirts and 4 pairs of trousers while B can stitch 10 shirts and 4 pairs of
trousers per day. To find how many days should each of them work and ifit

is desired to produce at least 60 shirts and 32 pairs of trousers at a

minimum labour cost, formulate this as anLPP.

Ans :
6 Of all the points of the feasible region , for maximum or minimum of 1
objective function , the point lies
(a ) inside the feasible region

(b ) y line of the feasible region

at the boundar

(c) vertex point of the boundary of the feasible region

(d ) none of these

Ans : (c )

7A dealer wishes to purchase a number of fans and sewing machines. He 1

has onl 5,760 to invest and has space for at most 20 items. A fan costs
y
him 360 and a sewing machine 240. He expects to sell a fan at a profit
of 22 and a sewing machine at a profit of 18. Assuming that he can sell
all the items that he buys, how should he invests his money to maximise

the profit? The LPP for above question is

(a) x → fans, y → sewing machines

To maximise Z = 22x + 18y

subject to constraints

x ≥ 0, y ≥ 0, x + y ≤ 20
360x + 240y ≥ 5760
(b) x → fans, y → sewing machines

To maximise Z = 18x + 22y

subject to constraints

x ≥ 0, y ≥ 0, x + y ≤ 20
360x + 240y ≥ 5760
(c) x → fans, y → sewing machines

To maximise Z = 22x + 18y

x ≥ 0, y ≥ 0, x + y ≥ 0
360x + 240y ≥ 5760
(d) x → fans, y → sewing machines

To maximise Z = 22x + 18y

x ≥ 0, y ≥ 0, x + y ≤ 20
360x + 240y ≤ 5760

Ans : (d )

8 Feasible region is the set of points which satisf y 1

(a ) the objective functions

(b ) some of the given constraints

(c ) all of the given constraints

(d ) none of these

Ans : (c )

9An aeroplane can carry a maximum of 200 passangers. A profit of 400 is 1

made on each first class ticket and a profit of 300 is made on each
economy class ticket. An airline reserves at least 20 seats for first class.

However, at least 4 times as many passengers prefer to travel

by economy class than by first class. Find how many tickets of each type

must be sold to maximise the profit? The LPP for the given situation is

(a) x → first class, y → economy class

To maximise Z = 400x + 300y

subject to constraints

x ≥ 0, y ≥ 0, x + y ≤ 200
x ≥ 20, y ≥ 80
(b) x → first class, y → economy class

To maximise Z = 400x + 300y

subject to constraints

x ≥ 0, y ≥ 0, x + y ≥ 200
x ≥ 20, y ≥ 80
(c) x → first class, y → economy class

To maximise Z = 400x + 300y

subject to constraints

x ≥ 0, y ≥ 0, x ≥ 20
x + y ≤ 200
x ≥ 4y
(d) x → first class, y → economy class

To maximise Z = 400x + 300y

subject to constraints

x ≥ 20, y ≥ 0
x + y ≤ 200
y ≥ 4x
Ans : (d )

10 Solution of LPP 1
x
To ma imise Z 4x + 8 y
=

subject to constraints : 2x + y ≤ 30, x + 2y ≤ 24, x ≥ 3, y ≤ 9, y ≥ 0 is

(a) x = 12, y = 6

(b) x = 6, y = 12

(c) x = 9, y = 6

(d ) none of these

Ans : (a )

11 The objective function for a given linear programming problem is Z = ax + 1

b y –5. If Z attains same value at 1, 2) and (3, 1), then
(

(a) a 2b = 0
+

(b) a + b = 0

(c) a = b

(d) 2a – b = 0
Ans: (d) z(1, 2) = z(3, 1) ⇒ a + 2b – 5 = 3a + b – 5 ⇒ –2a + b = 0
⇒ 2a – b = 0

12For a given LPP, corner points of a closed feasible region are A(3, 5), B(4, 1
2), C(3, 0) and O(0, 0), then objective function, Z = px + qy attains
x
ma imum at

(a) A

(b) B

(c) C or O

(d) It depends upon values of p and q and points A , B, C.

Ans :
(d) x
It depends upon values of p and q and ma imum value can be at A , B,
C .

13 Which of the terms is not used in linear programming 1

(a) slack inequations
(b) concave region

(c) objective function

(d) feasible region

Ans : (b) Concave region

14 The objective function of LPP is 1

(a) a constraint

(b) a function to be optimised

(c) a relation between the variables

(d) None of these

Ans :( b) a function to be optimised