系数和指数与二进制数关联的几何规划问题
Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers
AI总结:
本文提出一种利用二进制数拆分成本系数、约束系数和指数的几何规划求解方法,基于对偶定理得到目标函数值,并通过两个数值例子验证。
摘要:
几何规划(GP)为解决各种优化问题提供了有力工具。在现实世界中,几何规划的许多应用是工程设计问题,其中部分问题参数是对实际值的估计。本文开发了一种使用GP技术求解非线性规划问题的求解过程,通过借助二进制数拆分成本系数、约束系数和指数。基于对偶定理,建立了等价的数学规划问题以找到目标函数的相应值。本文开发的成本系数、约束系数和指数的计算能力可能有助于在工程设计领域实现更现实的建模工作。使用标准非线性规划软件求解所提出的优化问题。给出了两个数值例子来说明该方法。
英文摘要:
Geometric programming (GP) provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP) are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve nonlinear programming problems using GP technique by splitting the cost coefficients, constraint coefficients and exponents with the help of binary numbers. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. The ability of calculating the cost coefficients, constraint coefficients and exponents developed in this paper might help lead to more realistic modeling efforts in engineering design areas. Standard nonlinear programming software has been used to solve the proposed optimization problem. Two numerical examples are presented to illustrate the method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。