EduProd
EduProd
JEE PCM PLATFORM
📊 Dashboard
⚡ OFFICIAL NTA ASSESSMENT GENERATOR & WORD (.DOCX) EXPORTER

Linear Programming · Practice Worksheet

JEE Main Mathematics · Curated Assessment Set Print directly or export as a beautifully formatted Microsoft Word document with embedded 180-DPI mathematical prompt clips and step-by-step derivations.

EDUPROD JEE MAIN TEST SERIES · NTA PATTERN

Linear Programming · Practice Worksheet

JEE Main Mathematics · Curated Assessment Set · Assessment Code: JEE-101

Total Marks: 120
Marking: +4 / -1 (Sec A) · +4 / 0 (Sec B)
Candidate Name: __________________________
Roll No.: _____________________
Date: __________________
QUESTION 1 MATHEMATICS · Complex Numbers
SECTION A · MCQ (+4, -1)
Question 1
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 2 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Which of the following systems of constraints defines an infeasible solution (empty feasible region)?
(1) x + y ≤ 2, x + y ≥ 1, x ≥ 0, y ≥ 0
(2) 2x + 3y ≤ 6, x ≥ 0, y ≥ 0
(3) 3x + 4y ≥ 12, 3x + 4y ≤ 8, x ≥ 0, y ≥ 0
(4) x ≥ 1, x ≤ 0, x ≥ 0, y ≥ 0
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 3 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Can a feasible region defined by linear inequalities be non-convex?
(1) No. The intersection of linear half-planes is always a convex set.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 4 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Can an unbounded feasible region have a unique finite minimum value?
(1) [-5, 7)
(2) Yes! Unbounded minimization problems (e.g. diet problems) frequently have well-defined finite minimums.
(3) Yes! Unbounded minimization problems (e.g. diet problems) frequently have well+defined finite minimums.
(4) Undefined under standard Linear Programming axioms.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 5 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Consider the constraints x ≤ 3, x ≤ 6, and x ≥ 0. Which constraint is redundant?
(1) x ≥ 0
(2) All are active
(3) x ≤ 3
(4) x ≤ 6
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 6 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Consider the objective function Z = x + y with feasible region defined by x - y ≥ 0, x ≤ 4, y ≥ 0. If the maximum value of Z is found to be 8 at the corner point (4, 4), which of the following must be true?
(1) The open half-plane x + y > 8 has no points in common with the feasible region.
(2) The value 8 is not the maximum since the region is unbounded.
(3) The value 8 is the minimum, not the maximum.
(4) The open half-plane x + y > 8 intersects the feasible region.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 7 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
For the objective function Z = 3x + 2y with vertices (0, 0), (4, 0), (2, 3), and (0, 5), which vertex gives the maximum value of Z?
(1) (4, 0): Z = 12
(2) (0, 5): Z = 10
(3) (0, 0): Z = 0
(4) (2, 3): Z = 12
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 8 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
If a diet must contain at least 80 units of vitamin A, and foods X and Y provide 2 and 4 units per kg, what is the constraint?
(1) Requires uniform continuity across the entire open interval $(a, b)$.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) 2x + 4y >= 80.
(4) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 9 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
In an unbounded region, what happens if ax + by > M intersects the feasible region?
(1) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(2) Z has no maximum value.
(3) Contradicted by boundary limit constraints under standard Cartesian mapping.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 10 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Why is the feasible region always restricted to the first quadrant in standard LPP?
(1) Contradicted by boundary limit constraints under standard Cartesian mapping.
(2) Requires uniform continuity across the entire open interval $(a, b)$.
(3) Due to the non-negativity constraints x >= 0 and y >= 0.
(4) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 11 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Find the intersection point of the lines 2x + y = 10 and x + 3y = 15. Use algebraic elimination to solve.
(1) (0, 5)
(2) (3, 4)
(3) (4, 2)
(4) (5, 0)
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 12 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
A factory produces tables (x) and chairs (y). If the profit per table is Rs 250 and per chair is Rs 75, which of these is the correct objective function for maximizing profit?
(1) Maximize Z = 250x² + 75y
(2) Maximize Z = 250x + 75y
(3) Maximize Z = 250x + 75y ≤ 5000
(4) Maximize Z = 250x + 75y + 100
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 13 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Is the region defined by x + y <= 10, x >= 0, y >= 0 bounded or unbounded?
(1) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(2) Bounded, because all points satisfy x <= 10, y <= 10 and are trapped in a finite triangle.
(3) Contradicted by boundary limit constraints under standard Cartesian mapping.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 14 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Which test point should you use if the boundary line is x - y = 0?
(1) (-∞, Use a point not on the line, such as (1, 0) or (0, 1).)
(2) [-5, 7)
(3) Undefined under standard Linear Programming axioms.
(4) Use a point not on the line, such as (1, 0) or (0, 1).
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 15 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
If machine A is available for at most 42 hours, what type of inequality constraint represents this limit?
(1) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) A less than or equal to inequality: a1 x + b1 y <= 42.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 16 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Can an objective function in a Linear Programming Problem contain non-linear terms like x^2 or x*y?
(1) Contradicted by boundary limit constraints under standard Cartesian mapping.
(2) No. In LPP, the objective function and all constraints must be strictly linear.
(3) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 17 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Find the intersection point of x + 2y = 8 and 2x + y = 7.
(1) Undefined under standard Linear Programming axioms.
(2) Multiply second by 2: 4x + 2y = 14. Subtract: 3x = 6 => x = 2, y = 3. Point is (2, 3).
(3) [-5, 7)
(4) (-∞, Multiply second by 2: 4x + 2y = 14. Subtract: 3x = 6 => x = 2, y = 3. Point is (2, 3).)
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 18 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
According to the Corner Point Theorem, where must the optimal value of a linear objective function Z = ax + by occur in a bounded feasible region?
(1) At the vertices of the feasible region
(2) At the centroid of the feasible region
(3) At any interior point of the feasible region
(4) Along the edges of the feasible region
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 19 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Consider the problem: Maximize Z = 3x + 2y subject to x ≥ 1, y ≥ 1. What is the nature of the solution?
(1) Redundant constraint
(2) Infeasible solution
(3) Unbounded solution
(4) Unique optimal solution
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 20 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Consider the objective function Z = 3x + 3y with maximum values at points (2, 4) and (4, 2), both yielding Z = 18. How many optimal solutions exist for this problem?
(1) No solutions
(2) Exactly two solutions
(3) Only one solution at (3, 3)
(4) Infinite solutions along the line segment joining (2, 4) and (4, 2)
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 21 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
If constraints are x <= 3 and x <= 6 (with x >= 0), which constraint is redundant?
(1) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) x <= 6 is redundant because x <= 3 already guarantees x <= 6.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 22 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
To graph the inequality 2x + 3y ≤ 6, a student draws the boundary line and tests the origin (0, 0). What is the correct next step?
(1) Shade the region above the line since 0 ≤ 6 is true
(2) Shade the region below the line since 0 ≤ 6 is true
(3) Shade the region above the line since 0 ≤ 6 is false
(4) Shade the region below the line since 0 ≤ 6 is false
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 23 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
A diet problem requires minimizing the cost of food items while meeting minimum nutrient requirements. If Food A provides 2 units of nutrient X per kg at Rs 50/kg, and Food B provides 3 units of nutrient X per kg at Rs 70/kg, with a daily requirement of at least 18 units, which statement is correct?
(1) The feasible region is bounded, and the minimum cost occurs at (0,6).
(2) The feasible region is unbounded, and the minimum cost occurs at (9,0).
(3) The feasible region is unbounded, and the minimum cost occurs at (0,6).
(4) The feasible region is bounded, and the minimum cost occurs at (6,0).
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 24 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
A factory produces two products, X and Y. Each unit of X requires 2 kg of raw material and each unit of Y requires 3 kg. The total raw material available is 60 kg. Which inequality correctly represents this constraint?
(1) 2x + 3y >= 60
(2) 2x + 3y = 60
(3) 2x + 3y <= 60
(4) 3x + 2y <= 60
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 25 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
If the open half-plane ax + by < m shares a common point with the feasible region, what is the conclusion?
(1) Requires uniform continuity across the entire open interval $(a, b)$.
(2) The objective function Z has no minimum value in that region.
(3) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(4) Contradicted by boundary limit constraints under standard Cartesian mapping.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 26 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Which of the following shapes CANNOT be a feasible region defined by linear inequalities in a linear programming problem?
(1) A convex polygon
(2) A quadrilateral
(3) A triangle
(4) A circle
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 27 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Can Z = 2x + 3y attain a maximum value in the region x + y >= 4, x >= 0, y >= 0?
(1) No. As x and y approach infinity, Z approaches infinity, so no finite maximum exists.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(4) Requires uniform continuity across the entire open interval $(a, b)$.
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 28 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Which of the following regions is bounded and guarantees the existence of both maximum and minimum values for any linear objective function?
(1) x + y ≥ 5, x ≥ 0, y ≥ 0
(2) x + y ≥ 1, x ≤ 0, y ≥ 0
(3) x + y ≤ 10, x ≥ 0, y ≥ 0
(4) x ≥ 2, y ≥ 3
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 29 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
If a bounded region has 5 vertices, how many points must you evaluate to find the maximum of Z?
(1) Undefined under standard Linear Programming axioms.
(2) (-∞, Exactly 5 points (the 5 corner vertices).)
(3) Exactly 5 points (the 5 corner vertices).
(4) [-5, 7)
Candidate Response: (1)   (2)   (3)   (4)
QUESTION 30 MATHEMATICS · Linear Programming
SECTION A · MCQ (+4, -1)
Can an LPP with an empty feasible region have an optimal value?
(1) Requires uniform continuity across the entire open interval $(a, b)$.
(2) Contradicted by boundary limit constraints under standard Cartesian mapping.
(3) Valid only when elements belong strictly to the non-negative real domain $\mathbb{R}^+$.
(4) No. If there are no feasible points, no optimal solution exists.
Candidate Response: (1)   (2)   (3)   (4)