Sublinear upper bounds for stochastic programs with recourse
From MaRDI portal
Consider the stochastic linear program with recourse: find \(x\in R^ n\), \(\chi \in R^ m\) such that \(Ax=b\), \(Tx-\chi =0\), \(x\geq 0\) and \(cx+E\psi (\chi,\xi)\) is minimized where \[ \psi (\chi,\xi)=\inf_{y\geq 0}\{qy| \quad Wy=\xi -\chi \}. \] Let \(e_ i\) be the i-th unit m- vector. Then solutions of linear programs \(\min_{y\geq 0}\{qy|\) \(Wy=e_ i\}\) give us an approximation of the initial problem by simple recourse vectors. In this paper, using other bases then \(\pm e_ i\), the sublinear (positively homogeneous and convex) approximations of \(\psi\) are presented (for example, let \(D=\{d_ 1\),..., \(d_ m\}\) be a linear basis such that pos[D, \(-D]=R^ m)\). Such linear transformations of random vectors can be used to obtain a variety of separable, sublinear bounding functions. These sublinear approximations are solved using their duals. Computational results are presented.
Recommendations
- Stochastic programs with recourse: An upper bound and the related moment problem
- Approximations to Stochastic Programs with Complete Recourse
- Restricted-recourse bounds for stochastic linear programming
- scientific article; zbMATH DE number 1163790
- scientific article; zbMATH DE number 1187195
- scientific article; zbMATH DE number 4076968
- A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions
- Subdifferential Convergence in Stochastic Programs
- Upper bounds for Gaussian stochastic programs
- scientific article; zbMATH DE number 1031417
Cites work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A piecewise linear upper bound on the network recourse function
- Algorithms for stochastic programs: The case of nonstochastic tenders
- An alternating method for stochastic linear programming with simple recourse
- Approximationen der Entscheidungsprobleme mit linearer Ergebnisfunktion und positiv homogener, subadditiver Verlustfunktion
- Boole-Bonferroni Inequalities and Linear Programming
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Computational methods for solving two-stage stochastic linear programming problems
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- Convex Analysis
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- scientific article; zbMATH DE number 3169929 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3741138 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- Programming under uncertainty: The complete problem
- Solving stochastic programming problems with recourse including error bounds
- Solving stochastic programs with simple recourse
- Stability in Two-Stage Stochastic Programming
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- stochastic quasigradient methods and their application to system optimization†
Cited in
(25)- A tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions
- Refining bounds for stochastic linear programs with linearly transformed independent random variables
- Distribution sensitivity in stochastic programming
- Bounding separable recourse functions with limited distribution information
- An upper bound on the expectation of simplicial functions of multivariate random variables
- Improving aggregation bounds for two-stage stochastic programs
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Upper bounds for Gaussian stochastic programs
- The approximation of separable stochastic programs
- Projection and discretization methods in stochastic programming
- Continuous approximation schemes for stochastic programs
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
- Designing a majorization scheme for the recourse function in two-stage stochastic linear programming
- Bounding the variance of the approximation error.
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- Barycentric bounds in stochastic programming: theory and application
- A polynomial-time solution scheme for quadratic stochastic programs
- An alternating method for stochastic linear programming with simple recourse
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Generalized decision rule approximations for stochastic programming via liftings
- A scalable bounding method for multistage stochastic programs
- On the safe side of stochastic programming: bounds and approximations
- A hybrid genetic algorithm for scheduling jobs sharing multiple resources under uncertainty
- Bounding multi-stage stochastic programs from above
- Parallel processors for planning under uncertainty
This page was built for publication: Sublinear upper bounds for stochastic programs with recourse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115346)
