The optimal solution to a maximization linear programming problem (when appropriate) 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) graphing the non-negativity statement. E) drawing a line between the 0 axis and each line at the point of inter