Wetzel

Math 110

6.6 (9.6) – Linear Programming

Linear Programming –

            Def. - a form of optimization, maximizing or minimizing something.

The Objective Function is being maximized or minimized.  However, it is subject to constraints.  Constraints are inequalities that restrict the values of the variables.

To Solve:

            1.)  Graph the constraints as a system of inequalities.

            2.)  Find the vertices of the shaded region or feasible solutions.

            3.)  Evaluate the objective function at each of these vertices.

            4.)  If maximizing, the max will be the largest value.

                        If minimizing, the min will be the smallest value.

Ex.:

1.)  Minimize  with the constraints,

2.)  Maximize  with the constraints,

HW:  #1-15odd, 23, 25