<Li> Choose a large positive M and introduce a term in the objective of the form - M multiplying the artificial variables </Li> <Li> For less - than or equal constraints, introduce slack variables so that all constraints are equalities </Li> <Li> Solve the problem using the usual simplex method . </Li> <P> For example, x + y ≤ 100 becomes x + y + s = 100, whilst x + y ≥ 100 becomes x + y − s + a = 100 . The artificial variables must be shown to be 0 . The function to be maximised is rewritten to include the sum of all the artificial variables . Then row reductions are applied to gain a final solution . </P>

Disadvantage of big m method over two phase method