Careful usage of pessimistic values is needed in multiple objectives optimization
From MaRDI portal
Attention is drawn to the fact that so-called pessimistic values are not lower bounds for the objective function values on the efficient solution set. Two counterexamples, to stress this point, are presented.
Recommendations
Cites work
- scientific article; zbMATH DE number 3889306 (Why is no real title available?)
- scientific article; zbMATH DE number 3729887 (Why is no real title available?)
- Interactive Sequential Goal Programming
- Linear programming with multiple objective functions: Step method (stem)
- The set of all nondominated solutions in linear cases and a multicriteria simplex method
Cited in
(19)- Computational experience concerning payoff tables and minimum criterion values over the efficient set
- An interactive MOLP procedure using epsilon-constraints
- 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
- 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
- Optimizing a linear function over an efficient set
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem
- An upper bound on properly efficient solutions in multiobjective optimization
- Optimization over the efficient set using an active constraint approach
- An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem
- Solving Optimization Problems over the Weakly Efficient Set
- Optimization over the efficient set
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
This page was built for publication: Careful usage of pessimistic values is needed in multiple objectives optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060964)
