Minimize C = −2x + 3y subject to 3x + 4y ≤ 24, 7x − 4y ≤ 16, and x, y ≥ 0.
Objective function refers to the function that is either maximized or minimized. The constraints may be equalities or inequalities. So, in linear programming problems, linear objective functions are minimized or maximized which is subject to linear constraints. Thus, in a linear programming problem the objective function and the constraints must be linear functions of the decision variables.
Get Answers For Free
Most questions answered within 1 hours.