Theorem 2: Let R be the feasible region for a linear programming problem, and let Z = ax + by be the objective function.If R is bounded**, then the objective function Z has both a maximum and a ...