On the computational solution of dynamic-programming processes—VIII: A bottleneck situation involving interdependent industries

An examination of the computational solution of a maximization problem arising in the study of the use of interdependent industries. Assuming proportional costs and returns, it is shown that the dimensionality of the problem can always be reduced by ...