Bound Improving Sequences: A Tool for Discrete Programming

Bárcia, Paulo

http://hdl.handle.net/10362/89159

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
WP18.pdf		368.35 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Bárcia, Paulo

Resumo(s)

The purpose of this note is to report a new tool for discrete programming: Bound improving sequences. It consists on the construction of a sequence of bounds that, under appropriate conditions, converges in a finite number of steps to the optimal value of the objective function of the Problem studied. As a byproduct an optimal solution for that problem is produced. For the case of 0-1 LP's such a sequence can be efficiently computed. Examples, geometric interpretations and computational experience reports for this case are given.

URI

http://hdl.handle.net/10362/89159

Citação

Bárcia, Paulo, Bound Improving Sequences: A Tool for Discrete Programming (April, 1984). FEUNL Working Paper Series No. 18

Editora

Nova SBE

Coleções

NSBE - Working Paper Series

Ver registo completo