scientific article

zbMath0907.90215MaRDI QIDQ3840335

Tamás Badics, Béla Vizvári, Prékopa, András

Publication date: 10 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cutting plane method\(p\)-level efficient pointprobabilistic constrained modelsimple recourse model

Mathematics Subject Classification ID

Stochastic programming (90C15)

Related Items (26)

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ MIP reformulations of the probabilistic set covering problem ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ ON INTEGRATED CHANCE CONSTRAINTS IN ALM FOR PENSION FUNDS ⋮ Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel ⋮ Chance constrained unit commitment approximation under stochastic wind energy ⋮ On safe tractable approximations of chance constraints ⋮ Multivariate value at risk and related topics ⋮ Pattern definition of the \(p\)-efficiency concept ⋮ Augmented Lagrangian method for probabilistic optimization ⋮ Belief linear programming ⋮ Uniform quasi-concavity in probabilistic constrained stochastic programming ⋮ Regularization methods for optimization problems with probabilistic constraints ⋮ Log-concavity of compound distributions with applications in stochastic optimization ⋮ Properties and calculation of multivariate risk measures: MVaR and MCVaR ⋮ Computing the probability of union in the $n$-dimensional Euclidean space for application of the multivariate quantile: $p$-level efficient points ⋮ A novel probabilistic formulation for locating and sizing emergency medical service stations ⋮ Analysis of a chance-constrained new product risk model with multiple customer classes ⋮ Beam search heuristic to solve stochastic integer problems under probabilistic constraints ⋮ Mathematical programming approaches for generating \(p\)-efficient points ⋮ 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 ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ A compromise solution for the multiobjective stochastic linear programming under partial uncertainty ⋮ Bounds for probabilistic integer programming problems ⋮ Decision-making from a risk assessment perspective for corporate mergers and acquisitions

This page was built for publication: