Generalized semi-infinite programming

In mathematics, a semi-infinite programming (SIP) problem is an optimization problem with a finite number of variables and an infinite number of constraints. The constraints are typically parameterized. In a generalized semi-infinite programming (GSIP) problem, the feasible set of the parameters depends on the variables.

Mathematical formulation of the problem

The problem can be stated simply as:

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

where

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

In the special case that the set :Y(x) is nonempty for all x∈X GSIP can be cast as bilevel programs (Multilevel programming).

Methods for solving the problem

Examples

See also