Min-max regret robust optimization approach on interval data uncertainty
From MaRDI portal
Publication:946180
DOI10.1007/s10957-007-9334-6zbMath1151.90019OpenAlexW1964367484MaRDI QIDQ946180
Jane C. Ammons, Tiravat Assavapokee, Matthew J. Realff
Publication date: 22 September 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9334-6
robust optimizationdeviation robust optimizationinterval data uncertaintymin-max regret robust optimization
Related Items (9)
Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems ⋮ An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives ⋮ Robust supply chain network design: an optimization model with real world application ⋮ Robust optimisation with normal vectors on critical manifolds of disturbance-induced stability loss ⋮ Complexity results and exact algorithms for robust knapsack problems ⋮ A minmax regret linear regression model under uncertainty in the dependent variable ⋮ Recent advances in robust optimization: an overview ⋮ Relative Robust and Adaptive Optimization ⋮ A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
Cites Work
- Some properties of the bilevel programming problem
- Practical bilevel optimization. Algorithms and applications
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- A multivariate partition approach to optimization problems
- Robust discrete optimization and network flows
- Robust solutions of linear programming problems contaminated with uncertain data
- Minmax regret solutions for minimax optimization problems with uncertainty
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Robust Convex Optimization
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The Price of Robustness
- New Branch-and-Bound Rules for Linear Bilevel Programming
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: Min-max regret robust optimization approach on interval data uncertainty
