A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071)
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 novel branch-and-bound algorithm for solving linear multiplicative programming problems |
scientific article; zbMATH DE number 7951733
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A novel branch-and-bound algorithm for solving linear multiplicative programming problems |
scientific article; zbMATH DE number 7951733 |
Statements
A novel branch-and-bound algorithm for solving linear multiplicative programming problems (English)
0 references
29 November 2024
0 references
global optimization
0 references
linear multiplication problems
0 references
linear relaxation programming problem
0 references
rectangle branch and bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
