防空兵群(团)火力配系优化

首先阐明了防空兵群(团)火力配系优化的基本概念,然后,运用作战模拟的有关理论,分别建立了火力单位距目标的最佳配置距离(D)、防空兵群(团)对来袭目标的抗击率(Pk)和被保护目标的安全率(Pa)的优化模型。在此基础上,提出了防空兵群(团)火力配系优化的一般方法。最后通过一个实例,说明了防空兵群(团)火力配系的具体步骤。     

主维对矩阵运算性能的影响

随着计算机体系结构的发展,高速缓存（ｃａｃｈｅ）的引入,分块方法成为矩阵计算中性能优化的主要方法,而矩阵主维对分块算法的性能影响很大。本文分析了矩阵主维影响性能的原因以及如何选取主维来改善性能,并与拷贝方法进行了比较。最后用矩阵乘法和ＬＵ分解进行了试算,取得了满意的结果     

递进优化技术在汽油机工作过程优化计算中的应用

采用数学规化的方法优化汽油机的工作过程,可以在限制发动机热负荷、机械负荷、氧化氮排放和不爆震的条件下,使发动机在运行过程中经济性最好.但是要求得比较精确的优化解,一般要进行大量计算,花费较多机时.本文提出了一种分段、分层、分级的递进优化方法,应用于汽油机工作过程的优化计算中,取得了较好的效果.     

气动剥离液滴的附面层分析方法

本文根据附面层理论,对高速气流中的液滴,因气流和液滴表面相互作用而产生的气动剥离现象进行了分析,建立了气液两相附面层耦合问题的理论分析模型,得到了发生气动剥离时的最小气流速度的计算公式,为液体燃料在高速气流申雾化机理研究提供参考。     

Minimizing sums and products of linear fractional functions over a polytope

In this paper, we develop efficient deterministic algorithms for globally minimizing the sum and the product of several linear fractional functions over a polytope. We will show that an elaborate implementation of an outer approximation algorithm applied to the master problem generated by a parametric transformation of the objective function serves as an efficient method for calculating global minima of these nonconvex minimization problems if the number of linear fractional terms in the objective function is less than four or five. It will be shown that the Charnes–Cooper transformation plays an essential role in solving these problems. Also a simple bounding technique using linear multiplicative programming techniques has remarkable effects on structured problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 583–596, 1999     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem

Scheduling a set of n jobs on a single machine so as to minimize the completion time variance is a well‐known NP‐hard problem. In this paper, we propose a sequence, which can be constructed in O(n log n) time, as a solution for the problem. Our primary concern is to establish the asymptotical optimality of the sequence within the framework of probabilistic analysis. Our main result is that, when the processing times are randomly and independently drawn from the same uniform distribution, the sequence is asymptotically optimal in the sense that its relative error converges to zero in probability as n increases. Other theoretical results are also derived, including: (i) When the processing times follow a symmetric structure, the problem has 2^{⌊(n−1)/2⌋} optimal sequences, which include our proposed sequence and other heuristic sequences suggested in the literature; and (ii) when these 2^{⌊(n−1)/2⌋} sequences are used as approximate solutions for a general problem, our proposed sequence yields the best approximation (in an average sense) while another sequence, which is commonly believed to be a good approximation in the literature, is interestingly the worst. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 373–398, 1999     

高超声速滑翔导弹气动参数自适应跟踪建模

针对高超声速滑翔导弹跟踪中状态模型构建问题,研究基于制导变量变化规律的气动参数建模方法。对气动参数进行分析,指出传统建模方法的缺点。在假设制导变量服从一阶时滞过程的前提下,利用线性化的气动系数推导气动参数模型,通过分析不同飞行状态下的模型变式,证明模型对目标机动具有自适应性。对模型中未知参数的取值问题进行讨论,实现模型与飞行状态的自适应匹配。仿真结果表明：当目标发生机动时,所提模型性能明显优于传统模型。同时,在不同滤波器参数条件下的仿真结果进一步证实了模型的有效性。     

面向多星观测调度的分层迭代算法

提出一种基于分治策略的多星观测分层调度框架,在该框架下,用蚁群优化算法把任务分配至各轨道圈次上,并利用自适应模拟退火算法求解各轨道圈次的调度问题。根据各轨道圈次调度结果的反馈情况,再调整任务分配方案,重复上述过程直到达到算法终止条件。为了提高算法的性能,在设计蚁群算法的启发式信息模型时,应充分考虑卫星调度问题的领域知识;在模拟退火算法中设计两个邻域结构,采用动态选择策略在优化过程中确定最佳邻域搜索结构。仿真实验表明,该方法有效地降低了问题求解的复杂度,尤其在求解大规模多星观测调度问题时表现出优异的性能。     

外挂式导弹机弹分离气动干扰特性研究

以经典的机翼/挂架/导弹组合模型为例,采用重叠网格软件系统和计算流体力学技术,从机弹干扰工况简化和气动干扰特性影响因素分析两个方面对外挂式导弹机弹分离气动干扰特性进行研究。导弹分离轨迹参数和气动干扰系数的数值预示结果与捕获轨迹试验结果吻合,表明该计算方法能有效预测机弹分离轨迹和分析导弹与载机间复杂气动干扰现象。根据计算流体力学结果,从马赫数、机翼攻角、导弹攻角等方面,给出导弹在不同分离工况下的气动干扰规律,并采用增量系数法对缺失工况进行一阶外插处理的气动干扰数据外推方法,可应用于机载外挂空基武器的机弹分离轨迹预示和气动干扰特性设计中,具有重要的工程应用价值。