A new pivoting rule for solving various degeneracy problems (Q1198621): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Note on Shadow Prices in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average length of lexicographic paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229788 / 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: 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: An algorithm for determining all extreme points of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved vertex enumeration algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the set bases of a degenerate point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of solved and open problems in the degeneracy phenomenon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual approach to primal degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy graphs and the neighbourhood problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general phase-I method in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on degeneracy in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degeneracy graphs and simplex cycling / rank
 
Normal rank

Revision as of 15:13, 16 May 2024

scientific article
Language Label Description Also known as
English
A new pivoting rule for solving various degeneracy problems
scientific article

    Statements

    A new pivoting rule for solving various degeneracy problems (English)
    0 references
    0 references
    0 references
    16 January 1993
    0 references
    Based on the recently developed theory of degeneracy graphs, the authors present a new pivoting rule called the `transition node pivoting rule'. A survey on potential applications of this rule is given.
    0 references
    transition node pivoting rule
    0 references
    degeneracy graphs
    0 references

    Identifiers