In Solving an Integer Linear Programming Problem, Lifting the Integer

Multiple Choice

In solving an integer linear programming problem, lifting the integer requirements and first solving the underlying standard linear programming problem:

A) never yields an optimal solution.
B) is not part of the branch-and-bound technique.
C) is not part of the cutting plane technique.
D) may yield an integer-valued solution.