Calculating the Best Dual Bound for Problems with Multiple Lagrangian Relaxations
Nenhuma Miniatura disponível
Data
2010-12-01
Autores
Litvinchev, I.
Mata, M.
Rangel, J.
Título da Revista
ISSN da Revista
Título de Volume
Editor
Maik Nauka/interperiodica/springer
Resumo
There are often many ways in which a given problem can be relaxed in a Lagrangian fashion. It is not obvious a priori, which relaxation produces the best bound. Moreover, a bound may appear to be the best for a certain data set, while being among the worst for another problem instance. We consider here an optimization problem over the set of Lagrangian relaxations with the objective to indicate the relaxation producing the best dual bound. An iterative technique to solve this problem is proposed based on constraints generation scheme. The approach is illustrated by a computational study for a class of the two-stage capacitated facility location problem.
Descrição
Palavras-chave
Como citar
Journal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica/springer, v. 49, n. 6, p. 915-922, 2010.