A symmetrical linear maxmin approach to disjoint bilinear programming (Q1586213)
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 symmetrical linear maxmin approach to disjoint bilinear programming |
scientific article; zbMATH DE number 1528065
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A symmetrical linear maxmin approach to disjoint bilinear programming |
scientific article; zbMATH DE number 1528065 |
Statements
A symmetrical linear maxmin approach to disjoint bilinear programming (English)
0 references
12 November 2000
0 references
disjoint bilinear problem
0 references
linear maximin problem
0 references
branch and bound algorithm
0 references
global optimization
0 references
