Monografie
Probabilistic programs with discrete distributions and precedence constrained knapsack polyhedra
- Sprache
-
Englisch
- Identifier
-
1185986758
- Reihe
-
Stochastic Programming E-Print Series; 22
Beteiligte Personen und Organisationen
Ruszczynski, Andrzej
- DOI
-
10.18452/8246
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:57 MEZ
Objekttyp
- Monografie
Beteiligte
- Ruszczynski, Andrzej
Ähnliche Objekte (12)
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Efficient point methods for probabilistic optimization problems
Optimization with stochastic dominance constraints
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Convexification of stochastic ordering
Dual stochastic dominance and related mean-risk models
Robust path choice in networks with failures
Frontiers of stochastically nondominated portfolios
Perturbation ananlysis of chance-constrained programs under variation of all constraint data
Hölder and Lipschitz Stability of Solution Sets in Programs with Probabilistic Constraints
Tree-sparse convex programs
Structure and stability of probabilistic storage level constraints
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Efficient point methods for probabilistic optimization problems
Optimization with stochastic dominance constraints
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Convexification of stochastic ordering
Dual stochastic dominance and related mean-risk models
Robust path choice in networks with failures
Frontiers of stochastically nondominated portfolios
Perturbation ananlysis of chance-constrained programs under variation of all constraint data
Hölder and Lipschitz Stability of Solution Sets in Programs with Probabilistic Constraints
Tree-sparse convex programs
Structure and stability of probabilistic storage level constraints
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Efficient point methods for probabilistic optimization problems
Optimization with stochastic dominance constraints
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Convexification of stochastic ordering
Dual stochastic dominance and related mean-risk models
Robust path choice in networks with failures
Frontiers of stochastically nondominated portfolios
Perturbation ananlysis of chance-constrained programs under variation of all constraint data
Hölder and Lipschitz Stability of Solution Sets in Programs with Probabilistic Constraints
Tree-sparse convex programs