Concavity and efficient points of discrete distributions in probabilistic programming.
From MaRDI portal
Publication:5926331
DOI10.1007/S101070000178zbMATH Open1033.90078MaRDI QIDQ5926331FDOQ5926331
Darinka Dentcheva, András Prékopa, Andrzej Ruszczyński
Publication date: 18 February 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cited In (78)
- Solving joint chance constrained problems using regularization and Benders' decomposition
- Analysis and optimization of recruitment stocking problems
- Analysis of a chance-constrained new product risk model with multiple customer classes
- An Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization Problems
- Vector-valued multivariate conditional value-at-risk
- Probabilistic programming models for traffic incident management operations planning
- A polyhedral study on chance constrained program with random right-hand side
- First-order dominance: stronger characterization and a bivariate checking algorithm
- A provisioning problem with stochastic payments
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
- Chance-constrained problems and rare events: an importance sampling approach
- Decomposition algorithms for two-stage chance-constrained programs
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Convexity of chance constrained programming problems with respect to a new generalized concavity notion
- A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
- Mixed integer linear programming formulations for probabilistic constraints
- Regularization methods for optimization problems with probabilistic constraints
- Eventual convexity of probability constraints with elliptical distributions
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Augmented Lagrangian method for probabilistic optimization
- An integer programming approach for linear programs with probabilistic constraints
- MIP reformulations of the probabilistic set covering problem
- Integrated chance constraints: reduced forms and an algorithm
- IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
- Sample average approximation method for chance constrained programming: Theory and applications
- Relaxations and approximations of chance constraints under finite distributions
- Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization
- Using integer programming for balancing return and risk in problems with individual chance constraints
- Uniform quasi-concavity in probabilistic constrained stochastic programming
- On two-stage convex chance constrained problems
- Multivariate value at risk and related topics
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
- Scenario Min-Max Optimization and the Risk of Empirical Costs
- Asymptotically optimal staffing of service systems with joint QoS constraints
- The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
- Risk-return trade-off with the scenario approach in practice: a case study in portfolio selection
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- On convex probabilistic programming with discrete distributions.
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Rectangular chance constrained geometric optimization
- On mixing sets arising in chance-constrained programming
- Risk tomography
- Designing robust emergency medical service via stochastic programming
- Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Log-concavity of compound distributions with applications in stochastic optimization
- A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints
- Bounds for probabilistic integer programming problems
- On safe tractable approximations of chance constraints
- Partial sample average approximation method for chance constrained problems
- Bicriteria Approximation of Chance-Constrained Covering Problems
- New sufficient conditions for strong unimodality of multivariate discrete distributions
- A polyhedral study of the static probabilistic lot-sizing problem
- Chance-Constrained Binary Packing Problems
- Probabilistic modeling of multiperiod service levels
- ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs
- A stochastic biomass blending problem in decentralized supply chains
- On the Convexity of Level-sets of Probability Functions
- Properties and calculation of multivariate risk measures: MVaR and MCVaR
- Robust approximation of chance constrained DC optimal power flow under decision-dependent uncertainty
- Chance-constrained programs with convex underlying functions: a bilevel convex optimization perspective
- An algorithm to solve a quantile optimization problem with loss function having a separable structure, and its application to an aerospace problem
- Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets
- Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory
- Single commodity stochastic network design under probabilistic constraint with discrete random variables
- Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints
- Gaining traction: on the convergence of an inner approximation scheme for probability maximization
- An algorithm for binary linear chance-constrained problems using IIS
- Chance constrained unit commitment approximation under stochastic wind energy
- Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel
- Bounds for probabilistic programming with application to a blend planning problem
- On risk evaluation and control of distributed multi-agent systems
- Derivatives of probability functions: unions of polyhedra and elliptical distributions
- Chance-constrained sets approximation: a probabilistic scaling approach
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- A solution algorithm for chance-constrained problems with integer second-stage recourse decisions
This page was built for publication: Concavity and efficient points of discrete distributions in probabilistic programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5926331)
