Comparison of two algorithms for solving a two-stage bilinear stochastic programming problem with quantile criterion
From MaRDI portal
Publication:4620134
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
Cited in
(8)- 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
- scientific article; zbMATH DE number 1463002 (Why is no real title available?)
- On reduction of the two-stage problem of quantile optimization to the problem of convex programming
- 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)