An algorithm for generalized fractional programs (Q799495)

From MaRDI portal
Revision as of 11:17, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithm for generalized fractional programs
scientific article

    Statements

    An algorithm for generalized fractional programs (English)
    0 references
    0 references
    0 references
    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

    Identifiers