Linear Programming (LP) problems (Edexcel A-Level Further Mathematics): Flashcards

A mathematical method to optimize an objective function subject to constraints

Maximise profit or minimise cost

To $\leq$ constraints to convert them into equations

Unused capacity

Subtracted from $\geq$ constraints to make equations

Excess quantity

For $\geq$ or $=$ constraints to start Simplex algorithm

Temporary, eliminated during optimisation

$ax + by + s = d$ where $s \geq 0$

$ax + by - s = d$ where $s \geq 0$