Pages that link to "Item:Q3154417"

The following pages link to Minimising the maximum relative regret for linear programmes with interval objective function coefficients (Q3154417):

Displayed 13 items.

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