Lesson eLearning

Find the maximum value of subject to , , , .

hard 5 marks Class 11 · Mathematics · Linear Inequalities
Answer

The correct answer is — The largest value is attained at .

Step-by-step solution

  1. List the four constraints and note the feasible region is a convex polygon.
  2. Find intersection points of each pair of boundary lines: , from , from .
  3. Solve and simultaneously: , substitute to get , yielding , (i.e. ).
  4. Check each vertex satisfies all inequalities.
  5. Evaluate at each vertex: , , , .
  6. The largest value is attained at .
Common mistake: Ignoring feasibility of intersection points or miscalculating coordinates

Concept tested: Linear programming optimisation

Published · How this solution was prepared and checked

← All Linear Inequalities questions