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.

Question

Quizplus · Accepted Answer

Lifting the integer requirements and solving the underlying standard linear programming problem can yield an integer-valued solution, which can be a feasible solution to the original integer linear programming problem. This approach is commonly used in the branch-and-bound technique, where the relaxation of integer requirements can help to generate lower bounds on the objective function.

In Solving an Integer Linear Programming Problem, Lifting the Integer