Uniform quasi-concavity in probabilistic constrained stochastic programming
From MaRDI portal
Publication:635508
DOI10.1016/j.orl.2011.03.007zbMath1219.90114MaRDI QIDQ635508
Munevver Mine Subasi, Kunikazu Yoda, Prékopa, András
Publication date: 19 August 2011
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.03.007
90C15: Stochastic programming
Related Items
Unnamed Item, Second order conic approximation for disassembly line design with joint probabilistic constraints, Threshold Boolean form for joint probabilistic constraints with random technology matrix, Uniformly monotone functions -- definition, properties, characterizations, Analysis of a chance-constrained new product risk model with multiple customer classes, Preference-based reinforcement learning: evolutionary direct policy search using a preference-based racing algorithm, Arc routing under uncertainty: introduction and literature review, Unnamed Item
Cites Work
- An integer programming approach for linear programs with probabilistic constraints
- Convexity of chance constraints with independent random variables
- Stochastic linear programming. Models, theory, and computation
- Programming under probabilistic constraints with a random technology matrix
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- A Stochastic Programming Model
- Concavity and efficient points of discrete distributions in probabilistic programming.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item