DVIEJŲ ETAPŲ STOCHASTINIO TIESINIO PROGRAMAVIMO UŽDAVINIO AGREGAVIMO TYRIMAS
INVESTIGATION OF AGGREGATION PROBLEM IN TWO-STAGE STOCHASTIC LINEAR PROGRAMMING
Author(s): Ana Ušpurienė, Leonidas SakalauskasSubject(s): Higher Education , ICT Information and Communications Technologies
Published by: Vilniaus Universiteto Leidykla
Keywords: stochastic programming; scenario generation; aggregation; optimization; L-shaped method;
Summary/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.
Journal: Jaunųjų mokslininkų darbai
- Issue Year: 2016
- Issue No: 1 (45)
- Page Range: 60-64
- Page Count: 5
- Language: Lithuanian
