.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In a preceding paper Jacobsen [Jacobsen, S. 1971. On marginal allocation in single constraint min-max problems. Management Sci. (July).] shows that marginal allocation solves a class of discrete, single constraint, min-max allocation problems. A dual approach, to this problem is presented, based on a generalization of Jacobsen's P condition, which should prove more efficient when many marginal improvement iterations would be required. A variant of sequential search by bisection is applied, possibly augmented by an accelerated marginal allocation scheme, in which finite convergence to an optimum solution is guaranteed.
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息