Second order duality for multiobjective programming with cone constraints

We focus on second order duality for a class of multiobjective programming problem subject to cone constraints. Four types of second order duality models are formulated. Weak and strong duality theorems are established in terms of the generalized convexity, respectively. Converse duality theorems, e...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Science China. Mathematics Ročník 59; číslo 7; s. 1285 - 1306
Hlavní autoři: Tang, LiPing, Yan, Hong, Yang, XinMin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Science China Press 01.07.2016
Témata:
Applications of Mathematics
Convexity
Duality theorem
Mathematical models
Mathematical programming
Mathematics
Mathematics and Statistics
Multiple objective
multiobjective programming
cone constraints
90C30
90C46
second order duality
90C29
90C26
ISSN:1674-7283, 1869-1862
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We focus on second order duality for a class of multiobjective programming problem subject to cone constraints. Four types of second order duality models are formulated. Weak and strong duality theorems are established in terms of the generalized convexity, respectively. Converse duality theorems, essential parts of duality theory, are presented under appropriate assumptions. Moreover, some deficiencies in the work of Ahmad and Agarwal (2010) are discussed.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1674-7283
1869-1862
DOI:10.1007/s11425-016-5147-0