The feasible region for the pure ILP problem
A) is equivalent to the feasible region for the LP relaxation problem
B) is a lattice consisting of points corresponding only to integer values of the decision variables
C) is a k-dimensional hyperspace
D) is impossible to determine

Question

Quizplus · Accepted Answer

A pure ILP problem has the additional constraint that the decision variables must take only integer values. Therefore, the feasible region can only consist of points with integer values for the decision variables, which forms a lattice structure. This feasible region is a subset of the feasible region for the LP relaxation problem, which allows non-integer values for the decision variables.

The Feasible Region for the Pure ILP Problem