(追記) (追記ここまで)
Linear Programming
An algorithm for solving problems asking the largest or smallest possible value of a linear polynomial. Any restrictions on the problem must be expressed as a system of inequalities; in particular, all equations and/or inequalities must be linear.
Note: The region defined by the system will always by convex.