For the graph of a linear programming prob =q 0 are

-2x+y \<=q 4, x+y \<=q 3, x-2y \<=q 2

-2x+y \>=q 4, x+y \>=q 3, x-2y \>=q 2

CUET Mathematics - For the graph of a linear programming problem(LPP) given below. If z = 3x+5y is the objective function and shaded portion in the figure is the feasible region of the LPP, then constraints other than x, y ≥ 0 are | PYQs + Solutions

CUET Mathematics 2026 15th May Shift 1

Algebra

Medium

core

$-2x+y \leq 4, x+y \leq 3, x-2y \leq 2$

$-2x+y \geq 4, x+y \leq 3, x-2y \geq 2$

$-2x+y \leq 4, x+y \geq 3, x-2y \leq 2$

$-2x+y \geq 4, x+y \geq 3, x-2y \geq 2$

✅ Correct Option: 3

Related questions:

15 June Shift 2

Match List - I with List - II.

List - I	List - II
(A) The common region determined by all the constraints of LPP is called	(I) objective function
(B) Minimize $z = c_1x_1 + c_2x_2 + ..... + c_nx_n$ is	(II) convex set
(C) A solution that also satisfies the non-negative restrictions of a LPP is called	(III) feasible region
(D) The set of all feasible solutions of a LPP is a	(IV) feasible solution

Choose the correct answer from the options given below :

14 May Shift 1

Which one of the following set of constraints does the given shaded region represent?

2 June Shift 1

The corner points of the bounded feasible region for an LLP are: (5, 5), (15, 15), (0, 20) and (0, 10). Let $z = 3x + 9y$ be the objective function. Then the value of $maximum(z) - minimum(z)$ is

CUET Mathematics 2026 15th May Shift 1 PYQs

Keyboard Shortcuts