Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1285-1306 |
Number of pages | 22 |
Journal | Science China Mathematics |
Volume | 59 |
Issue number | 7 |
DOIs | |
Publication status | Published - 1 Jul 2016 |
Keywords
- cone constraints
- multiobjective programming
- second order duality
ASJC Scopus subject areas
- General Mathematics