LINEAR PROGRAMMING CUET PYQs
1. The feasible region for a LPP is shown in the given figure. The maximum value of z = 2x + 5y is:
(a) 14 (b) 10 (c) 36 (d) 26
[CUET 2023]
2. In a Linear Programming problem, the objective function is always:
(a) Linear (b) Quadratic (c) Cubic (d) Biquadratic
[CUET 2023]
3. The corner points of the feasible region determined by the following system of linear inequalities: 2x + y
≤ 10, x + 3y ≤ 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 = 2q (c) p = 3q (d) q = 3p
[CUET 2023]
4. The comer points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40),
(60, 20), (60, 0). The objective function is z = 4x + 3y.
Compare the quantity in Column-A and Column-B.
Column-I Column-II
Maximum value of z 350
(a) The quantity in column A is greater
(b) The quantity in column B is greater
(c) The two quantities are equal
(d) The quantity in column B is greater than twice the quantity in column A
[CUET 2023]
1
5. The feasible region represented by the system of inequalities x + y ≤ 3, y ≤ 6, x ≥ 0, y ≥ 0 is:
(a) Unbounded in first quadrant
(b) Bounded in first quadrant
(c) Unbounded in first and second quadrant
(d) Bounded in first and second quadrant
[CUET 2023]
6. The set of values of decision variables that satisfy the linear constraints and non-negative conditions of a
linear programming problem is called its:
(a) Unbounded solution
(b) Bounded solution
(c) Feasible solution
(d) Optimum solution
[CUET 2023]
7. In a Linear Programming Problem:
(a) The constraints are linear, in any objective function.
(b) The constraints and objective function both are linear.
(c) Constraints are linear or quadratic and objective function is linear.
(d) Only one of the constraints or the objective function is linear.
[CUET 2023]
8. The corner points of the feasible region for an LPP are (0, 10), (5, 5), (15, 15) and (0, 20). If the
objective function is Z = px + qy; p, q > 0, then the condition on p and q so that the maximum of Z
occurs at (15, 15) and (0, 20) is
(a) p = q (b) p = 2q (c) q = 2p (d) q = 3p
[CUET 2023]
9. The maximum value of the function Z = 3x + 3y, subject to the constraints
x + 2y ≤ 30, 2x + y ≤ 50, x ≥ 0, y ≥ 0 is:
(a) 75 (b) 90 (c) 80 (d) 45
[CUET 2022]
2
10. A manufacturer of electronic circuit, has a stock of 200 resistors, 120 transistors and 150 capacitors and
is required to produce two types of circuits A and B. Type A requires 20 resistors, 10 transistors and 10
capacitors. Type B requires 10 resistors, 20 transistors and 30 capacitors. If the profit on type A circuit is
₹50 and that on type B circuit is ₹60, identify the constraints for this LPP, if it was assumed that x circuit
for type A and y circuits of type B was produced by the manufacturer.
A. x + 2y ≥ 15 B. 2x + y ≤ 20
C. x + 2y ≤ 12 D. x, y, ≤ 0
Choose the correct answer from the options given below:
(a) A and B only (b) B and C only (c) C and D only (d) A and D only
[CUET 2022]
11. The vertices of a closed convex polygon representing the feasible region of the LPP with, objective
function Z = 5x + 3y are (0, 0), (3, 1), (1, 3) and (0, 2). The maximum value of z is
(a) 6 (b) 18 (c) 14 (d) 15
[CUET 2022]
12. The corner points of the feasible region of an LPP are (0, 0), (30, 0), (20, 30) and (0, 50). If the objective
function maximize (Z) = ax + by, where a ≠ b and a, b > 0, has 0) and (20, 30) then optimal solution at
both points (30, 0) and (20, 30) then which of the following is true?
(a) a = 2b (b) a = 3b (c) 2a=b (d) 3a=b
[CUET 2022]
13. Which of the following is NOT a corner point of the feasible set S = {(x, y): 3x + 4y ≤ 24, 8x + 6y ≤ 48,
x ≤ 5, x ≥ 0, y ≥ 0} of some LPP?
24 24 4 24 33
(a) ( 7 , 7 ) (b) (5, 3) (c) ( 7 , 7 ) (d) (0, 6)
[CUET 2022]
14. The linear programing problem
Max. (z) = 5x + 7y
Subject to
x + y ≥ 10
3x + 5y ≤ 15,
x ≥ 0, y ≥ 0;
(a) Has a unique optimal solution
(b) Is infeasible
(c) Has multiple optimal solutions
(d) Is feasible and unbounded
[CUET 2022]
3
15. The solution of linear programming problem
Maximize Z = 3x1 + 5x2
Subject to 3x1 + 2x2 ≤ 18, x1 ≤ 4, x2 ≤ 6 x1 ≥ 0, x2 ≤ 0
is
(a) x1 = 2, x2 = 6, Z = 36
(b) x1 = 4, x2 = 3, Z = 27
(c) x1 = 2, x2 = 0, Z=6
(d) x1 = 4, x2 = 6, Z = 42
[CUET 2022]
16. The maximum value of the objective function Z = x + y
Subject to constraints:
x – y ≤ -1
-x + y ≤ 0 and x ≥ 0, y ≥ 0 is
(a) 0 (b) 1 (c) 2 (d) Maximum value does not exist
[CUET 2022]
4
Answers
1. d
2. a
3. d
4. b
5. b
6. c
7. b
8. d
9. c
10. b
11. b
12. b
13. c
14. b
15. a
16. d
