Linear programming with interval right hand sides

DOI10.1111/j.1475-3995.2009.00737.xzbMath1187.90188MaRDI 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

zbMATH Keywords

linear programming; robustness analysis; complexity theory; interval right hand side; worst case criteria

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90C05: Linear programming

Related Items

A parameter method for linear algebra and optimization with uncertainties, Checking weak optimality of the solution to interval linear program in the general form, 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 alternative optimization technique for interval objective constrained optimization problems via multiobjective programming, On approximation of the best case optimal value in interval linear programming, Violation analysis on two-step method for interval linear programming, Some properties of the lower bound of optimal values in interval convex quadratic programming, 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, Interval convex quadratic programming problems in a general form, Optimality and duality for second-order interval-valued variational problems, A decentralized feedback approach for flow control in highway traffic networks, An algebraic model for the propagation of errors in matrix calculus, Recent advances in robust optimization: an overview, Duality gap in interval linear programming, New method for computing the upper bound of optimal value in interval quadratic program, Inverse optimization: towards the optimal parameter set of inverse LP with interval coefficients, Efficient robust control of first order scalar conservation laws using semi-analytical solutions, How to determine basis stability in interval linear programming, Checking weak optimality of the solution to linear programming with interval right-hand side, The outcome range problem in interval linear programming

Cites Work

• 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
• Unnamed Item