Optimality and duality without a constraint qualification for minimax programming

Optimality and duality without a constraint qualification for minimax programming

Without the need of a constraint qualification, we establish the optimality necessary and sufficient conditions for generalised minimax programming. Using these optimality conditions, we construct a parametric dual model and a parameter-free mixed dual model. Several duality theorems are established...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Bulletin of the Australian Mathematical Society 2003-02, Vol.67 (1), p.121-130
Hauptverfasser: Zhou, Houchun, Sun, Wenyu
Format: Artikel
Sprache:eng
Schlagworte:
Minimax technique
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Without the need of a constraint qualification, we establish the optimality necessary and sufficient conditions for generalised minimax programming. Using these optimality conditions, we construct a parametric dual model and a parameter-free mixed dual model. Several duality theorems are established.
ISSN:0004-9727
1755-1633
DOI:10.1017/S000497270003358X