An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4188659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generation of the binary reflected gray code and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Finite Pivoting Rules for the Simplex Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case behavior of the steepest edge simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Simple Applications of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent criss-cross method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Criss-Cross Method for Solving Linear Programming Problems / rank
 
Normal rank

Revision as of 14:08, 20 June 2024

scientific article
Language Label Description Also known as
English
An exponential example for Terlaky's pivoting rule for the criss-cross simplex method
scientific article

    Statements

    An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (English)
    0 references
    0 references
    1990
    0 references
    This paper shows that the required number of iterations for Terlaky's pivoting rule for the criss-cross simplex method [see \textit{E. Klafszky} and \textit{T. Terlaky}, Alkalmazott Mat. Lapok 12, 1-14 (1986; Zbl 0631.90039)] may be exponential in the number of variables and constraints of the linear programming problem.
    0 references
    Gray code
    0 references
    Terlaky's pivoting rule
    0 references
    criss-cross simplex method
    0 references

    Identifiers