TY - JOUR
AU - D. Bhati
AU - P. Singh
PY - 2017/11/25
Y2 - 2022/10/01
TI - Multi-objective nonlinear sum of fractional optimization problems
with non-convex constraints using duality based branch and bound algorithm
JF - Ukrainsâ€™kyi Matematychnyi Zhurnal
JA - Ukr. Mat. Zhurn.
VL - 69
IS - 11
SE - Research articles
DO -
UR - http://umj.imath.kiev.ua/index.php/umj/article/view/1795
AB - The present paper investigates the solution of multiobjective nonlinear sum of fractional optimization problems. A dualitybased branch and bound cut method is developed to obtain efficient solution and the methodology is validate by provingthe theoretical assertions for the solution. The present method is the extension of the work P. P. Shen, Y. P. Duan andY. G. Pei[19] which developed for single objective sum of ratios nonlinear optimization problem. The proposed method iscoded in matlab (version 2014b). Two numerical problems are considered for solving by using the proposed method andglobal optimal solution is obtained.
ER -