Improved criteria for identifying optimal basic and nonbasic variables in LP
We derive new criteria for identifying whether a variable is basic or nonbasic at each optimal solution of a LP. Our criteria, stronger than those derived recently by Ye and Todd, can be combined with the central path-following algorithm.
basic and nonbasic variables optimal solution linear programming computational efficiency primal-dual ellipsoids