%0 Journal Article %T SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING %A AHMAD , I. %A AGARWAL, RAVI P. %J Journal of Nonlinear Sciences and Applications %D 2010 %V 3 %N 4 %@ ISSN 2008-1901 %F AHMAD 2010 %X Chandra and Abha [European J. Oper. Res. 122 (2000), 161-165] considered a nonlinear programming problem over cone constraints and presented the correct forms of its four types of duals formulated by Nanda and Das [European J. Oper. Res. 88 (1996) 572-577]. Yang et al. [Indian J. Pure Appl. Math. 35 (2004), 699-708] considered the same problem and discussed weak and strong duality for its four types of second order duals under the assumptions of generalized second order F-convexity. In this paper, we are intended to prove converse duality theorems for second order duals of Yang et al. %9 journal article %R 10.22436/jnsa.003.04.01 %U http://dx.doi.org/10.22436/jnsa.003.04.01 %P 234-244 %0 Journal Article %T On symmetric duality in nonlinear programming %A M. S. Bazaraa %A J. J. Goode %J Oper. Res. %D 1973 %V 21 %F Bazaraa1973 %0 Journal Article %T A note on pseudo-invexity and duality in nonlinear programming %A S. Chandra %A Abha %J European J. Oper. Res. %D 2000 %V 122 %F Chandra2000 %0 Journal Article %T Pseudo-invexity and duality in nonlinear programming %A L. N. Das %A S. Nanda %J European J. Oper. Res. %D 1996 %V 88 %F Das1996 %0 Journal Article %T Second order duality for nonlinear programming %A X. M. Yang %A X. Q. Yang %A K. L. Teo %A S. H. Hou %J Indian J. Pure Appl. Math. %D 2004 %V 35 %F Yang2004 %0 Journal Article %T Converse duality in nonlinear programming with cone constraints %A X. M. Yang %A X. Q. Yang %A K. L. Teo %J European J. Oper. Res. %D 2006 %V 170 %F Yang2006