Programming Variable Factors

Abstract

A duality theory and two computational algorithms are developed for variable-factor programming, a name given to linear programming when the profit coefficients are functionally dependent upon a program of variable-factor inputs in limited supply. Computational experience is reported for one of the algorithms. An interesting and useful feature of the dual problem is that it is a concave programming problem, whereas the primal problem is not.