Linear programming graph showing feasible region defined by three constraints.
Graph of a linear programming problem with three constraints: 7x + 10y ≥ -30 (solid line, shaded above), y ≤ 4 (solid line, shaded below), and x + y ≤ 0 (solid line, shaded below). The feasible region is the intersection of these shaded areas. Objective function f(x, y) = -x - 5y is to be minimized over this region.