Pattern definition of the \(p\)-efficiency concept

DOI10.1007/s10479-010-0803-1zbMath1261.90032OpenAlexW2053481037MaRDI QIDQ1931642

Miguel A. Lejeune

Publication date: 15 January 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0803-1

zbMATH Keywords

disjunctive normal formbinarization of the probability distribution

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15)

Related Items (19)

Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints ⋮ Solving joint chance constrained problems using regularization and Benders' decomposition ⋮ Chance-constrained problems and rare events: an importance sampling approach ⋮ Multi-objective probabilistically constrained programs with variable risk: models for multi-portfolio financial optimization ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Using integer programming for balancing return and risk in problems with individual chance constraints ⋮ Optimization Approaches to Multiplicative Tariff of Rates Estimation in Non-Life Insurance ⋮ Approximation of probabilistic constraints in stochastic programming problems with a probability measure kernel ⋮ Derivatives of probability functions: unions of polyhedra and elliptical distributions ⋮ Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness ⋮ Recent advances in the theory and practice of logical analysis of data ⋮ Threshold Boolean form for joint probabilistic constraints with random technology matrix ⋮ A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints ⋮ A fractional stochastic integer programming problem for reliability-to-stability ratio in forest harvesting ⋮ Exact penalization in stochastic programming -- calmness and constraint qualification ⋮ Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities ⋮ Generalized Differentiation of Probability Functions Acting on an Infinite System of Constraints ⋮ 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

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Dual methods for probabilistic optimization problems.
• An integer programming approach for linear programs with probabilistic constraints
• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• Mathematical programming approaches for generating \(p\)-efficient points
• Logical analysis of numerical data
• Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
• Uncertain convex programs: randomized solutions and confidence levels
• On convex probabilistic programming with discrete distributions.
• Pareto-optimal patterns in logical analysis of data
• Spanned patterns for the logical analysis of data
• Accelerated algorithm for pattern detection in logical analysis of data
• An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
• Preprocessing techniques and column generation algorithms for stochastically efficient demand
• Contributions to the theory of stochastic programming
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• The logical combinatorial approach to pattern recognition, an overview through selected works

This page was built for publication: Pattern definition of the \(p\)-efficiency concept