期刊名称：Lecture Notes in Engineering and Computer Science
印刷版ISSN：2078-0958
电子版ISSN：2078-0966
出版年度：2022
卷号：52
期号：1
语种：English
出版社：Newswood and International Association of Engineers
摘要：For solving linear multiplicative programming(P0), a global optimization algorithm is proposed in this paper.First, by using logarithmic transformation, we equivalentlytransform problem (P0) into an problem (P). Then, a mixedinteger convex programming problem (M) is derived basedon piecewise linear approximation for nonconvex part of theobjective function in (P), which is a convex approximation of(P). Finally, by solving the problem (M), an ϵ-global optimumof (P0) can be acquired. The numerical results verify thefeasibility and effectiveness of this method.
