Computational aspects of two-segment separable programming (Q3664835)

From MaRDI portal
Revision as of 16:14, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational aspects of two-segment separable programming
scientific article

    Statements

    Computational aspects of two-segment separable programming (English)
    0 references
    0 references
    1983
    0 references
    recursive separable programming algorithms
    0 references
    local, two-segment approximations
    0 references
    separable convex programs
    0 references
    computation of lower bounds
    0 references
    primal and a dual approach
    0 references
    computational comparisons
    0 references
    test problems
    0 references
    network optimization
    0 references
    piecewise-linear approximation
    0 references
    error bounds
    0 references

    Identifiers

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