SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING


Authors

I. AHMAD - Department of Mathematics, Aligarh Muslim University, Aligarh- 202 002, India. - Department of Mathematics and Statistics, King Fahd University of Petroleum & Minerals, Dhahran-31261, Saudi Arabia. RAVI P. AGARWAL - Department of Mathematical Sciences, Florida Institute of Technology, Melbourne 32901, USA. - Department of Mathematics and Statistics, King Fahd University of Petroleum & Minerals, Dhahran-31261, Saudi Arabia.


Abstract

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.


Share and Cite

  • Share on Facebook
  • Share on Twitter
  • Share on LinkedIn
ISRP Style

I. AHMAD, RAVI P. AGARWAL, SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING, Journal of Nonlinear Sciences and Applications, 3 (2010), no. 4, 234-244

AMA Style

AHMAD I., AGARWAL RAVI P., SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING. J. Nonlinear Sci. Appl. (2010); 3(4):234-244

Chicago/Turabian Style

AHMAD , I., AGARWAL, RAVI P.. " SECOND ORDER CONVERSE DUALITY FOR NONLINEAR PROGRAMMING." Journal of Nonlinear Sciences and Applications, 3, no. 4 (2010): 234-244


Keywords


MSC


References