A dual method for probabilistic constrained problems
From MaRDI portal
Recommendations
- A dual algorithm for probabilistic constrained problem of stochastic convex programming
- scientific article; zbMATH DE number 4174668
- scientific article; zbMATH DE number 3847225
- On properties of the probabilistic contrained linear programming problem and its dual
- Dual methods for probabilistic optimization problems.
Cited in
(11)- Probabilistic constraints in primal and dual linear programs: Duality results
- On properties of the probabilistic contrained linear programming problem and its dual
- Probabilistic linearly constrained programming problems with lognormal random variables.
- scientific article; zbMATH DE number 4174668 (Why is no real title available?)
- scientific article; zbMATH DE number 3847225 (Why is no real title available?)
- scientific article; zbMATH DE number 3854816 (Why is no real title available?)
- A dual algorithm for probabilistic constrained problem of stochastic convex programming
- scientific article; zbMATH DE number 4083369 (Why is no real title available?)
- On a dual method for a specially structured linear programming problem with application to stochastic programming
- scientific article; zbMATH DE number 938962 (Why is no real title available?)
- Dual methods for probabilistic optimization problems.
This page was built for publication: A dual method for probabilistic constrained problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745629)
