Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
From MaRDI portal
Publication:848729
DOI10.1007/s10957-009-9589-1zbMath1188.90232OpenAlexW2087003538MaRDI QIDQ848729
Publication date: 5 March 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9589-1
Related Items
Efficiency in quasiconvex multiobjective nondifferentiable optimization on the real line ⋮ Variational convergence for vector-valued functions and its applications to convex multiobjective optimization ⋮ Asymptotic analysis of scalarization functions and applications ⋮ Vector optimization problems via improvement sets ⋮ Existence and boundedness of solutions in infinite-dimensional vector optimization problems ⋮ Optimality conditions for vector equilibrium problems with applications ⋮ Existence of efficient and properly efficient solutions to problems of constrained vector optimization ⋮ Nonemptiness and boundedness of solution sets for vector variational inequalities via topological method ⋮ Second-order asymptotic analysis for noncoercive convex optimization ⋮ Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization ⋮ Boundedness and nonemptiness of solution sets for set-valued vector equilibrium problems with an application ⋮ A scalarization scheme for binary relations with applications to set-valued and robust optimization ⋮ On Hadamard well-posedness of families of Pareto optimization problems ⋮ The q-asymptotic function in c-convex analysis ⋮ Existence of Pareto solutions for vector polynomial optimization problems with constraints ⋮ Recession function and its applications in optimization
Cites Work
- Convex composite multi-objective nonsmooth programming
- Characterization of the nonemptiness and compactness of solution sets in convex and nonconvex vector optimization
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- Theory of multiobjective optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- On efficient solutions in vector optimization
- Existence theory for finite-dimensional pseudomonotone equilibrium problems
- Vector equilibrium problems under asymptotic analysis
- Multicriteria optimization in engineering and in the sciences
- Proper efficiency and the theory of vector maximization
- Variational Analysis
- Coercivity properties and well-posedness in vector optimization
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
This page was built for publication: Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
