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

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.