Generalized linear multiplicative and fractional programming (Q2277368)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generalized linear multiplicative and fractional programming
scientific article

    Statements

    Generalized linear multiplicative and fractional programming (English)
    0 references
    0 references
    0 references
    0 references
    1990
    0 references
    The nonconvex problem of minimizing the sum of a convex function and the product of two linear functions over a polytope is shown to be solvable by a sequence of convex programming problems, by embedding the original n-dimensional problem into an \((n+1)\)-dimensional master problem and then applying a parametric programming approach.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    product of two linear functions
    0 references
    sequence of convex programming problems
    0 references
    parametric programming
    0 references
    0 references