Hostname: page-component-6bf8c574d5-mggfc Total loading time: 0 Render date: 2025-02-26T15:00:23.011Z Has data issue: false hasContentIssue false
  • English
  • Français

On convex vector optimisation

Published online by Cambridge University Press:  17 April 2009

Joydeep Dutta
Joydeep Dutta
Affiliation:
Department of Mathematics, P.D. Womens College, Jalpaiguri 735101, West Bengal, India
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.

In this article we present a simple method to deduce necessary conditions for weak minimisation of a convex vector program in a Banach space. Our main tool here will be the generalised Jabcobian of Ralph.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 61 , Issue 1 , February 2000 , pp. 85 - 88
Copyright
Copyright © Australian Mathematical Society 2000

References

REFERENCES

[1]Clarke, F.H., Optimization and nonsmooth analysis, Canadian Mathematical Scoeity Series of Monographs and Advanced Texts (J. Wiley and Sons, New York, 1983).Google Scholar
[2]Craven, B.D., Mathematical programming and control theory (Chapman and Hall, London, 1978).CrossRefGoogle Scholar
[3]Craven, B.D. and Glover, B.M., ‘An approach to vector subdifferential’, Optimization 38 (1996), 237–251.CrossRefGoogle Scholar
[4]Glover, B.M. and Ralph, D., ‘First order approximations to nonsmooth mappings with application to metric regularity’, Numer. Funct. Anal. Optim. 15 (1994), 599–620.CrossRefGoogle Scholar
[5]Ralph, D., Rank-1 support functionals and generalized Jacobian, piecewise linear homemorphisms, (Ph.D. Thesis) (University of Wisconsin, Madison, 1990).Google Scholar