Min–max and min–max (relative) regret approaches to representatives selection problem
- 235 Downloads
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision. The arising min–max, min–max regret and min–max relative regret optimization problems are shown to be polynomially solvable for interval scenarios. For discrete scenarios, they are proved to be NP-hard in the strong sense if the number of scenarios is part of the input. If it is part of the problem type, then they are NP-hard in the ordinary sense, pseudo-polynomially solvable by a dynamic programming algorithm and possess an FPTAS. This study is motivated by the problem of selecting tools of minimum total cost in the design of a production line.
KeywordsUncertainty Min–max approach Min–max regret Computational complexity Dynamic programming
Mathematics Subject Classification03D15 62F35
Unable to display preview. Download preview PDF.
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscoGoogle Scholar
- Kovalyov MY (1996) A rounding technique to construct approximation algorithms for knapsack and partition type problems. Appl Math Comput Sci 6: 101–113Google Scholar
- Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, BostonGoogle Scholar
- Mirzapour Al-E-Hashem SMJ, Aryanezhad MB, Malekly H, Sadjadi SJ (2009) Mixed model assembly line balancing problem under uncertainty. International Conference on Computers and Industrial Engineering, CIE 2009 , art. no. 5223925, pp. 233–238Google Scholar