CUET Mathematics - A linear programming problem is as follows: Minimize z = 2x + 3y Subject to the constraints x ≥ 3, x ≤ 9, y ≤ 10, x - y ≥ 0, x + y ≤ 14. The feasible region has 5 corner points including | PYQs + Solutions

CUET Mathematics 2025 15 May Shift 1

Algebra

Medium

core

(0, 0) and (9, 5)

(14, 0) and (9, 0)

(7, 7) and (3, 3)

(3, 6) and (9, 5)

✅ Correct Option: 3

Related questions:

13 May Shift 1

The feasible region associated with the inequality $2x + 3y > 4$ is

3 June Shift 2

The corner points of the feasible region of a LPP with the constraints $x + 2y \leq 40$ , $3x + y \leq 30$ , $4x + 3y \leq 60$ , $x, y \geq 0$ are

16 May Shift 1

Consider the linear programming problem (LPP):

Maximize Z = 6x + 3y subject to the conditions,

4x + y ≥ 80, x + 5y ≥ 115, 3x + 2y ≤ 150, x, y ≥ 0.

In reference to the above LPP, which of the following are correct?

(A) The feasible region is bounded.

(B) The corner points of the feasible region are (15, 20), (40, 15) and (0, 75).

(D) The LPP does not have optimal solution.

Choose the correct answer from the options given below:

CUET Mathematics 2025 15 May Shift 1 PYQs