A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (Q6601128)
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 self-adjustable branch-and-bound algorithm for solving linear multiplicative programming |
scientific article; zbMATH DE number 7909826
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming |
scientific article; zbMATH DE number 7909826 |
Statements
A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming (English)
0 references
10 September 2024
0 references
global optimization
0 references
linear multiplicative program
0 references
linear relaxation
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
