Question
Solving an integer programming problem by rounding off answers obtained by solving it as a linear programming problem (using simplex), we find that.
- The values of decision variables obtained by rounding off are always very close to the optimal values.
- The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
- The value of the objective function for a minimization problem will likely be less than that for the simplex solution.
- All constraints are satisfied exactly.
- None of the above.