An Efficient algorithm for quadratic sum-of-ratios fractional programs problem (Q4602158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6830122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Efficient algorithm for quadratic sum-of-ratios fractional programs problem |
scientific article; zbMATH DE number 6830122 |
Statements
An Efficient Algorithm for Quadratic Sum-of-Ratios Fractional Programs Problem (English)
0 references
26 January 2018
0 references
branch-and-bound
0 references
fractional programs
0 references
global optimization
0 references
parametric linearizing technique
0 references
quadratic sum-of-ratios
0 references
0.8601522445678711
0 references
0.8535839915275574
0 references
0.8479533791542053
0 references
0.8443708419799805
0 references
0.8368855714797974
0 references
