Semi-infinite programming: Difference between revisions

Revision as of 15:46, 10 November 2010

Revision as of 15:48, 10 November 2010

Line 1:

In [[optimization (mathematics)|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 [http://glossary.computing.society.informs.org/second.php?page=S.html#Semi-infinite_program]. In the former case the constraints are typically parameterized.<ref>

{{Unreferenced|date=May 2008}}

In [[mathematics]], '''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 [http://glossary.computing.society.informs.org/second.php?page=S.html#Semi-infinite_program]. In the former case the constraints are typically parameterized.<ref>

* {{cite book|last1=Bonnans|first1=J.&nbsp;Frédéric|last2=Shapiro|first2=Alexander|chapter=5.4 and&nbsp;7.4.4 Semi-infinite programming|title=Perturbation analysis of optimization problems|series=Springer Series in Operations Research|publisher=Springer-Verlag|___location=New York|year=2000|pages=496–526 and&nbsp;581|isbn=0-387-98705-3|id={{MR|1756264}}|}}

* M. A. Goberna and M. A. López, ''Linear Semi-Infinite Optimization'', Wiley, 1998.