(Answered) : please answer asap for mba 550 If a maximization linear programming problem consists of all less-than-or-equal-to constraints

please answer asap for mba 550

If a maximization linear programming problem consists of all less-than-or-equal-to constraints with all positive coefficients and the objective function consists of all positive objective function coefficients, then rounding down the linear programming optimal solution values of the decision variables will ________ result in a(n) ________ solution to the integer linear programming problem.

sometimes; optimal

always; optimal

never; non-optimal

always; non-optimal

Expert Answer

The correct answer is: sometimes; optimal
In a linear program, the purpose utility and the restrictions are in linear relationships. It means that the effect of altering a decision variable is directly proportional to its extent.