A series of Linear Programming constraints on two variables produces a region of possible values for those variables. Solvable two-variable problems will have a feasible region in the shape of a convex simple polygon. In an algorithm that tests feasible points sequentially, each tested point is in turn a candidate solution.