Capital rationing problems under uncertainty and risk
From MaRDI portal
Publication:429488
DOI10.1007/s10589-010-9390-yzbMath1241.90064OpenAlexW2062918869MaRDI QIDQ429488
Maria Elena Bruni, Antonio Violi, Patrizia Beraldi
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9390-y
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Management decision making, including multiple objectives (90B50)
Related Items (6)
The mixed capacitated general routing problem under uncertainty ⋮ Chance-Constrained Binary Packing Problems ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Capital rationing problems under uncertainty and risk ⋮ Water distribution networks design under uncertainty ⋮ The risk-averse traveling repairman problem with profits
Uses Software
Cites Work
- Capital rationing problems under uncertainty and risk
- An integer programming approach for linear programs with probabilistic constraints
- Sample average approximation method for chance constrained programming: Theory and applications
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Optimal project selection when borrowing and lending rates differ
- An exact approach for solving integer problems under probabilistic constraints with random technology matrix
- Convexity and decomposition of mean-risk stochastic programs
- Coherent Measures of Risk
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Capital Budgeting Under Uncertainty—An Integrated Approach Using Contingent Claims Analysis and Integer Programming
- The Probabilistic Set-Covering Problem
- Deterministic approximations of probability inequalities
- Stochastic Dominance and Expected Utility: Survey and Analysis
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Dual Stochastic Dominance and Related Mean-Risk Models
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
- On consistency of stochastic dominance and mean-semideviation models
This page was built for publication: Capital rationing problems under uncertainty and risk
