On the complexity of minmax regret linear programming

European Journal of Operational Research

Volumn 160, Issue 1, 2005, Pages 227-231

  Averbakh, Igor ^a   Lebedev, Vasilij ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b VOLGOGRAD STATE UNIVERSITY   (Russian Federation)

Author keywords

Combinatorial optimization; Complexity theory; Minmax regret optimization; Uncertainty modeling

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

COMBINATORIAL OPTIMIZATION; COMPLEXITY THEORY; MINIMAX REGRET OPTIMIZATION; UNCERTAINITY MODELING;

LINEAR PROGRAMMING;

EID: 3943071056     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.07.007     Document Type: Conference Paper

References (10)

1. Averbakh I. On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming. 90:2001;263-272.
2. Bertsimas D., Tsitsiklis J.N. Introduction to Linear Optimization. 1997;Athena Scientific, Belmont, MA.
3. Garey M., Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
4. Inuiguchi M., Sakawa M. Minimax regret solution to linear programming problems with an interval objective function. European Journal of Operational Research. 86:1995;526-536.
5. M. Inuiguchi, M. Sakawa, Maximum regret analysis in linear programs with an interval objective function, in: Proceedings of IWSCI'96, 308-317.
6. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica. 4:1984;373-395.
7. Khachian L.G. A polynomial algorithm in linear programming. Soviet Mathematics Doklady. 20:1979;191-194.
8. Mausser H., Laguna M. A new mixed integer formulation for the maximum regret problem. International Transactions in Operational Research. 5(5):1998;389-403.
9. Mausser H., Laguna M. A heuristic to minimax absolute regret for linear programs with interval objective function coefficients. European Journal of Operational Research. 117:1999;157-174.
10. T. Schaefer, The complexity of satisfiability problems, in: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, New York, 1978, pp. 216-226.