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