Misplaced Pages

Semi-infinite programming

Article snapshot taken from[REDACTED] with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

In optimization theory, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or an infinite number of variables and a finite number of constraints. In the former case the constraints are typically parameterized.

Mathematical formulation of the problem

The problem can be stated simply as:

min x X f ( x ) {\displaystyle \min _{x\in X}\;\;f(x)}
subject to:  {\displaystyle {\text{subject to: }}}
g ( x , y ) 0 , y Y {\displaystyle g(x,y)\leq 0,\;\;\forall y\in Y}

where

f : R n R {\displaystyle f:R^{n}\to R}
g : R n × R m R {\displaystyle g:R^{n}\times R^{m}\to R}
X R n {\displaystyle X\subseteq R^{n}}
Y R m . {\displaystyle Y\subseteq R^{m}.}

SIP can be seen as a special case of bilevel programs in which the lower-level variables do not participate in the objective function.

Methods for solving the problem

This section is empty. You can help by adding to it. (July 2010)

In the meantime, see external links below for a complete tutorial.

Examples

This section is empty. You can help by adding to it. (July 2010)

In the meantime, see external links below for a complete tutorial.

See also

References

  1. Bonnans & Shapiro 2000, pp. 496–526, 581 Goberna & López 1998 Hettich & Kortanek 1993, pp. 380–429

External links

Stub icon

This applied mathematics–related article is a stub. You can help Misplaced Pages by expanding it.

Categories:
Semi-infinite programming Add topic