Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141): Difference between revisions
From MaRDI portal
Revision as of 13:03, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Accelerating convergence of cutting plane algorithms for disjoint bilinear programming |
scientific article |
Statements
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (English)
0 references
14 November 2007
0 references
Linear programming
0 references
Bilinear programming
0 references
Cutting plane
0 references
Polar cuts
0 references
Lower bounding
0 references
0 references
0 references