Simplex
Method
A methodology designed to systematically solve large scale linear programming
problems. This method is an algebraic approach based equality relationship. Yet
linear programs typically involve inequality. To use the simplex method, the
decision makers first must convert each inequalities restriction into equality
through adding slack variables of deducting surplus variables. Simplex method
was first introduced by G.B Dantzig and his associates in 1947 in USA among the
department of airforce.
No comments:
Post a Comment