3.1.4 Linear Programming (continued) Example 2 Solving Linear Programming Problems
Linear programming is a method for finding the best combination of values in order to minimize or maximize a certain function. This function is the objective function. An objective function may have a minimum, maximum, neither, or both depending on the feasible region. If a feasible region is bounded by both the x - and y -axis, then a corresponding objective function has both a maximum and a minimum value. If a feasible region is not bounded by both the x - and y -axis, then a corresponding objective function has either a maximum or a minimum value, but not both. If an objective function has a maximum or minimum value, it must occur at one or more of the vertices of the feasible region. The vertices of a feasible region are the points at which the boundary lines intersect.
171
Made with FlippingBook flipbook maker