Academy
This page is published in English.
Ranking
PROMETHEE V - PROMETHEE with Integer Programming Constraints
PROMETHEE II net flows maximized over a subset selection IP problem
Brans, J. P., Mareschal, B.1992doi:10.1080/03155986.1992.11732186 ↗
Overview
Use when final selection is subject to real-world constraints (budget, categorical quotas, etc.).
- Output
- subset selection
- Data
- Crisp
- Weights
- Needs a weight source
Edge cases and pitfalls
Infeasible constraint system
How to cite
Brans, J. P.; Mareschal, B. (1992). PROMETHEE V: MCDM problems with segmentation constraints. INFOR: Information Systems and Operational Research. https://doi.org/10.1080/03155986.1992.11732186
System ID, as it appears in reports and the API
PROMETHEE-V