Programming Variable Factors

Published Online:https://doi.org/10.1287/mnsc.13.1.144

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.