Mathematical programming approaches for generating \(p\)-efficient points
type: Item
instance of: scholarly article
title: Mathematical programming approaches for generating \(p\)-efficient points
zbMATH Open document ID: 1205.90210
author: Nilay Noyan
author: Miguel A. Lejeune
published in: European Journal of Operational Research
publication date: 2010-09-09T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5781867
zbMATH Keywords: stochastic programming
zbMATH Keywords: probabilistic constraints
zbMATH Keywords: \(p\)-efficiency
zbMATH Keywords: outer approximation
zbMATH Keywords: valid inequalities
describes a project that uses: AMPL
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.05.025
OpenAlex ID: W2095564588
cites work: The Probabilistic Set-Covering Problem
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: Q5201293
cites work: On convex probabilistic programming with discrete distributions.
cites work: Bounds for probabilistic integer programming problems
cites work: Dual methods for probabilistic optimization problems.
cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs
cites work: Solving mixed integer nonlinear programs by outer approximation
cites work: Facet of regular 0–1 polytopes
cites work: The minmax multidimensional knapsack problem with application to a chance‐constrained problem
cites work: Preprocessing techniques and column generation algorithms for stochastically efficient demand
cites work: An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
cites work: An integer programming approach for linear programs with probabilistic constraints
cites work: Convex Approximations of Chance Constrained Programs
cites work: Q5638126
cites work: Contributions to the theory of stochastic programming
cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
cites work: Q4838490
cites work: Q4830009
cites work: Q3840335
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
cites work: MIP reformulations of the probabilistic set covering problem
cites work: Relaxations for probabilistically constrained programs with discrete random variables
DOI: 10.1016/J.EJOR.2010.05.025
description: scientific article; zbMATH DE number 5781867