Implicit Treatment of “Zero or Range” Constraints in a Model for Minimum Cost Foundry Alloys
提出用混合整数规划求解铸造厂选择废合金和纯金属以最低成本生产指定成分合金的问题，通过隐式处理“零或范围”约束，将计算时间缩短三分之二。
A major problem in foundries is to select scrap alloys and pure metals in order to produce at minimum cost alloy of specified composition. We show that such problems, of realistic size, can be solved optimally by mixed-integer programming. Constraints are that the content of the alloys in various metals must be within given ranges and that the selected amount of each scrap alloy must be either zero or within a given range. The latter “zero or range” constraints can be treated implicitly in a similar way as lower and upper bounds are treated implicitly in bounded variables linear programming. Computation times for representative problems are thus reduced by a factor of three.