| 天然肠衣搭配优化模型 |
| |
| 引用本文： | 孙光助,张嵘,吴和木.天然肠衣搭配优化模型[J].南通职业大学学报,2012,26(1):69-71,80. |
| |
| 作者姓名： | 孙光助 张嵘 吴和木 |
| |
| 作者单位： | 南京工业职业技术学院,江苏南京,210046 |
| |
| 摘 要： | 讨论了多种长度原料的最优搭配问题。首先根据成品规格和原料数据,通过总数除法确定成品数量的上限和成品结构的限制,明确优化目标;其次逐步衔接,建立多个线性规划模型,在原料数量、成品总长、成品构成的约束条件下,最小化原料总数或最大化成品数量;最后经计算机软件运行,得到最佳搭配方案。
|
| 关 键 词： | 天然肠衣 优化模型 搭配方案 上限值 |
Optimized Model of the Match of Natural Casings |
| |
| SUN Guang-zhu
,
ZHANG Rong
,
WU He-mu.Optimized Model of the Match of Natural Casings[J].Journal of Nantong Vocational College,2012,26(1):69-71,80. |
| |
| Authors: | SUN Guang-zhu ZHANG Rong WU He-mu |
| |
| Institution: | (Nanjing Institute of Industry Technology,Nanjing 210046,China) |
| |
| Abstract: | This paper discusses the best matching program of varieties of raw materials with different length.First of all,according to the finished product specifications and raw data,it defines the maximum number of finished products and their structural limitations by the total number of division and identifies a clear optimization goal;secondly,many linear programming models are established by gradual convergence,and,under the limit of raw material number,length of the finished product,as well as their structures,it minimizes the total number or maximizes the amount of goods;finally,the best program is obtained through computer software. |
| |
| Keywords: | natural casings optimized model match program upper limit |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
