Learning how to find the maximum value of an objective function

Learn how to solve problems using linear programming. A linear programming problem involves finding the maximum or minimum value of an equation, called the objective functions, subject to a system of inequalities, called the constraints.

To solve a linear programming problem graphically, we graph the individual inequalities making up the constraints of the linear programming problem. The region bounded by the graphs of the inequalities in the constraints is called the feasible region and the vertices of the polygon formed by the feasible region is called the corner points.

The solution to the linear programming problem is the corner point which yields the maximum/minimum value (as the case may be) of the objective function.
#systemsofequations #linearprogramming