JEE Main Mathematics: Linear Programming Practice Questions

13 questions with answers and step-by-step solutions. Tap any question to see the full worked solution.

Q1.
$Which of the following represents a constraint in a linear programming problem?$
Easy
Q2.
$If the feasible region of an LPP is unbounded, then the maximum value of the objective function:$
Easy
Q3.
$The corner points of the feasible region for an LPP are (0,0), (4,0), (2,4), and (0,2). What is the maximum value of Z = 3x + 2y?$
Easy
Q4.
$What is the feasible region in a linear programming problem?$
Easy
Q5.
$What is the objective function in a linear programming problem?$
Easy
Q6.
$Find the maximum value of the objective function Z = 3x + 4y subject to the constraints x + y <= 4, x >= 0, and y >= 0.$
Medium
Q7.
$For the constraints x + y <= 5, x - y >= 0, x >= 0, y >= 0, what is the minimum value of Z = x + 2y?$
Medium
Q8.
$If the constraints are x + y <= 10, x >= 2, y >= 3, what is the maximum value of Z = 5x + 2y?$
Medium
Q9.
$A linear programming problem has constraints x + 2y <= 8 and 3x + 2y <= 12 with x, y >= 0. What is the maximum value of Z = x + y?$
Medium
Q10.
$The feasible region for a linear programming problem is defined by x >= 0, y >= 0, 2x + 3y <= 6, and x + 4y <= 4. What is the maximum value of Z = 2x + 3y?$
Medium
Q11.
$For the objective function Z = ax + by, where a, b > 0, the maximum value occurs at both (2, 3) and (4, 1). What is the ratio of a to b?$
Hard
Q12.
$Minimize Z = 3x + 5y subject to x + 3y >= 3, x + y >= 2, x, y >= 0.$
Hard
Q13.
$A linear programming problem has constraints x + y <= 1, 3x + y >= 3, x >= 0, y >= 0. What is the nature of the feasible region?$
Hard

Track your progress on Linear Programming

Start Practising Free →