Algorithms for Stochastic Programs: The Case of Nonstochastic Tenders

Nazareth, J. & Wets, R (1986). Algorithms for Stochastic Programs: The Case of Nonstochastic Tenders. In: Stochastic Programming 84 Part II. Eds. Prekopa, A. & Wets, R., pp. 1-28 Springer. ISBN 978-3-642-00924-2 10.1007/BFb0121123.

Full text not available from this repository.

Abstract

We consider solution strategies for stochastic programs whose deterministic equivalent programs take on the form: Find x an element of R**n, chi an element of R**m such that x greater than equivalent to 0, Ax equals b, Tx equals chi and z equals cx plus PSI ( chi ) is minimized. We suggest algorithms based upon (i) extensions of the revised simplex method, (ii) inner approximations (generalized programming techniques), (iii) outer approximations (minmax) strategies.

Item Type:	Book Section
Depositing User:	Luke Kirwan
Date Deposited:	09 Aug 2016 14:57
Last Modified:	27 Aug 2021 17:41
URI:	https://pure.iiasa.ac.at/13652

Actions (login required)

View Item