CUET Mathematics - The feasible region represented by the constraints: x + 2y ≥ 100, 2x - y ≤ 0, 2x + y ≤ 200, x ≥ 0, y ≥ 0 of an LPP is: | PYQs + Solutions

CUET Mathematics 2025 27 May Shift 1

Algebra

Medium

common

Region A

Region B

Region C

Region D

✅ Correct Option: 3

Related questions:

15 May Shift 2

If the objective function for a linear programming problem (LPP) is $Z = 4x + 5y$ and the corner points of the bounded feasible region are (0, 0), (4, 3), (2, 5), and (0,8), then the minimum value of Z is:

30 May Shift 2

For a linear programming problem, the feasible region is shown in the figure by shaded portion, then linear constraints are

2 June Shift 1

For the linear programing problem,

$Minimize(Z) = 60x + 30y$

subject to: $2x - y \geq -5; 3x + y \geq 3; 2x - 3y \leq 12; x, y \geq 0$

the optimal value of $z$ is

CUET Mathematics 2025 27 May Shift 1 PYQs

Keyboard Shortcuts