Scribd
Upload
229 views3 pages

WORKSHEET LPP

Uploaded by

dharmendra25112006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
229 views3 pages

WORKSHEET LPP

Uploaded by

dharmendra25112006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

WORKSHEET (LINEAR PROGRAMMING PROBLEM)

MCQ(1 Mark each)

1. 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

2. Which of the following points satisfies both the in equations 2x+y≤10 and x+2y≥ 8?
(a) (-2,4) (b) (3,2) (c) (-5,6) (d) (4,2)
3. The corner points of the bounded feasible region determined by a system of linear
constraints are (0,3), (1,1)and (3,0). Let Z = px + qy, where p,q >0. The condition on p and q
so that the minimum of Z occurs at (3,0) and (1,1) is
(a) p=2q (b) p=q/2 (c) p=3q (d) p=q
4. The feasible region satisfied by the constraints 𝑥 + 𝑦 ≤ 5, 𝑥 ≤ 4, 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0, 5𝑥 + 𝑦 ≥ 5,
x+ 6𝑦 ≥ 6 is bounded by
(a) 4 straight lines (b) 5 straight lines (c) 6 straight lines (d) 7 straight lines
5. For the following feasible region, the linear constraints are :

(a) 𝑥 ≥ 0, 𝑦 ≥ 0, 3𝑥 + 2𝑦 ≥ 12, 𝑥 + 3𝑦 ≥ 11 (b) 𝑥 ≥ 0, 𝑦 ≥ 0, 3𝑥 + 2𝑦 ≤ 12, 𝑥 + 3𝑦 ≥ 11


(c) 𝑥 ≥ 0, 𝑦 ≥ 0, 3𝑥 + 2𝑦 ≤ 12, 𝑥 + 3𝑦 ≤ 11 (d) None of these
6. 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) Every point on line segment CD (d) Point D

PREPARED BY MANISHA SAWOO . PGT(MATHS)


7. In the given graph, the feasible region for a LPP is shaded. The objective function
𝑍=20𝑥+10𝑦, will be minimum at:

(a) (15,0) (b) (40,0) (c)(4,18) (d)(6,12)


8. Corner points of the feasible region for an LPP are (0,2),(3,0),(6,0),(6,8) and (0,5). Let
𝑍=4𝑥+6𝑦 be the objective function. The minimum value of 𝑍 occurs at:
(a) (0,2) only
(b) (3,0) only
(c) The mid-point on the line segment joining the point (0,2) and (3,0) only
(d)Any point on the line segment joining the points (0,2) and (3,0).
9. The feasible region corresponding to the linear constraints of a Linear Programming Problem
is given below. Which of the following is not a constraint to the given Linear Programming
Problem?

(a) x+y≥2 (b) x + 2y ≤10


(c) x-y≥1 (d) x- y ≤1
10. 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

PREPARED BY MANISHA SAWOO . PGT(MATHS)


(a)(0.6, 1.6) 𝑜𝑛𝑙𝑦 (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)
11. 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)
12. The number of corner points of the feasible region determined by the constraints x- y 0,
2y x + 2, x 0, y 0 is :
(a) 2 (b) 3 (c) 4 (d) 5
13. The objective function of Z=ax+by of an LPP has maximum value 42 at (4,6) and minimum
value 19 at (3,2). Which of the following is true?
(a) A=9,b=1 (b) a=5,b=2 (c) a=3,b=5 (d)a=5,b=3
SA (This section comprises of short answer type questions of 3 marks each)
14. Solve the following Linear Programming Problem graphically:
Minimize: z = x + 2y
subject to the constraints: x + 2y ≥100, 2x -y≤0, 2x +y ≤200, x,y≥0
15. Solve the following Linear Programming Problem graphically: Maximize: z= - x +2 y
subject to the constraints: x≥3, x +y ≥5, x +2y ≥6, y≥0
16. Solve the following Linear Programming Problem graphically: Maximize Z = 400x + 300y
subject to 𝑥 + 𝑦 ≤ 200, 𝑥 ≤ 40, 𝑥 ≥ 20, ≥ 0
17. Solve the following Linear Programming Problem graphically: Minimize Z = 5x + 10y
subject to 𝑥 + 2𝑦 ≤ 120, 𝑥 +y ≥ 60, x-2y≥0, 𝑥 ≥ 0, 𝑦 ≥ 0
18. Solve the following Linear Programming Problem graphically: Maximize Z = 3x + 9y
subject to the constraints 𝑥 + 𝑦 ≥10, 𝑥 + 3y ≤ 60, x≤y , 𝑥 ≥ 0, 𝑦 ≥ 0

PREPARED BY MANISHA SAWOO . PGT(MATHS)

You might also like