MTH 208 Lecture Notes - Lecture 3: Slack Variable, Xz, Simplex Algorithm
7 May 2020
School
Department
Course
Professor
Document Summary
5 2 ego can be convertedto equality constraint by introducing a new variable called slack variable. 3 1 5 27 original constraint can be replaced by. I for all variables where xi xz in xs 70. In this form xs. xu. is appear exactly once we call basicvariable. 5 whereas xi xz are parameters once x xz chosen all variables are determined. 3 5 2 1 3 90 q xexiiz o. Note we always write the objective roll with nonnegative. Defy in whatfollows when we say solution we mean any set of xj satisfying the problem constraints. Otherwise is it"s feasible then the set infeasible solution obtainedby setting all parameters to o. Xi xz xz xy xs xo since xy xs co infeasible. T coco ol 2 3 5 t tableau infeasible. Phase 2 f i s ihf the basic solution feasible we call the tableau feasible. If tableau feasible tableau is infeasible this is.
