Minimising the maximum relative regret for linear programmes with interval objective function coefficients

Related Items

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems, The robust (minmax regret) assembly line worker assignment and balancing problem, The min-p robust optimization approach for facility location problem under uncertainty, Erratum to: ``An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem, Robust optimality analysis of non-degenerate basic feasible solutions in linear programming problems with fuzzy objective coefficients, Linear bilevel programming with interval coefficients, Violation analysis on two-step method for interval linear programming, Robust multiobjective portfolio optimization: A minimax regret approach, New conditions for testing necessarily/possibly efficiency of non-degenerate basic solutions based on the tolerance approach, Relative Robust and Adaptive Optimization, Computing and minimizing the relative regret in combinatorial optimization with interval data, A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity, Relatively robust decisions