Linear programming

From DDWiki

(Redirected from LP)
Jump to: navigation, search

Linear programming refers to the class of optimization problems of the form:

minimize \mathbf{c}^T\mathbf{x}
with respect to \mathbf{x}
subject to \mathbf{Ax \leq b}
\mathbf{x}\in\mathbb{R}^n

where \mathbf{A} is a matrix, \mathbf{b} and \mathbf{c} are vectors, and n is a positive integer.

Contents

Theory

This article has been marked as incomplete and requiring attention. You can help DDWiki by expanding it.


Methods

This article has been marked as incomplete and requiring attention. You can help DDWiki by expanding it.


Software

References

Retrieved from "http://ddl.me.cmu.edu/ddwiki/index.php/Linear_programming"
Personal tools