A utility theory based interactive approach to robustness in linear optimization
From MaRDI portal
Publication:1753136
Abstract: We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms for robust optimization, based on concave and quasi-concave utility functions. In addition to practical advantages, due to the flexibility of our approach, we are able to prove that under a theoretical framework due to Bertsimas and Sim [14], which establishes the existence of certain convex formulation of robust optimization problems, the robust optimal solutions generated by our algorithms are at least as desirable to the decision maker as any solution generated by many other robust optimization algorithms in the theoretical framework. We present some probabilistic bounds for feasibility of robust solutions and evaluate our approach by means of computational experiments.
Recommendations
Cites work
- scientific article; zbMATH DE number 3769296 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- A cutting plane algorithm for convex programming that uses analytic centers
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- A stochastic programming approach for supply chain network design under uncertainty
- A technique for bounding the number of iterations in path following algorithms
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A utility theory based interactive approach to robustness in linear optimization
- Adaptive and robust radiation therapy optimization for lung cancer
- Adjustable robust solutions of uncertain linear programs
- Ambiguous chance constrained problems and robust optimization
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- An inverse reliability-based approach for designing under uncertainty with application to robust piston design
- Chance Constrained Programming with Joint Constraints
- Combinatorial approximation algorithms for the robust facility location problem with penalties
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Convex Approximations of Chance Constrained Programs
- Distributionally robust optimization and its tractable approximations
- Distributionally robust stochastic programming
- Extending scope of robust optimization: comprehensive robust counterparts of uncertain problems
- General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems.
- Global optimization of robust chance constrained problems
- Location of the Maximum on Unimodal Surfaces
- On 2-stage robust LP with RHS uncertainty: complexity results and applications
- On Vaidya's Volumetric Cutting Plane Method for Convex Programming
- On constrained optimization by adjoint based quasi-Newton methods
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Polynomial algorithms in linear programming
- Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy
- Robust Optimization of Large-Scale Systems
- Robust Solutions to Uncertain Semidefinite Programs
- Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations
- Robust convex optimization
- Robust discrete optimization and network flows
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization with simulated annealing
- Robust solutions for network design under transportation cost and demand uncertainty
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- Stochastic programming for off-line adaptive radiotherapy
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The ellipsoid method and its consequences in combinatorial optimization
- The robust crew pairing problem: model and solution methodology
- Tractable approximations to robust conic optimization problems
- Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm
- Value-focused thinking: Identifying decision opportunities and creating alternatives
Cited in
(3)
This page was built for publication: A utility theory based interactive approach to robustness in linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753136)
