On the choice of the pivot columns of the simplex-method: Gradient criteria (Q1097836)

From MaRDI portal
Revision as of 20:30, 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
On the choice of the pivot columns of the simplex-method: Gradient criteria
scientific article

    Statements

    On the choice of the pivot columns of the simplex-method: Gradient criteria (English)
    0 references
    0 references
    0 references
    1987
    0 references
    In a Monte Carlo simulation experiment the author tests different variations of gradient criteria and compares them to the steepest unit ascent criteria. He concludes that the necessary CPU time for the latter was very high in comparison to the other ones, although the computer time per iteration was generally particularly short; moreover, of all of the 31 criteria examined, a modification of the gradient criterion taking the basic variables into account showed itself to be clearly superior to all the other criteria, in particular to the latter, and therefore can be recommended for practical use.
    0 references
    0 references
    simplex algorithm
    0 references
    pivoting
    0 references
    Monte Carlo simulation
    0 references
    gradient criteria
    0 references
    steepest unit ascent criteria
    0 references

    Identifiers