Semi-infinite programming

From HandWiki

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.[1]

Mathematical formulation of the problem

The problem can be stated simply as:

minx∈Xf(x)
subject to: 
g(x,y)≤0,∀y∈Y

where

f:Rn→R
g:Rn×Rm→R
X⊆Rn
Y⊆Rm.

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