材料切割优化问题的特殊解法  

Material Cutting Optimization Question Special Solution

作　　者：施佳琦[1] 魏祖宽[2] 

机构地区：[1]电子科技大学软件学院,四川成都610054 [2]电子科技大学计算机科学与工程学院,四川成都610054

出　　处：《计算机与现代化》2010年第3期173-175,共3页Computer and Modernization

摘　　要：材料切割优化问题是平时生活中经常会碰到的一类问题。所谓"材料切割"就是采用切割的办法对具有一定形状和尺寸的型材、板材进行利用。为了节省材料,必须选用合适的切割方案使得用料最少。对于大规模的材料切割问题,本文用解有限列子问题的方法逐步逼近问题的最优解(列生成法)。最后,把一维材料切割模型推广到更一般的情况。The material cutting optimization question is a kind of questing which usually appears in life. So-called material cutting means to have sections and plates to certain shape and size with using cutting way. In order to save materials, the appropriate cutting plan must be selected to make consumed the least materials. Regarding the large-scale material cutting question, this paper gradually＇ approximates the problem＇ s optimal solution with the way of solving the limited row subprohlems （ a row generator method）. Finally, tiffs paper promotes the unidimensional material cutting model to a more common situation.

关 键 词：材料切割 大规模线性规划 列生成法 推广 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]