Reference no: EM132232095
A problem is referred to as an integer linear programming (ILP) problem when:
a. All decision variables assume the values of 0 or 1.
b. Only one decision variable assumes integer values.
c. All decision variables assume integer values.
d. Some or all of the decision variables in an LP problem are restricted to assuming only integer values.
An integrality condition imposed on a variable indicates that:
a. The variable is continuous.
b. The variable has an upper bound.
c. The variable has a lower bound.
d. The variable must assume only integer values.
Integrality conditions often make a problem:
a. More difficult to formulate.
b. More difficult (and sometimes impossible) to solve.
c. A continuous problem.
d. Easier to solve.
One approach to finding the optimal integer solution to a problem is to ignore the integrality conditions and solve the problem as if it were a standard LP problem where all the variables are assumed to be continuous. This solution approach is referred to as:
a. LP relaxation.
b. Simplex.
c. Simplification.
d. Discretization.