Examlex
Given the following all-integer linear program:
Max 15x1 + 2x2
s. t. 7x1 + x2 < 23
3x1 - x2 < 5
x1, x2 > 0 and integer
a. Solve the problem as an LP, ignoring the integer constraints.
b. What solution is obtained by rounding up fractions greater than or equal to 1/2? Is this the optimal integer solution?
c. What solution is obtained by rounding down all fractions? Is this the optimal integer solution? Explain.
d. Show that the optimal objective function value for the ILP is lower than that for the optimal LP.
e. Why is the optimal objective function value for the ILP problem always less than or equal to the corresponding LP's optimal objective function value? When would they be equal? Comment on the MILP's optimal objective function compared to the corresponding LP & ILP.
Q6: Refer to Exhibit 4-1. Blue Bell's
Q11: When activity times are uncertain, total project
Q12: Which of the following statements about executory
Q22: The rules for accounting are based upon
Q26: Comfort Plus Inc. (CPI) manufactures a standard
Q26: A section of output from The Management
Q40: In portfolio models, risk is minimized by
Q123: List four measurement methods that reflect current
Q123: Slater Company uses the cash basis of
Q124: Which of the following assets is reported