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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lineare Programmierung und Erweiterungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—On Upper Bounds for the Number of Iterations in Solving Linear Programs / rank
 
Normal rank

Latest revision as of 14:43, 18 June 2024

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
    simplex algorithm
    0 references
    pivoting
    0 references
    Monte Carlo simulation
    0 references
    gradient criteria
    0 references
    steepest unit ascent criteria
    0 references
    0 references
    0 references
    0 references

    Identifiers