A phase-1 approach for the generalized simplex algorithm (Q1612514): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Programming of Interdependent Activities: II Mathematical Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A basis-defiency-allowing variation of the simplex method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilization of the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simplex method of linear programming using LU decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results / 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: Q3229788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and Degeneracy in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized simplex method for minimizing a linear form under linear inequality restraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criss-cross methods: A fresh view on pivot algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical anti-cycling procedure for linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5185900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical finite pivoting rules for the simplex method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex-like method with bisection for linear programming<sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual projective simplex method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projective simplex method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projective simplex algorithm using LU decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / 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 15:02, 4 June 2024

scientific article
Language Label Description Also known as
English
A phase-1 approach for the generalized simplex algorithm
scientific article

    Statements

    A phase-1 approach for the generalized simplex algorithm (English)
    0 references
    0 references
    0 references
    25 August 2002
    0 references
    degeneracy
    0 references
    deficient basis
    0 references
    LU-decomposition
    0 references
    phase-1
    0 references
    single artificial variable
    0 references
    simplex algorithm
    0 references
    linear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers