基于数学归纳法的空中加油辅机安排方案

针对飞机空中加油的辅机安排问题,我们讨论了如何通过最少的辅机数来实现往返运输物品的要求,利用线性规划和数学归纳法获得了主机的最远单程飞行距离与辅助发动机的数量之间的关系以及辅机的最佳组合方式,可以推广到同类问题的解决上。

In view of the auxiliary arrangement of aircraft refueling in the air, we discuss how to realize the requirement of transporting goods to and from each other by minimizing the number of auxiliary aircraft. The relationship between the farthest one-way flight distance of the main engine and the number of auxiliary engines and the best combination of auxiliary engines are obtained by means of linear programming and mathematical induction, which can be extended to the solution of similar problems.