Multiple Choice
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.Which of the following must be true for the optimal integer solution to this problem?
A) X = 12 Y = 32
B) X = 12 Y = 33
C) X = 12
D) Y = 32
E) None of the above
Correct Answer:
Verified
Correct Answer:
Verified
Q3: There is no general method for solving
Q54: The constraint X<sub>1</sub> + X<sub>2</sub> ≤ 1
Q64: A goal programming problem had two goals
Q66: Another name for a 0-1 variable is
Q67: Table 10-5<br>Maximize Z = 34 X<sub>1</sub> +
Q68: A goal programming problem had two goals
Q71: Goal programming and linear programming differ in
Q72: According to Table 10-6,how is the constraint
Q73: The following <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB2950/.jpg" alt="The following
Q74: Table 10-3<br>A company has decided to use