Ideal, weakly efficient solutions for vector optimization problems

DOI10.1007/s10107-002-0311-4zbMath1023.90056OpenAlexW2317783333MaRDI QIDQ1396277

Fabián Flores-Bazan

Publication date: 30 June 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10533/173110

zbMATH Keywords

convex analysisefficient solutionrecession coneweakly efficient solutionideal solutionconvex vector optimizationrecession function

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Related Items (29)

A study of interval optimization problems ⋮ Variational convergence for vector-valued functions and its applications to convex multiobjective optimization ⋮ Optimality conditions for a unified vector optimization problem with not necessarily preordering relations ⋮ Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ On the existence of weak efficient solutions of nonconvex vector optimization problems ⋮ Existence of optimal points via improvement sets ⋮ Existence of solutions of generalized vector equilibrium problems in reflexive Banach spaces ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Asymptotic analysis in convex composite multiobjective optimization problems ⋮ Conditions for the stability of ideal efficient solutions in parametric vector optimization via set-valued inclusions ⋮ Existence and boundedness of solutions in infinite-dimensional vector optimization problems ⋮ Lagrange multiplier rules for weak approximate Pareto solutions of constrained vector optimization problems in Hilbert spaces ⋮ Existence of efficient and properly efficient solutions to problems of constrained vector optimization ⋮ Generalized proximal point algorithms for multiobjective optimization problems ⋮ Characterizations of solution sets for parametric multiobjective optimization problems ⋮ On the set of weakly efficient minimizers for convex multiobjective programming ⋮ Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization ⋮ Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions ⋮ Generalized viscosity approximation methods in multiobjective optimization problems ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ An optimal alternative theorem and applications to mathematical programming ⋮ Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives ⋮ On Hadamard well-posedness of families of Pareto optimization problems ⋮ Approximate proper efficiency in vector optimization ⋮ Convergence analysis of Tikhonov-type regularization algorithms for multiobjective optimization problems ⋮ Optimality conditions for vector optimization problems ⋮ About asymptotic analysis and set optimization ⋮ The Fermat rule for multifunctions on Banach spaces

This page was built for publication: Ideal, weakly efficient solutions for vector optimization problems