zbMATH — the first resource for mathematics

Nonsmooth multiobjective programming. (English) Zbl 0645.90076
Necessary Lagrangian conditions are obtained for a weak minimum of a nonsmooth constrained multiobjective programming problem, assuming Lipschitz functions and general cone constraints. This generalizes a result of F. Clarke. A vector dual problem is deduced.
Reviewer: B.D.Craven

90C31 Sensitivity, stability, parametric optimization
90C30 Nonlinear programming
49N15 Duality theory (optimization)
49M37 Numerical methods based on nonlinear programming
Full Text: DOI
[1] Clarke F. H., Optimization and Nonsmooth Analysis (1983) · Zbl 0582.49001
[2] Craven B. D., Mathematical Programming and Control Theory (1978) · Zbl 0431.90039
[3] Craven B. D., Bull. Austral. Math. Soc. 16 pp 325– (1977) · Zbl 0362.90106
[4] Craven B. D., Optimization 17 pp 3– (1986) · Zbl 0591.49016
[5] Craven B. D., A modified Wolfe dual for weak vector minimization (1988) · Zbl 0695.90089
[6] Craven B. D., Optimization 18 pp 151– (1987) · Zbl 0613.49026
[7] Jeyakumar V., Numer. Funct. Anal. and Optimiz. 9 pp 535– (1987) · Zbl 0611.90081
[8] Robinson S. M., SIAM J. Numerical Analysis 13 pp 497– (1976) · Zbl 0347.90050
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.