In the linear programming problem maximize Z = 4x+3y subject to the constraints x+y ≥ 8, 3x+5y ≤ 15, x≥0, y≥0, the feasible region has Option 1: 2 corner points Option 2: 3 corner points Option 3: 4 corner points Option 4: No point

The answer is 'No point'. View full solution:

CUET Mathematics - In the linear programming problem maximize Z = 4x+3y subject to the constraints x+y ≥ 8, 3x+5y ≤ 15, x≥0, y≥0, the feasible region has | PYQs + Solutions

CUET Mathematics 2026 12th May Shift 2

Algebra

Easy

common

2 corner points

3 corner points

4 corner points

No point

✅ Correct Option: 4

Related questions:

7 Aug Shift 2

The corner points of the feasible region determined by inequalities of LPP are $(4, 10)$ , $(6, 8)$ and $(6, 5)$ . Let $z = 3x + 4y$ be the objective function. Then the sum of maximum value of z and minimum value of z is :

4 Aug Shift 1

The constraints to the LPP are:

A. $3x + 2y \leq 720$

B. $2x + 3y \leq 720$

C. $x + y \leq 300$

D. $x \geq 0$ and $y \geq 0$

E. $x + y \geq 300$

Choose the correct answer from the options given below:

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 :

CUET Mathematics 2026 12th May Shift 2 PYQs

Keyboard Shortcuts