A finite cutting plane method for facial disjunctive programs

This paper shows that any linear disjunctive program with a finite number of constraints can be transformed into an equivalent facial program. Based upon linear programming technique, a new, finite cutting plane method is presented for the facial programs.

---

Zusammenfassung Die Arbeit zeigt, daß jedes lineare disjunktive Optimierungsproblem mit endlich vielen Restriktionen in ein äquivalentes Fazetten-Problem transformiert werden kann. Auf der Grundlage von linearer Optimierungstechnik wird für das Fazetten-Problem ein neues, endliches Schnittebenenverfahren vorgestellt.

     

Fejér means of functions on noncommutative Vilenkin groups with respect to the character system

Summary It is known that the Fejér means - with respect to the character system of the Walsh, and bounded Vilenkin groups - of an integrable function converge to the function a.e. In this work we discuss analogous problems on the complete product of finite, not necessarily Abelian groups with respect to the character system for functions that are constant on the conjugacy classes. We find that the nonabelian case differs from the commutative case. We prove the a.e. convergence of the (C,1) means of the Fourier series of square integrable functions. We also prove the existence of a function f∊L^q for some q >1 such that sup |σ_n f | = + ∞ a.e. This is a sharp contrast between the Abelian and the nonabelian cases.     

On the Point-Particle (Newtonian) Limit¶of the Non-Linear Hartree Equation

We consider the nonlinear Hartree equation describing the dynamics of weakly interacting non-relativistic Bosons. We show that a nonlinear M?ller wave operator describing the scattering of a soliton and a wave can be defined. We also consider the dynamics of a soliton in a slowly varying background potential W(ɛx). We prove that the soliton decomposes into a soliton plus a scattering wave (radiation) up to times of order ɛ⁻¹. To leading order, the center of the soliton follows the trajectory of a classical particle in the potential W(ɛx). Received: 30 June 2000 / Accepted: 25 June 2001     

A cutting plane algorithm for a clustering problem

In this paper we consider a clustering problem that arises in qualitative data analysis. This problem can be transformed to a combinatorial optimization problem, the clique partitioning problem. We have studied the latter problem from a polyhedral point of view and determined large classes of facets of the associated polytope. These theoretical results are utilized in this paper. We describe a cutting plane algorithm that is based on the simplex method and uses exact and heuristic separation routines for some of the classes of facets mentioned before. We discuss some details of the implementation of our code and present our computational results. We mention applications from, e.g., zoology, economics, and the political sciences.     

Acousto-optic mode coupling of partially coherent light in two-mode optical fibers

An acoustic pulse propagating on a two-mode fiber can act as a beam splitter in a scanning interferometer. When this device is employed in white-light interferometry, the effects of distributed coupling and dispersive interferometer arms need to be considered. A theory suitable for treating acousto-optic interaction of partially coherent light in a moving interaction region was developed. It was found that differential optical dispersion should be negligible and the acoustic pulse length short. Also the coherence time should be short but long compared to the intermodal group delay difference over a pulse length. Experiments with long acoustic pulses were performed, and fairly good agreement with theory was obtained.