Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.     

极大单调算子的一个邻近点算法

设E是自反的Banach空间,T∶E→2E是极大单调算子.T-10≠.令x0∈E,yn=(J λnT)-1xn en,xn 1=J-1(αnJxn (1-αn)Jyn),n≥0,λn>0,αn∈[0,1],本文研究了{xn}收敛性.     

基于单纯形方法的双层线性规划全局优化算法

通过分析双层线性规划可行域的结构特征和全局最优解在约束域的极点上达到这一特性,对单纯形方法中进基变量的选取法则进行适当修改后,给出了一个求解双层线性规划局部最优解方法,然后引进上层目标函数对应的一种割平面约束来修正当前局部最优解,直到求得双层线性规划的全局最优解.提出的算法具有全局收敛性,并通过算例说明了算法的求解过程.     

双相干点光源干涉的一般分析

讨论了双相干点光源的三维空间干涉场的一般数学描述,分析了3个不同截面处的干涉强度的空间分布情况,并给出了相干相长点的计算机模拟图样.该结果也适用于其他类型波的相干叠加场分布.     

A CLASS OF r-POINT (r+1)ST-ORDER A-STABLE ONE-BLOCK METHODS WITH DAMPING AT THE INFINITE POINT

1　ＩｎｔｒｏｄｕｃｔｉｏｎＦｏｒｓｏｌｖｉｎｇｓｔｉｆｆｉｎｉｔｉａｌｖａｌｕｅｐｒｏｂｌｅｍｓｆｏｒｓｙｓｔｅｍｓｏｆＯＤＥｓｙ′=ｆ(ｙ) ,ｙ(ｔ0 ) =ｙ0 ,ｔ0 <ｔ≤Ｔ ,ｙ0 ,ｙ∈Ｒｍ,ｆ :Ω Ｒｍ →Ｒｍ (1 .1 )ｍａｎｙｐａｒｔｉｃｕｌａｒｏｎｅ ｂｌｏｃｋｍｅｔｈｏｄｓｏｆｔｈｅｆｏｒｍＹｎ+1= ＡＹｎ+ｈ( Ｂ0 Ｆ(Ｙｎ) + Ｂ1Ｆ(Ｙｎ+1) ) , Ａ =Ａ Ｉｍ, Ｂｉ=Ｂｉ Ｉｍ,Ａ ,Ｂｉ∈Ｒｒ×ｒ,Ｙｎ =(ＹＴｎｒ,… ,ｙＴ(ｎ+1)ｒ- 1) Ｔ,Ｆ(Ｙｎ) =(ｆＴ(ｙｎｒ) ,… ,ｆＴ(ｙ(ｎ+1)ｒ- 1) ) Ｔ,ｙｊ≈ ｙ(ｔｊ) ,…     

二阶非线性微分方程的斜周期边值问题

In this paper a uniqueness theorem for a skewperiodic boundary value problem is obtained. By using the optimal control method, we derive the best estimate for the integration mean ensuring that the results hold.     

随机动力系统的进展和问题

本文主要介绍随机动力系统的主要成果和进一步研究的问题。     

边值问题的某些存在定理(英)

本文给出关于边值问题解的某存在唯一性定理及其应用．     

气体放电击穿过程的物理和数值研究

本文对低气压（１０＾－２Ｐａ）热阴极气体放电的击穿过程给出了物理描述和相应的双流体数学型，并发展了一种选择和调整未知初始条件的有效算法，可以通过伴随试射法得到对初始条件十分敏感的非线性两点边值常微分方程组的数值解，从而给出这类气体放电中击穿过程的定量描述。