A Recursive Algorithm for Order Cycle-time that Minimizes Logistics Cost

A firm's logistics cost, including shipping and inventory-carrying, is a substantial percentage of its sales. Nevertheless, typical inventory-control methods ignore or insufficiently represent the shipping cost. This paper describes a recursive algorithm that determines the reorder cycle-time that minimizes total logistics cost. It allows for a realistic accounting of shipping cost, which is modelled here as a function of shipping distance and weight. The algorithm uses a relaxation procedure to identify a suitable initial approximation to the optimal order cycle-time and then, through a series of recursive steps, moves to the optimal result. We demonstrate the algorithm with a single item, with a group of items that share a common order cycle, and with multi-items when item demands are random variables. Experience with this algorithm indicates that it converges to the optimal result in a very few steps.     

Signed graphs for portfolio analysis in risk management

We introduce the notion of structural balance for signed graphsin the context of portfolio analysis. A portfolio of securitiescan be represented as a signed graph with the nodes denotingthe securities and the edges representing the correlation betweenthe securities. With signed graphs, the characteristics of aportfolio from a risk management perspective can be uncoveredfor analysis purposes. It is shown that a portfolio characterizedby a signed graph of positive and negative edges that is structurallybalanced is characteristically more predictable. Investors whoundertake a portfolio position with all positively correlatedsecurities do so with the intention to speculate on the upside(or downside). If the portfolio consists of negative edges andis balanced, then it is likely that the position has a hedgingdisposition within it. On the other hand, an unbalanced signedgraph is representative of an investment portfolio which ischaracteristically unpredictable.     

Quantum effects in a one-dimensional magnetic gravitational trap for ultracold neutrons

JETP Letters - The problem of storing ultracold neutrons over a plane magnetic mirror in the presence of gravity is considered. For neutrons with a definite polarization, the sum of the magnetic...     

Energy decay of solutions to Maxwell's equations with conductivity and polarization

In this paper, Maxwell's equations involving generally nonlinear polarization and field-dependent currents are studied. The main objective is the asymptotic behavior of the solution for t→∞ if no damping term occurs in the equation governing the polarization field.     

Yellow‐light‐emitting cyano‐substituted poly[(1,3‐phenylene vinylene)‐alt‐(1,4‐phenylene vinylene)] derivative: Its synthesis and optical properties

A soluble cyano‐substituted poly[(1,3‐phenylene vinylene)‐alt‐(1,4‐phenylene vinylene)] derivative ( 9 ) was synthesized and characterized. Comparison between 9 and its model compound ( 10 ) showed that the chromophore in 9 remained to be well defined as a result of a π‐conjugation interruption at adjacent m‐phenylene units. The attachment of a cyano substituent only at the β position of the vinylene allowed the maximum electronic impact of the cyano group on the optical properties of the poly(p‐phenylene vinylene) material. At a low temperature (?108 or ?198 °C), the vibronic structures of 9 and 10 were partially resolved. The absorption and emission spectra of a film of 9 were less temperature‐dependent than those of a film of 10 , indicating that the former had a lower tendency to aggregate. A light‐emitting diode (LED) based on 9 emitted yellow light (λ_max ≈ 578 nm) with an external quantum efficiency of 0.03%. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 3149–3158, 2003     

Searching in trees

In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given.     

Piecewise Deterministic Markov Control Processes with Feedback Controls and Unbounded Costs

The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls.     

Aspects of operator theory in hereditarily indecomposable Banach spaces

We examine certain special features exhibited by various classes of linear operators acting in a hereditarily indecomposable Banach space. For instance, we show that the family of all Riesz operators in a H.I. space forms a closed, 2-sided ideal. We also give further characterizations of the class of scalar-type spectral operators (to those already given in [16]). The final section discusses some properties of the spectral maximal spaces of (necessarily decomposable) linear operators in such spaces. Conferenza tenuta il 16 settembre 1997 The support of the German Academic Exchange Scheme (DAAD) is gratefully acknowledged