| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 303.86 KB | Adobe PDF |
Authors
Advisor(s)
Abstract(s)
Lagrangean and linear penalties can be used for variable bounding in ILP. Such penalties, embedded in a branch-and-bound algorithm, yield remarkable reductions in the search procedure effort for large scale problems. In this paper, four different ways of exploring this idea for a covering problem with integer variables are presented. Computing results taken from test problems have revealed the efficiency of the technique in reducing the amplitude of variable intervals, and even in fixing them at feasible values .
Description
Keywords
Integer Linear Programming Covering Problems Lagrangean Relaxation Penalties
Pedagogical Context
Citation
Pato, Margarida Vaz .(1992). “Linear and Lagrangean Penalties” for ILP. An Application to a Covering Problem”. Investigação Operacional, Volume 12: no.1: pp. 43-50. 1992
Publisher
APDIO