Multi-objective nonlinear sum of fractional optimization problems with non-convex constraints using duality based branch and bound algorithm
AbstractThe present paper investigates the solution of multiobjective nonlinear sum of fractional optimization problems. A duality based branch and bound cut method is developed to obtain efficient solution and the methodology is validate by proving the theoretical assertions for the solution. The present method is the extension of the work P. P. Shen, Y. P. Duan and Y. G. Pei which developed for single objective sum of ratios nonlinear optimization problem. The proposed method is coded in matlab (version 2014b). Two numerical problems are considered for solving by using the proposed method and global optimal solution is obtained.
How to Cite
Bhati, D., and P. Singh. “Multi-Objective Nonlinear Sum of Fractional Optimization problems with Non-Convex Constraints Using Duality Based Branch and Bound Algorithm”. Ukrains’kyi Matematychnyi Zhurnal, Vol. 69, no. 11, Nov. 2017, pp. 1455-71, https://umj.imath.kiev.ua/index.php/umj/article/view/1795.