Stochastic integer programming solution through a convexification method

S. Cerisola, J.M. Latorre, A. Ramos

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

 Request the document to be emailed to you.

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.

Your name:
Your email:
Your company:
Code:
I accept the Privacy Policy	Yes.