Operational research in the UK Ministry of Defence: an overview

The paper presents a survey of operational research (OR) as it is currently used in the UK Ministry of Defence (MoD). After a short historical introduction summarising developments since 1945, it identifies the impact which the end of the Cold War has had on defence operational analysis (OA), as the discipline is generally called within MoD, in terms of the problems studied, the technical challenges presented and the techniques employed. The factors, both external and internal, that have led to the MoD maintaining and indeed expanding its OA activity against a background of falling defence budgets are discussed in the context of previously reported research on the survival and success of OR groups.     

Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems

This paper develops a theory for the global solution of nonconvex optimization problems with parameter-embedded linear dynamic systems. A quite general problem formulation is introduced and a solution is shown to exists. A convexity theory for integrals is then developed to construct convex relaxations for utilization in a branch-and-bound framework to calculate a global minimum. Interval analysis is employed to generate bounds on the state variables implied by the bounds on the embedded parameters. These bounds, along with basic integration theory, are used to prove convergence of the branch-and-bound algorithm to the global minimum of the optimization problem. The implementation of the algorithm is then considered and several numerical case studies are examined thoroughly     

Maximizing revenue in the airline industry under one-way pricing

The paper describes a methodology that has been implemented in a major British airline to find the optimal price to charge for airline tickets under one-way pricing. An analytical model has been developed to describe the buying behaviour of customers for flights over the selling period. Using this model and a standard analytical method for constrained optimization, we can find an expression for the optimal price structure for a flight. The expected number of bookings made on each day of the selling period and in each fare class given these prices can then be easily calculated. A simulation model is used to find the confidence ranges on the numbers of bookings and these ranges can be used to regulate the sale of tickets. A procedure to update the price structure based on the remaining capacity has also been developed.     

Exploring Little Higgs models with ATLAS at the LHC-

The European Physical Journal C - We discuss possible searches for the new particles predicted by Little Higgs Models at the LHC. By using a simulation of the ATLAS detector, we demonstrate how the...     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.     

Computation of the Morse Spectrum

The Morse spectrum is a limit set of Lyapunov exponents of periodic pseudo-trajectories. This notion is especially important in the case where a dynamical system has infinitely many periodic trajectories of large period. A method for estimating the Morse spectrum was suggested by the first author in J. Math. Anal. Appl., 252 (2000). This method is based on ideas of symbolic dynamics which reduces the study of a dynamical system to the study of a certain graph, called a symbolic image. Within the framework of this method, the computation of the Morse spectrum is connected with searching simple closed paths and extracting contours with suitable characteristics. However, under iterations of the symbolic image, the number of such paths sharply increases, which leads to huge expenses of memory and time. We suggest an algorithm for constructing contours with the maximal and minimal mean values. This algorithm is based on a special version of the simplex method. Numerical tests are also described. Bibliography: 13 titles. Illustrations: 3 figures.     

Existence of solutions to projected differential equations in Hilbert spaces

We prove existence and uniqueness of integral curves to the (discontinuous) vector field that results when a Lipschitz continuous vector field on a Hilbert space of any dimension is projected on a non-empty, closed and convex subset.

     

Reflection quotients in Riemannian geometry. A geometric converse to Chevalley's theorem

Chevalley's theorem and its converse, the Sheppard-Todd theorem, assert that finite reflection groups are distinguished by the fact that the ring of invariant polynomials is freely generated. We show that, in the Euclidean case, a weaker condition suffices to characterize finite reflection groups, namely, that a freely-generated polynomial subring is closed with respect to the gradient product.