(definition)

**Definition:**
A problem expressible in the following form. Given an n × m real matrix A, m-vector b and n-vector c, determine min_{x}{c· x | Ax ≥ b and x ≥ 0} where x ranges over all n-vectors and the inequalities are interpreted component-wise, i.e., x ≥ 0 means that the entries of x are nonnegative.

**See also**
*dual linear program*.

*Note:
From Algorithms and Theory of Computation Handbook, page 34-18 (also pages 31-33 and 32-39), Copyright © 1999 by CRC Press LLC. Appearing in the Dictionary of Computer Science, Engineering and Technology, Copyright © 2000 CRC Press LLC.*

Author: CRC-A

Programación Lineal, a site in Spanish about linear programming.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 6 May 2019.

HTML page formatted Mon May 6 10:22:33 2019.

Cite this as:

Algorithms and Theory of Computation Handbook, CRC Press LLC, 1999, "linear program", in
*Dictionary of Algorithms and Data Structures* [online], Paul E. Black, ed. 6 May 2019. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/linearProgramming.html