Practicing Success
In linear programming, the optimal value of the objective function is attained at the points given by |
intersection of the inequalities with the x-axis only intersection of the inequalities with the axes only corner points of the feasible region intersection of the inequalities with the y-axis only |
corner points of the feasible region |
with corner points Option: 3 |