Computational Algorithms for Convex Stochastic Programs with Simple Recourse

William T. Ziemba
Additional contact information
William T. Ziemba: The University of British Columbia, Vancouver, British Columbia

Operations Research, 1970, vol. 18, issue 3, 414-431

Abstract: This paper presents computational algorithms for the solution of a class of stochastic programming problems. Let x and y represent the decision and state vectors, and suppose that x must be chosen from some set K and that y is a linear function of both x and an additive random vector ξ. If y is uniquely determined once x is chosen and ξ is observed, we say that the problem has simple recourse. The algorithms presented apply, e.g., when the preference functions h ( x ) and g ( y ) are convex, and continuously differentiable, k is a convex polytope, ξ has a distribution that satisfies mild convergence conditions, and the objective is to minimize the expectation of the sum of the two preference functions. An illustrative example of an inventory problem is formulated, and the special case when g is asymmetric, quadratic, and separable is presented in detail to illustrate the calculations involved.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.3.414 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:3:p:414-431

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().