Simplex Algorithm (Edexcel A-Level Further Mathematics): Flashcards

For LP problems with $\geq$ or equality constraints

Temporary variables ($t_1, t_2, ...$) for initial feasible solution

By end of Stage 1

Minimise sum of all artificial variables

Solve original problem from Stage 1's feasible solution

Surplus variable ($s$)

$a_1x_1 + a_2x_2 - s + t = b$

Sum of all artificial variables

A feasible solution

Should use original objective function, not $W$