Author 1

Author 1

Question 20. 20. 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.

Question 1. If the solution values of a linear program are rounded in order to obtain an integer solution, the solution is: (Points : 5) always optimal and feasible. sometimes optimal and feasible. always feasible. never optimal and feasible. Question…