Fractional programming by lower subdifferentiability techniques (Q911479)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Fractional programming by lower subdifferentiability techniques
scientific article

    Statements

    Fractional programming by lower subdifferentiability techniques (English)
    0 references
    0 references
    1991
    0 references
    The notion of lower subdifferentiability is applied to the analysis of convex fractional programming problems. In particular, duality results and optimality conditions are presented, and the applicability of a cutting-plane algorithm using lower subgradients is discussed. These methods are useful also in generalized fractional programming, where, in the linear case, the performance of the cutting-plane algorithm is compared with that of the most efficient version of the Dinkelbach method, which is based on the solution of a parametric linear programming problem.
    0 references
    lower subdifferentiability
    0 references
    convex fractional programming
    0 references
    duality results
    0 references
    optimality conditions
    0 references
    cutting-plane algorithm
    0 references
    lower subgradients
    0 references
    Dinkelbach method
    0 references
    parametric linear programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references