The main issue in the present article is to investigate how to solve a mixed integer fractional signomial geometric programing problem (MIFSGP). In the first step to achieving this idea, we must convert a fractional signomial programing problem into a non-fractional problem via a simple conversion technique. Then, a convex relaxation with a new modified piecewise linear approximation with integer break points as a pre-solve method is used to reach an integer global optimum solution. A few numerical examples are included to illustrate the advantages of the proposed method

中文翻译：

---

混合整数符号分式规划问题的全局优化

本文的主要问题是研究如何解决混合整数分数符号几何规划问题（MIFSGP）。实现这一想法的第一步，我们必须通过简单的转换技术将分数符号规划问题转换为非分数问题。然后，使用带有整数断点的新修正分段线性近似的凸松弛作为预求解方法来达到整数全局最优解。包括一些数值例子来说明所提出方法的优点