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

Q1:

2025: 14 May Shift 2

Linear Programming

Medium

Common

The maximum value of the objective function Z=8x+2yZ = 8x + 2y of an LPP subject to constraints 2x+y≤3,2x+3y≤6,x≥0,y≥02x + y \leq 3, 2x + 3y \leq 6, x \geq 0, y \geq 0 is:

Answer options
Option 1
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 1

Q2:

2025: 14 May Shift 2

Linear Programming

Medium

Core

The minimum value of the objective function z=x+2yz = x + 2y of an L.P.P. subject to constraints 2x+y≥3,x2+2y≥6,x≥0,y≥02x + y \geq 3, \frac {x} {2} + 2y \geq 6, x \geq 0, y \geq 0 is:

Answer options
Option 2
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 2

Q3:

2025: 14 May Shift 2

Linear Programming

Medium

Core

For an LPP: Maximize z=3x+9yz = 3x + 9y, x≥0,y≥0x \geq 0, y \geq 0, the feasible region OAB is shown in the figure, then the other constraints are

Answer options
Option 4
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 3

Q4:

2025: 14 May Shift 2

Linear Programming

Medium

Core

The maximum value of the objective function Z=2x+yZ = 2x + y of an LPP, subject to the constraints x≤6,y≤2,x−y≤0x \leq 6, y \leq 2, x - y \leq 0, x≥0,y≥0x \geq 0, y \geq 0 is

Answer options
Option 2
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 4

Q5:

2025: 14 May Shift 2

Linear Programming

Medium

Applied

If the objective function Z=px+qy,p>0,q>0Z = px + qy, p > 0, q > 0 of a linear programming problem attains its optimal value at the points (4, 7) and (5, 5) and pq=50pq = 50 then

Answer options
Option 2
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 5

Q6:

2025: 14 May Shift 2

Linear Programming

Hard

Applied

Consider the linear programming problem(LPP):

Minimize Z=x+yZ = x + y

x+2y≤4,x + 2y \leq 4,

3x+y≥3,3x + y \geq 3,

4x+3y≥6,4x + 3y \geq 6,

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

Which of the following is correct for the above linear programming problem (LPP):

(A) The LPP has a bounded feasible region.

(B) The LPP has a unique optimal solution.

(C) The optimal value of the LPP exists at the point (3/2, 0)

(D) The corner points of the feasible region are (3/2, 0), (3/5, 6/5), (2/5, 6/5) and (4, 0)

Choose the correct answer from the options given below:

Answer options
Option 2
Correct Answer
Explanation for 2025: 14 May Shift 2 MAT question 6

Q7:

2025: 14 May Shift 1

Linear Programming

Medium

Common

The corner points of the feasible region associated with the LPP: Maximise Z=px+qyZ = px + qy, p,q>0p,q > 0 subject to 2x+y≤102x + y \leq 10, x+3y≤15x + 3y \leq 15, x,y≥0x, y \geq 0 are (0, 0), (5, 0), (3, 4) and (0, 5). If optimum value occurs at both (3, 4) and (0, 5), then

Answer options
Option 4
Correct Answer
Explanation for 2025: 14 May Shift 1 MAT question 7

Q8:

2025: 14 May Shift 1

Linear Programming

Medium

Common

Consider the LPP: Minimize Z=x+2yZ = x + 2y subject to 2x+y≥32x + y \geq 3, x+2y≥6x + 2y \geq 6, x,y≥0x, y \geq 0. The optimal feasible solution occurs at

Answer options
Option 4
Correct Answer
Explanation for 2025: 14 May Shift 1 MAT question 8

Q9:

2025: 14 May Shift 1

Linear Programming

Medium

Core

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

Answer options
Option 1
Correct Answer
Explanation for 2025: 14 May Shift 1 MAT question 9

Q10:

2025: 14 May Shift 1

Linear Programming

Medium

Core

The corner points of the feasible region of the LPP: Minimize Z=−50x+20yZ = -50x + 20y subject to 2x−y≥−52x - y \geq -5, 3x+y≥33x + y \geq 3, 2x−3y≤122x - 3y \leq 12 and x,y≥0x, y \geq 0 are

Answer options

Q11:

2025: 14 May Shift 1

Linear Programming

Medium

Applied

Which of the following is NOT a basic requirement of the linear programming problem (LPP)?

Answer options

Q12:

2025: 14 May Shift 1

Linear Programming

Medium

Applied

Which of the following statements are correct in reference to the linear programming problem(LPP):

Maximize Z=5x+2y{Z} = 5x + 2y

subject to the following constraints

3x+5y≤153x + 5y \leq 15, 5x+2y≤105x + 2y \leq 10, x≥0,y≥0x \geq 0, y \geq 0.

(A) The LPP has a unique optimal solution at (2,0)(2, 0) only.

(B) The feasible region is bounded with corner points (0,0)(0, 0), (2,0)(2, 0), (20/19,45/19)(20/19, 45/19) and (0,3)(0, 3).

(C) The optimal value is unique, but there are an infinite number of optimal solutions.

(D) The feasible region is unbounded.

Choose the correct answer from the options given below:

Answer options

Q13:

2025: 13 May Shift 2

Linear Programming

Medium

Common

The objective function of an LPP is z=ax+byz = ax + by. If the maximum value of the objective function is 180, which occurs at two points (15,15) and (0,20), then which one of the following is true?

Answer options

Q14:

2025: 13 May Shift 2

Linear Programming

Easy

Common

If the corner points of the bounded feasible region of an LPP with objective function Maximize z=2x+3yz = 2x + 3y are (0,0), (1,2) and (1,1), then its optimal value is

Answer options

Q15:

2025: 13 May Shift 2

Linear Programming

Medium

Core

The feasible region of the linear programming problem is represented below:

The constraints of this LPP are

Answer options

Q16:

2025: 13 May Shift 2

Linear Programming

Hard

Core

The optimal value of the objective function of the LPP, Minimize Z=3x−2yZ = 3x - 2y subject to constraints x+y≥10x + y \ge 10, 3x+5y≥153x + 5y \ge 15, x≥0x \ge 0, y≥0y \ge 0, is equal to:

Answer options

Q17:

2025: 13 May Shift 2

Linear Programming

Medium

Applied

Which of the following is incorrect about the Linear Programming Problem (LPP)?

Answer options

Q18:

2025: 13 May Shift 2

Linear Programming

Medium

Applied

A manufacturing unit makes two models, 'classic' and 'supreme' of the scooter. Each piece of the classic model requires 9 labour hours for assembling and 1 labour hour for finishing. Each piece of supreme model requires 12 labour hours for assembling and 3 labour hour for finishing. For assembling and finishing, the maximum labour hours available are 180 and 30 respectively. The company makes a profit of ₹ 10000 on each piece of the classic model and ₹ 15000 on each piece of the supreme model. Which of the following options describes the given Linear Programming Problem (LPP) to maximize the profit Z (Max Z) (where x and y are the number of pieces of the classic model and the supreme model respectively)?

Answer options

Q19:

2025: 13 May Shift 1

Linear Programming

Easy

Common

If corner points of the bounded feasible region are (0, 0), (3, 0) and (0, 3) and objective function is z=4x+7yz = 4x + 7y, then the maximum value of zz is

Answer options

Q20:

2025: 13 May Shift 1

Linear Programming

Medium

Common

In the given figure, feasible region represented by the constraints 4x+y≥804x + y \geq 80, x+5y≥115x + 5y \geq 115, 3x+2y≤1503x + 2y \leq 150, x,y≥0x,y \geq 0 is

Answer options

Q21:

2025: 13 May Shift 1

Linear Programming

Easy

Core

The feasible region associated with the inequality 2x+3y>42x + 3y > 4 is

Answer options

Q22:

2025: 13 May Shift 1

Linear Programming

Medium

Core

Consider the LPP: Maximize z=x+yz = x + y subject to the constraints x+2y≤70x + 2y \leq 70, 2x+y≤952x + y \leq 95, x,y≥0x,y \geq 0. The optimal feasible solution is

Answer options

Q23:

2025: 13 May Shift 1

Linear Programming

Medium

Applied

For the linear programming problem(LPP),

Maximize Z=4x+yZ = 4x + y

x+y≤5x + y \leq 5

3x+y≤93x + y \leq 9

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

Which of the following are NOT true?

(A) The given LPP has unbounded feasible region.

(B) The corner points of the feasible region are (0,0), (0, 5), (3, 2) and (3, 0).

(C) The optimal value of the objective function is 12.

(D) The given LPP has a unique optimal solution.

Choose the correct answer from the options given below:

Answer options

Q24:

2025: 13 May Shift 1

Linear Programming

Medium

Applied

If a person rides his motorbike xx km at 30 km per hour, he has to spend ₹ 3 per kilometer on petrol. If he rides yy km at a faster speed of 40 km per hour, the petrol cost increases to ₹ 4 per kilometer. If he has ₹ 100 to spend on petrol and wishes to find the maximum distance he can travel within one hour, then linear programming problem (LPP) formulation is:

Answer options

Q25:

2024: 16 May Shift 1

Linear Programming

Medium

Common

The corner points of the feasible region determined by x+y≤8,2x+y≥8,x≥0,y≥0x+y \leq 8, 2 x+y \geq 8, x \geq 0, y \geq 0 are A(0,8),B(4,0)A(0,8), B(4,0) and C(8,0)C(8,0). If the objective function Z=ax+Z=a x+ by has its maximum value on the line segment ABA B, then the relation between aa and bb is :

Answer options

Q26:

2024: 16 May Shift 1

Linear Programming

Easy

Common

An objective function Z=ax+byZ=a x+b y is maximum at points (8,2)(8,2) and (4,6)(4,6). If a≥0a \geq 0 and b≥0b \geq 0 and ab=25a b=25, then the maximum value of the function is equal to :

Answer options

Q27:

2024: 16 May Shift 1

Linear Programming

Easy

Core

The feasible region represented by the constraints 4x+y≥80,x+5y≥115,3x+2y≤150,x,y≥04 x+y \geq 80, x+5 y \geq 115,3 x+2 y \leq 150, x, y \geq 0 of an LPP is

Answer options

Q28:

2024: 16 May Shift 1

Linear Programming

Easy

Core

Which one of the following represents the correct feasible region determined by the following constraints of an LPP?

x+y≥10,2x+2y≤25,x≥0,y≥0x+y \geq 10,2 x+2 y \leq 25, x \geq 0, y \geq 0

Answer options

Q29:

2024: 16 May Shift 1

Linear Programming

Medium

Applied

A person wants to invest an amount of ₹ 75,00075,000. He has two options A and B yielding 8%8 \% and 9%9 \% return respectively on the invested amount. He plans to invest at least ₹ 15,00015,000 in Plan A and at least ₹ 25,00025,000 in Plan B. Also he wants that his investment in Plan A is less than or equal to his investment in Plan B. Which of the following options describes the given LPP to maximize the return (where xx and yy are investments in Plan A and Plan B respectively) ?

Answer options

Q30:

2024: 16 May Shift 1

Linear Programming

Medium

Applied

The corner points of the feasible region for an L.P.P. are (0,10)(0, 10), (5,5)(5, 5), (5,15)(5, 15) and (0,30)(0, 30). If the objective function is Z=αx+βyZ = \alpha x + \beta y, where α,β>0\alpha, \beta > 0, find the condition on α\alpha and β\beta so that the maximum of ZZ occurs at both the corner points (5,15)(5, 15) and (0,30)(0, 30).

Answer options