A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6698256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A practicable branch-and-bound algorithm for globally solving linear multiplicative programming |
scientific article; zbMATH DE number 6698256 |
Statements
A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (English)
0 references
30 March 2017
0 references
linear multiplicative
0 references
branch-and-bound
0 references
linear relaxation
0 references
global optimization
0 references
0 references
0 references
0.9466613
0 references
0.94354343
0 references
0.9429636
0 references
0.9324221
0 references
0.9293144
0 references
0.9265322
0 references
0.9255264
0 references
0.92050064
0 references
0.9197155
0 references
