Careful usage of pessimistic values is needed in multiple objectives optimization

DOI10.1016/0167-6377(85)90046-XzbMath0569.90087OpenAlexW2086721910MaRDI QIDQ1060964

H. Roland Weistroffer

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0167-6377(85)90046-x

zbMATH Keywords

efficient solutionslower boundscounterexamplesmultiple objectivesPareto solutionsnondominated solutionspessimistic values

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Related Items (18)

Optimizing a linear function over an efficient set ⋮ Computational experience concerning payoff tables and minimum criterion values over the efficient set ⋮ An upper bound on properly efficient solutions in multiobjective optimization ⋮ Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem ⋮ An interactive MOLP procedure using epsilon-constraints ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem ⋮ A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem ⋮ An all-linear programming relaxation algorithm for optimizing over the efficient set ⋮ A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case ⋮ Optimization over the efficient set ⋮ Optimization over the efficient set using an active constraint approach ⋮ Solving Optimization Problems over the Weakly Efficient Set ⋮ Optimization over the efficient set of a parametric multiple objective linear programming problem ⋮ New closedness results for efficient sets in multiple objective mathematical programming ⋮ A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set ⋮ Optimization over the efficient set: Four special cases ⋮ Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems

Cites Work

• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Interactive Sequential Goal Programming
• Linear programming with multiple objective functions: Step method (stem)
• Unnamed Item
• Unnamed Item

This page was built for publication: Careful usage of pessimistic values is needed in multiple objectives optimization