Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs

Samer Takriti () and John Birge
Additional contact information
Samer Takriti: Mathematical Sciences Department, IBM Thomas J. Watson Research Center, Yorktown Heights, New York 10598

Operations Research, 2000, vol. 48, issue 1, 91-98

Abstract: Many production problems involve facility setups that lead to integer variables, production decisions that are continuous, and demands that are likely to be random. While these problems can be quite difficult to solve, we propose a model and an efficient solution technique for this basic class of stochastic mixed-integer programs. We use a set of scenarios to reflect uncertainty. The resulting mathematical model is solved using Lagrangian relaxation. We show that the duality gap of our relaxation is bounded above by a constant that depends on the cost function and the number of branching points in the scenario tree. We apply our technique to the problem of generating electric power. Numerical results indicate significant savings when the stochastic model is used instead of a deterministic one.

Keywords: Production/Scheduling; Stochastic: mixed-integer programs with varying right-hand side; Industries; electric: scheduling power generators (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.48.1.91.12450 (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:48:y:2000:i:1:p:91-98

Access Statistics for this article

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