Linear Programming with Relative Bounded Variables

Abstract

Linear programming problems with simple upper and lower bounds on the variables have been well explored. Here we investigate the problems containing a system of relative lower bounds and/or relative upper bounds. We suggest computational procedures that exploit the special triangular structure of these constraints.