Maximizing the ratio of two convex functions over a convex set

The purpose of this article is to present an algorithm for globally maximizing the ratio of two convex functions f and g over a convex set X. To our knowledge, this is the first algorithm to be proposed for globally solving this problem. The algorithm uses a branch and bound search to guarantee that a global optimal solution is found. While it does not require the functions f and g to be differentiable, it does require that subgradients of g can be calculated efficiently. The main computational effort of the algorithm involves solving a sequence of subproblems that can be solved by convex programming methods. When X is polyhedral, these subproblems can be solved by linear programming procedures. Because of these properties, the algorithm offers a potentially attractive means for globally maximizing ratios of convex functions over convex sets. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

联合作战规划中资源调度算法研究

以联合作战为例建立任务和作战平台资源模型,通过多维动态列表规划算法(Multidimensional Dynamic List Scheduling,MDLS)进行任务-平台分配,对平台选择提出了两种不同的优先权计算方法,通过对案例求解比较了不同方法的结果.     

单脉冲雷达在多源环境中对目标的定位

在日益复杂的电子干扰环境下,提高精确制导武器的抗干扰能力一直是一个研究重点.针对单脉冲雷达跟踪目标过程中受到多源干扰这一背景,在多源信噪比未知情况下,提出一种利用某些先验信息对目标波束到达方向(DOA)进行估计的方法.这些先验信息包括噪声调频干扰信号(干扰带宽大于接收机带宽)经过匹配滤波后在围绕目标位置的各个距离分辨单元内都有信号输出以及雷达在跟踪目标过程中可获得目标信噪比.仿真结果表明,所提估计方法是有效的.     

管道热边界层减阻理论的应用研究

全面研究了高粘性液体管道流动的热边界层减阻理论的应用。利用管道热边界层理论中关于边界层的温度分布及层流、紊流时热边界层厚度的计算表达式,推证了管壁热流量及定性温度的计算表达式,利用指数型的粘温特性方程,采用积分方法推出了管道热边界层流动中层流和紊流摩擦水头损失的计算公式,并给出了设计应用实例。计算结果表明,对于高粘液体短管输送,其流动一般均为边界层入口段,热边界层减阻的最佳范围大致是管长L≤5km,管径D≤200mm。     

利用添加剂改善高原热水采暖性能的研究

通过对高海拔、高寒地区采暖系统现状及存在问题的分析,拟利用添加剂改善常规的热媒水,增大采暖热媒平均温度,进而提高散热器的传热系数及散热量。并通过试验台分别对两种流体热媒的采暖系统表面对流换热系数及散热量进行实测研究。结果表明采用新热媒比以普通水为热媒时,散热器表面对流换热系数提高的平均值约为8．28％,单位面积散热量增加的平均值约为45．71％,取得了理想的效果。     

舰载防空武器系统效能评估模型

运用随机服务系统理论建立了舰载防空武器系统的作战仿真模型。通过作战想定,对几种防空武器配置方案的作战效果进行了仿真。根据仿真结果,对影响防空武器作战效能的因素进行了深入的研究。研究结果表明,对于防空武器的优化配置、作战使用等都有一定参考价值。     

航母编队航渡过程中防空哨戒舰阵位确定方法研究

研究了一种航母编队航渡过程中防空哨戒舰的阵位确定方法。通过对航母编队防空区域划分与防空作战过程的分析,总结了航母编队航渡过程中防空哨戒舰阵位确定的原则,建立了防空哨戒舰阵位的数学模型,仿真计算了模型中各个参数对防空哨戒舰前出距离的影响。这些模型可用于确定防空哨戒舰的前出距离和方位,满足航母编队作战使用的需要。     

Solution algorithms for the parallel replacement problem under economy of scale

We consider the parallel replacement problem in which machine investment costs exhibit economy of scale which is modeled through associating both fixed and variable costs with machine investment costs. Both finite- and infinite-horizon cases are investigated. Under the three assumptions made in the literature on the problem parameters, we show that the finite-horizon problem with time-varying parameters is equivalent to a shortest path problem and hence can be solved very efficiently, and give a very simple and fast algorithm for the infinite-horizon problem with time-invariant parameters. For the general finite-horizon problem without any assumption on the problem parameters, we formulate it as a zero-one integer program and propose an algorithm for solving it exactly based on Benders' decomposition. Computational results show that this solution algorithm is efficient, i.e., it is capable of solving large scale problems within a reasonable cpu time, and robust, i.e., the number of iterations needed to solve a problem does not increase quickly with the problem size. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 279–295, 1998     

Single machine sequencing with linear models of release dates

The paper deals with a problem of scheduling a set of jobs on a single machine. Before a job is released for processing, it must undergo some preprocessing treatment that consumes resources. It is assumed that the release date of a job is a linear decreasing continuous function of the amount of a locally and globally constrained, continuously divisible resource (e.g., energy, catalyzer, financial outlay, gas). The problem is to find a sequence of jobs and a resource allocation that will minimize the maximum job completion time. Such a problem appears, for example, in the ingot preheating and hot-rolling process in steel mills. It is shown that the problem is strongly NP-hard. Some polynomially solvable cases of the problem and approximate algorithms with both experimental and worst-case analysis are presented. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 99–113, 1998     

Attrition models of the Ardennes campaign

This paper revisits the modeling by Bracken [3] of the Ardennes campaign of World War II using the Lanchester equations. It revises and extends that analysis in a number of ways: (1) It more accurately fits the model parameters using linear regression; (2) it considers the data from the entire campaign; and (3) it adds in air sortie data. In contrast to previous results, it concludes by showing that neither the Lanchester linear or Lanchester square laws fit the data. A new form of the Lanchester equations emerges with a physical interpretation. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 1–22, 1998