A branch and bound algorithm to globally solve the sum of several linear ratios (Q2572656)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm to globally solve the sum of several linear ratios |
scientific article |
Statements
A branch and bound algorithm to globally solve the sum of several linear ratios (English)
0 references
4 November 2005
0 references
The authors develop a branch and bound globally convergent algorithm for optimizing the sum of several linear fractional functions over a polytope by solving a series of linear programming problems. Some numerical results are presented.
0 references
fractional programming
0 references
branch and bound
0 references
global optimization
0 references
algorithm
0 references
numerical results
0 references
0 references
0 references
