MATHEMATICS · Multi-part · CBSE · Mathematics · Linear Programming · Linear Programming
Problem
For the constraints
3x+4yx+yxy≤24,≥5,≥0,≥0,
examine the four points A(2,6), B(4,2), C(3,3) and D(6,1).
(i) Determine, with complete justification, which of the given points lie in the feasible region.
(ii) For every point that lies on the boundary of the feasible region, identify the specific boundary line involved.