Find the maximum value of subject to , , , .
Answer
The correct answer is — The largest value is attained at .
Step-by-step solution
- List the four constraints and note the feasible region is a convex polygon.
- Find intersection points of each pair of boundary lines: , from , from .
- Solve and simultaneously: , substitute to get , yielding , (i.e. ).
- Check each vertex satisfies all inequalities.
- Evaluate at each vertex: , , , .
- 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