Skip to Main content Skip to Navigation
Conference papers

An Algorithm for Two-Stage Stochastic Quadratic Problems

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Thursday, July 21, 2016 - 11:17:25 AM
Last modification on : Thursday, July 21, 2016 - 11:48:15 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Les métriques sont temporairement indisponibles