Chapter 7 - The Simplex Algorithm

• For less than or equal to signs use the Simplex Method. Use slack variables
• For a mix of less than and greater than symbols use either Big-M method or 2-stage simple method. Use surplus and artificial variables
• For 2-stage simplex we need to make the artificial variables 0. therefore for the 1st part our objective function is, I = -(a1 + a2 ....).
• For the big-m method, M is and arbitrarily large, real number. P = aX + bY + cZ - M( a1 + a2 ....)
• To find the pivot, largest negative number on the objective row is your pivot column. To find the pivot value divide values by the respective number in the pivot column, smallest positive is your pivot row. Where pivot row and column meet is the pivot point.