Characterizing the nonemptiness and compactness of weakly efficient solution sets for non-convex multiobjective optimization problems
From MaRDI portal
Publication:6564296
DOI10.1016/J.ORL.2024.107092MaRDI QIDQ6564296
Publication date: 1 July 2024
Published in: Operations Research Letters (Search for Journal in Brave)
Cites Work
- Inner and outer estimates for the solution sets and their asymptotic cones in vector optimization
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- On the set of weakly efficient minimizers for convex multiobjective programming
- Characterizations of the nonemptiness and Boundedness of weakly efficient solution sets of Convex vector optimization problems in real reflexive Banach spaces
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- A quasiconvex asymptotic function with applications in optimization
- On the structure of the weakly efficient set for quasiconvex vector minimization
- Asymptotic analysis of scalarization functions and applications
- Variational Analysis
- Recession function and its applications in optimization
- Quasiconvex optimization problems and asymptotic analysis in Banach spaces
- Generalized asymptotic functions in nonconvex multiobjective optimization problems
This page was built for publication: Characterizing the nonemptiness and compactness of weakly efficient solution sets for non-convex multiobjective optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564296)