A simplex branch-and-bound method of a class of multi-product programming problems (Q2885973)
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 simplex branch-and-bound method of a class of multi-product programming problems |
scientific article; zbMATH DE number 6040809
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplex branch-and-bound method of a class of multi-product programming problems |
scientific article; zbMATH DE number 6040809 |
Statements
1 June 2012
0 references
global optimization
0 references
concave multiplicative programming
0 references
branch-and-bound method
0 references
convex envelope
0 references
A simplex branch-and-bound method of a class of multi-product programming problems (English)
0 references
0.8523906469345093
0 references
0.8099386096000671
0 references
0.7943984270095825
0 references
0.7932592034339905
0 references
