An implementation of the simplex method for linear programming problems with variable upper bounds

Abstract

Special methods for dealing with constraints of the form xj≤ xk, called variable upper bounds, were introduced by Schrage. Here we describe a method that circumvents the massive degeneracy inherent in these constraints and show how it can be implemented using triangular basis factorizations. © 1982 The Mathematical Programming Society, Inc.