Improving the min-max method for multiobjective programming
From MaRDI portal
Publication:2661504
DOI10.1016/j.orl.2020.05.013zbMath1479.90194OpenAlexW3031779170MaRDI QIDQ2661504
M. A. Yaghoobi, Hossein Salmei
Publication date: 7 April 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2020.05.013
approximate solutionsmultiobjective programmingscalarizationproperly efficient solutionsmin-max method
Related Items (1)
Uses Software
Cites Work
- A combined scalarizing method for multiobjective programming problems
- The weighted sum method for multi-objective optimization: new insights
- Scalarizations for adaptively solving multi-objective optimization problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- Multiple criteria decision making combined with finance: a categorized bibliographic study.
- A subjective assessment of alternative mission architectures for the human exploration of Mars at NASA using multicriteria decision making.
- An MCDM approach to portfolio optimization.
- On min-norm and min-max methods of multi-objective optimization
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- Multiobjective optimization: survey of methods and industrial applications
- An Overview of Techniques for Solving Multiobjective Mathematical Programs
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Multicriteria Optimization
- Convex analysis and global optimization
This page was built for publication: Improving the min-max method for multiobjective programming
