A practicable branch-and-bound algorithm for globally solving linear multiplicative programming (Q2970402): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/02331934.2016.1269765 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2568448495 / rank | |||
Normal rank | |||
Revision as of 22:00, 19 March 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
