返回
Ordinal optimization through multi-objective reformulation
DOI:10.1016/j.ejor.2023.04.042.png)
摘要
En 中文
We analyze combinatorial optimization problems with ordinal, i.e., non-additive, objective functions that assign categories (like good, medium and bad) rather than cost coefficients to the elements of feasible so-lutions. We review different optimality concepts for ordinal optimization problems and discuss their sim-ilarities and differences. We then focus on two prevalent optimality concepts that are shown to be equiv-alent. Our main focus lies on the investigation of a bijective linear transformation that transforms ordinal optimization problems to associated standard multi-objective optimization problems with binary cost co-efficients. Since this transformation preserves all properties of the underlying problem, problem-specific solution methods remain applicable. A prominent example is dynamic programming and Bellman's prin-ciple of optimality, that can be applied, e.g., to ordinal shortest path and ordinal knapsack problems. We investigate the interrelation between scalarization techniques and methods based on the hypervolume indicator when applied to the ordinal and the transformed problem, respectively. Furthermore, we ex-tend our results to multi-objective optimization problems that combine ordinal and real-valued objective functions.& COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Multiple objective programming
Ordering cones
Ordinal objective functions
Combinatorial optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
A Systematic Review of Clinical Diagnostic Systems Used in the Diagnosis of Tuberculosis in Children

