A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem |
| |
Authors: | Pei-Ping Shen Yun-Peng DuanYong-Gang Pei |
| |
Institution: | Department of Mathematics, Henan Normal University, Xinxiang, 453007, PR China |
| |
Abstract: | This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex–convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme where the Lagrange duality theory is used to obtain the lower bounds. As a result, the lower-bounding subproblems during the algorithm search are all ordinary linear programs that can be solved very efficiently. It has been proved that the algorithm possesses global convergence. Finally, the numerical experiments are given to show the feasibility of the proposed algorithm. |
| |
Keywords: | 90C30 90C32 65K05 |
本文献已被 ScienceDirect 等数据库收录! |
|