So-called 'flexible accelerator' or partial adjustment models can be derived from dynamic optimization under convex adjustment costs. However, even with time-invariant adjustment costs and constant discount rate, constancy of the speed of adjustment requires infinite horizon planning. Using a...

This paper presents a tractable model of non-linear dynamics of market returns using a Langevin approach.Due to non-linearity of an interaction potential, the model admits regimes of both small and large return fluctuations. Langevin dynamics are mapped onto an equivalent quantum mechanical (QM)...

The biological Deoxyribo Nucleic Acid (DNA) strand is found to be a promising computing unit. An attempt has been made in this paper to solve Capacitated Vehicle Routing Problem (CVRP). This difficult combinatorial problem combines both the Bin Packing Problem (BPP) and the Multiple Travelling...

This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. [48]. In the network, the involved utilities are stage-dependent and contain random oscillations with an...

This paper deals with the search of optimal paths in a multi-stage stochastic decision network as a first application of the deterministic approximation approach proposed by Tadei et al. [48]. In the network, the involved utilities are stage-dependent and contain random oscillations with an...

Let {ξi} be a family of i.i.d. random vectors in Rd(d≥2), and μn be the distributions in Rd of the empirical means ξ1+⋯+ξnn. Without imposing any conditions, a new and elementary approach is presented in this note for showing the lower bound of the large deviation principle for {μn},...