A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone

This paper re-examines use of the linear programming (LP) formulation to solve the transportation problem (TP). The proposed method is a general-purpose algorithm which uses only one operation, the Gauss Jordan pivoting used in the simplex method. The final tableau can be used for post-optimality analysis of TP. This algorithm appears to be faster than simplex, more general than stepping-stone and simpler than both in solving general TP. A numerical example illustrates the methodology. It is assumed the reader is familiar with simplex terminology.     

A family of maximal surfaces in Lorentz-Minkowski three-space

We prove the existence of an infinite family of complete spacelike maximal surfaces with singularities in Lorentz-Minkowski three-space and study their properties. These surfaces are distinguished by their number of handles and have two elliptic catenoidal ends.

     

Stowage planning in maritime container transportation

We consider a stowage-planning problem of arranging containers on a container ship in the maritime transportation system. Since containers are accessible only from the top of the stack, temporary unloading and reloading of containers, called shifting, is unavoidable if a container required to be unloaded at the current port is stacked under containers to be unloaded at later ports on the route of the ship. The objective of the stowage planning problem is to minimize the time required for shifting and crane movements on a tour of a container ship while maintaining the stability of the ship. For the problem, we develop a heuristic solution method in which the problem is divided into two subproblems, one for assigning container groups into the holds and one for determining a loading pattern of containers assigned to each hold. The former subproblem is solved by a greedy heuristic based on the transportation simplex method, while the latter is solved by a tree search method. These two subproblems are solved iteratively using information obtained from solutions of each other. To see the performance of the suggested algorithm, computational tests are performed on problem instances generated based on information obtained from an ocean container liner. Results show that the suggested algorithm works better than existing algorithms.     

Strong interactions at low energies

The lectures review some of the basic concepts relevant for an understanding of the low energy properties of the strong interactions: chiral symmetry, spontaneous symmetry breakdown, Goldstone bosons, quark condensate. The effective field theory used to analyze the low energy structure is briefly sketched. As an illustration, I discuss the implications of the recent data on the decay K→ππeν for the magnitude of the quark condensate.     

Weather Risk in Offshore Projects

Risk analysis tools have been used to help manage various projects. This paper describes a case study in which an extension to the stochastic project network model was developed for a risk analysis of an oil platform installation, quantifying the possible impact of the weather on the project's schedule. Examination of the weather data suggested the use of a Markov weather model combined with a separate residence time distribution for key states. The weather model was incorporated into the stochastic project network allowing the interactions of the various project uncertainties to be examined. While the weather introduced a significant additional risk to the project, analysis of management's options indicated that much of the risk might be avoided. In particular, the analysis quantified the benefits of scheduling the project start to take advantage of the seasonal variations and hiring heavy duty equipment to operate in more arduous conditions.     

Optimal Server Acquisition in Open Queueing Networks

Several production and flexible manufacturing systems can naturally be modelled using queueing networks. In this paper, we consider the problem of acquiring servers for the nodes of an open queueing network, so as to optimize the steady-state mean virtual system parameters subject to a budget constraint. A partial enumeration scheme and a heuristic method have been proposed to solve this problem. Empirical results based on randomly generated test problems are used to identify a class of problems for which the heuristic performs well.     

On the reconstruction index of permutation groups: semiregular groups

Summary. The reconstruction index of all semiregular permutation groups is determined. We show that this index satisfies 3 ￡ r(G, W) ￡ 5 3 \leq \rho(G, \Omega) \leq 5 and we classify the groups in each case.     

Unified Interactive Multiple Objective Programming: An Open Architecture For Accommodating New Procedures

It has previously been shown that nine of the most prominent procedures of interactive multiple objective programming can be considered as special cases of a common procedure called the unified algorithm. In this paper, we show how four additional procedures can be similarly included in the unified approach. Also, the paper presents a procedure-switching matrix that depicts the possibilities for switching from one procedure to another, one iteration to the next, in the unified algorithm if so directed by a user.     

Filled Julia Sets with Empty Interior Are Computable

We show that if a polynomial filled Julia set has empty interior, then it is computable.     

On the index of composition of integers from various sets

Given an integer n ≥ 2, let λ(n) := (log n)/(log γ(n)), where γ(n) = Π _p|n p, stand for the index of composition of n, with λ(1) = 1. We study the distribution function of (λ(n) – 1) log n as n runs through particular sets of integers, such as the shifted primes, the values of a given irreducible cubic polynomial and the shifted powerful numbers. Research supported in part by a grant from NSERC. Research supported by the Applied Number Theory Research Group of the Hungarian Academy of Science and by a grant from OTKA. Professor M.V. Subbarao passed away on February 15, 2006. Received: 3 March 2006 Revised: 28 October 2006