线性规划问题新解——改进大M法

借鉴两阶段法的求解思路,在用单纯形法求解线性规划问题时,对大M法进行改进,提出一种新的算法.这种改进后的算法可以有效克服原来两种算法的不足,既能降低理解难度,又能提高算法的效率,保证算法的全局收敛性.     

军队人力资源培训问题的整数线性规划模型

文章研究了军队人力资源培训问题,并基于时间和费用两个指标,建立了一个满足培训时间约束且费用最省的0-1整数线性规划模型,给出了基于Lagrange松驰分解的模型求解算法。在算法中,采用一种简单可行的Lagrange乘子更新方法代替传统的次梯度法。另外,文章证明了算法获得最优解的两个充分条件,计算实例初步表明给出的算法是行之有效的。     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

A multilevel passenger screening problem for aviation security

Passenger prescreening is a critical component of aviation security systems. This paper introduces the Multilevel Allocation Problem (MAP), which models the screening of passengers and baggage in a multilevel aviation security system. A passenger is screened by one of several classes, each of which corresponds to a set of procedures using security screening devices, where passengers are differentiated by their perceived risk levels. Each class is defined in terms of its fixed cost (the overhead costs), its marginal cost (the additional cost to screen a passenger), and its security level. The objective of MAP is to assign each passenger to a class such that the total security is maximized subject to passenger assignments and budget constraints. This paper shows that MAP is NP‐hard and introduces a Greedy heuristic that obtains approximate solutions to MAP that use no more than two classes. Examples are constructed using data extracted from the Official Airline Guide. Analysis of the examples suggests that fewer security classes for passenger screening may be more effective and that using passenger risk information can lead to more effective security screening strategies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

任务空间概念模型VV&A研究

任务空间概念模型是现实世界军事知识的第一层抽象,是仿真系统开发的业务基础。所以任务空间概念模型的质量直接影响到仿真系统的质量,任务空间概念模型自身的VV&A是一个非常值得关注的问题。任务空间概念建模本质上看是军事领域的知识表示或者需求描述,定性描述占主要,定量成分非常少。因此,传统的通过分析输出数据的方法不能适应任务空间概念模型的特点。概要介绍了任务空间概念模型建模,并且提出了从专家法、静态校核机制、概念执行机制三个角度来考察模型质量的思路。     

云模型及其在指挥控制系统可靠性分析中的应用

根据指挥控制系统的特点及作战应用的具体情况,从指挥控制系统的可靠性出发,提出了适合指控系统可靠性分析的云模型。通过拟定性能评价指标,导出各指标的云模型及其多维加权综合云的重心,应用云重心评价方法进行分析;并通过案例,运用基于PC-L INM AP的云重心评价方法,以影响指挥控制系统可靠性的两个重要性能指标为依据,分析了未来联合作战中指挥控制系统的可靠性,比较贴近作战实际,可信度较高。     

Approximate dynamic programming methods for an inventory allocation problem under uncertainty

We propose two approximate dynamic programming methods to optimize the distribution operations of a company manufacturing a certain product at multiple production plants and shipping it to different customer locations for sale. We begin by formulating the problem as a dynamic program. Our first approximate dynamic programming method uses a linear approximation of the value function and computes the parameters of this approximation by using the linear programming representation of the dynamic program. Our second method relaxes the constraints that link the decisions for different production plants. Consequently, the dynamic program decomposes by the production plants. Computational experiments show that the proposed methods are computationally attractive, and in particular, the second method performs significantly better than standard benchmarks. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于整数规划的地地导弹打击目标优化选取

地地战役战术导弹火力运用中,对导弹打击目标的选取是导弹部队制定合理科学作战方案所面临的现实问题。针对给定弹量和特定作战意图对打击目标进行优化选择问题,运用0-1型整数规划,建立合理的数学模型并确定最优打击目标。通过应用实例表明,此方法简便易行,可操作性较强,具有一定的实用价值。     

Rational Rose在HLA联邦开发中的应用

作为“建模与仿真”(M&S)的高层体系结构 ,HLA能带给用户的好处将是巨大的。HLA联邦开发与运行过程 (FEDEP)的自动化是促进HLA应用的关键。文中研究了将功能强大的CASE工具RationalRose用于支持FEDEP自动化的可行性 ,指出了应用中应特别注意的问题 ,重点说明了应用中的关键技术 ,并给出一应用实例     

数字电路中引线逻辑值的计算

采用了事件驱动法计算电路的逻辑值,其特点是将变化的引线值定义为一个事件,根据事件是否发生计算引线的逻辑值,和下一事件法相比,该方法明显提高效率。