EduProd
EduProd
JEE PCM PLATFORM
📊 Dashboard
✎ ANSWER ONLINE · EVERY MISTAKE LINKS BACK TO THE CONCEPT

Linear Programming · Practice Worksheet

Answer each question here and it marks straight away, with the derivation and a link to the exact micro-concept to revisit.

QUESTIONS:
10 15 20 25 30
(36 in pool)
Answered 0 / 18 🖨 Print version
12 questions from this set could not be marked online — a bonus or dual-key question, which has no single defensible answer. The print and .docx versions still include them.
QUESTION 1 Complex Numbers
SECTION A · MCQ (+4, -1)
Question 1
(1) 9
(2) 12
(3) 16
(4) 22
QUESTION 2 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)$.
QUESTION 3 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.
QUESTION 4 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
QUESTION 5 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.
QUESTION 6 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}^+$.
QUESTION 7 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)$.
QUESTION 8 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}^+$.
QUESTION 9 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
QUESTION 10 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)$.
QUESTION 11 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
QUESTION 12 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
QUESTION 13 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)$.
QUESTION 14 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
QUESTION 15 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
QUESTION 16 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.
QUESTION 17 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
QUESTION 18 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)