A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
From MaRDI portal
Publication:3638501
DOI10.1007/978-0-387-88617-6_4zbMath1172.90479OpenAlexW123168732MaRDI QIDQ3638501
Jane C. Ammons, Matthew J. Realff, Tiravat Assavapokee
Publication date: 27 October 2009
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-0-387-88617-6_4
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Linear programming (90C05)
Cites Work
- Some properties of the bilevel programming problem
- Min-max regret robust optimization approach on interval data uncertainty
- Partitioning procedures for solving mixed-variables programming problems
- Practical bilevel optimization. Algorithms and applications
- Robust solutions of uncertain linear programs
- Interior point methods of mathematical programming
- Robust discrete optimization and its applications
- Multilevel optimization: algorithms and applications
- A multivariate partition approach to optimization problems
- Linear-fractional programming. Theory, methods, applications and software.
- 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
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization
- Robust Convex Optimization
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- The Price of Robustness
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Making a Case for Robust Optimization Models
- Robust Optimization of Large-Scale Systems
- Handbook of semidefinite programming. Theory, algorithms, and applications
- On the complexity of a class of combinatorial optimization problems with uncertainty
This page was built for publication: A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
