Lot-sizing with fixed charges on stocks: the convex hull

In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems.

Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany et al. (Math. Programming Stud. 22 (1984) 32) for the uncapacitated lot-sizing problem. The convex hull proof is based on showing that an extended facility location formulation is tight and by projecting it onto the original space of variables.     

Stochastic control problems with delay

We consider optimal control problems for systems described by stochastic differential equations with delay. We state conditions for certain classes of such systems under which the stochastic control problems become finite-dimensional. These conditions are illustrated with three applications. First, we solve some linear quadratic problems with delay. Then we find the optimal consumption rate in a financial market with delay. Finally, we solve explicitly a deterministic fluid problem with delay which arises from admission control in ATM communication networks.     

Effects of the switching time in OPS/OBS networks

In this paper we present an analytical model, which considers the effects of the switching time on the network performance in service differentiated optical packet/burst switching (OPS/OBS) networks. Our results indicate that the switching time must be less than 10 % of the packet/burst duration in order to avoid any significant reductions in the network performance. Furthermore, regarding a network with full wavelength conversion, we show that the benefits of statistical resource sharing are almost non-existent for low priority traffic when the switching time is large.     

Charge manipulation and imaging of the Mn acceptor state in GaAs by cross-sectional scanning tunneling microscopy

An individual Mn acceptor in GaAs is mapped by cross-sectional scanning tunneling microscopy (X-STM) at room temperature and a strongly anisotropic shape of the acceptor state is observed. An acceptor state manifests itself as a cross-like feature which we attribute to a valence hole weakly bound to the Mn ion forming the (Mn²⁺3d⁵+hole) complex. We propose that the observed anisotropy of the Mn acceptor wavefunction is due to the d-wave present in the acceptor ground state.     

Relevance of Reflection in Static and Dynamic Light Scattering Experiments

Using a monodisperse PMMA dispersion, it was shown that light reflection at the sample cuvette walls may greatly influence the results of both static (SLS) and dynamic (DLS) light scattering experiments. Considering SLS, this reflection phenomenon mostly causes an overestimation of the scattered intensity at high scattering angles, which may give rise to the emergence of an additional, artificial peak in the lower region of the particle size distribution. On the other hand, the influcence of reflection on DLS measurements was shown to be particularly important in the upper region of the particle size distribution. The experimentally observed phenomena were explained from the basic principles of both particle sizing methods. Finally, it was shown that the disturbing effect of reflection could be avoided by modifying either the hardware or the software of the static and dynamic light scattering technique.     

The core of discontinuous games

The traditional design of cooperative games implicitly assumes that preferences are continuous. However, if agents implement tie breaking procedures, preferences are effectively lexicographic and thus discontinuous. This rouses concern over whether classic core nonemptiness theorems apply in such settings. We show that balanced NTU games may have empty cores when agents have discontinuous preferences. Moreover, exchange economies may lack coalitionally rational trades when consumers implement tie breaking rules, even if these rules are themselves continuous and convex as are all first order preferences. Results are more positive when “utility” is transferable. We prove that balancedness is necessary and sufficient to ensure a nonempty core in lexicographic TU games.