Mixed-integer bilinear programming problems (Q687032)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 429090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Mixed-integer bilinear programming problems |
scientific article; zbMATH DE number 429090 |
Statements
Mixed-integer bilinear programming problems (English)
0 references
4 April 1994
0 references
This paper considers the bilinear programming problem with one set of variables restricted to be binary values. The authors describe some special cases of the problem which admit more efficient solution procedures. A composite Lagrangian relaxation cutting plane algorithm is given for the more general case. Some computational results are presented for comparing different algorithmic steps.
0 references
implicit enumeration
0 references
bilinear programming
0 references
composite Lagrangian relaxation cutting plane algorithm
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8265247941017151
0 references
0.8227744698524475
0 references
0.8158335089683533
0 references
0.8136196732521057
0 references
