MATH 305 Lecture 4: Simplex Method
26 Apr 2016
School
Department
Course
Professor
Document Summary
Ideas for simplex method (focus only on corner pts) Go to a better adjacent corner point. Which direction to go (select the entering basic variable) (i. e which non basic variable to increase from 0) Where to stop (select the leaving basic variable) (increasing the entering variable as much as you can without leaving the feasible region) Write the objective function z in terms of the current nonbasic variables, If the coefficient of the non-basic variables are all negative or 0 then the current z-value is the maximal value of the objective function and an optimal solution has been attained. Basic variable (for maximization problem) (for maximization problem) In the 1st iteration, we start with an initial bfs (0, 0, 4, 6, 18) (corresponding corner point (0, 0)) The non-basic variables (for the current bfs) are: _________________ Objective function z = 3x1 + 5x2 it is already written in the current ______________ variables.
