CUET Mathematics: AlgebraLinear Programming. Free, no login required.

Q1:

2026: 31 May Shift 2

Linear Programming

Medium

Common

The feasible region for a LPP is shown in the given figure. The maximum value of z=2x+5yz = 2x + 5y is :

Answer options
Option 4
Correct Answer
Explanation for 2026: 31 May Shift 2 MAT question 1

Q2:

2026: 31 May Shift 2

Linear Programming

Medium

Core

A LPP max Z=3x+8ymax\,Z = 3x + 8y subjected to the constraints 2x+y≤102x + y \le 10, x+3y≤15x + 3y \le 15, x,y≥0x,y \ge 0, then max Zmax\,Z is

Answer options
Option 1
Correct Answer
Explanation for 2026: 31 May Shift 2 MAT question 2

Q3:

2026: 31 May Shift 2

Linear Programming

Hard

Core

A LPP max z=ax+bymax\,z = ax+by having bounded feasible region with vertices on (2,1),(3,2),(5,6)(2,1), (3,2), (5,6) and (1,7)(1,7). Then which of following are TRUE?

A. max zmax\,z occurs at (1,7)(1,7) and (5,6)(5,6) if b=4ab = 4a

B. max zmax\,z occurs at (1,7)(1,7) and (5,6)(5,6) if b=−4ab = -4a

C. max zmax\,z does not exist

D. if max zmax\,z occurs at (1,7)(1,7) and (5,6)(5,6), then max zmax\,z occurs for infinite number of value of xx and yy

Choose the correct answer from the options given below:

Answer options
Option 3
Correct Answer
Explanation for 2026: 31 May Shift 2 MAT question 3

Q4:

2026: 31 May Shift 2

Linear Programming

Medium

Applied

If the corner points of the bounded feasible region for an LPP are (5,0),(0,4),(0,2),(3,4)(5,0), (0,4), (0,2), (3,4), and (0,7)(0,7), then the minimum value of the objective function z=2x+5yz = 2x+5y occurs at :

Answer options
Option 4
Correct Answer
Explanation for 2026: 31 May Shift 2 MAT question 4

Q5:

2026: 31 May Shift 2

Linear Programming

Medium

Applied

Consider a LPP given by:

Maximize z=3x+4yz = 3x+4y,

Subject to: x+y≤40x+y \le 40, x+2y≤60x+2y \le 60, x,y≥0x,y \ge 0.

Then which of the following statements are correct ?

A. The corner points of the feasible region are (0,0),(0,30),(40,0),(20,20)(0,0), (0,30), (40,0), (20,20).

B. The feasible region is unbounded.

C. The feasible region is bounded.

D. The maximum value of z=3x+4yz=3x+4y is obtained at (60,40)(60,40).

Choose the correct answer from the options given below:

Answer options
Option 2
Correct Answer
Explanation for 2026: 31 May Shift 2 MAT question 5

Q6:

2026: 30 May Shift 2

Linear Programming

Medium

Common

The point/points which provides the optimal solution of the linear programming problem maximum z=3x+yz = 3x+y, x+3y≤12,3x+y≤12,x,y≥0x+3y \le 12, 3x+y \le 12, x,y \ge 0, is/are

Answer options
Option 3
Correct Answer
Explanation for 2026: 30 May Shift 2 MAT question 6

Q7:

2026: 30 May Shift 2

Linear Programming

Easy

Core

The corner points of the bounded feasible region of a linear programming problem are A(15,0), B(40,0), C(4, 18), D(6, 12) and objective function is z=20x+10yz = 20x+10y, then which of the following are TRUE?

(A) Value of z at point A(15, 0) = 300.

(B) Value of z at point B(40, 0) = 800.

(C) Value of z at point C(4, 18) = 340.

(D) Maximum value of z = 800.

Choose the correct answer from the options given below:

Answer options
Option 1
Correct Answer
Explanation for 2026: 30 May Shift 2 MAT question 7

Q8:

2026: 30 May Shift 2

Linear Programming

Easy

Applied

Consider the linear programming problem (LPP):

Max Z= 4x + 3y

subject to the constraints:

x≤8,y≤4,x≥0,y≥0x\le 8, y\le 4, x\ge 0, y\ge 0. At what coordinates will the objective function have optimal solution?

Answer options
Option 4
Correct Answer
Explanation for 2026: 30 May Shift 2 MAT question 8

Q9:

2026: 30 May Shift 2

Linear Programming

Easy

Applied

If the objective function for a LPP is Z=3x+5yZ=3x+5y and the corner points of the bounded feasible region are (0, 0), (6, 0), (3, 5) and (0, 3), then the value of ∣max(Z)−min(Z)∣|max(Z) - min(Z)| is:

Answer options
Option 4
Correct Answer
Explanation for 2026: 30 May Shift 2 MAT question 9

Q10:

2026: 30 May Shift 1

Linear Programming

Easy

Common

The corner points of the bounded feasible region determined by the system of linear constraints of an LPP are (0, 0), (0, 8), (5, 0) and (4, 10). Let z=3x−4yz = 3x - 4y be the objective function, then the minimum value of zz is:

Answer options

Q11:

2026: 30 May Shift 1

Linear Programming

Medium

Core

In reference to a linear programming problem (LPP), which of the following statements are true?

A. The optimal value of the objective function is attained at the points given by intersections of inequation with the axes only.

B. The objective function of a LPP is a linear function to be optimized.

C. Every LPP admits an optimal solution.

D. The region represented by the inequation system, x,y≥0x, y\geq0, x+2y≤4,3x+y≥3,4x+3y≥6x+2y\leq4, 3x+y\geq3, 4x+3y\geq6 is bounded in the first quadrant.

Choose the correct answer from the options given below:

Answer options

Q12:

2026: 30 May Shift 1

Linear Programming

Medium

Core

For a LPP, the objective function is z=4x+3yz=4x+3y and the feasible region determined by a set of linear constraints is shown in the graph as a shaded portion. Which one of the following statement is true ?

Answer options

Q13:

2026: 30 May Shift 1

Linear Programming

Easy

Applied

Which of the following statements are correct about the linear programming problem (LPP)?

A. Every point in the feasible region is a feasible solution of the given LPP.

B. An optimal solution of an LPP, if it exists, occurs at one of the extreme points of the convex set of the feasible solutions.

C. The feasible region for an LPP is always a convex set.

D. If an LPP admits two optimal solutions, it has an infinite number of optimal solutions.

Choose the correct answer from the options given below:

Answer options

Q14:

2026: 30 May Shift 1

Linear Programming

Medium

Applied

The point at which the maximum value of the function Z=x+yZ=x+y, subject to the constraints x+2y≤70x+2y\leq70, 2x+y≤952x+y\leq95, x,y≥0x,y\geq0, is obtained, is:

Answer options

Q15:

2026: 29 May Shift 2

Linear Programming

Easy

Common

The corner points of the bounded feasible region of an LPP are (0,0), (6,0), (4,3) and (0,6). Let Z=ax+byZ = ax + by, where a,b>0a, b > 0. Condition on aa and bb so that the maximum of ZZ occurs at both (4, 3) and (0, 6) is

Answer options

Q16:

2026: 29 May Shift 2

Linear Programming

Easy

Core

The number of feasible solutions of the linear programming problem as

Maximum z=15x+30yz=15x+30y subject to the constraints

3x+y≤123x+y \leq 12

x+2y≤10x+2y \leq 10

x≥0,y≥0x \geq 0, y \geq 0

is

Answer options

Q17:

2026: 29 May Shift 2

Linear Programming

Easy

Core

For linear programming problem maximize z=2x+3yz=2x+3y

Subject to the constraints x+y≤4x+y \leq 4

x≤2x \leq 2

x≥0,y≥0x \geq 0, y \geq 0

Maximum value of z is

Answer options

Q18:

2026: 29 May Shift 1

Linear Programming

Medium

Common

The maximum value of z=5x+3yz=5x+3y subjected to the constraints 2x+3y≥60,2x+y≤40;x,y≥02x+3y \ge 60, 2x+y \le 40; x,y \ge 0 is:

Answer options

Q19:

2026: 29 May Shift 1

Linear Programming

Easy

Core

The feasible region determined by the following constraints of a LPP

x+y≥5x+y \ge 5

y≤8y \le 8

x≥0,y≥0x \ge 0, y \ge 0 is

Answer options

Q20:

2026: 29 May Shift 1

Linear Programming

Medium

Core

Let the corner points of the bounded feasible region of an LPP determined by a set of constraints are A(1, 5), B(3, 2) and C(2, 1). If the objective function z=2ax+byz=2ax+by, a,b>0a,b>0 has maximum values at points A and B, and z has minimum value 8 at point C, then the value of 4a+b4a+b is:

Answer options

Q21:

2026: 29 May Shift 1

Linear Programming

Medium

Applied

The corner points of the bounded feasible region for an LPP are (0, 0), (6, 0), (4, 3) and (0, 8). The objective function Z=px+qyZ=px+qy, p,q>0p,q>0 has maximum value 360 at points (6, 0) and (4, 3). The value of ZZ at (0, 8) is :

Answer options

Q22:

2026: 29 May Shift 1

Linear Programming

Easy

Applied

If the objective function for an LPP is Z=4x+5yZ=4x+5y and the corner points for bounded feasible region are (10, 0), (5, 3), (2, 5) and (0, 6), then the minimum value of ZZ occurs at

Answer options

Q23:

2026: 26 May Shift 2

Linear Programming

Medium

Common

If the feasible region (shaded portion)of a LPP is as shown in the graph, then max z=50x+15yz = 50x + 15y is:

Answer options

Q24:

2026: 26 May Shift 2

Linear Programming

Medium

Core

Which one of the region I, II, III, IV is represented by the constraints

x+3y≤60,x+y≥10,x≤y,x≥0,y≥0x + 3y \le 60, x + y \ge 10, x \le y, x \ge 0, y \ge 0

Answer options

Q25:

2026: 26 May Shift 2

Linear Programming

Medium

Core

For any linear programming problem the feasible region is shaded region as given below, then constraints are:

Answer options

Q26:

2026: 26 May Shift 2

Linear Programming

Medium

Applied

Consider an LPP:

Maximize Z=5x+yZ = 5x + y

Subject to x+3y≤12x + 3y \le 12

3x+y≤123x + y \le 12

and x,y≥0x,y \ge 0

then which of the following statements are TRUE ?

A. The corner points of the bounded feasible region are (0,0), (4,0), (3,3) and (0,4).

B. Maximum value of zz occurs at (3,3).

C. Maximum value of zz occurs at (4,0).

D. The maximum value of zz is 20.

Choose the correct answer from the options given below:

Answer options

Q27:

2026: 26 May Shift 2

Linear Programming

Medium

Applied

If the objective function for an LPP is Z=2x+5yZ = 2x + 5y and the corner points of the bounded feasible region are (0, 0), (5, 0) , (85,65)\left(\dfrac{8}{5},\dfrac{6}{5}\right) and (0, 2) then the maximum value of zz occurs at

Answer options

Q28:

2026: 25 May Shift 1

Linear Programming

Easy

Common

For a two variables linear programming problem (LPP), which of the following statement is correct ?

Answer options

Q29:

2026: 25 May Shift 1

Linear Programming

Medium

Core

For the linear programming problem:

Minimize z=2x−5yz = 2x - 5y, subject to the constraints:

x+2y≥10x + 2y \ge 10;

3x+4y≤243x + 4y \le 24;

x,y≥0x,y \ge 0, then optimal value of zz is

Answer options

Q30:

2026: 25 May Shift 1

Linear Programming

Medium

Core

Which of the following group of constraints represents the feasible region given as shaded area below ?

Answer options