An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects |
| |
Authors: | L.F. Escudero,M.A. Garí n,M. Merino,G. Pé rez |
| |
Affiliation: | 1. Dpto. Estadística e Investigación Operativa Universidad Rey Juan Carlos, Móstoles, Madrid, Spain;2. Dpto. de Economía Aplicada III, Universidad del País Vasco, Bilbao, Vizcaya, Spain;3. Dpto. de Matemática Aplicada, Estadística e Investigación Operativa, Universidad del País Vasco, Leioa, Vizcaya, Spain |
| |
Abstract: | We present an algorithmic framework, so-called BFC-TSMIP, for solving two-stage stochastic mixed 0–1 problems. The constraints in the Deterministic Equivalent Model have 0–1 variables and continuous variables at any stage. The approach uses the Twin Node Family (TNF) concept within an adaptation of the algorithmic framework so-called Branch-and-Fix Coordination for satisfying the nonanticipativity constraints for the first stage 0–1 variables. Jointly we solve the mixed 0–1 submodels defined at each TNF integer set for satisfying the nonanticipativity constraints for the first stage continuous variables. In these submodels the only integer variables are the second stage 0–1 variables. A numerical example and some theoretical and computational results are presented to show the performance of the proposed approach. |
| |
Keywords: | Stochastic integer programming Nonanticipativity constraints Splitting variables Twin Node Family Branch-and-Fix Coordination |
本文献已被 ScienceDirect 等数据库收录! |
|