Reference no: EM132232088
1. The feasible region of the LP relaxation of an ILP problem:
a. Is a lattice connecting the required integer nodes.
b. Is a subset of the feasible region for the original ILP problem.
c. Always encompasses all the feasible integer solutions to the original ILP problem.
d. Is a continuous area.
2. Suppose that you solved a LP relaxed formulation of the maximization problem and found that the optimal objective function value is 500. The objective function value for the optimal solution to the original ILP problem can never be:
a. Integer.
b. Continuous.
c. Lower than 500, which is the objective function value for the optimal solution to its LP relaxation.
d. Higher than 500, which is the objective function value for the optimal solution to its LP relaxation.
3. Suppose that you solved a LP relaxed formulation of the minimization problem and found that the optimal objective function value is 500. The objective function value for the optimal solution to the original ILP problem can never be:
a. Higher than 500, which is the objective function value for the optimal solution to its LP relaxation.
b. Continuous.
c. Integer.
d. Lower than 500, which is the objective function value for the optimal solution to its LP relaxation.
4. Solving the LP relaxation to the ILP problem and rounding the solution manually rounded up to their closest integer values is not a good solution approach because:
a. You are guaranteed feasibility.
b. The resulting solution may be infeasible.
c. The approach is too simple.
d. You are guaranteed optimality.