Abstract
We consider a class of stochastic programming with binary recourse variables in which a fixed cost is imposed if the value of the continuous recourse variable is strictly positive. The algorithm of a branch-and-cut method to solve the problem is developed by using the property of the expected recourse function. The problem is applied to a power generating system. The numerical experiments show that the proposed algorithm is quite efficient. The mathematical programming model defined in this paper is quite useful for a variety of design and operational problems.
Original language | English |
---|---|
Pages (from-to) | 1407-1416 |
Number of pages | 10 |
Journal | Procedia Computer Science |
Volume | 1 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2010 |
Externally published | Yes |
Keywords
- Branch-and-cut
- Integer programming
- Stochastic programming with recourse
ASJC Scopus subject areas
- Computer Science(all)