Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508)
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: Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound |
scientific article; zbMATH DE number 7704013
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound |
scientific article; zbMATH DE number 7704013 |
Statements
Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (English)
0 references
28 June 2023
0 references
linear multiplicative programming
0 references
global optimization
0 references
simplicial branching
0 references
convex quadratic relaxation
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
