MATH 123 Chapter Notes - Chapter 3: Feasible Region
10 Aug 2017
School
Department
Course
Professor
Document Summary
Linear programming attempts to solve maximization and minimization problems with linear constraints. Linear programming models can be used to analyze a wide range of applications from many disciplines. Graphing a linear inequality: decide which half-plane to shade, draw the graph of the boundary line. When deciding which half-plane to shade, use one of the following methods: test point if the test point satisfies the original inequality; otherwise, shade the half- plane on the other side of the boundary line. The corner point theorem assures us that the optimal solution to a linear program, if it exists, must occur at one or more of the corner points of the feasible region. In other words, if an optimum value (either a maximum or a minimum) of the objective function exists, it will occur at one or more of the corner points of the feasible region.
