以库存成本为中心的航空备件决策分析

在分析库存成本的基础上,根据等周期补货原则,确定了在一定时间跨度内的缺货时间点、补货时间点及每次的补充量;根据补货周期内部缺货的时间长度与周期长度界定了库存服务水平;最后通过算例对备件决策中的各要素与库存成本的关系进行了分析.     

三级备件保障系统下的备件库存优化模型

目前我军装备备件保障通常采用三级保障模式,以各级备件期望短缺数量之和最小为目标,研究在不同库存水平条件下,三级备件保障系统的备件库存优化模型.经示例分析,验证了该模型的可行性和有效性,该结果可为多级备件保障提供理论依据.     

有限可修备件条件下系统计划更换策略

在现有的计划更换模型的基础上 ,研究了一种备件有限及部件可修的更换策略问题。利用在更换周期点上具有的马尔可夫性质 ,以系统首次故障前平均工作时间最大为目标建立了确定最佳更换周期的模型。     

典型串并联系统的备件库存优化模型

选取典型串并联系统的备件库存优化为研究对象,以系统供应可用度最大为目标,备件总购置费为约束条件构建备件库存优化模型,给出基于边际分析法的优化算法.经示例分析,验证了该模型的可行性和有效性,结果可为备件保障经费的合理配置提供理论依据.     

停产后服务备件存储点的选择与库存问题研究

分析了停产后服务备件的三种存储模式,以主要基层仓库和常规基层仓库模式为基本模式,建立了选址库存模型,将两级库存体系不变模式和单级库存体系模式作为特例加以讨论,并设计了基于遗传算法的迭代算法求解选址库存问题,通过仿真算例验证了模型和方法的可行性和有效性.通过分析,主要基层仓库和常规基层仓库模式能够将成本优势与客户服务水平良好结合,是一种较好的模式.     

模糊需求下的库存风险及最优库存决策

分析了在模糊需求下,按经典库存模型中的经济订货批量和订货周期所导致的库存风险损失。推导了模糊需求下的经济风险函数。给出了风险函数在模糊需求分布下的重心决策方法,在此基础上得到了模糊需求下经济批量的修正公式,为模糊库存风险分析的研究提供了一种方法。     

两人交叉决策联合最优解的存在性

本文探讨了两人交叉规划问题联合最优解的存在性．交叉规划问题来源于具有冲突的经济均衡问题，它的研究在理论和应用上具有重要的意义．     

单向可替代产品价格和库存的联合决策

考虑单周期问题中零售商同时销售两种可单向替代的产品,以期望利润为目标函数建立数学模型.将库存和替代价格共同作为零售商决策变量,证明其目标函数是凹函数,并得到求模型最优解的充要条件及解存在的范围.最后假设产品需求为正态分布,通过数值实验对模型的最优解进行分析,结果表明:实行最优替代价格策略可以有效提高零售商期望利润;允许替代销售不一定提高市场服务水平;被替代产品的销售价格和残值对零售商的最优替代价格决策没有显著影响.     

最优刀具更换周期上界、检查间隔下界的证明

本文针对 99年大学生数学建模竞赛 A题中问题 1 ,利用目标函数求出了一般情况下刀具更换周期最优解 T<μ的一个充分条件及最优检查间隔的下界 ,并证明了问题 1中刀具更换周期最优解 T<551 <μ和检查间隔最优解 n≥ 8     

随机需求下考虑半成品库存的多周期生产决策优化

为了更好地应对需求的不确定性,在需求实现之前,企业既可以生产成品直接满足需求,亦可生产部分半成品,在观察到实际需求之后短时间内迅速完成剩余生产环节以满足需求。未加工的半成品和未售出的成品可用于满足后续周期的需求。作为一种提高生产灵活性的手段,分阶段生产的方式会产生更高的成本。企业需要在成本和灵活性之间作出权衡,优化生产决策。模型通过动态规划的方法,研究需求不确定情况下考虑半成品库存的多周期生产决策问题,通过分析目标函数以及最优值函数的结构性质,推导出最优的多周期生产策略为修正的目标库存策略,并且分析了不同参数对最优策略的影响。     

A condition-based replacement and spare provisioning policy for deteriorating systems with uncertain deterioration to failure

A new policy, referred to as the condition-based replacement and spare provisioning policy, is presented for deteriorating systems with a number of identical units. It combines the condition-based replacement policy with periodical inspections and the (S,s$S\text{,}s$) type inventory policy, noted as the (T,S,s,_Lp$T\text{,}S\text{,}s\text{,}{L}_{\text{p}}$) policy, where T is the inspection interval, S is the maximum stock level, s   is the reorder level, and _Lp$L_{\text{p}}$ is the preventive replacement threshold for the deterioration levels of units. The deterioration level of each unit in the system can be described by a scalar random variable, which is continuous and increasing monotonically. Furthermore, the deterioration level just when the unit failure occurs, termed deterioration to failure, is uncertain. Therefore, the condition-based reliability is proposed in order to characterize various and uncertain deterioration levels when unit failure occurs. A simulation model is developed for the system operation under the proposed condition-based replacement and spare provisioning policy. Thus, via the simulation method and the genetic algorithm, the decision variables T, S, s  , and _Lp$L_{\text{p}}$ can be jointly optimized for minimizing the cost rate. A case study is given, showing the procedure of applying the proposed policy and the condition-based reliability methodology to optimizing the maintenance scheme of haul truck motors at a mine site based on oil inspections, and proving beneficial for plant maintenance managers to reduce maintenance cost.     

Optimal Starting Conditions for the Rendezvous Maneuver, Part 1: Optimal Control Approach

We consider the three-dimensional rendezvous between two spacecraft: a target spacecraft on a circular orbit around the Earth and a chaser spacecraft initially on some elliptical orbit yet to be determined. The chaser spacecraft has variable mass, limited thrust, and its trajectory is governed by three controls, one determining the thrust magnitude and two determining the thrust direction. We seek the time history of the controls in such a way that the propellant mass required to execute the rendezvous maneuver is minimized. Two cases are considered: (i) time-to-rendezvous free and (ii) time-to-rendezvous given, respectively equivalent to (i) free angular travel and (ii) fixed angular travel for the target spacecraft. The above problem has been studied by several authors under the assumption that the initial separation coordinates and the initial separation velocities are given, hence known initial conditions for the chaser spacecraft. In this paper, it is assumed that both the initial separation coordinates and initial separation velocities are free except for the requirement that the initial chaser-to-target distance is given so as to prevent the occurrence of trivial solutions. Analyses performed with the multiple-subarc sequential gradient-restoration algorithm for optimal control problems show that the fuel-optimal trajectory is zero-bang, namely it is characterized by two subarcs: a long coasting zero-thrust subarc followed by a short powered max-thrust braking subarc. While the thrust direction of the powered subarc is continuously variable for the optimal trajectory, its replacement with a constant (yet optimized) thrust direction produces a very efficient guidance trajectory: Indeed, for all values of the initial distance, the fuel required by the guidance trajectory is within less than one percent of the fuel required by the optimal trajectory. For the guidance trajectory, because of the replacement of the variable thrust direction of the powered subarc with a constant thrust direction, the optimal control problem degenerates into a mathematical programming problem with a relatively small number of degrees of freedom, more precisely: three for case (i) time-to-rendezvous free and two for case (ii) time-to-rendezvous given. In particular, we consider the rendezvous between the Space Shuttle (chaser) and the International Space Station (target). Once a given initial distance SS-to-ISS is preselected, the present work supplies not only the best initial conditions for the rendezvous trajectory, but simultaneously the corresponding final conditions for the ascent trajectory.     

A New Conical Regularization for Some Optimization and Optimal Control Problems: Convergence Analysis and Finite Element Discretization

In this article, we study an abstract constrained optimization problem that appears commonly in the optimal control of linear partial differential equations. The main emphasis of the present study is on the case when the ordering cone for the optimization problem has an empty interior. To circumvent this major difficulty, we propose a new conical regularization approach in which the main idea is to replace the ordering cone by a family of dilating cones. We devise a general regularization approach and use it to give a detailed convergence analysis for the conical regularization as well as a related regularization approach. We showed that the conical regularization approach leads to a family of optimization problems that admit regular multipliers. The approach remains valid in the setting of general Hilbert spaces and it does not require any sort of compactness or positivity condition on the operators involved. One of the main advantages of the approach is that it is amenable for numerical computations. We consider four different examples, two of them elliptic control problems with state constraints, and present numerical results that completely support our theoretical results and confirm the numerical feasibility of our approach. The motivation for the conical regularization is to overcome the difficulties associated with the lack of Slater's type constraint qualification, which is a common hurdle in numerous branches of applied mathematics including optimal control, inverse problems, vector optimization, set-valued optimization, sensitivity analysis, variational inequalities, among others.