Linear programming with interval right hand sides
From MaRDI portal
Publication:3566454
DOI10.1111/j.1475-3995.2009.00737.xzbMath1187.90188OpenAlexW2003494596MaRDI QIDQ3566454
N. Remli, Virginie Gabrel, Cécile Murat
Publication date: 8 June 2010
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2009.00737.x
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (24)
Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients ⋮ Some results on the upper bound of optimal values in interval convex quadratic programming ⋮ New models for the robust shortest path problem: complexity, resolution and generalization ⋮ An algebraic model for the propagation of errors in matrix calculus ⋮ Some properties of the lower bound of optimal values in interval convex quadratic programming ⋮ The outcome range problem in interval linear programming ⋮ A novel approach for exploring the trade‐offs between several features of students’ well‐being ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach ⋮ Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems ⋮ Efficient robust control of first order scalar conservation laws using semi-analytical solutions ⋮ How to determine basis stability in interval linear programming ⋮ An alternative optimization technique for interval objective constrained optimization problems via multiobjective programming ⋮ Checking weak optimality of the solution to linear programming with interval right-hand side ⋮ On approximation of the best case optimal value in interval linear programming ⋮ Violation analysis on two-step method for interval linear programming ⋮ Recent advances in robust optimization: an overview ⋮ Interval convex quadratic programming problems in a general form ⋮ Checking weak optimality of the solution to interval linear program in the general form ⋮ A parameter method for linear algebra and optimization with uncertainties ⋮ Duality gap in interval linear programming ⋮ Optimality and duality for second-order interval-valued variational problems ⋮ A decentralized feedback approach for flow control in highway traffic networks ⋮ New method for computing the upper bound of optimal value in interval quadratic program
Cites Work
- Unnamed Item
- Robust solutions of uncertain linear programs
- Minimax regret solution to linear programming problems with an interval objective function
- Robust discrete optimization and network flows
- A branch and bound algorithm for the robust shortest path problem with interval data.
- Interval data minmax regret network optimization problems
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- An exact algorithm for the robust shortest path problem with interval data
- On the complexity of minmax regret linear programming
- A Benders decomposition approach for the robust spanning tree problem with interval data
- The robust shortest path problem with interval data via Benders decomposition
- Linear programming with interval coefficients
- A Robust Optimization Approach to Inventory Theory
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- The Price of Robustness
- Robust solutions and methods in decision-aid
- Robust Optimization of Large-Scale Systems
- Robustness and duality in linear programming
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The robust spanning tree problem with interval data
This page was built for publication: Linear programming with interval right hand sides
