Semi-Infinite Programming

In mathematics, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, typically parameterized by some parameters

Mathematical formulation of the problem

The problem can be stated simply as:

$\min \limits _{x\in X}\;\;f(x)$

${\mbox{subject to: }}\$

$g(x,y)\leq 0\forall y\in Y$

where

$f:R^{n}\to R$

Failed to parse (unknown function "\timex"): {\displaystyle g: R^n \timex R^m \to R}

$X\subseteq R^{n}.$

See also

• optimization