Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Artigo

Fecha

2008-05-01

Registro en:

Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.

0965-5425

http://hdl.handle.net/11449/40884

10.1134/S0965542508050047

WOS:000262334100004

http://repositorioslatinoamericanos.uchile.cl/handle/2250/3911831

Autor

Russian Acad Sci

Universidade Estadual Paulista (Unesp)

Institución

Universidade Paulista Júlio de Mesquita Filho (Brasil)

Resumen

Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is used to design a Benders algorithm for solving the modified dual problem. Numerical results are presented that compare the quality of classical and modified bounds.

Materias

Lagrangian bounds in optimization problems

improvement of Lagrangian bounds

generalized assignment problem

Mostrar el registro completo del ítem