SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING

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.