The use of the Simplex method to solve a linear programming problem requires that the problem be converted into its standard form. The standard form of the linear Linear Programming Problem have the following characteristics.
1. All the constraints should be expressed as the adding slack variables or surplus variables or subtracting artificial varibales.
2. The right hand side of the each constraint should be non negative.
3. The Objective function should be of the maximization type.
We offers (Free Math Education) Algebra, Geometry, Trigonometry and Engineering Tutorials absolutely free.
If you need to any help regarding simplex method problems. Feel free to contact us on www.freematheducation.com or http://www.freematheducation.com/contact-us.html