arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.00359math.OCcs.NAmath.NA
收藏

多准则优化与决策:原理、算法与案例研究

Multicriteria Optimization and Decision Making: Principles, Algorithms and Case Studies

Michael Emmerich, André Deutz

AI总结:

本书介绍多准则优化与决策,涵盖帕累托最优、线性规划到非线性优化的算法原理,并基于莱顿大学硕士课程案例,面向非数学专业学生提供系统入门。

摘要:

现实世界中的决策与优化问题,往往涉及约束条件和相互冲突的准则。例如,选择出行方式必须在速度、成本、环境足迹和便利性之间进行权衡。同样,设计工业流程必须考虑安全性、环境影响和成本效益。所有目标均达到最优的理想解是罕见的;相反,我们寻求良好的折中方案,并力求避免双输的局面。多准则优化提供了计算帕累托最优解的计算技术,有助于决策分析和决策制定。本教材对这一主题进行了介绍,并基于荷兰莱顿大学莱顿高级计算机科学研究所的理学硕士计算机科学课程“多准则优化与决策分析”修订版教材编写而成。该课程由第一作者于2007年至2023年每年讲授,为一个学期的课程,包含讲座和实践环节。我们的目标是使这些材料对不以数学为核心专业的理学硕士学生易于理解,为此在必要时引入基础数值分析概念,并为有趣的情况提供数值示例。本教材以作者开发的一种独特教学方式组织,从线性规划和单点方法等较简单的概念开始,进而推进到非线性优化的最优性条件和面向集合的求解算法等较难的概念。此外,我们侧重于数学建模和基础理论,而非特定算法,但也不排除讨论一些具有代表性的求解算法实例。

英文摘要:

Real-world decision and optimization problems, often involve constraints and conflicting criteria. For example, choosing a travel method must balance speed, cost, environmental footprint, and convenience. Similarly, designing an industrial process must consider safety, environmental impact, and cost efficiency. Ideal solutions where all objectives are optimally met are rare; instead, we seek good compromises and aim to avoid lose-lose scenarios. Multicriteria optimization offers computational techniques to compute Pareto optimal solutions, aiding decision analysis and decision making. This reader offers an introduction to this topic and has been developed on the basis of the revised edition of the reader for the MSc computer science course "Multicriteria Optimization and Decision Analysis" at the Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands. This course was taught annually by the first author from 2007 to 2023 as a single semester course with lectures and practicals. Our aim was to make the material accessible to MSc students who do not study mathematics as their core discipline by introducing basic numerical analysis concepts when necessary and providing numerical examples for interesting cases. The introduction is organized in a unique didactic manner developed by the authors, starting from more simple concepts such as linear programming and single-point methods, and advancing from these to more difficult concepts such as optimality conditions for nonlinear optimization and set-oriented solution algorithms. Besides, we focus on the mathematical modeling and foundations rather than on specific algorithms, though not excluding the discussion of some representative examples of solution algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑