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     

地空导弹群火力优化分配模型

地空导弹群火力优化分配是对多批空中目标分别选择最有效的地空导弹火力单元进行拦截,形成最佳兵力、兵器使用方案,它是地空导弹武器指控系统的一项重要功能。从研究地空导弹群火力优化分配过程出发,建立了地空导弹拦截适宜性检查模型、射击优先度指标计算模型和火力分配方案优化模型,为仿真地空导弹群火力优化分配过程提供了模型依据。     

舰载武器系统研制方案多目标生成与评价方法

舰载武器系统研制方案的生成、评价与优选问题是武器装备研制论证中的重要内容.在分析目前舰载武器系统研制方案论证方法的基础上,构建了舰载武器系统多目标优化模型,提出了舰载武器系统研制方案的多目标生成方法,并建立了不完全偏好信息的舰载武器系统研制方案的多目标评价与优选模型.实例分析说明,该模型与方法是有效的,可为武器装备研制论证问题提供辅助决策方法和智力支持.     

一种有价值的预防维修策略

当前,在系统的维修性方面,有许多概念是模糊的;许多行为是盲目的,至少是经验主义的。本文针对这些情况,提出了完整的科学维修的概念。以一个有使用价值的预防性维修策略为例,通过讨论,使这种科学维修的概念具体化,并且给出了系统的首翻期、维修周期以及更换期的严格定义和确定方法。     

最优火力分配的改进方法——递推法

针对均匀分布法确定最优火力分配的不足,给出当某维出现虚数即该维最优火力分布不存在时,对其它维火力分配再优化并达最优的递推法。同时建立了均匀分布法计算ｎ维目标射击效率及其最优火力分配的一般数学模型     

科研选题重复因素的分析与对策初探

科研选题中,周期短、见效快的课题重复率较高,其原因与科技人员晋级需求,社会集团易对“短、平、快”选题投资,科研管理人员的情报意识淡漠等因素有关。改变现状需要科技政策的制定者对基础科学研究和从事基础科学研究的人员给予更多的重视和政策的倾斜。科研管理部门应把握科研方向、人才培养、选题调整及发挥专家对审题的充分论证。采取各项综合措施,可望降低科研选题的重复。     

二阶系统的最优控制

应用最优控制理论验证了二阶系统最优控制为典型的Ｂａｎｇ－Ｂａｎｇ控制,通过理论推导得出了其相轨迹,并讨论了二阶系统最优控制的实现。     

坦克连最优火力分配

坦克连火力分配方案的科学与否将直接关系到火力打击的整体效果。为了提高坦克连火力分配方案的科学合理性,力求结合我坦克连作战的实际,在充分考虑火力分配影响因素的基础上,建立了最优火力分配模型,这对于我坦克连充分发扬火力和提高整体作战能力具有重要的指导意义。     

序降应力加速寿命试验(下)——优化设计篇

如何设计试验方案使试验评估结果更准确、试验代价更小,是序降应力加速寿命试验应用中面临的一个重要问题。以试验评估精度和试验代价共同需求为背景,建立一类新的基于加权系数的优化目标函数。为解决仿真优化设计过程中的计算量问题,在深入分析目标函数性质基础上,提出一种新的优化设计法——正交搜索法。与优化设计过程的全局搜索法不同,该方法能够逐次缩小目标函数值,快速逼近最优试验方案。最后通过仿真算例验证了新方法的正确性和高效性。