Same chapter3 marksDifficulty: Medium
Define the feasible region and the objective function of a linear programming problem, and state where the optimum occurs.
Linear Programming
3 marksDifficulty: Medium
Define a convex feasible region and state why the optimum of a linear objective function occurs at a corner point.
Original Khojo Papers practice question — not from a past board paper.
Answer
A feasible region is convex if the segment joining any two of its points lies entirely within it. A linear function increases or decreases steadily in one direction across such a region, so its greatest and least values on the region must occur where the region ends, that is at a corner point.
No citable source has been recorded for this record. Treat it as practice material, not as fact.
Explanation
When the objective function is parallel to an edge, every point on that edge is optimal.
Related questions
From the same topic and chapter, at a similar level.
Same chapter4 marksDifficulty: Hard
Maximise Z = 3x + 4y subject to x + y ≤ 4, x ≥ 0 and y ≥ 0.
Linear Programming
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 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