The point/points which provides the optimal solution of the linear programming problem maximum z = 3x+y, x+3y ≤ 12, 3x+y ≤ 12, x,y ≥ 0, is/are Option 1: (4, 0) only Option 2: (3, 3) only Option 3: Points on line segment joining (4, 0) and (3, 3). Option 4: (3, 3) and (0, 0)

The answer is 'Points on line segment joining (4, 0) and (3, 3).'. View full solution:

CUET Mathematics - The point/points which provides the optimal solution of the linear programming problem maximum z = 3x+y, x+3y ≤ 12, 3x+y ≤ 12, x,y ≥ 0, is/are | PYQs + Solutions

CUET Mathematics 2026 30th May Shift 2

Algebra

Medium

common

(4, 0) only

(3, 3) only

Points on line segment joining (4, 0) and (3, 3).

(3, 3) and (0, 0)

✅ Correct Option: 3

Related questions:

15th May Shift 1

For the graph of a linear programming problem(LPP) given below. If $\min 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 \geq 0$ are

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 :

30 May Shift 2

For the L.P.P. Maximize z = 10x + 6y subjected to

3x + y ≤ 12,

2x + 5y ≤ 34,

x, y ≥ 0.

Then the feasible region represented by system of inequalities is

CUET Mathematics 2026 30th May Shift 2 PYQs

Keyboard Shortcuts