Investigation of Aggregation Problem in Two-Stage Stochastic Linear Programming
Physical Sciences
Ana Ušpurienė
Vilniaus universitetas
Leonidas Sakalauskas
Šiaulių universitetas. Vilniaus universitetas.
Published 2016-11-23
https://doi.org/10.21277/jmd.v1i45.42
PDF

Keywords

stochastic programming
scenario generation
aggregation
optimization
L-shaped method

How to Cite

Ušpurienė, A. and Sakalauskas, L. (2016) “Investigation of Aggregation Problem in Two-Stage Stochastic Linear Programming”, Jaunųjų mokslininkų darbai, 1(45), pp. 60–64. doi:10.21277/jmd.v1i45.42.

Abstract

The paper focuses on a two-stage stochastic linear programming problem when second stage variables depend on a random parameter with a normal (Gaussaian) distribution. Modified L-shaped algorithm using the optimization software CPLEX was applied to solve this problem. The aggregation scenario to reduce the number of iterations of the optimization process, the amount of resources to be used and the time required to produce an optimal solution have been analyzed in the paper. The efficiency of aggregation method was tested using statistical simulation method.
PDF

Downloads

Download data is not yet available.