Multiobjective Nonlinear Sum of Fractional Optimization Problems with Nonconvex Constraints with the Use of the Duality-Based Branch and Bound Algorithm
- 2 Downloads
We study the solution of a multiobjective nonlinear sum of fractional optimization problems. A dualitybased branch and bound cut method is developed for the efficient solution of this problems. The proposed methodology is validated by proving the required theoretical assertions for the solution. The present method is an extension of the work P. P. Shen, Y. P. Duan, and Y. G. Pei [J. Comput. Appl. Math., 223, 145–158 (2009)] developed for a single-objective sum of ratios of nonlinear optimization problems. The proposed method is realized in MatLab (version 2014b). Two numerical problems are considered and solved by using the proposed method and the global optimal solution is obtained.
Unable to display preview. Download preview PDF.
- 21.L. Jin and X. P. Hou, “Global optimization for a class nonlinear sum of ratios problems,” Math. Probl. Eng., Article ID: 103569 (2014).Google Scholar
- 22.Y. Gao and S. Jin, “A global optimization algorithm for sum of linear ratios problem,” J. Appl. Math., Article ID: 276245 (2013).Google Scholar