Solving Profit Maximization Problem in Case of the Cobb-Douglas Production Function via Weighted AG Inequality and Geometric Programming

V. Kojić, Zrinka Lukač
{"title":"Solving Profit Maximization Problem in Case of the Cobb-Douglas Production Function via Weighted AG Inequality and Geometric Programming","authors":"V. Kojić, Zrinka Lukač","doi":"10.1109/IEEM.2018.8607446","DOIUrl":null,"url":null,"abstract":"The long-run profit maximization is a standard and important problem having significant implications on a firm’s competitiveness. The common approach is to consider the profit maximization problem for production function with two inputs and use calculus to solve it. However, checking the necessary and sufficient conditions in case of more than two inputs can be difficult. Geometric programming provides a way to solve that problem for any number of inputs without the use of derivatives. Hereby the results are obtained much faster and the solution procedure is more elegant then when using calculus. Liu used the technique of signomial geometric programming to solve the problem in case of the Cobb-Douglas production function with two inputs. However, he was unable to prove that the result obtained is indeed the global maximum. Therefore, in this paper we solve the problem in question by using the weighted arithmetic-geometric inequality (WAG) in case of one input and some transformations of geometric programming in case of two or more inputs and prove that the result obtained is indeed the global optimum.","PeriodicalId":119238,"journal":{"name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2018.8607446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The long-run profit maximization is a standard and important problem having significant implications on a firm’s competitiveness. The common approach is to consider the profit maximization problem for production function with two inputs and use calculus to solve it. However, checking the necessary and sufficient conditions in case of more than two inputs can be difficult. Geometric programming provides a way to solve that problem for any number of inputs without the use of derivatives. Hereby the results are obtained much faster and the solution procedure is more elegant then when using calculus. Liu used the technique of signomial geometric programming to solve the problem in case of the Cobb-Douglas production function with two inputs. However, he was unable to prove that the result obtained is indeed the global maximum. Therefore, in this paper we solve the problem in question by using the weighted arithmetic-geometric inequality (WAG) in case of one input and some transformations of geometric programming in case of two or more inputs and prove that the result obtained is indeed the global optimum.
利用加权AG不等式和几何规划求解Cobb-Douglas生产函数的利润最大化问题
长期利润最大化是一个标准而重要的问题,对企业的竞争力有着重要的影响。一般的方法是考虑具有两种输入的生产函数的利润最大化问题,并用微积分来求解。然而,在两个以上输入的情况下,检查必要和充分条件可能是困难的。几何规划提供了一种方法来解决这个问题的任意数量的输入,而不使用导数。这样得到的结果比用微积分得到的结果要快得多,求解过程也更简洁。Liu利用符号几何规划技术解决了具有两个输入的Cobb-Douglas生产函数的问题。然而,他无法证明所得到的结果确实是全局最大值。因此,本文利用单输入情况下的加权算术几何不等式(WAG)和双或多输入情况下的几何规划的一些变换来解决该问题,并证明所得到的结果确实是全局最优的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信