Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables

DOI10.1287/opre.2015.1434zbMath1333.90023OpenAlexW2193237318MaRDI QIDQ2797468

Merve Unuvar, Prékopa, András

Publication date: 5 April 2016

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

Full work available at URL: https://semanticscholar.org/paper/1139c648d0dc89144d14b920059262b485220e87

zbMATH Keywords

stochastic programmingnetwork designstochastic networksprobabilistic constraint\(p\)-efficient points

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single source single-commodity stochastic network design
• The discrete moment problem and linear programming
• A theorem on flows in networks
• An integer programming approach for linear programs with probabilistic constraints
• Mathematical programming approaches for generating \(p\)-efficient points
• The facets of the polyhedral set determined by the Gale-Hoffman inequalities
• A minimal algorithm for the multiple-choice knapsack problem
• Bounds for probabilistic integer programming problems
• Multivariate value at risk and related topics
• Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai
• Regularization methods for optimization problems with probabilistic constraints
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• On the Existence of a Feasible Flow in a Stochastic Transportation Network
• On a dual method for a specially structured linear programming problem with application to stochastic programming
• The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński
• Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
• Best Possible Inequalities for the Probability of a Logical Function of Events
• On the Probability Distribution of the Optimum of a Random Linear Program
• Association of Random Variables, with Applications
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Optimality and Degeneracy in Linear Programming
• Concavity and efficient points of discrete distributions in probabilistic programming.

This page was built for publication: Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables