Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2004.05.028 Byline: X.M. Yang (a)(b), X.Q. Yang (c), K.L. Teo (c) Keywords: Converse duality; Nonlinear programming; Pseudo-invexity; Positive definiteness Abstract: The purpose of this paper is to establish various converse duality results for nonlinear programming with cone constraints and its four dual models introduced by Chandra and Abha [S. Chandra, Abha, A note on pseudo-invex and duality in nonlinear programming, European Journal of Operational Research 122 (2000) 161-165]. Author Affiliation: (a) Department of Mathematics, Chongqing Normal University, Chongqing 400047, China (b) Key Laboratory of Operational Research of Chongqing, Chongqing 400047, China (c) Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong Article History: Received 30 October 2003; Accepted 13 May 2004

Solutions to F-convexity under second-order symmetric duality in multiobjective nonlinear programming are examined.

Empirical results of duality theorems, which are used to examine second order F-convexity problems in mathematical programming, are presented.