A constraint selection technique for a class of linear programs (Q1105487)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A constraint selection technique for a class of linear programs
scientific article

    Statements

    A constraint selection technique for a class of linear programs (English)
    0 references
    0 references
    0 references
    1988
    0 references
    It is well known that, for most linear programs, only a relatively small percentage of constraints are binding at the optimal solution. Significant effort has been directed towards methods which identify those constraints most likely to be tight at optimality. We present here a simple, but highly effective, heuristic for finding solutions to linear programming problems by using only a small proportion of the original constraints.
    0 references
    binding constraints identification
    0 references
    constraint selection
    0 references
    heuristic
    0 references

    Identifiers