Question

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that

• A. The values of decision variables obtained by rounding off are always very close to the optimal values.
• B. The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
• C. The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
• D. All constraints are satisfied exactly.
• E. None of the above.

Answer 1

The correct option is B The value of the objective function for a maximization problem will likely be less than that for the simplex solution.

Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem, we find that the value of the objective function for a maximization problem will likely be less than that for the simplex solution.