3 multiple choice algebra questions
Linear programming In a linear programming problem, the constraints represent the limitations on the situation, and the objective function is the function being maximized (or minimized). The constraints are inequalities, so a graph with all constraints shown on it will be a region, called the feasible region. The maximum or minimum value of the objective function will always happen at one of the vertices (corners) […]