Decision Mathematics 2: Optimisation, Flows and Games | 决策数学2：优化、流与博弈

📚 Decision Mathematics 2: Optimisation, Flows and Games | 决策数学2：优化、流与博弈

Decision Mathematics 2 builds on D1 by applying algorithms to larger optimisation, network and strategic problems. This revision guide covers transportation and assignment models, dynamic programming, network flows, game theory, simplex extensions and critical path analysis. Each section pairs the key English explanation with a Chinese summary for effective bilingual revision.

决策数学2在D1的基础上，将算法应用于更大规模的优化、网络与策略问题。本复习指南涵盖运输与指派模型、动态规划、网络流、博弈论、单纯形扩展以及关键路径分析。每一节将英文要点与中文总结配对，便于双语复习。

1. Modelling Transportation Problems | 运输问题建模

A transportation problem is a special linear model that moves units from m supply sources to n demand destinations at minimum total cost. The standard assumption is balanced: total supply equals total demand.

运输问题是一类特殊的线性模型，将货物从 m 个供应地运往 n 个需求地，使总成本最小。标准假设是供需平衡：总供应等于总需求。

If the problem is unbalanced, introduce a dummy source or destination with zero transport cost, or with a penalty cost if shortages or stockouts are not allowed.

若问题不平衡，可引入一个虚拟供应地或需求地，运输成本设为零；若不允许缺货，则设为惩罚成本。

Published by TutorHao | Mathematics Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）