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

Q1:

2026: 25 May Shift 1

Linear Programming

Hard

Applied

Consider the objective function Z=3x+4yZ = 3x + 4y subject to the following constraints: x−6y≤6,x+y−1≥0,x−y+1≥0,x+2y≤6,x≥0,y≥0x-6y \le 6, x+y-1 \ge 0, x-y+1 \ge 0, x+2y \le 6, x \ge 0, y \ge 0 . Which of the following inequalities does not contribute to the feasible region?

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

Q2:

2026: 25 May Shift 1

Linear Programming

Medium

Applied

A company makes two types of cakes: type A and type B. it costs ₹ 360 to make a type A cake and ₹ 120 to make a type B cake. The company can make atmost 300 cakes and spend atmost ₹ 72,000 a day, the number of cakes of type B (yy) cannot exceed the number of type A (xx) cakes by more than 200.

The company makes a profit of ₹ 200 on each type A cake and ₹ 50 on each type B cake. A LPP to maximize the profit (₹) is

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

Q3:

2026: 22 May Shift 2

Linear Programming

Medium

Common

The feasible region represented by the constraints 2x+y≤12,x+2y≤12,4x+5y≥20,x,y≥02x+y \le 12, x+2y \le 12, 4x+5y \ge 20, x,y \ge 0 of LPP is

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

Q4:

2026: 22 May Shift 2

Linear Programming

Easy

Core

The corner points of the feasible region of a LPP are (0,2), (3,0), (6,0), (6,8) and (0,5). If the objective function is z=4x+6yz = 4x + 6y, then the sum of maximum and minimum value of z is equal to:

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

Q5:

2026: 22 May Shift 2

Linear Programming

Hard

Core

Consider the LPP: Minimize z=−50x+20yz=-50x+20y subject to 2x−y≥−5,3x+y≥3,2x−3y≤12,x≥0,y≥02x-y\ge -5, 3x+y\ge 3, 2x-3y\le 12, x\ge 0, y\ge 0. Then which of the following statements are TRUE?

(A) Corner points of the feasible region of the LPP are (0,5), (0,3), (1,0), (6,0).

(B) The optimum value of the objective function is -300

(C) Optimum value does not exist

(D) The optimum value of the objective function is 100

Choose the correct answer from the options given below:

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

Q6:

2026: 22 May Shift 2

Linear Programming

Hard

Applied

For the LPP,

Z=20x+10yZ=20x+10y

Subject to

x+2y≤40x+2y\le 40

3x+y≥303x+y\ge 30

4x+3y≥604x+3y\ge 60

x,y≥0x,y\ge 0

Match List-I with List-II

List-IList-II
(A) Max.ZMax.Z(I) 180
(B) Min.ZMin.Z(II) 320
(C) Max.Z−2 Min.ZMax.Z - 2\,Min.Z(III) 240
(D) If Min.ZMin.Z is attained at (α,β)(\alpha,\beta), then α2+β2\alpha^2+\beta^2 is(IV) 800

Choose the correct answer from the options given below:

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

Q7:

2026: 22 May Shift 2

Linear Programming

Medium

Applied

In reference to linear programming problem (LPP), which of the following statement is NOT correct?

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

Q8:

2026: 22 May Shift 1

Linear Programming

Medium

Common

The corner points of the bounded feasible region determined by x+3y≤60,x+y≥10,x≤y,x≥0,y≥0x+3y\le60, x+y\ge10, x\le y, x\ge0, y\ge0 are A(0, 10), B(5, 5), C(15, 15) and D(0, 20). If the objective function z=ax+byz=ax+by has its maximum value on the line segment CD, then the relation between aa and bb is:

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

Q9:

2026: 22 May Shift 1

Linear Programming

Medium

Core

For a LPP, maximize z=2x+3yz=2x+3y, subjected to constraints:

x≥2,x≤7,y≤x,x+y≤10,x≥0,y≥0x\ge2, x\le7, y\le x, x+y\le10, x\ge0, y\ge0

Which of the following statements are TRUE ?

(A) Vertices of feasible region are (2, 0), (7, 0), (7, 3), (5, 5) and (2, 2).

(B) Maximum z=25z=25 at point (5, 5).

(C) Maximum z=25z=25 at infinite numbers of points.

(D) The feasible region is unbounded.

Choose the correct answer from the options given below:

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

Q10:

2026: 22 May Shift 1

Linear Programming

Medium

Core

The linear constraints for which the shaded region in the figure is the solution set, are

Answer options

Q11:

2026: 22 May Shift 1

Linear Programming

Easy

Applied

A manufacturer produces two products, A and B. Both products are processed on two different machines. The available capacity of the first machine is 12 hours and of second machine is 9 hours per day. Each unit of product A requires 3 hours on both machines and each unit of product B requires 2 hours on first machine and 1 hour on second machine. Each unit of product A is sold at ₹7 profit and that of product B at a profit of ₹4. A LPP to maximise the profit is:

Answer options

Q12:

2026: 22 May Shift 1

Linear Programming

Easy

Applied

If the objective function for a LPP is Z=3x+4yZ=3x+4y and the corner points for bounded feasible region are (9,0), (4,3), (2,5) and (0,8), then the maximum value of Z occurs at

Answer options

Q13:

2026: 21 May Shift 2

Linear Programming

Easy

Common

Consider a LPP with objective function z=ax+byz = ax + by. If its feasible region R is bounded, then zz

Answer options

Q14:

2026: 21 May Shift 2

Linear Programming

Medium

Core

Consider a LPP with objective function Z=px+qyZ = px + qy subjected to certain constraints with a bounded feasible region such that maximum Z=80Z = 80 and minimum Z=52Z = 52, which occur at the corner points (0,8)(0, 8) and (2,4)(2, 4) respectively, Then the value of p+qp+q is:

Answer options

Q15:

2026: 21 May Shift 2

Linear Programming

Medium

Core

Which one of the following set of constraints depicted the shaded region given below?

Answer options

Q16:

2026: 21 May Shift 2

Linear Programming

Medium

Applied

The corner points of the bounded feasible region for an LPP are (0,5),(6,6),(9,9)(0,5), (6,6), (9,9) and (0,12)(0,12). If the objective function is Z=px+qy;p,q>0Z = px + qy; p,q>0, then the condition on pp and qq so that the maximum of ZZ occurs at (9,9)(9,9) and (0,12)(0,12) is

Answer options

Q17:

2026: 21 May Shift 2

Linear Programming

Medium

Applied

Consider an LPP:

Maximise Z=15x+10yZ = 15x + 10y

Subject to 2x+y≤402x + y \le 40

2x+3y≤802x + 3y \le 80

x,y≥0x, y \ge 0

Which of the following are correct?

A. The feasible region is bounded.

B. The corner points of the feasible region are (0,0),(40,0),(10,20)(0,0), (40,0), (10,20) and (0,40)(0,40).

C. The corner points of the feasible region are (0,0),(20,0),(10,20)(0,0), (20,0), (10,20) and (0,803)\left(0, \dfrac{80}{3}\right).

D. The maximum value of Z is 350.

Choose the correct answer from the options given below:

Answer options

Q19:

2026: 21 May Shift 1

Linear Programming

Medium

Core

The maximum value of z=3x+4yz = 3x + 4y subject to the constraints

x+y≥2,2x+3y≤6,x≥0,y≥0x + y \geq 2, 2x + 3y \leq 6, x \geq 0, y \geq 0 is

Answer options

Q20:

2026: 21 May Shift 1

Linear Programming

Medium

Core

The number of corner points of the feasible region determined by the constraints 2x−y≥0,x−3y+3≥0,x≥0,y≥02x - y \geq 0, x - 3y + 3 \geq 0, x \geq 0, y \geq 0 is

Answer options

Q21:

2026: 21 May Shift 1

Linear Programming

Easy

Applied

The feasible region of inequality 2x+3y>62x + 3y > 6 is

Answer options

Q22:

2026: 21 May Shift 1

Linear Programming

Medium

Applied

Max (z) = 5x + 10y subject to constraints:

x+2y<120x + 2y < 120

x+y>60x + y > 60

x−2y>0x - 2y > 0

x,y≥0x, y \geq 0

Which of the following points do not lie in the feasible region of the above LPP ?

(A) (90, 15)

(B) (30, 15)

(C) (60, 20)

(D) (90, 10)

Choose the correct answer from the options given below:

Answer options

Q23:

2026: 19 May Shift 2

Linear Programming

Hard

Common

Refer to the LPP given by Z=2.5x+yZ = 2.5x + y, subject to constraints

3x+y≤12;3y+x≤12;x,y≥03x + y \le 12; 3y + x \le 12; x, y \ge 0:

In the given figure, If ZAZ_A = value of Z at A, ZCZ_C = value of Z at C and Max.(Z) = maximum value of Z, then which of the following relations between ZAZ_A, ZCZ_C and Max.(Z) are correct?

A. 2ZA=52Z_A = 5 Max.(Z)

B. 5ZA=2ZC5Z_A = 2Z_C

C. ZA=6+ZCZ_A = 6 + Z_C

D. 6+ZA=ZC6+Z_A = Z_C

Choose the correct answer from the options given below:

Answer options

Q24:

2026: 19 May Shift 2

Linear Programming

Medium

Core

For the constriants x+y≤60x + y \le 60, 5x+y≤1005x + y \le 100 and x≥0,y≥0x \ge 0, y \ge 0, the feasible region is:

Answer options

Q25:

2026: 19 May Shift 2

Linear Programming

Medium

Core

Two linear programming problems (LPPs) have same bounded feasible region with three corner points (0,3),(4,4),(7,0)(0, 3), (4, 4), (7, 0). If Z1=x−3yZ_1 = x - 3y and Z2=2x+yZ_2 = 2x + y are objective functions of LPPs, then which of the following is/are correct?

A. only Z1Z_1 maximizes at (7,0)(7, 0).

B. both Z1,Z2Z_1, Z_2 minimize at (0,3)(0, 3).

C. both Z1,Z2Z_1, Z_2 maximize at (7,0)(7, 0).

D. Z2Z_2 maximizes at (4,4)(4, 4).

Choose the correct answer from the options given below:

Answer options

Q26:

2026: 19 May Shift 2

Linear Programming

Medium

Applied

In a LPP, Let R be the feasible region, then which of the following are TRUE?

A. If R is bounded, then the objective function Z has both a maximum and minimum value on R.

B. If R is unbounded, then the objective function Z may or may not have a maximum or minimum value.

C. If a optimal solution exists. It must occur at atleast one corner point of R.

D. If R is bounded, then maximum value will exist but minimum may or may not exist for an objective function Z.

Choose the correct answer from the options given below:

Answer options

Q27:

2026: 19 May Shift 2

Linear Programming

Hard

Applied

Ravi rides his motor cycle at 25 km per hour, he has to spend ₹ 4 per kilometer on petrol, if he rides at a faster speed of 40 km per hour, the petrol cost increases to ₹ 10 per kilometer. He can spend ₹ 200 on petrol and wishes to maximize distance he can travel within one hour. Which of the following is/are TRUE?

A. Maximum distance covered in one hour is 30 km

B. The distance covered at speed of 25km/hr is 50/3 km

C. The distance covered at speed of 25km/hr is 252\frac{25}{2} km

D. The distance covered at speed of 40km/hr is 754\frac{75}{4} km

Choose the correct answer from the options given below:

Answer options

Q28:

2026: 19 May Shift 1

Linear Programming

Easy

Common

The maximum value of z=4x+2yz = 4x + 2y, subjected to the constraints:

2x+3y≤182x + 3y \le 18, x+y≥5x + y \ge 5;

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

Answer options

Q29:

2026: 19 May Shift 1

Linear Programming

Medium

Core

The corner points O, A, B, C, D and E of the bounded feasible region determined by the system of linear constraints are shown in the given figure.

If z=3x−4yz = 3x - 4y be the objective function, then the minimum of z, is:

Answer options

Q30:

2026: 19 May Shift 1

Linear Programming

Easy

Core

If z=px+qyz = px + qy, where p,q>0p, q > 0, is the objective function. Then the condition on p and q so that the maximum value of z occurs at A(4, 10) and B(6, 8), is:

Answer options