Which point gives the maximum profit under the constraints?
The region that satisfies several inequalities at the same time is called the feasible region. The point where profit is maximized within that region is always one of its vertices (corners).
🚗 A toy factory makes cars (x units) and robots (y units). Material constraint: 2x + y ≤ 40. Work-time constraint: x + 3y ≤ 30 (x, y ≥ 0). The profit is 30,000 won per car and 50,000 won per robot.
Use the sliders to change x and y and find the point where the profit 3x + 5y is maximized. If you move outside the blue region, there are not enough materials or work time to make that combination.