On duality for nonsmooth Lipschitz optimization problems
DOI:
https://doi.org/10.2298/YJOR0901041PKeywords:
Nonsmooth Lipschitz vector optimization, Fritz John type necessary optimization conditions, duality theoremsAbstract
We present some duality theorems for a non-smooth Lipschitz vector optimization problem. Under generalized invexity assumptions on the functions the duality theorems do not require constraint qualifications.References
Clarke, F.H. (1983) Optimization and nonsmooth analysis. New York, NY: Wiley-Interscience
Giorgi, G., Guerraggio, A. (1996) Various types of nonsmooth invexity. Journal of Information and Optimization Sciences, 17, 137-150
Giorgi, G., Guerraggio, A. (1998) The notion of invexity in vector optimization: Smooth and nonsmooth case. u: Crouzeix J.P., J.E.Martinez-Legaz, M.Volle [ur.] Generalized Monotonicity: Recent Results, Dordrecht: Kluwer Academic Publishers
Jeyakumar, V., Mond, B. (1992) On generalized convex mathematical programming. J. Austral. Math. Soc., 34B: 43-53
Lee, G.M. (1994) Nonsmooth invexity in multiobjective programming. J. Information & Optimization Sciences, 15, 127-136
Minami, M. (1983) Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space. Journal of Optimization Theory and Applications, 41(3): 451
Mishra, S.K., Mukherjee, R.N. (1996) On generalized convex multiobjective nonsmooth programming. J. Austral. Math. Soc, 38B, 140-148
Mond, B., Weir, T. (1981) Generalized concavity and duality. u: Schaible S., Ziemba W.T. [ur.] Generalized Concavity in Optimization and Economics, New York, NY: Academic Press, 263-279
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
