✎ 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.
2 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.
// CONCEPT AUDIT RESULT
Everything you missed has been added to your Error Arena — retest them blind there, and a concept clears once you get it right.
QUESTION 1
Complex Numbers
SECTION A · MCQ (+4, -1)

(1) 9
(2) 12
(3) 16
(4) 22
Δ =
1
1
2
2
3
a
1
3
b - -
= 0
⇒2a + b – 6 = 0
…….(1)
Δ1 =
1
1
6
2
3
a
1
1
3
2b + - - = 0
⇒a + b – 8 = 0
…….(2)
Solving (1) + (2)
a = –2, b = 10
⇒7a + 3b = 16
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)$.
Linear combinations of linear inequalities preserve convexity: if a P + b <= c and a Q + b <= c, then a(t P + (1-t)Q) + b <= c for all t in [0, 1].
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.
Distinguishing between structural inconsistency (no solution possible) and lack of resource caps (infinite profit possible).
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
x ≤ 6 is redundant because any x satisfying x ≤ 3 automatically satisfies x ≤ 6. x ≥ 0 is active as it defines the lower bound. The other options are incorrect as they either misidentify the stricter constraint or assume all are active.
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.
If the open half-plane x + y > 8 has no points in common with the feasible region, then 8 is the true maximum. Other options contradict the open half-plane criterion or misinterpret the problem.
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}^+$.
Inequalities model boundary limits; you cannot consume more raw materials than exist in inventory, but you can consume less.
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)$.
Any point in the feasible region falling inside ax + by > M would yield a Z value strictly greater than M, contradicting that M is the maximum.
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}^+$.
Physical goods, hours, and inventory can never take negative values in realistic operational settings.