Abstract
We consider mixed-integer recourse (MIR) models with a single recourse constraint. We relate the second-stage value function of such problems to the expected simple integer recourse (SIR) shortage function. This allows to construct convex approximations for MIR problems by the same approach used for SIR models.
Original language | English |
---|---|
Pages (from-to) | 139-150 |
Number of pages | 12 |
Journal | Annals of Operations Research |
Volume | 177 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jun-2010 |
Keywords
- Mixed-integer recourse
- Convex approximation
- STOCHASTIC PROGRAMS
- BRANCH
- RISK