- Sprache
-
Englisch
- Identifier
-
1185399674
- Reihe
-
Stochastic Programming E-Print Series; 25
Beteiligte Personen und Organisationen
Dentcheva, Darinka
Lai, Bogumila
Ruszczynski, Andrzej
Lai, Bogumila
Ruszczynski, Andrzej
- DOI
-
10.18452/8307
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:53 MEZ
Objekttyp
- Monografie
Beteiligte
- Dentcheva, Darinka
- Lai, Bogumila
- Ruszczynski, Andrzej
Ähnliche Objekte (12)
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Probabilistic programs with discrete distributions and precedence constrained knapsack polyhedra
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Optimization with stochastic 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
Portfolio optimization with stochastic dominance constraints
MIP Reformulations of the Probabilistic Set Covering Problem
Structure and stability of probabilistic storage level constraints
A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Probabilistic programs with discrete distributions and precedence constrained knapsack polyhedra
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Optimization with stochastic 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
Portfolio optimization with stochastic dominance constraints
MIP Reformulations of the Probabilistic Set Covering Problem
Structure and stability of probabilistic storage level constraints
A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
Concavity and Efficient Points of Discrete Distributions in Probabilistic Programming
Probabilistic programs with discrete distributions and precedence constrained knapsack polyhedra
Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
Optimization with stochastic 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
Portfolio optimization with stochastic dominance constraints
MIP Reformulations of the Probabilistic Set Covering Problem
Structure and stability of probabilistic storage level constraints