standard maximisation problem
max z=c^T x
subject to Ax<=b
x>= On
standard minimisation problem
min z=c^T x
subject to Ax>=b
x>=On
canonical (maximisation) problem
max z=c^T x
subject to Ax=b
x>=On
convex set
for all x,y in S and λ in [0,1], λx + (1-λ)y in S
closed convex set
includes boundaries
hyperplane
(n=/ On) H = {x in R^n : n^T x=d}
positive/negative closed half-plane
{x in R^n : n^T x>/<=d}
closed polyhedron
intersection of closed half-spaces