摘要
本文基于对称性与均衡分配的方法,对基地有一架主机和n架辅机的空中加油问题进行讨论分析,设计了空中加油问题的优化作战方案,给出了该方案下最大作战半径的递推公式,利用数值拟合的方法求出了最大作战半径的近似计算公式.
According to the method of the balanced allotment and symmetry,the air refueling problem is discussed and analyzed in the situation of which there is a fight airplane and n assistant airplane in the airport. Optimizing battle project is designed for the fir refueling problem and formula of maximum battle radius is obtained under this project. At last approximate computing formula is fitted for maximum battle radius with the method of numerical fit.
出处
《数学理论与应用》
2006年第3期33-36,共4页
Mathematical Theory and Applications
基金
湖南省普通高校青年骨干教师培养对象资助项目
关键词
空中加油
作战半径
优化作战方案
数值拟舍
ifir refueling Maximum radius of fight airolane Optimized battle project
