肠衣搭配的整数规划模型

An Integer Programming Model of Casing Collocation Problem

为了提高原材料的利用率,建立了肠衣搭配问题的双目标整数规划模型,利用LINGO求得大规格肠衣成品的最大捆数及具体的搭配方案,改进了相关研究的结果。

A double objective integer programming model for the casings match is established, and the maximum number of large size product and collocation method is obtained by using LINGO, which improves the results of the relevant research.