The Decomposition Method for Two-Stage Stochastic Linear Programming Problems with Quantile Criterion


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We consider the two-stage stochastic linear programming problem with quantile criterion in case when the vector of random parameters has a discrete distribution with a finite number of realizations. Based on the confidence method and duality theorems, we construct a decompositional algorithm for finding guaranteeing solutions.

About the authors

I. D. Zhenevskaya

Moscow Aviation Institute (National State University)

Author for correspondence.
Email: genevskaia@gmail.com
Russian Federation, Moscow

A. V. Naumov

Moscow Aviation Institute (National State University)

Email: genevskaia@gmail.com
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2018 Pleiades Publishing, Ltd.