When Appropriate, the Optimal Solution to a Maximization Linear Programming

Multiple Choice

When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and

A) finding the profit at every corner point of the feasible region to see which one gives the highest value.
B) moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered.
C) locating the point that is highest on the graph.
D) sliding the constraints to find the greatest point of intersection.