A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:19, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A practicable branch-and-bound algorithm for globally solving linear multiplicative programming |
scientific article |
Statements
A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (English)
0 references
30 March 2017
0 references
linear multiplicative
0 references
branch-and-bound
0 references
linear relaxation
0 references
global optimization
0 references
