Linear Programming and Game Theory 1 (AQA A-Level Further Maths): Flashcards

Decision vars, Constraints, Objective function

Quantities that can be varied in the problem

Limitations on decision variable values, expressed as inequalities

Quantity to be optimised (max or min)

$x \geq 0$, $y \geq 0$ etc. (negative quantities don't make sense)

Set of all points satisfying all constraints simultaneously

Optimal solution occurs at a vertex of feasible region

Solid for $\leq$ or $\geq$, dotted for $<$ or $>$

Max: away from origin; Min: toward origin

Shade regions that do NOT satisfy constraints