On sufficiency and duality in multiobjective programming problem under generalized α-type I univexity

In this paper, we are concerned with the multiobjective programming problem with inequality constraints. We introduce new classes of generalized α -univex type I vector valued functions. A number of Kuhn–Tucker type sufficient optimality conditions are obtained for a feasible solution to be an effic...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of global optimization Jg. 46; H. 2; S. 207 - 216
1. Verfasser: Jayswal, Anurag
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.02.2010
Schlagworte:
Computer Science
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Real Functions
type I univexity
Sufficient optimality conditions
Duality
Generalized convexity
Multiobjective programming
ISSN:0925-5001, 1573-2916
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we are concerned with the multiobjective programming problem with inequality constraints. We introduce new classes of generalized α -univex type I vector valued functions. A number of Kuhn–Tucker type sufficient optimality conditions are obtained for a feasible solution to be an efficient solution. The Mond–Weir type duality results are also presented.
ISSN:0925-5001
1573-2916
DOI:10.1007/s10898-009-9418-y