This preview shows page 1. Sign up to view the full content.
Unformatted text preview: objective than the LP solution to the same problem. TRUE FALSE 1 1 point 7 The three types of integer programs are: PURE 1 1 point 8 MIXED 1 1 point 9 ZERO-ONE (BINARY) 1 1 point 10 A) X = 12 , Y = 32 B) X = 12, Y = 33 C) The objective function value must be less than $253.67. 1 1 point D) The objective function value will be greater than $253.67. E) None of the above An integer programming (maximization) problem was first solved as a linear programming problem, and the objective function value (profit) was $253.67. The two decision variables (X, Y) in the problem had values of X = 12.45 and Y = 32.75. If there is a single optimal solution, which of the following must be true for the optimal integer solution to this problem?...
View Full Document
- Fall '08