One approach to solving integer programming problems is to ignore the integrality conditions and solve the problem with continuous decision variables. This is referred to as
A) quickest solution method.
B) LP satisficing.
C) LP relaxation.
D) LP approximation.

Question

Quizplus · Accepted Answer

LP relaxation involves solving the linear programming problem using continuous decision variables, without regard to the integrality constraints. This provides a lower bound on the objective function value of the integer programming problem, which can be used as a benchmark for evaluating the quality of any solutions obtained through a branch and bound algorithm, for example.

One Approach to Solving Integer Programming Problems Is to Ignore