Abstract
In vector optimization problems several notions of proper efficiency have been proposed, in order to rule out some undesirable situations (tolerated by the definition of efficiency). The relationships between the above different definitions have been studied by many authors. In this paper we again show these relationships, under the assumption that the involved functions are not differentiable but only Lipschitzian.
The properties of Clarke’s generalized derivative and subdifferential are here used, in order to get a picture similar to the one obtained for the differentiable case. Then, by means of suitable generalized convexity assumptions, we obtain some equivalences of the different notions of proper efficiency considered, with respect to the notion of efficiency. The results of this paper may be viewed as a generalization of the situation established for the smooth case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borwein, J. M. (1977) Proper efficient points for maximization with respect to cones. SIAM Journal on Control and Optimization 15, 57–63
Borwein, J. M. (1980) The geometry of Pareto efficiency over cones. Mathematische Operationsforschung und Statistik, Ser. Optimization 11, 235–248
Clarke, F. H. (1983) Nonsmooth analysis and optimization. John Wiley, New York
Daniilidis A., Hadjisavvas N. (1999) Characterization of nonsmooth semistrictly quasiconvex and strictly convex functions. J.O.T.A. 102, 525–536
Ellaia R., Hassouni A. (1991) Characterization of nonsmooth functions through their generalized gradients. Optimization 22, 401–416
Glover, B. M. (1984) Generalized convexity in nondifferentiable programming. Bull. Austral. Math. Soc. 30, 193–218
Guerraggio A., Molho E., Zaffaroni A. (1994) On the notion of proper efficiency in vector optimization. J.O.T.A. 82, 1–21
Hiriart-Urruty, J. B. (1979) New concepts in nondifferentiable programing. Bull. Soc. Math. de France 60, 57–85
Klinger, A. (1967) Improper solutions of the vector maximum problem. Operations Research 15, 570–572
Kuhn H. W., Tucker A. W. (1951) Nonlinear programming. Proceedings of the second Berkley symposium on Mathematical Statistics and Probability, Berkeley, Cal, 481–492
Luc D. T. (1996) Generalized Monotone Set Valued Maps and Support Bifunc-tions, Acta Math. Vietnamica 21, 213–252
Penot J. P., Quang P. H. (1997) Generalized convexity of functions and generalized monotonicity of set-valued maps. J.O.T.A. 92, 343–356
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Giorgi, G., Guerraggio, A. (2001). Proper Efficiency and Generalized Convexity in Nonsmooth Vector Optimization Problems. In: Hadjisavvas, N., Martínez-Legaz, J.E., Penot, JP. (eds) Generalized Convexity and Generalized Monotonicity. Lecture Notes in Economics and Mathematical Systems, vol 502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56645-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-56645-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41806-1
Online ISBN: 978-3-642-56645-5
eBook Packages: Springer Book Archive