Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

Bank-office Process Management in the Financial Services: a Simulation Approach Using a Model Generator

For the last ten years or so, developments in simulation software and methodology have been focused in two areas: (1) automating the model-building process; and (2) interfacing with other techniques and systems. That both academic and commercial research continues to be carried out in these areas is evidence of the continued popularity of the simulation technique. The most popular application areas where simulation modelling is used include manufacturing (engineering and process), warehousing and communications; not surprisingly, research and developments have therefore been concentrated in these areas. This paper describes the development of a simulation model generator for a different application area, that of clerical office processing of paper and documents for financial service companies. It outlines the reasons why there is a need for such a model generator and discusses the initial design requirements. The paper goes on to detail the developments and re-defined criteria required as the model generator brief changes as a result of practical applications.     

An Overview of Scheduling Problems Arising in Satellite Communications

Satellite communications, like batches of work in a job shop, need to be scheduled in order to use their resources as efficiently as possible. The most common satellite communications system in use today is known as Time Division Multiple Access (TDMA), in which data from earth stations is buffered before being transmitted to the appropriate receiver on a satellite. Cycles of transmission are fixed for all stations. Since the same satellite will be used for routeing data in several different ways, a schedule must be devised to use the receivers, repeaters and transmitters on board to minimize the time needed for completion of a batch of work. This paper is a survey of current scheduling algorithms used for optimizing satellite communications resources. Apart from telecommunications, the methods presented here could be applied to more general scheduling problems with renewable resources but without precedence constraints.     

Dynamic Point Location in General Subdivisions

The dynamic planar point location problem is the task of maintaining a dynamic set S of n nonintersecting (except possibly at endpoints) line segments in the plane under the following operations:

• Locate (: point): Report the segment immediately above , i.e., the first segment intersected by an upward vertical ray starting at ;

• Insert (: segment): Add segment to the collection of segments;

• Delete (: segment): Remove segment from the collection of segments.

We present a solution which requires space O(n) and has query and insertion time O(log n log log n) and deletion time O(log²n). The bounds for insertions and deletions are amortized. A query time below O(log²n) was previously only known for monotone subdivisions and subdivisions consisting of horizontal segments and required nonlinear space.     

The elastoplastic stressed state of a half-plane under local nonstationary heating

We solve the thermoplastic problem for a semi-infinite plate under local nonstationary heating by heat sources. The physical equations are taken to be the relations of the nonisothermic theory of plastic flow associated with the Mises fluidity condition. The solution of the problem is constructed by the method of integral equations and the self-correcting method of sequential loading, where time is taken as the loading parameter. We carry out numerical computations of the stresses in the case of heating a plate with heat output by normal-circular heat sources. We study the problem of optimization of heating regimes in order to introduce favorable residual compressive stresses (from the point of view of hardness) in a given region of a half-plane. Two figures.Translated fromMatematicheskie Metody i Fiziko-Mekhanicheskie Polya, Issue 27, 1988, pp. 29–34.     

On the existence of <Emphasis Type="Bold">1, 3</Emphasis>P <Emphasis Type="Bold">o</Emphasis> resonances in H<Superscript>-</Superscript> between n = 2 and 3 H thresholds

We examine the influence of relativistic and QED effects on the existence of the ^1,3P ^o H^- resonances between n = 2 and 3 hydrogen thresholds, the relativistic and QED corrections and the coupling effects between the high singlet and triplet states are considered as first-order perturbations. We firstly obtain accurate non-relativistic resonant energies and widths of fifteen ¹P ^o resonances, and fifteen ³P ^o resonances. The fifteen ¹P ^o resonances are classified to be ₃ (2, 0) ^- _n ( 4 ? n ? 12) and ₃ (1, 1) ⁺ _n ( 3 ? n ? 8). The fifteen ³P ^o resonances are classified to be ₃ (2, 0) ⁺ _n ( 3 ? n ? 12) and ₃ (1, 1) ^- _n ( 4 ? n ? 8). We found there exist six Feshbach resonances for ₃ (2, 0) ^- _n (¹P ^o ) series, four Feshbach resonances for ₃ (1, 1) ⁺ _n (¹P ^o ) series, seven Feshbach resonances for ₃ (2, 0) ⁺ _n (³P ^o ) series, and three Feshbach resonances for ₃ (1, 1) ^- _n (¹P ^o ) series. Received 22 February 2002 Published online 24 September 2002     

Reaction of D2 with palladium fulleride C60Pd4.9

Fullerene deuteride was obtained by the reaction of deuterium with solid palladium fulleride C₆₀Pd_4.9 under fairly mild conditions. The compound was identified by FD-MS, UV-Vis and IR spectroscopies, and TLC.Translated from Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 483–484, February, 1996