Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

A flexible and generic approach to dynamic modelling of supply chains

In this paper, we present a new modelling approach for realistic supply chain simulation. The model provides an experimental environment for informed comparison between different supply chain policies. A basic simulation model for a generic node, from which a supply chain network can be built, has been developed using an object-oriented approach. This generic model allows the incorporation of the information and physical systems and decision-making policies used by each node. The object-oriented approach gives the flexibility in specifying the supply chain configuration and operation decisions, and policies. Stochastic simulations are achieved by applying Latin Supercube Sampling to the uncertain variables in descending order of importance, which reduces the number of simulations required. We also present a case study to show that the model is applicable to a real-life situation for dynamic stochastic studies.     

On a class of preconditioners for solving the Helmholtz equation

In 1983, a preconditioner was proposed [J. Comput. Phys. 49 (1983) 443] based on the Laplace operator for solving the discrete Helmholtz equation efficiently with CGNR. The preconditioner is especially effective for low wavenumber cases where the linear system is slightly indefinite. Laird [Preconditioned iterative solution of the 2D Helmholtz equation, First Year's Report, St. Hugh's College, Oxford, 2001] proposed a preconditioner where an extra term is added to the Laplace operator. This term is similar to the zeroth order term in the Helmholtz equation but with reversed sign. In this paper, both approaches are further generalized to a new class of preconditioners, the so-called “shifted Laplace” preconditioners of the form Δφ−k²φ with . Numerical experiments for various wavenumbers indicate the effectiveness of the preconditioner. The preconditioner is evaluated in combination with GMRES, Bi-CGSTAB, and CGNR.     

Critical Behavior of Two Interacting Linear Polymer Chains in a Good Solvent

A model of two interacting (chemically different) linear polymer chains is solved exactly using the real-space renormalization group transformation on a family of Sierpinski gasket type fractals and on a truncated 4-simplex lattice. The members of the family of the Sierpinski gasket-type fractals are characterized by an integer scale factorb which runs from 2 to ∞. The Hausdorff dimensiond _F of these fractals tends to 2 from below asb → ∞. We calculate the contact exponenty for the transition from the State of segregation to a State in which the two chains are entangled forb = 2-5. Using arguments based on the finite-size scaling theory, we show that forb→∞, y = 2 - v(b) d _F, wherev is the end-toend distance exponent of a chain. For a truncated 4-simplex lattice it is shown that the system of two chains either remains in a State in which these chains are intermingled in such a way that they cannot be told apart, in the sense that the chemical difference between the polymer chains completely drop out of the thermodynamics of the system, or in a State in which they are either zipped or entangled. We show the region of existence of these different phases separated by tricritical lines. The value of the contact exponenty is calculated at the tricritical points.     

Heavy Majorana neutrinos in e + e − → W + W−

In this paper we investigate the effects of heavy Majorana neutrinos in the reaction e ⁺ e ^? → W ⁺ W ^?. We consider neutrino masses in the 1–10 TeV region. We show that at LEP II and NLC energies it is possible to use this processes to verify indirect evidence of heavy neutral particles with mixing angles of the order sin² α = 0.01. We discuss the unitarity restrictions that can be obtained for vector singlet and fermion-mirror-fermion models.     

Vibrational spectrum of uridine obtained by means of nonresonant-background-free CARS spectroscopy

Received: 18 June 1996/Revised version: 3 January 1997