Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
From MaRDI portal
Publication:539107
DOI10.1007/s11067-010-9150-7zbMath1213.90191OpenAlexW1992970242MaRDI QIDQ539107
Shapour Azarm, Yohan Shim, Steven A. Gabriel, Mian Li
Publication date: 27 May 2011
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11067-010-9150-7
linear programmingquadratic programmingrobust optimizationinterval uncertaintymixed-integer linear programmingmixed-integer quadratic programming
Related Items (9)
Robust multi-period fleet allocation models for bike-sharing systems ⋮ A parallelised distributed implementation of a branch and fix coordination algorithm ⋮ A branch and bound algorithm for quantified quadratic programming ⋮ Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation ⋮ An approach for integrating valuable flexibility during conceptual design of networks ⋮ A stochastic multi-agent optimization model for energy infrastructure planning under uncertainty in an oligopolistic market ⋮ Recent advances in robust optimization: an overview ⋮ Robust Critical Node Selection by Benders Decomposition ⋮ A Practicable Robust Counterpart Formulation for Decomposable Functions: A Network Congestion Case Study
Uses Software
Cites Work
- Robust linear optimization under general norms.
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- A multiobjective optimization model for dynamic reconfiguration of ring topologies with stochastic load
- More test examples for nonlinear programming codes
- Robust solutions of uncertain linear programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust optimization-methodology and applications
- Robust asset allocation
- Tractable approximations to robust conic optimization problems
- Robust Convex Optimization
- Nonconvex Robust Optimization for Problems with Constraints
- The Price of Robustness
- Quadratic knapsack problems
- Robust Solutions to Uncertain Semidefinite Programs
- Robust Optimization of Large-Scale Systems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
