Long-term throughput, as a key performance indicator of a stochastic flow line, is affected by numerous parameters describing the features of the flow line, such as processing time and buffer size. Fast and accurate evaluation methods for a given set of values for those parameters are a...

A fundamental alternative for stochastic optimization problems named focus programming is proposed based on the focus theory of choice. Different from the existing approaches such as chance-constrained programming and two-stage stochastic programming which are based on expected utility theory,...

We combine a dynamic programming approach (stochastic optimal control) with a multi-stage stochastic programming approach (MSP) in order to solve various problems in personal finance and pensions. Stochastic optimal control produces an optimal policy that is easy to understand and implement....

Generalising the idea of the classical EM algorithm that is widely used for computing maximum likelihood estimates, we propose an EM-Control (EM-C) algorithm for solving multi-period finite time horizon stochastic control problems. The new algorithm sequentially updates the control policies in...

We develop and implement methods for determining whether relaxing sparsity constraints on portfolios improves the investment opportunity set for risk-averse investors. We formulate a new estimation procedure for sparse second-order stochastic spanning based on a greedy algorithm and Linear...

Modern Algorithmic Trading ("Algo") allows institutional investors and traders to liquidate or establish big security positions in a fully automated or low-touch manner. Most existing academic or industrial Algos focus on how to "slice" a big parent order into smaller child orders over a given...

Linking the statistic and the machine learning literature, we provide new general results on the convergence of stochastic approximation schemes and inexact Newton methods. Building on these results, we put forward a new optimization scheme that we call generalized inexact Newton method (GINM)....

Binary random variables often refer to such as customers that are present or not, roads that are open or not, machines that are operable or not. At the same time, stochastic programs often apply to situations where penalties are accumulated when demand is not met, travel times are too long, or...

We provide results for an efficient analytical valuation of partial moments of the multivariate Gaussian distribution over convex polyhedrons to aid the solution, sensitivity analysis and structural analysis of a large number of two-stage resource acquisition and allocation problems. These...

In this paper, we identify a new class of stochastic Iinear convex optimal control problems, whose solution can be obtained by solving appropriate equivalent deterministic optimal control problems. The term 'linear convex' is meant to imply that the dynamics is linear and the cost function is...