Conceptual Outline of the Steps ofthe Simplex Algorithm
FStep 0:Using the standard form determine a starting basicfeasible solution by settingn-mnon-basic variables to zero.
FStep 1: Select an entering variable from among the currentnon-basic variables, which gives the largest per-unitimprovement in the value of the objective function. If none exists stop; the current basic solution is optimal.Otherwise go to Step 2.
FStep 2: Select a leaving variable from among the current basicvariables that must now be set to zero (become non-basic)when the entering variable becomes basic.
FStep 3: Determine the new basic solution by making theentering variable, basic; and the leaving variable, non-basic,and return to Step 1.