Semi-infinite programming: Difference between revisions

Revision as of 14:22, 31 May 2008

Revision as of 14:27, 31 May 2008

Line 1:

{{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 a 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 by parameters.

== Mathematical formulation of the problem ==

The problem can be stated simply as:

Line 26:

== References==

* Rembert Reemtsen and Jan-J. Rückmann (Editors), ''Semi-Infinite Programming (Nonconvex Optimization and Its Applications)''. Springer, 1998, ISBN 07923505451998

* http://glossary.computing.society.informs.org/second.php?page=S.html#Semi-infinite_program

== External links==