Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
From MaRDI portal
Publication:1992061
DOI10.1007/s40096-017-0234-0zbMath1407.90294OpenAlexW2748675442WikidataQ59517774 ScholiaQ59517774MaRDI QIDQ1992061
Publication date: 2 November 2018
Published in: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40096-017-0234-0
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Related Items (4)
Optimizing over the properly efficient set of convex multi-objective optimization problems ⋮ Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs ⋮ Unnamed Item ⋮ Optimization for multi-objective sum of linear and linear fractional programming problem: fuzzy nonlinear programming approach
Cites Work
- Unnamed Item
- Unnamed Item
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Nonlinear multiobjective optimization
- On the notion of proper efficiency in vector optimization
- A conic scalarization method in multi-objective optimization
- Proper efficiency and the theory of vector maximization
- A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
- The geometry of Pareto efficiency over cones
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Characterization of substantially and quasi-substantially efficient solutions in multiobjective optimization problems
- Multicriteria Optimization
- The Nonlinear Separation Theorem and a Representation Theorem for Bishop–Phelps Cones
- Convex Analysis
This page was built for publication: Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
