Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
type: Item
instance of: scholarly article
title: Solving discrete stochastic linear programs with simple recourse by the dualplex algorithm
zbMATH Open document ID: 0789.90058
DOI: 10.1016/0305-0548(94)90058-2
author: Saul I. Gass
author: N. A. Bryson
published in: Computers \& Operations Research
publication date: 1994-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 527456
zbMATH Keywords: large-scale discrete version
zbMATH Keywords: stochastic linear-programming
zbMATH Keywords: simple recourse
describes a project that uses: XMP
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90058-2
OpenAlex ID: W1993995932
cites work: Q3288565
cites work: Two-Stage Programming under Uncertainty with Discrete Distribution Function
cites work: Programming under uncertainty: The complete problem
cites work: Programming Under Uncertainty: The Equivalent Convex Program
cites work: The allocation of aircraft to routes -- an example of linear programming under uncertain demand
cites work: Q5682157
cites work: A Stochastic Transportation Problem
cites work: The value of the stochastic solution in stochastic linear programs with fixed recourse
cites work: Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
cites work: Q4040713
cites work: Computational methods for solving two-stage stochastic linear programming problems
cites work: Q5670434
cites work: On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem
cites work: A solution comparison for dual angular linear programs
cites work: A set of staircase linear programming test problems
description: scientific article; zbMATH DE number 527456