Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-25T10:02:02.416Z Has data issue: false hasContentIssue false
  • English
  • Français

On generalised convex multi-objective nonsmooth programming

Published online by Cambridge University Press:  17 February 2009

S. K. Mishra  and
R. N. Mukherjee
Rights & Permissions [Opens in a new window]

Abstract

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.

We extend the concept of V-pseudo-invexity and V-quasi-invexity of multi-objective programming to the case of nonsmooth multi-objective programming problems. The generalised subgradient Kuhn-Tucker conditions are shown to be sufficient for a weak minimum of a multi-objective programming problem under certain assumptions. Duality results are also obtained.

Type
Research Article
Information
The ANZIAM Journal , Volume 38 , Issue 1 , July 1996 , pp. 140 - 148
Copyright
Copyright © Australian Mathematical Society 1996

References

[1]Clarke, F. H., Optimization and nonsmooth analysis (Wiley-Interscience, New York, 1983).Google Scholar
[2]Egudo, R. R. and Hanson, M. A., “On sufficiency of Kuhn-Tucker conditions in nonsmooth multi-objective programming”, FSU Technical Report M-888, (1993).Google Scholar
[3]Jeyakumar, V. and Mond, B., “On generalised convex mathematical programming”, J. Austral. Math. Soc. Ser. B 34 (1992) 43–53.CrossRefGoogle Scholar
[4]Zhao, F., “On sufficiency of the Kuhn-Tucker conditions in non-differentiable programming”, Bull. Austral. Math. Soc. 46 (1992) 385–389.Google Scholar