An expression ax+by defined over a closed convex polygon assumes its maximum and minimum value at one (or more) of the vertices of the polygon.
An extension of the fundamental theorem of linear programming
