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

Answer

  1. The value of the objective function for a maximization problem will likely be less than that for the simplex solution.
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.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free