RAVI MATHS TUITION & TEST PAPERS , WHATSAPP 8056206308

Linear Programming PREVIOUSLY ASKED

12th Standard
Maths

Multiple Choice Question 13 x 1 = 13

1)
The corner points of the feasible region in the graphical representation of a linear programming problem are (2, 72),
(15, 20) and (40,15). If Z = 18x + 9y be the objective function, then

(a) Z is maximum at (2, 72), minimum at (15, 20). (b) Z is maximum at (15, 20), minimum at (40, 15).
(c) Z is maximum at (40, 15), minimum at (15, 20). (d) Z is maximum at (40,15), minimum at (2, 72).

2) The number of corner points of the feasible region determined by the constraints x - y x − y ≥ 0, 2y ≤ x + 2, x ≥ 0 and
y ≥ 0 is

(a) 2 (b) 3 (c) 4 (d) 5

3)
The objective function Z = ax + by of an LPP if its maximum value 42 at (4, 6) and minimum value 19 at (3, 2). Which
of the following is true?

(a) a = 9 and b = 1 (b) a = 5 and b = 2 (c) a = 3 and b = 5 (d) a = 5 and b = 3

4) The corner points of the feasible region of linear programming problem are (0, 4), (8,0) and (
20
,
4
) If Z = 30x + 24y is
4 3

the objective function, then (Maximum value of Z- Minimum value of Z) is equal to

(a) 144 (b) 96 (c) 120 (d) 136

5)
The feasible region of a linear programming problem is shown in the figure below:

Which of the following are the possible constraints?

(a) x + 2y ≥ 4, x + y ≤ 3, x ≥ 0, y ≥ 0 (b) x + 2y ≤ 4, x + y ≤ 3, x ≥ 0, y ≥ 0 (c) x + 2y ≥ 4, x + y ≥ 3, x ≥ 0, y ≥ 0

(d) x + 2y ≥ 4, x + y ≥ 3, x ≤ 0, y ≤ 0

6)
The solution set of the inequality 3x + 5y < 4 is

(a) an open half plane not containing the origin. (b) an open half plane containing the origin.

(c) the whole XY-plane not containing the line 3x + 5y = 4. (d) a closed half plane containing the origin.
7) The corner points of the shaded unbounded feasible region of an LPP are (0, 4), (0.6, 1.6) and (3, 0) as shown in the
figure. The minimum value of the objective function Z = 4x + 6y occurs at

(a) (0.6, 1.6) only (b) (3, 0) only (c) (0.6, 1.6) and (3, 0) only
(d) at every point of the line-segment joining the points (0.6, 1.6) and (3,0)

8)
A linear programming problem is as follows Minimise Z = 30x + 50y Subjcct to the constraints,
3x + 5y ≥ 15, 2x + 3y ≤ 18 and x ≥ 0, y ≥ 0 In the fcasible region, the minimum value of Z occurs at

(a) a unique point (b) no point (c) infinitely many points (d) two points only

9) In a linear programming problem, the constraints on the decision variables x and y are ,
x − 3y ≥ 0, y ≥ 0

0 ≤ x ≤ 3 .The feasible region

(a) is not in the first quadrant (b) is bounded in the first quadrant (c) is unbounded in the first quadrant

(d) does not exist

10)
In the given graph, the feasible region for a LPP is shaded. The objective function Z = 2x - 3y will be minimum at

(a) (4, 10) (b) (6, 8) (c) (0, 8) (d) (6, 5)

11)
Based on the given shaded region as the feasible region in the graph, at which point (s) is the objective function Z =
3x + 9y maximum.

(a) Point B (b) Point C (c) Point D (d) Every point on the line segment CD

12) The point which does not lie in the half plane is
2x + 3y − 12 ≤ 0

(a) (1, 2) (b) (2, 1) (c) (2, 3) (d) (-3, 2)

13)
The graph of the inequality 2x + 3y > 6 is

(a) half plane that contains the origin

(b) half plane that neither contains the origin nor the points of the line 2x + 3y = 6

(c) whole XOY-plane excluding the points on the line 2x + 3y = 6 (d) entire XOY-plane
3 Marks 9 x 3 = 27
14)
Solve the following Linear Programming Problem graphically:
Minimise Z = – 3x + 4 y
subject to constraints
x + 2y ≤ 8, 3x + 2y ≤ 12

and x, y ≥ 0.

15)
Show that the minimum of Z occurs at more than two points
Minimise and Maximise Z = x + 2y
subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y ≤ 200; x, y ≥ 0.

16)
Solve the following Linear Programming Problem graphically:
Maximize Z = 3x + 4y subject to the constraints:
x + y ≤ 4,

x ≥ 0 and

y ≥ 0.

17)
Solve the following linear programming problem graphically.
Maximise Z = −x + 2y subject to the constraints :
4x + y ≥ 80, x + 5y ≥ 115, 3x + 2y ≤ 150, x ≥ 0, y ≥ 0

18)
Maximise and minimise Z = x + 2y subject to the constraints
x + 2y ≥ 100 ,
2x − y ≤ 0 ,
2x + y ≤ 200 and
x, y ≥ 0

Solve the above LPP graphically.

19)
Solve the following Linear Programming Problem graphically
Maximise Z = 300x + 600y
Subject to the constraints x + 2y ≤ 12

2x + y ≤ 12 ,
5
x + y ≥ 5
4

x ≥ 0, y ≥ 0

20)
Solve the following linear programming problem graphically :
Minimise Z = x + 2y
Subject to the constraints
2x + y ≥ 3, x + 2y ≥ 6

and x ≥ 0, y ≥ 0.

21)
Solve the following linear programming problem graphically:
Maximise Z = - 3x - 5y
Subject to the constraints
−2x + y ≤ 4, x + y ≥ 3

x − 2y ≤ 2 and x ≥ 0, y ≥ 0

22)
Solve the following LPP graphically: Maximise and minimise Z = x + 2y Subject to the constraints
x + 2y ≥ 100 ,
2x − y ≤ 0 ,
2x + y ≤ 200 ,
and x, y ≥ 0

5 Marks 5 x 5 = 25
23)
Solve the following LPP graphically.
Maximise Z = 60x + 40y
subject to the constraints
x + 2y ≤ 12

2x + y ≤ 12

4x + 5y ≥ 20 and x, y ≥ 0

24)
Solve the following Linear Programming Problem graphically:
Maximise Z = 70x + 40y
subject to constraints
3x + 2y ≤ 9, 3x + y ≤ 9 and x ≥ 0, y ≥ 0

25)
The corner points of the feasible region determined by the system of linear constraints are as shown below

Answer each of the following:

(i) Let Z =3x - 4y be the objective function. Find the maximum and minimum value of Z and also the corresponding
points at which the maximum and minimum value occurs.
(ii) Let Z = px + qy, where , q > 0 be the objective function. Find the condition on p and q so that the maximum
value of Z occurs at B(4,10) and C(6, 8). Also, mention the number of optimal solutions in this case.

26)
Find the minimum and maximum values of the objective function.
Z = 3x + 9y
Subject to constraints
x + 3y ≤ 60, x + y ≥ 10, x ≤ y

and x ≥ 0, y ≥ 0

27)
Find the maximum value of the objective function Z = 3x + 4y
Subject to constraints
x + y ≤ 4; x ≥ 0 and y ≥ 0

*****************************************