chapte的r07_Linear Programming_12e.pptVIP

INTRODUCTORY MATHEMATICAL ANALYSIS 0. Review of Algebra Applications and More Algebra Functions and Graphs Lines, Parabolas, and Systems Exponential and Logarithmic Functions Mathematics of Finance Matrix Algebra Linear Programming Introduction to Probability and Statistics Additional Topics in Probability Limits and Continuity Differentiation Additional Differentiation Topics Curve Sketching Integration Methods and Applications of Integration Continuous Random Variables Multivariable Calculus To represent geometrically a linear inequality in two variables. To state a linear programming problem and solve it geometrically. To consider situations in which a linear programming problem exists. To introduce the simplex method. To solve problems using the simplex method. To introduce use of artificial variables. To learn alteration of objective function. To define the dual of a linear programming problem. Linear Inequalities in Two Variables Linear Programming Multiple Optimum Solutions The Simplex Method Degeneracy, Unbounded Solutions, and Multiple Solutions Artificial Variables Minimization The Dual Linear inequality is written as where a, b, c = constants and not both a and b are zero. A solid line is included in the solution and a dashed line is not. A linear function in x and y has the form The function to be maximized or minimized is called the objective function. There may be multiple optimum solutions for an objective function. Standard Linear Programming Problem Maximize the linear function subject to the constraints where x and b are non-negative. Degeneracy A basic feasible solution (BFS) is degenerate if one of the basic variables is 0. Unbounded Solutions An unbounded solution occurs when the objective function has no maximum value. Multiple Optimum Solutions Multiple (optimum) solutions occur when there are different BFS. Use artificial variables to handle maximization problems that are not of standard form. To minimize a funct