Mathwords logoReference LibraryMathwords

Linear Programming

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.

 

Graph showing shaded feasible region with vertices (0,0), (0,6), (8,0) for 3x+4y≤24, x≥0, y≥0; table shows max of 2x−y is 16...