Expected Residual Minimization Formulation for a Class of Stochastic Vector Variational Inequalities

This paper considers a class of vector variational inequalities. First, we present an equivalent formulation, which is a scalar variational inequality, for the deterministic vector variational inequality. Then we concentrate on the stochastic circumstance. By noting that the stochastic vector variational inequality may not have a solution feasible for all realizations of the random variable in general, for tractability, we employ the expected residual minimization approach, which aims at minimizing the expected residual of the so-called regularized gap function. We investigate the properties of the expected residual minimization problem, and furthermore, we propose a sample average approximation method for solving the expected residual minimization problem. Comprehensive convergence analysis for the approximation approach is established as well.     

A successive convex approximation method for multistage workforce capacity planning problem with turnover

Workforce capacity planning in human resource management is a critical and essential component of the services supply chain management. In this paper, we consider the planning problem of transferring, hiring, or firing employees among different departments or branches of an organization under an environment of uncertain workforce demands and turnover, with the objective of minimizing the expected cost over a finite planning horizon. We model the problem as a multistage stochastic program and propose a successive convex approximation method which solves the problem in stages and iteratively. An advantage of the method is that it can handle problems of large size where normally solving the problems by equivalent deterministic linear programs is considered to be computationally infeasible. Numerical experiments indicate that solutions obtained by the proposed method have expected costs near optimal.     

Symmetry-breaking bifurcation analysis of stochastic van der pol system via Chebyshev polynomial approximation

Chebyshev polynomial approximation is applied to the symmetry-breaking bifurcation problem of a stochastic van der Pol system with bounded random parameter subjected to harmonic excitation. The stochastic system is reduced into an equivalent deterministic system, of which the responses can be obtained by numerical methods. Nonlinear dynamical behaviors related to various forms of stochastic bifurcations in stochastic system are explored and studied numerically.     

Stochastic chaos in a Duffing oscillator and its control

Stochastic chaos discussed here means a kind of chaotic responses in a Duffing oscillator with bounded random parameters under harmonic excitations. A system with random parameters is usually called a stochastic system. The modifier ‘stochastic’ here implies dependent on some random parameter. As the system itself is stochastic, so is the response, even under harmonic excitations alone. In this paper stochastic chaos and its control are verified by the top Lyapunov exponent of the system. A non-feedback control strategy is adopted here by adding an adjustable noisy phase to the harmonic excitation, so that the control can be realized by adjusting the noise level. It is found that by this control strategy stochastic chaos can be tamed down to the small neighborhood of a periodic trajectory or an equilibrium state. In the analysis the stochastic Duffing oscillator is first transformed into an equivalent deterministic nonlinear system by the Gegenbauer polynomial approximation, so that the problem of controlling stochastic chaos can be reduced into the problem of controlling deterministic chaos in the equivalent system. Then the top Lyapunov exponent of the equivalent system is obtained by Wolf’s method to examine the chaotic behavior of the response. Numerical simulations show that the random phase control strategy is an effective way to control stochastic chaos.     

Stochastic uncapacitated hub location

We study stochastic uncapacitated hub location problems in which uncertainty is associated to demands and transportation costs. We show that the stochastic problems with uncertain demands or dependent transportation costs are equivalent to their associated deterministic expected value problem (EVP), in which random variables are replaced by their expectations. In the case of uncertain independent transportation costs, the corresponding stochastic problem is not equivalent to its EVP and specific solution methods need to be developed. We describe a Monte-Carlo simulation-based algorithm that integrates a sample average approximation scheme with a Benders decomposition algorithm to solve problems having stochastic independent transportation costs. Numerical results on a set of instances with up to 50 nodes are reported.     

The Multi-Handler Knapsack Problem under Uncertainty

The Multi-Handler Knapsack Problem under Uncertainty is a new stochastic knapsack problem where, given a set of items, characterized by volume and random profit, and a set of potential handlers, we want to find a subset of items which maximizes the expected total profit. The item profit is given by the sum of a deterministic profit plus a stochastic profit due to the random handling costs of the handlers. On the contrary of other stochastic problems in the literature, the probability distribution of the stochastic profit is unknown. By using the asymptotic theory of extreme values, a deterministic approximation for the stochastic problem is derived. The accuracy of such a deterministic approximation is tested against the two-stage with fixed recourse formulation of the problem. Very promising results are obtained on a large set of instances in negligible computing time.     

A Deterministic Approach To Stochastic Optimal Control With Application To Anticipative Control

Using the decomposition of solution of SDE, we consider the stochastic optimal control problem with anticipative controls as a family of deterministic control problems parametrized by the paths of the driving Wiener process and of a newly introduced Lagrange multiplier stochastic process (nonanticipativity equality constraint). It is shown that the value function of these problems is the unique global solution of a robust equation (random partial differential equation) associated to a linear backward Hamilton-Jacobi-Bellman stochastic partial differential equation (HJB SPDE). This appears as limiting SPDE for a sequence of random HJB PDE's when linear interpolation approximation of the Wiener process is used. Our approach extends the Wong-Zakai type results [20] from SDE to the stochastic dynamic programming equation by showing how this arises as average of the limit of a sequence of deterministic dynamic programming equations. The stochastic characteristics method of Kunita [13] is used to represent the value function. By choosing the Lagrange multiplier equal to its nonanticipative constraint value the usual stochastic (nonanticipative) optimal control and optimal cost are recovered. This suggests a method for solving the anticipative control problems by almost sure deterministic optimal control. We obtain a PDE for the “cost of perfect information” the difference between the cost function of the nonanticipative control problem and the cost of the anticipative problem which satisfies a nonlinear backward HJB SPDE. Poisson bracket conditions are found ensuring this has a global solution. The cost of perfect information is shown to be zero when a Lagrangian submanifold is invariant for the stochastic characteristics. The LQG problem and a nonlinear anticipative control problem are considered as examples in this framework     

Solution of a class of stochastic linear-convex control problems using deterministic equivalents

In this paper, we identify a new class of stochastic linearconvex 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 convex in the state variables, linear in the control variables, and separable. Moreover, some of the coefficients in the dynamics are allowed to be random and the expectations of the control variables are allowed to be constrained. For any stochastic linear-convex problem, the equivalent deterministic problem is obtained. Furthermore, it is shown that the optimal feedback policy of the stochastic problem is affine in its current state, where the affine transformation depends explicitly on the optimal solution of the equivalent deterministic problem in a simple way. The result is illustrated by its application to a simple stochastic inventory control problem.This research was supported in part by NSERC Grant A4617, by SSHRC Grant 410-83-0888, and by an INRIA Post-Doctoral Fellowship.     

Numerical analysis of the stochastic Stokes equations of Wick type

We propose a finite element method for the numerical solution of the stochastic Stokes equations of the Wick type. We give existence and uniqueness results for the continuous problem and its approximation. Optimal error estimates are derived and algorithmic aspects of the method are discussed. Our method will reduce the problem of solving stochastic Stokes equations to solving a set of deterministic ones. Moreover, one can reconstruct particular realizations of the solution directly from Wiener chaos expansions once the coefficients are available. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

Two-stage workforce planning under demand fluctuations and uncertainty

We address a multi-category workforce planning problem for functional areas located at different service centres, each having office-space and recruitment capacity constraints, and facing fluctuating and uncertain workforce demand. A deterministic model is initially developed to deal with workforce fluctuations based on an expected demand profile over the horizon. To hedge against the demand uncertainty, we also propose a two-stage stochastic program, in which the first stage makes personnel recruiting and allocation decisions, while the second stage reassigns workforce demand among all units. A Benders’ decomposition-based algorithm is designed to solve this two-stage stochastic mixed-integer program. Computational results based on some practical numerical experiments are presented to provide insights on applying the deterministic versus the stochastic programming approach, and to demonstrate the efficacy of the proposed algorithm as compared with directly solving the model using its deterministic equivalent.     

Stochastic MOLP with Incomplete Information: An Interactive Approach with Recourse

Numerous multiobjective linear programming (MOLP) methods have been proposed in the last two decades, but almost all for contexts where the parameters of problems are deterministic. However, in many real situations, parameters of a stochastic nature arise. In this paper, we suppose that the decision-maker is confronted with a situation of partial uncertainty where he possesses incomplete information about the stochastic parameters of the problem, this information allowing him to specify only the limits of variation of these parameters and eventually their central values. For such situations, we propose a multiobjective stochastic linear programming methodology; it implies the transformation of the stochastic objective functions and constraints in order to obtain an equivalent deterministic MOLP problem and the solving of this last problem by an interactive approach derived from the STEM method. Our methodology is illustrated by a didactical example.     

On the Stochastic Non-sequential Production-planning Problem

This paper examines a stochastic non-sequential capacitated production-planning problem where the demand of each period is a continuous random variable. The stochastic non-sequential production-planning problem is examined with sequence-independent and then with sequence-dependent set-up costs, and the worst-case error determined when an approximate solution is obtained by solving the deterministic equivalent. We prove in general that the worst-case error is not dependent on the nature of the set-up cost, and identify a family of approximations for the stochastic non-sequential production-planning problem.     

Risk aversion for an electricity retailer with second-order stochastic dominance constraints

In this paper we present the problem faced by an electricity retailer which searches to determine its forward contracting portfolio and the selling prices for its potential clients. This problem is formulated as a two-stage stochastic program including second-order stochastic dominance constraints. The stochastic dominance theory is used in order to reduce the risk suffering from low profits. The resulting deterministic equivalent problem is a mixed-integer linear program which is solved using commercial branch-and-cut software. Numerical results for a realistic case study are reported and relevant conclusions are drawn.     

Re-solving stochastic programming models for airline revenue management

We study some mathematical programming formulations for the origin-destination model in airline revenue management. In particular, we focus on the traditional probabilistic model proposed in the literature. The approach we study consists of solving a sequence of two-stage stochastic programs with simple recourse, which can be viewed as an approximation to a multi-stage stochastic programming formulation to the seat allocation problem. Our theoretical results show that the proposed approximation is robust, in the sense that solving more successive two-stage programs can never worsen the expected revenue obtained with the corresponding allocation policy. Although intuitive, such a property is known not to hold for the traditional deterministic linear programming model found in the literature. We also show that this property does not hold for some bid-price policies. In addition, we propose a heuristic method to choose the re-solving points, rather than re-solving at equally-spaced times as customary. Numerical results are presented to illustrate the effectiveness of the proposed approach.     

A fuzzy stochastic model for telecommunications bandwidth brokers under probabilistic QoS measures

In this paper, we model and solve profit maximization problem of a telecommunications Bandwidth Broker (BB) under uncertain market and network infrastructure conditions. The BB may lease network capacity from a set of Backbone Providers (BPs) or from other BBs in order to gain profit by leasing already purchased capacity to end-users. BB’s problem becomes harder to deal with when bandwidth requests of end-users, profit and cost margins are not known in advance. The novelty of the proposed work is the development of a mechanism via combining fuzzy and stochastic programming methodologies for solving complex BP selection and bandwidth demand allocation problem in communication networks, based on the fact that information needed for making these decisions is not available prior to leasing capacity. In addition, suggested model aims to maximize BB’s decision maker’s satisfaction ratio rather than just profit. As a solution strategy, the resulting fuzzy stochastic programming model is transformed into deterministic crisp equivalent form and then solved to optimality. Finally, the numerical experiments show that on the average, proposed approach provides 14.30% more profit and 69.50% more satisfaction ratio compared to deterministic approaches in which randomness and vagueness in the market and infrastructure are ignored.     

A Sparse Grid Stochastic Collocation Discontinuous Galerkin Method for Constrained Optimal Control Problem Governed by Random Convection Dominated Diffusion Equations

A sparse grid stochastic collocation method combined with discontinuous Galerkin method is developed for solving convection dominated diffusion optimal control problem with random coefficients. By the optimal control theory, an optimality system is obtained for the problem, which consists of a state equation, a co-state equation and an inequality. Based on finite dimensional noise assumption of random field, the random coefficients are assumed to have finite term expansions depending on a finite number of mutually independent random variables in the probability space. An approximation scheme is established by using a discontinuous Galerkin method for the physical space and a sparse grid stochastic collocation method based on the Smolyak construction for the probability space, which leads to the solution of uncoupled deterministic problems. A priori error estimates are derived for the state, co-state and control variables. Numerical experiments are presented to illustrate the theoretical results.     

Path planning for robots under stochastic uncertainty *

In order to reduce large online measurement and correction expenses, the a priori informations on the random variations of the model parameters of a robot and its working environment are taken into account already at the planning stage. Thus, instead of solving a deterministic path planning problem with a fixed nominal parameter vector, here, the optimal velocity profile along a given trajectory in work space is determined by using a stochastic optimization approach. Especially, the standard polygon of constrained motion-depending on the nominal parameter vector-is replaced by a more general set of admissible motion determined by chance constraints or more general risk constraints. Robust values (with respect to stochastic parameter variations) of the maximum, minimum velocity, acceleration, deceleration, resp., can be obtained then by solving a univariate stochastic optimization problem Considering the fields of extremal trajectories, the minimum-time path planning problem under stochastic uncertainty can be solved now by standard optimal deterministic path planning methods     

The value of the stochastic solution in stochastic linear programs with fixed recourse

Stochastic linear programs have been rarely used in practical situations largely because of their complexity. In evaluating these problems without finding the exact solution, a common method has been to find bounds on the expected value of perfect information. In this paper, we consider a different method. We present bounds on the value of the stochastic solution, that is, the potential benefit from solving the stochastic program over solving a deterministic program in which expected values have replaced random parameters. These bounds are calculated by solving smaller programs related to the stochastic recourse problem.This paper is an extension of part of the author's dissertation in the Department of Operations Research, Stanford University, Stanford, California. The research was supported at Stanford by the Department of Energy under Contract DE-AC03-76SF00326, PA#DE-AT03-76ER72018, Office of Naval Research under Contract N00014-75-C-0267 and the National Science Foundation under Grants MCS76-81259, MCS-7926009 and ECS-8012974 (formerly ENG77-06761).     

Solving the stochastic steady-state diffusion problem using multigrid

Darran Furnival ^{We study multigrid for solving the stochastic steady-state diffusionproblem. We operate under the mild assumption that the diffusioncoefficient takes the form of a finite Karhunen-Loèveexpansion. The problem is discretized using a finite-elementmethodology using the polynomial chaos method to discretizethe stochastic part of the problem. We apply a multigrid algorithmto the stochastic problem in which the spatial discretizationis varied from grid to grid while the stochastic discretizationis held constant. We then show, theoretically and experimentally,that the convergence rate is independent of the spatial discretization,as in the deterministic case, and the stochastic discretization.}     

COMPUTATIONAL COMPLEXITY IN WORST,STOCHASTIC AND AVERAGE CASE SETTING ON FUNCTIONAL APPROXIMATION PROBLEM OF MULTIVARIATE

The order of computational complexity of all bounded linear functional ap proximation problem is determined for the generalized Sobolev class W_p~(?)(Id), Nikolskii class H|∞~k(Id) in the worst (deterministic), stochastic and average case setting, from which it is concluded that the bounded linear functional approximation problem for the classes W_p~(?)(Id) and H_∞~k(Id) is intractable in worst case setting, but is tractable with respect to stochastic and average case setting.