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.     

Influence of <Emphasis Type="Italic">CP</Emphasis> and <Emphasis Type="Italic">CPT</Emphasis> on production and decay of Dirac and Majorana fermions

The consequences of CP and CPT invariance for production and subsequent decay of Dirac and Majorana fermions in polarized fermion-antifermion annihilation are analytically studied. We derive general symmetry relations for the production spin density matrix and for the three-particle decay matrices and obtain constraints for the polarization and the spin-spin correlations of Dirac and Majorana fermions. We prove that only for Majorana fermions the energy and opening angle distribution factorizes exactly into contributions from production and decay if CP is conserved. Received: 6 November 2001 / Revised version: 23 April 2002 / Published online: 12 July 2002     

Differential algebraic equations with after-effect

In this paper, we are concerned with the solution of delay differential algebraic equations. These are differential algebraic equations with after-effect, or constrained delay differential equations. The general semi-explicit form of the problem consists of a set of delay differential equations combined with a set of constraints that may involve retarded arguments. Even simply stated problems of this type can give rise to difficult analytical and numerical problems. The more tractable examples can be shown to be equivalent to systems of delay or neutral delay differential equations. Our purpose is to highlight some of the complexities and obstacles that can arise when solving these problems, and to indicate problems that require further research.     

Solution of a Duffing-harmonic oscillator by the method of harmonic balance

The first-order harmonic balance method via first Fourier coefficient is used to construct an approximate frequency-amplitude relation for a Duffing-harmonic oscillator. This relation is in agreement with the result obtained by the Ritz procedure.     

Structural studies of Cr-doped mullite derived from single-phase precursors

Cr-doped mullites were prepared from single-phase precursors containing up to 9.60 wt% Cr₂O₃ using a sol-gel technique followed by thermal treatment. Particle induced X-ray emission spectroscopy and X-ray powder diffraction were used to characterize the samples. Mullites were orthorhombic, space group Pbam. Cr doping caused the increase of unit-cell parameters. Strongest expansion was noticed along c-axis followed by a and b (Δc/c=0.089, Δa/a=0.061, Δb/b=0.045% per mole Cr₂O₃). A second phase, namely θ-(Al,Cr)₂O₃, was revealed by XRD in the sample containing 9.60 wt% Cr₂O₃. The structure of mullites was refined by the Rietveld method, location of Cr³⁺ was performed by the EPR spectroscopy. At low chromium doping level (Cr₂O₃ content less than ∼5 wt%) Cr³⁺ ions were substituted for Al³⁺ in the AlO₆ octahedra of the mullite structure (M1 site). For higher doping level, Cr³⁺ ions were additionally substituted for Al³⁺ in the AlO₆ octahedra of the second phase [θ-(Al,Cr)₂O₃ at 1400 °C, or α-(Al,Cr)₂O₃ at 1600 °C] which segregated in the system. Substitution of Cr³⁺ for Al³⁺ on M1 site in the mullite structure resulted in increase of average distances in (M1)O₆ octahedron and decrease of average distances in T*O₄ tetrahedron, while average distances in TO₄ tetrahedron stayed almost constant.     

Development of high-repetition-rate LD pumped Nd:YAG laser and its application

High-average-power and high-energy lasers with good beam quality are fundamental tools for pumping high-peak and high-average-power ultrafast Ti:sapphire laser systems. Laser-diode (LD) pumped solid slate lasers with phase conjugation offer a unique combination of efficiency, reliability, and compactness. We present the design details and performance characteristics of a 360-W 1-kHz LD pumped Nd:YAG phase-conjugated laser. We also discuss the basic design aspects and present our preliminary experimental investigations on ultrashort-pulse laser systems.     

Linear sorting withO(logn) processors

A file ofn records can be sorted in linear time givenO(log(n)) processors. Four such algorithms are presented and analyzed. All of them have reasonable hardware requirements; no memory access conflicts are generated; a constant number of communication lines per processor are needed (except for one case); and the space requirements areO(n) orO(n log(log(n))).