Intelligent gradient search in linear programming (Q1071647)

From MaRDI portal
Revision as of 12:37, 12 July 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
Intelligent gradient search in linear programming
scientific article

    Statements

    Intelligent gradient search in linear programming (English)
    0 references
    0 references
    1985
    0 references
    The authors discuss practical aspects and modifications of the polynomial-time algorithm for linear programming by \textit{N. Karmarkar} [Combinatorica 4, 373-395 (1984; Zbl 0557.90065)]. The method has been tested for small and medium size problems and compares favorably with two other LP codes based on the simplex method.
    0 references
    0 references
    gradient methods
    0 references
    implementation
    0 references
    practical aspects
    0 references
    modifications
    0 references
    polynomial-time algorithm
    0 references

    Identifiers