Quantitative parametric connections between methods for generating noninferior solutions in multiobjective optimization
From MaRDI portal
Publication:1847149
DOI10.1016/S0377-2217(98)00018-6zbMath0998.90072OpenAlexW2085216139WikidataQ57445555 ScholiaQ57445555MaRDI QIDQ1847149
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00018-6
multicriteria analysismultiobjective optimizationgenerating methodweighting methodtrade-off information\(\epsilon \)-Constraint methodnoninferior solutionweighted \(p\)-power methodweighted minimax method
Related Items
Weighting method for bi-level linear fractional programming problems ⋮ A mental account-based portfolio selection model with an application for data with smaller dimensions ⋮ Scalarizations for adaptively solving multi-objective optimization problems ⋮ Dynamic mean-risk portfolio selection with multiple risk measures in continuous-time ⋮ On solving parametric multiobjective quadratic programs with parameters in general locations ⋮ Multi-objective optimization of water supply network rehabilitation with non-dominated sorting genetic algorithm. II ⋮ Multi-objective design of team oriented assembly systems. ⋮ Multi-objective optimization using statistical models
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the characterization of noninferior solutions of the vector optimization problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- The maximization of a function over the efficient set via a penalty function approach
- Optimization over the efficient set: Four special cases
- Optimizing a linear function over an efficient set
- Iterative parametric dynamic programming and its application in reliability optimization
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- Iterative parametric minimax method for a class of composite optimization problems
- Finding all efficient extreme points for multiple objective linear programs
- Optimization over the efficient set
- Convexification of a noninferior frontier
- On noninferior performance index vectors
