The decomposition principle and algorithms for linear programming (Q806964)

From MaRDI portal
Revision as of 23:22, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
The decomposition principle and algorithms for linear programming
scientific article

    Statements

    The decomposition principle and algorithms for linear programming (English)
    0 references
    0 references
    1991
    0 references
    The paper deals with the computational difficulties encountered in the Dantzig-Wolfe decomposition algorithm. The DKN-algorithm is proposed. Numerical experiments are given, which illustrate this procedure, and computational results are described. The DKN-algorithm is exemplified by further discussion of the case of decentralized decision.
    0 references
    0 references
    linear programming
    0 references
    Dantzig-Wolfe decomposition algorithm
    0 references
    DKN-algorithm
    0 references
    Numerical experiments
    0 references
    computational results
    0 references
    decentralized decision
    0 references
    0 references
    0 references