Integer linear programming

From DDL Wiki

Revision as of 18:51, 26 October 2008 by Jeremy Michalek (Talk | contribs)
(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)
Jump to: navigation, search

Integer linear programming refers to optimization problems of the form:

minimize f(\mathbf{x})
with respect to \mathbf{x}
subject to \mathbf{g(x) \leq 0}
\mathbf{h(x)=0}
\mathbf{x}\in\mathcal{Z}^n

where f(\mathbf{x}), \mathbf{g(x)} and \mathbf{h(x)} are all affine functions of the vector \mathbf{x}, n is a positive integer, and \mathcal{Z} is the set of integers.

Methods

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


Software

References

Retrieved from "http://wiki.ece.cmu.edu/ddl/index.php/Integer_linear_programming"
Personal tools