Linear programming problem with a graph and constraints for maximizing profit.
A whiteboard showing a linear programming problem with a graph, equations, and a shaded feasible region. The objective function is P = 40x + 30y, with constraints 2x + y = 320 and x + y = 240. Points (0,0), (160,0), and (0,240) are labeled, and the optimal solution is at (10,240).