A branch and bound reduction algorithm for solving a class of linear multiplicative programming problems with constant coefficients (Q4574567)
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 6906974
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound reduction algorithm for solving a class of linear multiplicative programming problems with constant coefficients |
scientific article; zbMATH DE number 6906974 |
Statements
18 July 2018
0 references
global optimization
0 references
multiplicative constraints
0 references
linear multiplicative programming
0 references
branch-and-bound
0 references
relaxed programming problem
0 references
0.869121253490448
0 references
0.8596853613853455
0 references
0.8569568991661072
0 references
0.8544943928718567
0 references
0.8482867479324341
0 references
