Weak Pareto optimality of multiobjective problems in a locally convex linear topological space

DOI10.1007/BF00935888zbMath0431.49004OpenAlexW4236752298MaRDI QIDQ1138214

S. H. Smith

Publication date: 1981

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00935888

zbMATH Keywords

convexitysubdifferentialpolar coneweak Pareto optimalitymultiobjective programcones of directions

Mathematics Subject Classification ID

Convex programming (90C25) Existence theories for problems in abstract spaces (49J27) Optimality conditions for minimax problems (49K35) Methods of successive quadratic programming type (90C55)

Related Items (10)

A survey of vector optimization in infinite-dimensional spaces. II ⋮ On necessary optimality conditions in vector optimization problems ⋮ An application-oriented, optimization-based methodology for interactive design of engineering systems† ⋮ Weak Pareto-optimal necessary conditions in a nondifferentiable multiobjective program on a Banach space ⋮ Unnamed Item ⋮ Multiplier rules for weak pareto optimization problems ⋮ Optimality conditions in nondifferentiable programming and their applications to best approximations ⋮ Some properties of efficient solutions for vector optimization ⋮ Duality theorem of nondifferentiable convex multiobjective programming ⋮ Optimality conditions for vector optimization problems of a difference of convex mappings

Cites Work

• Maximal vectors and multi-objective optimization
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• A course on optimization and best approximation
• Extremum problems in the presence of restrictions

This page was built for publication: Weak Pareto optimality of multiobjective problems in a locally convex linear topological space