Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-27T09:54:15.155Z Has data issue: false hasContentIssue false
  • English
  • Français

On second-order converse duality for a nondifferentiable programming problem

Published online by Cambridge University Press:  17 April 2009

Xin Min Yang  and
Ping Zhang
Xin Min Yang
Affiliation:
Department of Mathematics, Chongqing Normal University, Chongqing 400047, Peoples Republic of China e-mail: xmyang@cqnu.edu.cn
Ping Zhang
Affiliation:
Department of Applied Mathematics, Chengdu University of Technology, Chengdu 610059, Peoples Republic of China
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Certain shortcomings are described in the second order converse duality results in the recent work of (J. Zhang and B. Mond, Bull. Austral. Math. Soc. 55(1997) 29–44). Appropriate modifications are suggested.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 72 , Issue 2 , October 2005 , pp. 265 - 270
Copyright
Copyright © Australian Mathematical Society 2005

References

[1]Mangasarian, O.L., ‘Second order and higher order duality in nonlinear programming’, J. Math. Anal. Appl. 51 (1975), 607–620.CrossRefGoogle Scholar
[2]Mond, B., ‘Second order duality for nonlinear programs’, Opsearch 11 (1974), 90–99.Google Scholar
[3]Mond, B. and Weir, T., ‘Generalized convexity and higher order duality’, J. Mathematical Sciences 16/18 (1983), 74–94.Google Scholar
[4]Mond, B., ‘A class of nondifferentiable mathematical programming problems’, J. Math. Anal. Appl. 46 (1974), 169–174.CrossRefGoogle Scholar
[5]Zhang, J. and Mond, B., ‘Duality for a nondifferentiable programming problem’, Bull. Austral. Math. Soc. 55 (1997), 29–44.CrossRefGoogle Scholar