Higher-order Mond-Weir converse duality in multiobjective programming involving cones
Access Status
Fulltext not available
Authors
Yang, Xinmin
Yang, Jin
Yip, Tsz Leung
Teo, Kok Lay
Date
2013Type
Journal Article
Metadata
Show full item recordAbstract
In this work, we established a converse duality theorem for higher-order Mond-Weir type multiobjective programming involving cones. This fills some gap in recently work of Kim et al. [Kim D S, Kang H S, Lee Y J, et al. Higher order duality in multiobjective programming with cone constraints. Optimization, 2010, 59: 29–43].
Citation
Yang, Xinmin and Yang, Jin and Yip, Tsz Leung and Teo, Kok Lay. 2013. Higher-order Mond-Weir converse duality in multiobjective programming involving cones. Science China: Mathematics. 56 (11): pp. 2389-2392.
Source Title
Science China: Mathematics
Collections
Related items
Showing items related by title, author, creator and subject.
-
Ruan, Ning (2012)Duality is one of the most successful ideas in modern science [46] [91]. It is essential in natural phenomena, particularly, in physics and mathematics [39] [94] [96]. In this thesis, we consider the canonical duality ...
-
Grigoleit, Mark Ted (2008)The Constrained Shortest Path Problem (CSPP) consists of finding the shortest path in a graph or network that satisfies one or more resource constraints. Without these constraints, the shortest path problem can be solved ...
-
Yang, X.; Yang, X.; Teo, Kok Lay; Hou, S. (2005)We suggest a pair of second-order symmetric dual programs in multiobjective nonlinear programming. For these second-order symmetric dual programs, we prove the weak, strong and converse duality theorems under F-convexity ...