The bound improving sequence algorithm (Q1061001)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bound improving sequence algorithm |
scientific article; zbMATH DE number 3908164
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bound improving sequence algorithm |
scientific article; zbMATH DE number 3908164 |
Statements
The bound improving sequence algorithm (English)
0 references
1985
0 references
The purpose of this paper is to report on a new tool to help solve 0-1 LP's. It consists of a sequence of bounds that, under proper conditions, bridge the duality gap, i.e., converges in a finite number of steps to the optimal value of the objective function of the problem studied. As a by-product an optimal solution for that problem is produced. Computational experience is reported.
0 references
Lagrangean relaxation
0 references
knapsack problem
0 references
sequence of bounds
0 references
duality gap
0 references
Computational experience
0 references
