最优利润下的生产资源配置研究

P. N. Ezra, E. Ossai, F. O. Ohanuba, M. Eze
{"title":"最优利润下的生产资源配置研究","authors":"P. N. Ezra, E. Ossai, F. O. Ohanuba, M. Eze","doi":"10.56557/ajomcor/2022/v29i47988","DOIUrl":null,"url":null,"abstract":"In this study, the limited resources of a production company are maximally allocated for the production of cake of different sizes for optimal profit making. The datasets used were collected on the profit made from four different sizes of the cake and on the available production resources of the company. The profits made from the various cake sizes form the objective function coefficients; the measurements of the various resources used for the production of the different sizes of the cake form the coefficients in the constraint equations while the total available resource quantities form the right hand sides of the constraint equations. The resultant linear programming problem was solved and the result showed the various quantities of the cake sizes that should be produced so as to make an optimal profit. Sensitivity analysis was carried out to determine the robustness of the formulated model.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"STUDY ON ALLOCATION OF PRODUCTION RESOURCES FOR AN OPTIMAL PROFIT MAKING\",\"authors\":\"P. N. Ezra, E. Ossai, F. O. Ohanuba, M. Eze\",\"doi\":\"10.56557/ajomcor/2022/v29i47988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this study, the limited resources of a production company are maximally allocated for the production of cake of different sizes for optimal profit making. The datasets used were collected on the profit made from four different sizes of the cake and on the available production resources of the company. The profits made from the various cake sizes form the objective function coefficients; the measurements of the various resources used for the production of the different sizes of the cake form the coefficients in the constraint equations while the total available resource quantities form the right hand sides of the constraint equations. The resultant linear programming problem was solved and the result showed the various quantities of the cake sizes that should be produced so as to make an optimal profit. Sensitivity analysis was carried out to determine the robustness of the formulated model.\",\"PeriodicalId\":200824,\"journal\":{\"name\":\"Asian Journal of Mathematics and Computer Research\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Asian Journal of Mathematics and Computer Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.56557/ajomcor/2022/v29i47988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Asian Journal of Mathematics and Computer Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.56557/ajomcor/2022/v29i47988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本研究中,生产企业将有限的资源最大限度地分配到不同规模蛋糕的生产中,以获得最优的利润。所使用的数据集收集了四种不同尺寸蛋糕的利润和公司的可用生产资源。不同蛋糕尺寸的利润构成目标函数系数;用于生产不同尺寸蛋糕的各种资源的测量值构成约束方程中的系数,而总可用资源量构成约束方程的右侧。求解了由此产生的线性规划问题,结果显示了为获得最优利润而应生产的饼尺寸的不同数量。进行敏感性分析以确定所制定模型的稳健性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
STUDY ON ALLOCATION OF PRODUCTION RESOURCES FOR AN OPTIMAL PROFIT MAKING
In this study, the limited resources of a production company are maximally allocated for the production of cake of different sizes for optimal profit making. The datasets used were collected on the profit made from four different sizes of the cake and on the available production resources of the company. The profits made from the various cake sizes form the objective function coefficients; the measurements of the various resources used for the production of the different sizes of the cake form the coefficients in the constraint equations while the total available resource quantities form the right hand sides of the constraint equations. The resultant linear programming problem was solved and the result showed the various quantities of the cake sizes that should be produced so as to make an optimal profit. Sensitivity analysis was carried out to determine the robustness of the formulated model.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信