Mathematical programming approaches for generating \(p\)-efficient points

From MaRDI portal
Publication:992653

DOI10.1016/j.ejor.2010.05.025zbMath1205.90210OpenAlexW2095564588MaRDI QIDQ992653

Nilay Noyan, Miguel A. Lejeune

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.025




Related Items (22)

Solving joint chance constrained problems using regularization and Benders' decompositionConstruction of confidence absorbing set for analysis of static stochastic systemsProbabilistic optimization via approximate \(p\)-efficient points and bundle methodsChance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network designOptimization Approaches to Multiplicative Tariff of Rates Estimation in Non-Life InsuranceAn Augmented Lagrangian Decomposition Method for Chance-Constrained Optimization ProblemsChance constrained unit commitment approximation under stochastic wind energyLagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programsDerivatives of probability functions: unions of polyhedra and elliptical distributionsEventual convexity of probability constraints with elliptical distributionsA polyhedral study on chance constrained program with random right-hand sidePattern definition of the \(p\)-efficiency conceptAugmented Lagrangian method for probabilistic optimizationAn algorithm for binary linear chance-constrained problems using IISRegularization methods for optimization problems with probabilistic constraintsConstruction of confidence absorbing sets using statistical methodsOn the Convexity of Level-sets of Probability FunctionsSingle Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random VariablesGeneralized Differentiation of Probability Functions Acting on an Infinite System of ConstraintsAN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMSGeneralized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex setsProbabilistic modeling of multiperiod service levels


Uses Software


Cites Work


This page was built for publication: Mathematical programming approaches for generating \(p\)-efficient points