Necessary conditions for optimality of nondifferentiable convex multiobjective programming. (English) Zbl 0488.49007


49K10 Optimality conditions for free problems in two or more independent variables
90C55 Methods of successive quadratic programming type
90C31 Sensitivity, stability, parametric optimization
58E17 Multiobjective variational problems, Pareto optimality, applications to economics, etc.
90C25 Convex programming
Full Text: DOI


[1] Arrow, K. J., Hurwicz, L., andUzawa, H.,Studies in Linear and Nonlinear Programming, Stanford University Press, Stanford, California, 1958. · Zbl 0091.16002
[2] Dacunha, N. O., andPolak, E.,Constrained Minimization under Vector-Valued Criteria in Finite-Dimensional Spaces, Journal of Mathematical Analysis and Applications, Vol. 10, pp. 103-124, 1967. · Zbl 0154.44801
[3] Kuhn, H. W., andTucker, A. W.,Nonlinear Programming, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, California, pp. 416-427, 1950.
[4] Tanino, T., andSawaraki, Y.,Duality Theory in Multiobjective Programming, Journal of Optimization Theory and Applications, Vol. 27, pp. 509-529, 1979. · Zbl 0378.90100
[5] Schechter, M.,More on Subgradient Duality, Journal of Mathematical Analysis and Applications, Vol. 71, pp. 251-262, 1979. · Zbl 0421.90062
[6] Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970. · Zbl 0193.18401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.