Generalised convexity and duality in multiple objective programming

By considering the concept of weak minima, different scalar duality results are extended to multiple objective programming problems. A number of weak, strong and converse duality theorems are given under a variety of generalised convexity conditions.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Bulletin of the Australian Mathematical Society 1989-04, Vol.39 (2), p.287-299
Hauptverfasser:	Weir, T., Mond, B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Exact sciences and technology Mathematical programming Operational research and scientific management Operational research. Management science
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	By considering the concept of weak minima, different scalar duality results are extended to multiple objective programming problems. A number of weak, strong and converse duality theorems are given under a variety of generalised convexity conditions.
ISSN:	0004-9727 1755-1633
DOI:	10.1017/S000497270000277X