CUET Mathematics: Applied MathematicsLinear Programming. Free, no login required.

Q1:

2026: 29 May Shift 2

Linear Programming

Medium

Applied

The bounded feasible region of an LPP is shown in the diagram given below.

The objective function z=3x+10yz=3x+10y attains optimum values at :

A. Point (0,0)

B. Point (0,4)

C. Point (6,3)

D. Point (5,6)

Choose the correct answer from the options given below:

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

Q2:

2026: 29 May Shift 2

Linear Programming

Medium

Applied

Every gram of wheat provides 0.15 g of proteins and 0.24 g of carbo hydrates. The corresponding values of proteins and carbo hydrate of rice are 0.05g and 0.48g respectively. Wheat costs ₹40 per kg and rice costs ₹60 per kg. The minimum daily requirements of proteins and carbohydrates for an average child are 50g and 200 g respectively. Which of the following options describes the LPP to minimize the total cost of wheat and rice that provide minimum daily requirements of proteins and carbohydrates ?

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

Q3:

2026: 14 May Shift 2

Linear Programming

Easy

Applied

Match the LIST-I with LIST-II

LIST-ILIST-II
A.In a L.P.P the objective function is alwaysI.Finite
B.Feasible region for an L.P.P is always aII.Convex set
C.In an L.P.P having bounded feasible region, the maximum value of the objective function z=ax+byz = ax + by is alwaysIII.Linear
D.Feasible region is the set of points which satisfyIV.All the given constraints

Choose the correct answer from the options given below:

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

Q4:

2026: 14 May Shift 2

Linear Programming

Medium

Applied

If the objective function z=10(x−7y+190)z=10(x-7y+190) and the corner points of the bounded feasible region are A(0,4), B(0,5), C(3,5), D(5,3), E(5,0), F(4,0), then the minimum value of z will be:

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

Q5:

2023: 11 Aug Shift 1

Linear Programming

Medium

Core

Objective function Z=200x+500yZ = 200x + 500y, subject to constraint, x+2y≥10,3x+4y≤24x + 2y \geq 10, 3x + 4y \leq 24, x≥0,y≥0x \geq 0, y \geq 0 - (iii), the minimum value of Z is :

Answer options
Option 4
Correct Answer
Explanation for 2023: 11 Aug Shift 1 MAT question 5

Q6:

2023: 11 Aug Shift 1

Linear Programming

Medium

Core

Given a linear programming problem,

Max Z=22x+18yZ = 22x + 18y, Subject to constraints

x+y≤20,360x+240y≤5760,x≥0,y≥0x + y \leq 20, 360x + 240y \leq 5760, x \geq 0, y \geq 0. Its corner points are :

Answer options
Option 1
Correct Answer
Explanation for 2023: 11 Aug Shift 1 MAT question 6

Q7:

2023: 11 Aug Shift 1

Linear Programming

Medium

Core

The corner points of feasible region determined by the following system of linear inequalities 2x+y≤10,x+3y≤15,x≥0,y≥02x + y \leq 10, x + 3y \leq 15, x \geq 0, y \geq 0 are (0,0),(5,0),(3,4)(0,0), (5,0), (3,4) and (0,5)(0,5), then the relation between p and Q so that minimum of Z occurs both points (3,4)(3,4) and (0,5)(0,5) is :

Answer options
Option 2
Correct Answer
Explanation for 2023: 11 Aug Shift 1 MAT question 7

Q8:

2023: 11 Aug Shift 1

Linear Programming

Easy

Core

For the LPP, Min Z=6x+10yZ = 6x + 10y subject to x≥6,y≥3,2x+y≥10,x≥0,y≥0x \geq 6, y \geq 3, 2x + y \geq 10, x \geq 0, y \geq 0, redundant constraint is :

Answer options
Option 1
Correct Answer
Explanation for 2023: 11 Aug Shift 1 MAT question 8

Q9:

2023: 11 Aug Shift 1

Linear Programming

Easy

Core

Which of the following is a correct set of constraint for a LPP ?

Answer options
Option 1
Correct Answer
Explanation for 2023: 11 Aug Shift 1 MAT question 9

Q10:

2023: 11 Aug Shift 1

Linear Programming

Medium

Core

For the feasible reason of a LPP as shown, if the equation of OA and BC are y−2x=0y - 2x = 0 and y−2x=4y - 2x = 4 respectively than constraints for LPP are

Answer options

Q11:

2023: 11 Aug Shift 1

Linear Programming

Easy

Core

Objective function of a LPP represent

Answer options

Q12:

2023: 7 June Shift 1

Linear Programming

Easy

Core

Which constraints correctly represent the situation 'mixture of x and y must be at least 8 units' ?

Answer options

Q13:

2023: 7 June Shift 1

Linear Programming

Medium

Core

The feasible reason for the constraints x≥0x \geq 0, x+y≤1x + y \leq 1 and x−y≤1x - y \leq 1, is situated in :

(A) I and II quadrant only

(B) I Quadrant

(C) II and IV Quadrant

(D) IV Quadrant

(E) I , II , III and IV Quadrant

Choose the correct answer from the option given below :

Answer options

Q14:

2023: 7 June Shift 1

Linear Programming

Medium

Core

Maximum value of Z equals to 40x + 50y subject to constraints 3x+y≤93x + y \leq 9, x+2y≤8x + 2y \leq 8, x,y≥0x, y \geq 0 occurs at

Answer options

Q15:

2023: 7 June Shift 1

Linear Programming

Medium

Core

The corner point of the feasible region determined by a set of linear constraints are : (0,0) , (0,4), (2,5) , (6,3) and (6,0) then which of the following point lie in the feasible region ?

Answer options

Q16:

2023: 7 June Shift 1

Linear Programming

Medium

Core

A company produces two types of belts A & B with a profit of Rs 2 and Rs 1.50 respectively. Belt of type A needs twice as much time to make as belt type B . The company can produce at the most 1000 belts of type B per day . Material for 800 belts is available per day . At the most , 400 buckles for belt type A and 700 for belts type B are available . Then the appropriate LPP is :

Answer options

Q17:

2023: 7 June Shift 1

Linear Programming

Medium

Core

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

Answer options

Q18:

2023: 7 June Shift 1

Linear Programming

Easy

Core

The Solution set of the inequality three 3x+4y≤123x + 4y \leq 12 is :

Answer options

Q19:

2023: 23 May Shift 3

Linear Programming

Medium

Applied

The corner points of the feasible region determined by the system of linear constraints are (0, 10), (5, 5), (15, 15), (0, 20). Let Z=ax+byZ = ax + by, where a, b > 0. Condition on a and b so that the maximizing value of Z occurs at both the points (15, 15) and (0, 20) is:

Answer options

Q20:

2023: 23 May Shift 3

Linear Programming

Medium

Applied

The feasible region for an LPP is shown in the figure given below: If objective is maximizing Z=22x+18yZ = 22x + 18y find (x,y)(x, y) for the optimal ZZ.

Answer options

Q21:

2023: 22 May Shift 3

Linear Programming

Medium

Applied

If the objective function for an L.P.P. is z=3x+4yz = 3x + 4y and the corner points for unbounded feasible region are (9, 0), (4, 3), (2, 5) and (0, 8), then the minimum value of zz occurs at :

Answer options

Q22:

2023: 22 May Shift 3

Linear Programming

Hard

Applied

If objective function Z=20x+30yZ = 20x + 30y of an LPP is subject to the constraints 3x+4y≥123x + 4y \geq 12, 4x+y≥44x + y \geq 4, x≥0,y≥0x \geq 0, y \geq 0, then Z has :

(A) Min at (0, 4)

(B) Max at (0, 4)

(C) Min at (4, 0)

(D) Max at (4, 0)

(E) Min at (413,3613)\left(\frac{4}{13}, \frac{36}{13}\right)

Choose the correct answer from the options given below :

Answer options

Q23:

2023: 22 May Shift 3

Linear Programming

Easy

Applied

In an LPP if the objective function z=ax+byz = ax + by has same maximum value on two corner points of the feasible region, then the number of points at which maximum value of zz occurs is :

Answer options

Q24:

2023: 30 May Shift 3

Linear Programming

Medium

Applied

Corner points of the feasible region for an LPP are : (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let z=4x+6yz = 4x + 6y be the objective function. Then, Max z −- Min z is equal to :

Answer options

Q25:

2023: 30 May Shift 3

Linear Programming

Hard

Applied

The objective function z=4x+3yz = 4x + 3y can be maximised subject to the constraints 3x+4y≤243x + 4y \leq 24, 8x+6y≤488x + 6y \leq 48, x≤5x \leq 5, y≤6y \leq 6, x≥0x \geq 0, y≥0y \geq 0 :

Answer options

Q26:

2023: 30 May Shift 3

Linear Programming

Medium

Applied

The maximum value of Z=3x+4yZ = 3x + 4y subjected to the constraints 3x+7y≤213x + 7y \leq 21, 5x+2y≤105x + 2y \leq 10; x,y≥0x, y \geq 0 is :

Answer options

Q27:

2023: 15 June Shift 2

Linear Programming

Hard

Applied

The minimum value of z=3x+6yz = 3x + 6y subject to the constraints 2x+3y≤1802x + 3y \leq 180, x+y≥60x + y \geq 60, x≥3yx \geq 3y, x≥0x \geq 0, y≥0y \geq 0 is :

Answer options

Q28:

2023: 15 June Shift 2

Linear Programming

Hard

Applied

A carpenter earns a profit of ₹ 50 and ₹ 80 on one chair and one table respectively. The requirement and availability of wood and labour are tabled as :

RequiredChairTableAvailable quantity
Wood35150
Labour1256

The number of chairs and tables in appropriate units to be manufactured for maximum profit are, respectively :

Answer options

Q29:

2023: 15 June Shift 2

Linear Programming

Easy

Applied

Match List - I with List - II.

List - IList - II
(A) The common region determined by all the linear constraints of a L.P.P. is called(I) corner point
(B) A point in the feasible region which is the intersection of two boundary lines is called,(II) non-negative
(C) The feasible region for an LPP is always a(III) feasible region
(D) The constraints x,y≥0x, y \geq 0 describes that the variables involved in a LPP are(IV) convex polygon

Choose the correct answer from the options given below :

Answer options

Q30:

2022: 25 May Shift 1

Linear Programming

Easy

Applied

The maximum value of Z=3x+yZ = 3x + y subject to the constraints x+y≤30,2x+y≤40,x,y≥0x + y \leq 30, 2x + y \leq 40, x, y \geq 0 is

Answer options