New reformulations for probabilistically constrained quadratic programs
From MaRDI portal
Publication:296982
DOI10.1016/j.ejor.2013.08.052zbMath1339.90260OpenAlexW1983846209WikidataQ57445422 ScholiaQ57445422MaRDI QIDQ296982
Publication date: 24 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.052
quadratic programmingsemi-definite programmingmixed-integer quadratic programprobabilistic constraintvalue-at-risk/variance portfolio selection
Related Items (2)
Risk-budgeting multi-portfolio optimization with portfolio and marginal risk constraints ⋮ Quadratic convex reformulation for quadratic programming with linear on-off constraints
Uses Software
Cites Work
- Unnamed Item
- Threshold Boolean form for joint probabilistic constraints with random technology matrix
- An integer programming approach for linear programs with probabilistic constraints
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs
- Augmented Lagrangian method for probabilistic optimization
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- An Efficient Trajectory Method for Probabilistic Production-Inventory-Distribution Problems
- Pattern-Based Modeling and Solution of Probabilistically Constrained Optimization Problems
This page was built for publication: New reformulations for probabilistically constrained quadratic programs