On the hierarchy of γ‐valid cuts in global optimization

Concavity Cuts play an important role in concave minimization. In Porembski, J Global Optim 15 ( 17 ), 371–404 we extended the concept underlying concavity cuts which led to the development of decomposition cuts. In numerical experiments with pure cutting plane algorithms for concave minimization, decomposition cuts have been shown to be superior to concavity cuts. However, three points remained open. First, how to derive decomposition cuts in the degenerate case. Second, how to ensure dominance of decomposition cuts over concavity cuts. Third, how to ensure the finite convergence of a pure cutting plane algorithm solely by decomposition cuts. These points will be addressed in this paper. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

装甲装备修理对象修理工作量的分布模型及应用

通过论述当今典型军队战时修理机构任务的划分,给出了装甲装备修理对象按照修理工作量和按照修理时间分布的2种模型,结合俄陆军各级修理机构修理时限的划分,计算得到了典型装甲装备的技术故障和战损产生的修理对象在各级修理机构的概率分布,为开展战损研究提供了一条新途径,对提高技术保障方案的准确性有积极作用。     

Strategic capacity decision‐making in a stochastic manufacturing environment using real‐time approximate dynamic programming

In this study, we illustrate a real‐time approximate dynamic programming (RTADP) method for solving multistage capacity decision problems in a stochastic manufacturing environment, by using an exemplary three‐stage manufacturing system with recycle. The system is a moderate size queuing network, which experiences stochastic variations in demand and product yield. The dynamic capacity decision problem is formulated as a Markov decision process (MDP). The proposed RTADP method starts with a set of heuristics and learns a superior quality solution by interacting with the stochastic system via simulation. The curse‐of‐dimensionality associated with DP methods is alleviated by the adoption of several notions including “evolving set of relevant states,” for which the value function table is built and updated, “adaptive action set” for keeping track of attractive action candidates, and “nonparametric k nearest neighbor averager” for value function approximation. The performance of the learned solution is evaluated against (1) an “ideal” solution derived using a mixed integer programming (MIP) formulation, which assumes full knowledge of future realized values of the stochastic variables (2) a myopic heuristic solution, and (3) a sample path based rolling horizon MIP solution. The policy learned through the RTADP method turned out to be superior to polices of 2 and 3. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

多芯片焊球阵列封装体受热载荷作用数值模拟

针对典型高密度多芯片BGA(焊球阵列)封装体建立三维有限元分析模型,研究不同尺寸封装体在稳态热载荷作用下的结构变形和应力情况,在此基础上引入包含等效梁和危险焊球真实几何形状和间距等在内的简化模型以进行序列分析,研究各设计参数对力学参量的影响。数值结果反映了封装体应力分布及其变化特点,表明影响封装体变形和应力的主要参数;提出的建模方法简便有效,可以方便地用来分析不同类型的BGA封装,并扩展应用至不同的分析目的,为此种结构的设计和优化提供一定参考。     

基于二人有限零和对策的防空兵火力分配方法

为了优化防空作战过程中火力分配问题,使射击达到最佳效果,运用对策论、线性规划等理论方法,采用对策矩阵建立了防空火力分配的线性规划模型,并通过计算示例和计算机仿真初步预测了敌方的空袭兵器使用情况和我方相应的兵力分配对策。该模型建立的防空火力分配方法较好地满足了要地防空装备的战术应用问题,对提高作战效能具有一定的参考价值。     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

罐顶板声发射检测及其稳定最不利点有限元分析

罐顶板的缺陷检测对于评估立式拱顶罐的使用状况有着重要的意义,它的应用有助于更好地掌握立式拱顶罐的安全状况与可靠程度。将声发射法应用于罐顶板材料的检测,并对相关的设备仪器及操作流程进行介绍。为了给检测结果提供对照和参考,利用有限元分析法对拱顶瓜皮板的稳定最不利点进行了初步分析和定位。分析结果表明：顶板中上部肋板围成的区域可能会产生稳定最不利点,该部位应作为检测时重点关注的区域。     

海洋拖曳系统运动方程的变步长有限差分数值仿真

有限差分算法是常用的海洋拖曳系统运动仿真计算方法,传统的有限差分算法在对拖缆进行离散时,采用固定空间步长,为了提高数值计算的精度,通常需要减小空间步长,这既增加了计算时间,又浪费了计算机内存,甚至造成无法仿真一些工况。针对这一问题,提出了变步长有限差分数值算法,给出了步长变化的设定原则与算法,在建立海洋拖曳系统运动模型的基础上,系统分析了这一方法的求解思想与过程,并分别采用传统固定步长有限差分算法(大空间步长和小空间步长)和变步长有限差分算法,对模型进行了数值仿真,结果表明:变步长有限差分算法不仅保证了仿真计算精度,而且降低了计算机内存需求量,减少了计算时间。此外,变步长有限差分算法具有较高的灵活性,可根据实际情况,综合考虑计算时间、内存需求量和计算结果精度,从而选择合适的空间步长变化规律。     

武警部队重大改革必须向“能打胜仗”的战斗力聚焦

从关于国防和军队重大改革的重要论述入手,系统地阐述了武警部队重大改革必须向“能打胜仗”的战斗力聚焦。主要从三个层面进行分析：一是向提高部队整体素质及优化规模结构聚焦;二是向提高部队武器装备保障效能聚焦;三是向增强部队以执勤处突为中心的军事能力聚焦。     

带运力限制及单边时变约束下多出发机场航空战略投送兵力分配模型研究

利用民航力量由多个机场向一个目标机场实施航空战略投送时,由于各民航机场都具有运力限制约束,不可能无限制地快速投送兵力,因此,考虑了在多个出发机场存在运力限制约束的情况下,构建了"投送时间最短,动员机场最少"多目标决策模型,并给出了优化算法和算例.