Convex integer nonlinear programming

From DDWiki

(Redirected from Convex INLP)
Jump to: navigation, search

Convex nonlinear 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}) and \mathbf{g(x)} are convex functions of the vector \mathbf{x}, \mathbf{h(x)} is an affine function of the vector \mathbf{x}, n is a positive integer, and \mathcal{Z} is the set of integers.

Contents

Theory

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


Methods


Software


References

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