产品组合问题的优化模型

A. Butrat, S. Supsomboon
{"title":"产品组合问题的优化模型","authors":"A. Butrat, S. Supsomboon","doi":"10.1109/RI2C48728.2019.8999930","DOIUrl":null,"url":null,"abstract":"This research offers the optimization model, which is Pure integer linear programming (PILP), to solve the product mix problem based-on resources of time. The objective function is to maximize profit. The production volumes are the decision variable and have defined by using the resource of time and demand. Lingo 11 had been used to solve problems. The result from model validation, the mathematical model can provide the decision variable of the number of production volume as many as the result of calculating the bottleneck","PeriodicalId":404700,"journal":{"name":"2019 Research, Invention, and Innovation Congress (RI2C)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Optimization Model for Product Mix Problem\",\"authors\":\"A. Butrat, S. Supsomboon\",\"doi\":\"10.1109/RI2C48728.2019.8999930\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This research offers the optimization model, which is Pure integer linear programming (PILP), to solve the product mix problem based-on resources of time. The objective function is to maximize profit. The production volumes are the decision variable and have defined by using the resource of time and demand. Lingo 11 had been used to solve problems. The result from model validation, the mathematical model can provide the decision variable of the number of production volume as many as the result of calculating the bottleneck\",\"PeriodicalId\":404700,\"journal\":{\"name\":\"2019 Research, Invention, and Innovation Congress (RI2C)\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Research, Invention, and Innovation Congress (RI2C)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RI2C48728.2019.8999930\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Research, Invention, and Innovation Congress (RI2C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RI2C48728.2019.8999930","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了基于时间资源的产品组合优化模型——纯整数线性规划(PILP)。目标函数是利润最大化。产量是决策变量,是利用时间和需求资源来定义的。语言被用来解决问题。模型验证的结果表明,该数学模型可以提供与瓶颈计算结果一样多的产量决策变量
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Optimization Model for Product Mix Problem
This research offers the optimization model, which is Pure integer linear programming (PILP), to solve the product mix problem based-on resources of time. The objective function is to maximize profit. The production volumes are the decision variable and have defined by using the resource of time and demand. Lingo 11 had been used to solve problems. The result from model validation, the mathematical model can provide the decision variable of the number of production volume as many as the result of calculating the bottleneck
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信