INFORMS Journal on Computing
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


INFORMS JOURNAL ON COMPUTING
Vol. 21, No. 1, Winter 2009, pp. 107-122
DOI: 10.1287/ijoc.1080.0282
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Valente, C.
Right arrow Articles by Fourer, R.
Right arrow Search for Related Content

Extending Algebraic Modelling Languages for Stochastic Programming

Christian Valente, Gautam Mitra, Mustapha Sadki, Robert Fourer

CARISMA (Centre for the Analysis of Risk and Optimisation Modelling Applications), Brunel University, Uxbridge UB8 3PH, United Kingdom, and OptiRisk Systems, Uxbridge UB9 4DA, Middlesex, United Kingdom
CARISMA (Centre for the Analysis of Risk and Optimisation Modelling Applications), Brunel University, Uxbridge UB8 3PH, United Kingdom, and OptiRisk Systems, Uxbridge UB9 4DA, Middlesex, United Kingdom
Inorganic Chemistry Laboratory, University of Oxford, Oxford OX1 3QR, United Kingdom
Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208

christian.valente{at}brunel.ac.uk
gautam.mitra{at}brunel.ac.uk
mustapha.sadki{at}chem.ox.ac.uk
4er{at}iems.northwestern.edu

Algebraic modelling languages have gained wide acceptance and use by researchers and practitioners in mathematical programming. At a basic level, these languages can define stochastic programming (SP) models by constructing their deterministic equivalents. Unfortunately, this leads to very large model data instances. We propose instead a direct approach in which the random values of the model coefficients and the stage structure of the decision variables and constraints are "overlaid" on the underlying deterministic (core) model of the SP problems. This leads to a natural definition of the SP model, while the resulting generated instance is also a compact representation of the otherwise large problem data. As an example of the workability of our approach, we describe the design of a stochastic extension for the AMPL language that enables the formulation of two-stage and multistage scenario-based recourse problems. This extended language, which we call SAMPL, is in turn embedded in a stochastic programming integrated environment that facilitates modelling and investigation of SP problems.

Key words: stochastic programming; algebraic modelling language; SMPS; decomposition methods; multistage recourse problem; two-stage recourse problem; scenario tree
History: received October 2004; revised January 2008; accepted March 2008.







HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2009 by INFORMS.