On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization

DOI10.1007/BF02192533zbMath0853.90101MaRDI QIDQ1918005

Dentcheva, Darinka, Siegfried Helbig

Publication date: 15 January 1997

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

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

zbMATH Keywords

well-posedness; Ekeland variational principle; \(\varepsilon\)-efficient solutions; Kuratowski limits of level sets; perturbed vector optimization; vector-valued objective functions

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

Related Items

Coercivity properties and well-posedness in vector optimization, OPTIMALITY CONDITIONS AND APPROXIMATE OPTIMALITY CONDITIONS IN LOCALLY LIPSCHITZ VECTOR OPTIMIZATION, Well-posedness for a class of strong vector equilibrium problems, Equilibrium versions of variational principles in quasi-metric spaces and the robust trap problem, A New Variant of Ekeland's Variational Principle for Set-Valued Maps, Pointwise well-posedness and scalarization of optimization problems for locally convex cone-valued functions, Ekeland variational principles for set-valued functions with set perturbations, Equilibrium versions of set-valued variational principles and their applications to organizational behavior, Vector-valued variational principle in fuzzy metric space and its applications, Pointwise well-posedness of perturbed vector optimization problems in a vector-valued variational principle, Pointwise well-posedness in set optimization with cone proper sets, Scalarization and pointwise well-posedness for set optimization problems, An equilibrium version of set-valued Ekeland variational principle and its applications to set-valued vector equilibrium problems, Scalarization and pointwise well-posedness in vector optimization problems, A generic approach to approximate efficiency and applications to vector optimization with set-valued maps, Set-valued pseudo-metric families and Ekeland's variational principles in fuzzy metric spaces, The Ekeland variational principle for Henig proper minimizers and super minimizers, Well-posedness and scalarization in vector optimization, On approximate efficiency in multiobjective programming, Set-valued increasing-along-rays maps and well-posed set-valued star-shaped optimization, Pointwise well-posedness and scalarization in set optimization, An equilibrium version of vectorial Ekeland variational principle and its applications to equilibrium problems, Well-posedness for set optimization problems, Axiomatic approach to approximate solutions in multiobjective optimization, General Ekeland's variational principle for set-valued mappings., Extended well-posedness properties of vector optimization problems, Generalized variational principle and vector optimization, Vectorial Ekeland variational principle for systems of equilibrium problems and its applications, Existence and well-posedness for symmetric vector quasi-equilibrium problems, Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh, A new maximal point theorem, Scalarization method for Levitin-Polyak well-posedness of vectorial optimization problems, Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems, A pre-order principle and set-valued Ekeland variational principle, Hadamard well-posed vector optimization problems, Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization, Versions of Ekeland's variational principle involving set perturbations, Scalarization for pointwise well-posed vectorial problems, Increasing-along-rays property, vector optimization and well-posedness, Optimality conditions for metrically consistent approximate solutions in vector optimization, Estimates of approximate solutions and well-posedness in vector optimization, Extended \(B\)-well-Posedness and property (H) for set-valued vector optimization with convexity, A chain rule for \(\varepsilon\)-subdifferentials with applications to approximate solutions in convex Pareto problems, Scalarization of Levitin–Polyak well-posed set optimization problems, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Nonconvex separation theorems and some applications in vector optimization
• A general maximality principle and a fixed point theorem in uniform space
• On several concepts for \(\varepsilon\)-efficiency
• Continuous dependence of solutions on a parameter in a scalarization method
• The drop theorem, the petal theorem and Ekeland's variational principle
• Nonconvex minimization problems
• An Existence Theorem in Vector Optimization
• A generalization of ekellandz’s variational principle
• A nonconvex vector minimization problem