An upper bound on properly efficient solutions in multiobjective optimization

DOI10.1016/0167-6377(91)90091-3MaRDI QIDQ2638949zbMATH OpenOpenAlexFDO

Authors 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

multiobjective optimizationupper boundproperly efficient solutions

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Strongly proper efficient solutions: efficient solutions with bounded trade-offs
• Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
• Optimizing over the properly efficient set of convex multi-objective optimization problems
• A characterization of properly efficient solutions by an augmented Tchebycheff norm
• Characterizing ϵ-properly efficient solutions

Cites work

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

Cited in

(8)

• Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
• Two methods for determining properly effcient solutions with a minimum upper bound for trade-offs
• Strongly proper efficient solutions: efficient solutions with bounded trade-offs
• scientific article; zbMATH DE number 2143160 (Why is no real title available?)
• Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization
• Solving multiple-objective problems in the objective space
• Separations and optimality of constrained multiobjective optimization via improvement sets
• Optimizing over the properly efficient set of convex multi-objective optimization problems

This page was built for publication: An upper bound on properly efficient solutions in multiobjective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638949)