论文部分内容阅读
空中加油问题是一个关于在飞机飞行过程中,辅机在空中给主机加油来提高主机直航能力的问题.该题的要求是在辅机架数n一定的情况下,确定最优作战方案及主机的最大作战半径.对于问题1和问题2,首先给出了一般情况下的飞机调度的数学模型,然后用穷举法求出了n≤4情况下的最优作战方案及主机的最大作战半径rn,然后用归纳法推导出了n为一般情况下rn的上下界,最后给出了判断最优作战方案的必要条件.问题3中,给出了与问题1、问题2类似问题的求解结果.问题4中,首先求出了n≤4时空军基地的选址和最优作战方案,然后给出了n为一般情况下,最优作战方案和基地选址的通用数学模型.问题5中,在主机最快到达目的地并返回的条件下,给出了主机的飞行路线和最优作战方案;在满足辅机架数最少的条件下,给出了作战方案,并用MATLAB求出了满足该条件时的最少辅机架数的上界为248架.另外,给出了一些新的定义方法和定理并全部给予证明.
The air refueling issue is a question about the ability of the auxiliary engine to refuel the main engine in the air during the flight to improve the direct air-handling capability of the main engine. The requirement of this question is to determine the optimal operation plan with a certain number of auxiliary racks The maximum combat radius of the host.For questions 1 and 2, first of all, given the mathematical model of the aircraft scheduling under normal circumstances, and then use the exhaustive method to find the optimal combat scenario n ≤ 4 and the host’s maximum combat Radius rn, and then deduced by induction n is the upper and lower bounds of rn in general, and finally the necessary conditions for judging the optimal warfare scenario are given.In the third problem, we give the solution to the problems similar to Question 1 and Question 2 Results In Question 4, we first find out the location and the optimal warfare plan for the n-4 AFB, and then give a general mathematic model of n for the optimal warfare scenario and site selection. Problem 5 , The host’s flight route and the optimal operation plan are given under the condition that the host arrives at the destination and arrives at its quickest, and the combat plan is given under the condition of meeting the least number of auxiliary machines. The minimum auxiliary to meet this condition The upper bound for the number 248. In addition, given some new definitions and theorems and all methods give proof.