Referring to Exercise 38, use the usual rounding rule to round the -coordinate and the -coordinate of the point where the optimal linear-programming solution occurs. Call the point with these coordinates .
Determine whether ’s coordinates define a feasible point by checking them against the constraints.
Evaluate the profit value at point . How does the profit value compare with the point where the optimal value occurred in Exercise 38?
Let be the point with coordinates (0, 3). Is in the feasible region? Evaluate at point and compare the result with the answer at and where the optimum linear-programming value occurred.
Explain the significance of the situation here for solving maximization problems where (with and known in advance) is subject to linear constraints but where the variables must be nonnegative integers rather than arbitrary nonnegative decimal numbers.
39.
(a) (2, 0)
(b) They do not.
(c) Profit at (2, 0) is greater than the profit at .