An algorithm for generalized fractional programs (Q799495)
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: An algorithm for generalized fractional programs |
scientific article; zbMATH DE number 3874991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for generalized fractional programs |
scientific article; zbMATH DE number 3874991 |
Statements
An algorithm for generalized fractional programs (English)
0 references
1985
0 references
An algorithm is suggested that finds the constrained minimum of the maximum of finitely many ratios. The method involves a sequence of linear (convex) subproblems if the ratios are linear (convex-concave). Convergence results as well as rate of convergence results are derived. Special consideration is given to the case of (a) compact feasible regions and (b) linear ratios.
0 references
multi-ratio programming
0 references
constrained minimum
0 references
maximum of finitely many ratios
0 references
Convergence results
0 references
0.98575884
0 references
0.98554975
0 references
0.9773241
0 references
0.9719081
0 references
0.9674658
0 references
0.9638877
0 references
0.95045376
0 references
