contestada

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. never, non-optimal sometimes, optimal always, optimal

Respuesta :

Answer:

always, feasible

Step-by-step explanation:

In a linear programming problem we find the extreme value of the linear function which is subjected to some certain constraints.

When the [tex]\text{ maximization linear programming}[/tex] consists of all the [tex]\text{less than or equal}[/tex] to constraints having the all positive coefficients and the objective functions consisting of all the objective function coefficient that is positive, then we can round the linear programming optimal solution values from the decision variables will [tex]\text{always}[/tex] result in the [tex]\text{feasible}[/tex] solution to the integer linear programming problem.

Otras preguntas