Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

一种改进方位向非线性CS大斜视角SAR成像算法

大斜视角SAR成像时存在严重的距离走动现象,慢时域的距离走动校正在解决这一问题同时导致了聚焦深度问题.分析了二维频域解耦合后残余相位误差以及时域走动校正后的多普勒调频率误差,提出一种改进的方位向非线性CS算法,校正了三次以上距离迁徙带来的相位误差,同时采用改进非线性CS扰动方程补偿了随方位偏移量线性变化的调频率误差.仿真结果表明,改进算法的大斜视角大场景成像性能优于传统的高分辨大斜视角成像算法.     

Competitive Statehood in Libya: Governing Differently a Specific Setting or Deconstructing its Weak Sovereign State with a Fateful Drift Toward Chaos?

Abstract

Libya in 2011 witnessed a real process of political change, though different from all the policy-oriented jargon equating transition with a teleological transition to democracy. Due to the resilience of the Qadhafi regime in power and with the essential role of NATO intervention, the process was eased out by a eight-month civil war. Governance in post-Qadhafi Libya was not done through the rebuilding of centralized authorities. But it took the specific form of the emergence of multiple non-state actors embedded in local dynamics and then connected with weakened central authorities that had access to the huge Libyan resources. That raised complex questions about the quality of this mode of governance, especially at a time of pressing problems for Libya and its neighbors, whether direct ones (Tunisia, Egypt, Mali) or farther countries across the Mediterranean sea: terrorism with the expansion of Da’esh into the country and flows of refugees crossing Libya’s uncontrolled borders and flowing into Italy and then Europe by thousands.     

An attacker‐defender model for analyzing the vulnerability of initial attack in wildfire suppression

Wildfire managers use initial attack (IA) to control wildfires before they grow large and become difficult to suppress. Although the majority of wildfire incidents are contained by IA, the small percentage of fires that escape IA causes most of the damage. Therefore, planning a successful IA is very important. In this article, we study the vulnerability of IA in wildfire suppression using an attacker‐defender Stackelberg model. The attacker's objective is to coordinate the simultaneous ignition of fires at various points in a landscape to maximize the number of fires that cannot be contained by IA. The defender's objective is to optimally dispatch suppression resources from multiple fire stations located across the landscape to minimize the number of wildfires not contained by IA. We use a decomposition algorithm to solve the model and apply the model on a test case landscape. We also investigate the impact of delay in the response, the fire growth rate, the amount of suppression resources, and the locations of fire stations on the success of IA.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

一种高速实时数据采集处理系统设计

针对目前高速数据采集中的实时性和同步性问题,提出了一种高速实时数据采集处理设计方案。根据上述方案进行了系统的硬件和软件设计,该系统以FPGA器件作为下位机控制核心,设计了时钟同步、数据采集、数据处理、数据缓存、数据通讯等功能模块;整个系统采用ARM微处理器作为上位机控制核心,基于嵌入式Linux 2.6内核进行软件编程,负责向FPGA发送设置参数和控制指令,同时对数据前端采样和处理数据进行存储、显示、统计等。经测试验证,该方案具有高速率、高精度、同步测量、实时处理、体积小、功耗低等优点。     

指控系统信息服务质量评价研究

为了有效评价指控系统信息服务质量情况,在深入分析指控系统信息服务特征及用户服务要求的基础上,研究了评价指标的析取原则,从主观和客观两个方面提出了指控系统信息服务质量评价的指标体系,对各维度及评价指标的含义、测量方法进行了详细讨论,并给出了定性评价、定量评价和半定量评价3种指标评价方法和加权综合评价方法。     

一类带时滞的非线性兰彻斯特战斗模型的分析

基于非线性兰彻斯特方程的一般形式和现代战争的特点,考虑到时间因素在现代战争中的巨大作用,建立并讨论了一类带时滞的非线性兰彻斯特战斗模型。通过定性分析,得到了模型的平衡点及其稳定性,证明了原模型解的存在唯一性,并给出了解的存在区域。战例分析结果表明该模型能用来描述现代战争。因此,该模型对研究现代战争的战斗进程、武器发展规划、现代军事练兵等都具有一定的参考价值。