On the closure of the feasible set in generalized semi-infinite programming
In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity
Gespeichert in:
Veröffentlicht in: | Central European journal of operations research 2007-09, Vol.15 (3), p.271-280 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In generalized semi-infinite programming the feasible set is known to be not closed in general. In this paper, under natural and generic assumptions, the closure of the feasible set is described in explicit terms. Keywords Semi-infinite programming * Feasible set * Projection * Genericity |
---|---|
ISSN: | 1435-246X 1613-9178 |
DOI: | 10.1007/s10100-007-0030-2 |