Summary:
In this paper we present a solution method for stochastic integer problems. The method is a Benderstype algorithm that sequentially approximates the nonconvex recourse functions defined by the second stage subproblems. The presented convexification takes into account the domain that is induced by the collection of tender variables. The method is applied to a broad collection of stochastic integer programming problems taken from the literature and a summary of the numerical results is presented.
Keywords: Benders decomposition, lagrangean relaxation
Registration date: 01/01/2007
IIT-07-031A
Due to copyright restriction we cannot distribute this content on the web. However, using the next form you can contact the authors, which are allowed to redistribute a limited number of copies of it by email. Please, check your spam folder.
Legal notice | Cookies policy | Privacy policy
Calle de Santa Cruz de Marcenado, 26 - 28015 Madrid, Spain - Tel: (+34) 91 542 28 00
We use our own and third-party cookies to improve the functionality of our website and the quality of our service, by analyzing your browsing habits. I accept this site's cookies.
|
|