A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578): 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: 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: The generalized simplex method for minimizing a linear form under linear inequality restraints / 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: Q4178772 / 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: A dual approach to primal degeneracy / 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: Practical finite pivoting rules for the simplex method / 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: Steepest-edge simplex algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4673630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practicable steepest-edge simplex algorithm / 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: Q4051876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101610 / 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: A Variant of the Dual Pivoting Rule in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879697 / 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

Latest revision as of 08:58, 29 May 2024

scientific article
Language Label Description Also known as
English
A basis-defiency-allowing variation of the simplex method for linear programming
scientific article

    Statements

    A basis-defiency-allowing variation of the simplex method for linear programming (English)
    0 references
    8 November 1999
    0 references
    linear programming
    0 references
    simplex method
    0 references
    degeneracy
    0 references
    basis deficiency
    0 references
    least squares problem
    0 references
    orthogonal transformation
    0 references
    0 references
    0 references
    0 references

    Identifiers