Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (Q1180819)

From MaRDI portal
Revision as of 15:42, 14 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
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
scientific article

    Statements

    Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    The convergence behavior of Karmarkar's projective algorithm for linear programming problems is described. The authors show that the algorithm requires at least \(n-1\) iterations to reach the optimal solution.
    0 references
    0 references
    convergence behavior
    0 references
    Karmarkar's projective algorithm
    0 references

    Identifiers