Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

要地防卫反无人机装备发展与启示

无人机技术的发展及其在现代战场的广泛应用,给机场、阵地、营地、指挥所等要地的防空体系带来新的挑战。以俄罗斯铠甲武器系统为首的弹炮结合末段防空系统代表了要地防卫装备的重要发展方向。本文从无人机技术发展对要地防空系统的新威胁出发,探讨传统防空武器系统在执行要地防卫过程中应对低、慢、小无人机目标可能存在的技术问题,并对比分析了监测控制类、直接摧毁类和干扰反制类等典型反无人机技术的特点,然后针对俄罗斯“铠甲”弹炮结合武器系统发展的过程、反无人机作战案例及其在要地防卫作战中的应用特点等进行深入探讨,最后针对要地防卫反无人机装备的发展提出若干建议。研究结果可为开展要地防卫反无人机装备的体系规划和发展论证提供参考。     

层流介质中金属板腐蚀电位分布研究

为了研究流动介质中产生的静电场,结合电化学和流体力学相关知识建立层流介质中金属板模型,利用贝塞尔函数展开及其逆运算推导出在三层介质中基于点电荷模型的腐蚀电位解析表达式,同时计算出金属板产生的电场。运用推导出的解析表达式计算出在流动介质中任意场点处金属板随不同流速产生的腐蚀电位,并通过实验验证结果的正确性。结果表明,对层流条件下电化学反应产生的电流密度所建模型的结果与实验测量数据吻合度较高,同时电场分布也会随着流体流速及层流方向上长度的变化而发生变化。     

舰炮对岸无瞄准点射击诸元计算模型

介绍了一种新的舰炮射击方法--舰炮对岸无瞄准点射击概念、原理,建立了目标相对坐标计算模型、观测舰位坐标转换模型,解决了水面舰艇舰炮对岸上目标射击诸元计算问题.舰炮对岸无瞄准点射击,解决了水面舰艇全天候对岸应召射击问题,显著提高了舰炮对岸打击能力和战术使用的灵活性.     

无人战斗机航路规划圆切线算法

通过对无人战斗机低空进入敌防区面临的各种威胁进行分析,建立了适用于圆切线算法的威胁场模型;由于可行方向法对威胁圆叠加时规划出的航路效果不理想,提出了圆的切线算法理论作为此航路规划方法的改进,采用随机产生威胁场的方法来模拟多变的战场环境,并且进行了理论分析,最后得出仿真结果.仿真证明,将两种方法结合规划出的飞行航线在航程上是比较理想的,而且路径规则的效果也得到了很大的提高.     

科研经费管理决策支持系统若干模型

本文应用多目标决策原理和计算机技术,在分析用户需求的基础上,建立了科研任务项目的预测评价和经费分配模型,并分析了有关模型的关系和解决性质。根据这些模型和决策的特点,简要叙述了该系统的主要功能。我们相信。该系统的应用,将给管理人员提供方便,且使管理进一步科学化,让有限的经费发挥更大的作用。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

The value of information sharing in a two‐stage supply chain with production capacity constraints

We consider a simple two‐stage supply chain with a single retailer facing i.i.d. demand and a single manufacturer with finite production capacity. We analyze the value of information sharing between the retailer and the manufacturer over a finite time horizon. In our model, the manufacturer receives demand information from the retailer even during time periods in which the retailer does not order. To analyze the impact of information sharing, we consider the following three strategies: (1) the retailer does not share demand information with the manufacturer; (2) the retailer does share demand information with the manufacturer and the manufacturer uses the optimal policy to schedule production; (3) the retailer shares demand information with the manufacturer and the manufacturer uses a greedy policy to schedule production. These strategies allow us to study the impact of information sharing on the manufacturer as a function of the production capacity, and the frequency and timing in which demand information is shared. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal stopping in software testing

In this paper we address the problem of how to decide when to terminate the testing/modification process and to release the software during the development phase. We present a Bayesian decision theoretic approach by formulating the optimal release problem as a sequential decision problem. By using a non‐Gaussian Kalman filter type model, proposed by Chen and Singpurwalla (1994), to track software reliability, we are able to obtain tractable expressions for inference and determine a one‐stage look ahead stopping rule under reasonable conditions and a class of loss functions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

关于非扩展映象的有限族的一个强收敛性定理

讨论了一个非扩展映象的有限族所定义的迭代格式,证明了Banach空间中的一个非扩展映象的有限族的强收敛性定理。