On the number of solutions generated by the dual simplex method (Q439907): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4906130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the number of different basic solutions generated by the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Klee-Minty's LP and upper bounds for Dantzig's simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate / rank
 
Normal rank

Revision as of 13:20, 5 July 2024

scientific article
Language Label Description Also known as
English
On the number of solutions generated by the dual simplex method
scientific article

    Statements

    On the number of solutions generated by the dual simplex method (English)
    0 references
    0 references
    0 references
    17 August 2012
    0 references
    dual simplex method
    0 references
    basic feasible solutions
    0 references
    maximum flow problem
    0 references

    Identifiers