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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of global optimization Ročník 46; číslo 2; s. 207 - 216
Hlavný autor: Jayswal, Anurag
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Boston Springer US 01.02.2010
Predmet:
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
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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