Redundant constraints are constraints that can be omitted from a system of linear constraints without changing the feasible region. Implicit equalities are inequality constraints that can be replaced ...

In this paper a unified treatment of algorithms is described for linear programming methods based on the central path. This path is a curve along which the cost decreases, and that stays always far ...