An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696)
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: An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation |
scientific article; zbMATH DE number 7862479
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation |
scientific article; zbMATH DE number 7862479 |
Statements
An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (English)
0 references
10 June 2024
0 references
global optimization
0 references
linear multiplicative programming
0 references
convex relaxation technique
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
