Menu
Home Explore People Places Arts History Plants & Animals Science Life & Culture Technology
On this page
Semi-infinite programming
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 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.

We don't have any images related to Semi-infinite programming yet.
We don't have any YouTube videos related to Semi-infinite programming yet.
We don't have any PDF documents related to Semi-infinite programming yet.
We don't have any Books related to Semi-infinite programming yet.
We don't have any archived web articles related to Semi-infinite programming yet.

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

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

Examples

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 - Bonnans, J. Frédéric; Shapiro, Alexander (2000). "5.4, 7.4.4 Semi-infinite programming". Perturbation analysis of optimization problems. Springer Series in Operations Research. Springer. pp. 496–526, 581. ISBN 978-0-387-98705-7. MR 1756264. https://mathscinet.ams.org/mathscinet-getitem?mr=1756264