Simplex Algorithm (AQA A-Level Further Maths): Flashcards

Algebraic method to solve linear programming problems

Unused capacity in a constraint

Constraint is active/binding (using all capacity)

Choose most negative coefficient in objective row

$\theta_i = v_i / p_i$ (value ÷ pivot column entry)

Row with smallest $\theta$-value

No negative coefficients in objective row

Maximizing $P = -C$

Only for positive entries in pivot column

To avoid rounding errors accumulating through iterations