An Algorithm for Two-Stage Stochastic Quadratic Problems - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

An Algorithm for Two-Stage Stochastic Quadratic Problems



An algorithm for solving quadratic, two-stage stochastic problems is developed. The algorithm is based on the framework of the Branch and Fix Coordination (BFC) method. These problems have continuous and binary variables in the first stage and only continuous variables in the second one. The objective function is quadratic and the constraints are linear. The nonanticipativity constraints are fulfilled by means of the twin node family strategy. On the basis of the BFC method for two-stage stochastic linear problems with binary variables in the first stage, an algorithm to solve these stochastic quadratic problems is designed. In order to gain computational efficiency, we use scenario clusters and propose to use either outer linear approximations or (if possible) perspective cuts. This algorithm is implemented in C++ with the help of the Cplex library to solve the quadratic subproblems. Numerical results are reported.
Fichier principal
Vignette du fichier
978-3-642-36062-6_18_Chapter.pdf (4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01347535 , version 1 (21-07-2016)


Attribution - CC BY 4.0



Eugenio Mijangos. An Algorithm for Two-Stage Stochastic Quadratic Problems. 25th System Modeling and Optimization (CSMO), Sep 2011, Berlin, Germany. pp.177-187, ⟨10.1007/978-3-642-36062-6_18⟩. ⟨hal-01347535⟩
55 View
98 Download



Gmail Facebook Twitter LinkedIn More