A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts (Q3877412): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:50, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts |
scientific article |
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
