On robustness in nonconvex optimization with application to defense planning
From MaRDI portal
Publication:6161271
DOI10.1016/j.orl.2022.11.003zbMath1525.90341arXiv2208.09725MaRDI QIDQ6161271
Publication date: 27 June 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.09725
Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Robustness in mathematical programming (90C17)
Cites Work
- Unnamed Item
- Optimal search for moving targets
- Optimization. Algorithms and consistent approximations
- Data-driven robust optimization
- Stability analysis for parameterized variational systems with implicit constraints
- Modeling uncertainty of expert elicitation for use in risk-based optimization
- A survey of network interdiction models and algorithms
- Distributionally Robust Convex Optimization
- Stochastic Finance
- Theory and Applications of Robust Optimization
- Optimizing the US Navy's combat logistics force
- The Price of Robustness
- Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
- Variational Analysis
- Variational Analysis and Applications
- Scheduling combat logistics force replenishments at sea for the US Navy
- An Optimization Primer
- Robust Stochastic Facility Location: Sensitivity Analysis and Exact Solution
- Measures of Residual Risk with Connections to Regression, Risk Tracking, Surrogate Models, and Ambiguity
- Variational Theory for Optimization under Stochastic Ambiguity
- Pyomo -- optimization modeling in Python
This page was built for publication: On robustness in nonconvex optimization with application to defense planning