A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412)
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: A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts |
scientific article; zbMATH DE number 3681496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts |
scientific article; zbMATH DE number 3681496 |
Statements
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (English)
0 references
1980
0 references
polar cuts
0 references
disjunctive face cuts
0 references
finite algorithm
0 references
cutting plane
0 references
polyhedral set
0 references
computational experience
0 references
test problems
0 references
disjunctive cuts
0 references
bilinear programming problem
0 references
