COMM-5022EL Chapter Notes - Chapter 17: Ratio Test, Negative Number, Slack Variable
1 Mar 2018
School
Department
Course
Professor
Document Summary
Simplex method an algebraic procedure for solving linear programming problems. The simplex method uses elementary row operations to iterate from one basic feasible solution (extreme point) to another until the optimal solution is reached. 17. 1: an algebraic overview of the simplex method. Whenever a system of simultaneous linear equations has more variables than equations, we can expect an infinite number of solutions, therefore, requiring the simplex method! If we set x2 = 0 and s1 = 0, the system of constraint equations becomes: This means that x1 = 150/3 = 50, and s2 = 20. Substituting x1 = 50 into equation 17. 8 results in: 8(50) + 1s3 = 300 solving for s3 we obtain s3 = -100. Thus, we obtain the following solution to the 3-equation, 5-variable set of linear equations: This solution is referred to as the basic solution for the hightech linear programming problem.
