Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem

@article{Argyris2011IdentifyingPS,
  title={Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem},
  author={N. Argyris and J. Figueira and A. Morton},
  journal={Journal of Global Optimization},
  year={2011},
  volume={49},
  pages={213-235}
}
In this paper we present a new framework for identifying preferred solutions to multi-objective binary optimisation problems. We develop the necessary theory which leads to new formulations that integrate the decision space with the space of criterion weights. The advantage of this is that it allows for incorporating preferences directly within a unique binary optimisation problem which identifies efficient solutions and associated weights simultaneously. We discuss how preferences can be… Expand
An interactive approximation algorithm for multi-objective integer programs
A general space-time model for combinatorial optimization problems (and not only)
...
1
2
...

References

SHOWING 1-10 OF 49 REFERENCES
Interactive Multiobjective Optimization Using a Set of Additive Value Functions
A Relationship between optimality and efficiency in multicriteria 0-1 programming problems
Using mathematical programming heuristics in a multicriteria network flow context
A combined approach to solve binary multicriteria problems
A review of interactive methods for multiobjective integer and mixed-integer programming
Decisions with Multiple Objectives: Preferences and Value Trade-Offs
Dynamic Portfolio Selection of NPD Programs Using Marginal Returns
...
1
2
3
4
5
...