Comparison of two algorithms for solving a two-stage bilinear stochastic programming problem with quantile criterion
DOI10.1002/ASMB.2115zbMATH Open1406.90085OpenAlexW2022128734MaRDI QIDQ4620134FDOQ4620134
Authors: A. I. Kibzun
Publication date: 8 February 2019
Published in: Applied Stochastic Models in Business and Industry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/asmb.2115
Recommendations
- On reduction of the two-stage problem of quantile optimization to the problem of convex programming
- A linear two-stage stochastic programming problem with quantile criterion: its discrete approximation
- On the two-stage problem of linear stochastic programming with quantile criterion and discrete distribution of the random parameters
- Bilevel stochastic linear programming problems with quantile criterion
- The decomposition method for two-stage stochastic linear programming problems with quantile criterion
convex programmingstochastic programmingquantile functionmixed integer linear programming problemconfidence methodtwo-stage problemvalue-at-risk criterion
Convex programming (90C25) Linear programming (90C05) Stochastic programming (90C15) Mixed integer programming (90C11)
Cited In (7)
- Reduction of the bilevel stochastic optimization problem with quantile objective function to a mixed‐integer problem
- General properties of two-stage stochastic programming problems with probabilistic criteria
- Investigation of a two-stage integer problem of quantile optimization
- Title not available (Why is that?)
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- A linear two-stage stochastic programming problem with quantile criterion: its discrete approximation
- Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion
This page was built for publication: Comparison of two algorithms for solving a two-stage bilinear stochastic programming problem with quantile criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620134)