An experimental sequential solution procedure to stochastic linear programming problems with 0–1 variables
From MaRDI portal
Publication:3335534
DOI10.1080/00207728408926625zbMath0544.90083OpenAlexW2031417225MaRDI QIDQ3335534
Publication date: 1984
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728408926625
Numerical mathematical programming methods (65K05) Linear programming (90C05) Stochastic programming (90C15) Boolean programming (90C09)
Cites Work
- Chance-Constrained Programming
- Budget Constrained Optimization of Simulation Models via Estimation of Their Response Surfaces
- The Probability Distribution Function of the Optimum of a 0-1 Linear Program with Randomly Distributed Coefficients of the Objective Function and the Right-Hand Side
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- An experimental solution of the general stochastic programming problem
- A New Model for Stochastic Linear Programming
This page was built for publication: An experimental sequential solution procedure to stochastic linear programming problems with 0–1 variables