Multi-objective nonlinear sum of fractional optimization problems with non-convex constraints using duality based branch and bound algorithm
The 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 m...
Збережено в:
| Дата: | 2017 |
|---|---|
| Автори: | , , , |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Institute of Mathematics, NAS of Ukraine
2017
|
| Онлайн доступ: | https://umj.imath.kiev.ua/index.php/umj/article/view/1795 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Ukrains’kyi Matematychnyi Zhurnal |
| Завантажити файл: |  |
Репозитарії
Ukrains’kyi Matematychnyi Zhurnal| Резюме: | The 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[19] 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. |
|---|