Same chapter3 marksDifficulty: Medium
Define a convex feasible region and state why the optimum of a linear objective function occurs at a corner point.
Linear Programming
3 marksDifficulty: Medium
Define the feasible region and the objective function of a linear programming problem, and state where the optimum occurs.
Original Khojo Papers practice question — not from a past board paper.
Answer
The feasible region is the set of all points satisfying every constraint of the problem. The objective function is the linear function to be maximised or minimised. If an optimum exists, it occurs at a corner point of the feasible region.
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
This is why the graphical method needs only the corner points to be tested.
Related questions
From the same topic and chapter, at a similar level.
Same chapter4 marksDifficulty: Hard
Minimise Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60, x − 2y ≥ 0 and x, y ≥ 0.
Linear Programming
Same chapter4 marksDifficulty: Hard
Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0 and y ≥ 0.
Linear Programming
Same subject3 marksDifficulty: Medium
Find the projection of a = 2i + 3j + 2k on b = i + 2j + k.
Vectors
Same subject3 marksDifficulty: Medium
If A = [[1, 2], [3, 4]] and B = [[0, 1], [1, 0]], find AB and BA and state whether they are equal.
Matrices
Same subject3 marksDifficulty: Medium
Evaluate the integral of 1/(x2 − 1) with respect to x.
Integrals