防空导弹兵力规划模型

借助兵力交换的思想,从宏观层次上研究不同类型的防空导弹火力单元对空中目标的优化分配问题;分析在最优目标分配策略下区域防空中各类型防空导弹火力单元的火力分配问题,并建立了递阶优化的求解模型.该模型可为区域防空部署的决策与分析提供科学依据.     

基于火灾风险分析的消防力量优化布局

分析了我国目前消防力量布局存在的问题,从当前有限消防经费和现有的城市布局出发,提出了依据风险来优化消防力量布局的观点和方法,以最大限度的提高消防部队的灭火和抢险救援能力。     

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

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

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

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

弹道导弹基本诸元的快速装订算法研究

应用牛顿迭代法实现了弹道导弹基本诸元的快速装订。推导了根据落点偏差求飞行程序角和发射方位角的牛顿迭代公式，设计了迭代算法，并给出了实际算例。考虑到迭代算法收敛速度与所给的迭代初值有一定的关系，提出了预先准备简易射表采用反插值算法为牛顿迭代法准备初值的方法，经计算表明可以大大减少迭代次数，从而实现标准弹道的快速设计。     

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

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

Minimizing makespan in a multimode multiprocessor shop scheduling problem

We study the problem of multimode scheduling tasks on dedicated processors, with the objective of minimizing the maximum completion time. Each task can be undertaken in one among a set of predefined alternative modes, where each mode specifies a required set of dedicated processors and a processing time. At any time each processor can be used by a single task at most. General precedence constraints exist among tasks, and task preemption is not allowed. The problem consists of assigning a mode and a starting time to each task, respecting processor and precedence constraints, to minimize the time required to complete all tasks. The problem is NP-hard in several particular cases. In previous works, we studied algorithms in which a solution was obtained by means of an iterative procedure that combines mode assignment and sequencing phases separately. In this paper, we present some new heuristics where the decision on the mode assignment is taken on the basis of a partial schedule. Then, for each task, the mode selection and the starting time are chosen simultaneously considering the current processor usage. Different lower bounds are derived from a mathematical formulation of the problem and from a graph representation of a particular relaxed version of the problem. Heuristic solutions and lower bounds are evaluated on randomly generated test problems. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 893–911, 1999     

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     

基于多目标决策理论武器装备效能综合评估方法

探讨一种适用范围较大的武器装备效能评估方法。基于多目标决策理论的方法,将武器系统效能评估的量化标尺评价法、模糊评价法、矩阵相乘法(ADC法)和专家评价法等方法结合起来,利用解析的形式,对武器装备的效能评估进行研究,给出了一个综合评价值,能够有效地评估武器装备的效能。这种研究是对量化标尺度量法的扩充。     

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