Technical Note—Parameterizing an Activity Vector in Linear Programming

Abstract

This note demonstrates that a linear programming problem in which the coefficients of one variable depend linearly on a variable parameter can be reduced to a problem in which only one coefficient depends on the variable parameter; the latter problem is relatively easy to solve.