A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (Q1106721): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Trivial and Binding Constraints in Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: Occurrences of cycling and other phenomena arising in a class of linear programming models / rank
 
Normal rank

Latest revision as of 17:23, 18 June 2024

scientific article
Language Label Description Also known as
English
A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary
scientific article

    Statements

    A degenerate extreme point strategy for the classification of linear constraints as redundant or necessary (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    This paper presents a degenerate extreme point strategy for active set algorithms which classify linear constraints as either redundant or necessary. The strategy makes use of an efficient method for classifying constraints active at degenerate extreme points. Numerical results indicate that significant savings in the computational effort required to classify the constraints can be achieved.
    0 references
    redundancy
    0 references
    degeneracy
    0 references
    degenerate extreme point strategy
    0 references
    active set algorithms
    0 references
    linear constraints
    0 references
    classifying constraints
    0 references

    Identifiers