Applying oracles of on-demand accuracy in two-stage stochastic programming – A computational study

Traditionally, two variants of the L-shaped method based on Benders’ decomposition principle are used to solve two-stage stochastic programming problems: the aggregate and the disaggregate version. In this study we report our experiments with a special convex programming method applied to the aggregate master problem. The convex programming method is of the type that uses an oracle with on-demand accuracy. We use a special form which, when applied to two-stage stochastic programming problems, is shown to integrate the advantages of the traditional variants while avoiding their disadvantages. On a set of 105 test problems, we compare and analyze parallel implementations of regularized and unregularized versions of the algorithms. The results indicate that solution times are significantly shortened by applying the concept of on-demand accuracy.     

A stochastic programming model for scheduling call centers with global Service Level Agreements

We consider the issue of call center scheduling in an environment where arrivals rates are highly variable, aggregate volumes are uncertain, and the call center is subject to a global service level constraint. This paper is motivated by work with a provider of outsourced technical support services where call volumes exhibit significant variability and uncertainty. The outsourcing contract specifies a Service Level Agreement that must be satisfied over an extended period of a week or month. We formulate the problem as a mixed-integer stochastic program. Our model has two distinctive features. Firstly, we combine the server sizing and staff scheduling steps into a single optimization program. Secondly, we explicitly recognize the uncertainty in period-by-period arrival rates. We show that the stochastic formulation, in general, calculates a higher cost optimal schedule than a model which ignores variability, but that the expected cost of this schedule is lower. We conduct extensive experimentation to compare the solutions of the stochastic program with the deterministic programs, based on mean valued arrivals. We find that, in general, the stochastic model provides a significant reduction in the expected cost of operation. The stochastic model also allows the manager to make informed risk management decisions by evaluating the probability that the Service Level Agreement will be achieved.     

Differential equations in spaces of abstract stochastic distributions

We develop the theory of stochastic distributions with values in a separable Hilbert space, and apply this theory to the investigation of abstract stochastic evolution equations with additive noise.     

Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method

The nested L-shaped method is used to solve two- and multi-stage linear stochastic programs with recourse, which can have integer variables on the first stage. In this paper we present and evaluate a cut consolidation technique and a dynamic sequencing protocol to accelerate the solution process. Furthermore, we present a parallelized implementation of the algorithm, which is developed within the COIN-OR framework. We show on a test set of 51 two-stage and 42 multi-stage problems, that both of the developed techniques lead to significant speed ups in computation time.     

An improved lower bound for the expected number of real zeros of a random algebraic polynomials

In this note we estimate the lower bound of the average number of real zeros of a random algebraic polynomials when the random coefficients are standard normal random variables     

Existence and uniqueness of the solutions of stochastic differential equations

The standard existence and uniqueness theorem for stochastic differential equations requires Lipschitz condition of the coefficients. In this paper, we extend these results to the case in which the coefficients are not required to be Lipschitz continuous, instead they only satisfy a ‘weak’ type of Lipschitz condition.     

Two-Step Scheme for Backward Stochastic Differential Equations

In this paper, a stochastic linear two-step scheme has been presented to approximate backward stochastic differential equations (BSDEs). A necessary and sufficient condition is given to judge the $\mathbb{L}_2$-stability of our numerical schemes. This stochastic linear two-step method possesses a family of $3$-order convergence schemes in the sense of strong stability. The coefficients in the numerical methods are inferred based on the constraints of strong stability and $n$-order accuracy ($n\in\mathbb{N}^+$). Numerical experiments illustrate that the scheme is an efficient probabilistic numerical method.     

Stochastic Variational Inequality Approaches to the Stochastic Generalized Nash Equilibrium with Shared Constraints

In this paper, we consider the generalized Nash equilibrium with shared constraints in the stochastic environment, and we call it the stochastic generalized Nash equilibrium. The stochastic variational inequalities are employed to solve this kind of problems, and the expected residual minimization model and the conditional value-at-risk formulations defined by the residual function for the stochastic variational inequalities are discussed. We show the risk for different kinds of solutions for the stochastic generalized Nash equilibrium by the conditional value-at-risk formulations. The properties of the stochastic quadratic generalized Nash equilibrium are shown. The smoothing approximations for the expected residual minimization formulation and the conditional value-at-risk formulation are employed. Moreover, we establish the gradient consistency for the measurable smoothing functions and the integrable functions under some suitable conditions, and we also analyze the properties of the formulations. Numerical results for the applications arising from the electricity market model illustrate that the solutions for the stochastic generalized Nash equilibrium given by the ERM model have good properties, such as robustness, low risk and so on.     

An infinite horizon stochastic maximum principle for discounted control problem with Lipschitz coefficients

In the present work, a stochastic maximum principle for discounted control of a certain class of degenerate diffusion processes with global Lipschitz coefficient is investigated. The value function is given by a discounted performance functional, leading to a stochastic maximum principle of semi-couple forward–backward stochastic differential equation with non-smooth coefficients. The proof is based on the approximation of the Lipschitz coefficients by smooth ones and the approximation of the infinite horizon adjoint process.