An upper bound on properly efficient solutions in multiobjective optimization

DOI10.1016/0167-6377(91)90091-3zbMath0717.90067MaRDI QIDQ2638949

P. A. Valente Ferreira, José C. Geromel

Publication date: 1991

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(91)90091-3

zbMATH Keywords

upper bound; multiobjective optimization; properly efficient solutions

Mathematics Subject Classification ID

90C25: Convex programming

90C29: Multi-objective and goal programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs, Optimizing over the properly efficient set of convex multi-objective optimization problems, Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems, Solving multiple-objective problems in the objective space

Cites Work

• On the characterization of noninferior solutions of the vector optimization problem
• Careful usage of pessimistic values is needed in multiple objectives optimization
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
• Proper efficiency and the theory of vector maximization
• Linear programming with multiple objective functions: Step method (stem)