Загрузка...
Global Minimization for Generalized Polynomial Fractional Program
This paper is concerned with an efficient global optimization algorithm for solving a kind of fractional program problem (P), whose objective and constraints functions are all defined as the sum of ratios generalized polynomial functions. The proposed algorithm is a combination of the branch-and-bou...
Сохранить в:
| Главные авторы: | , , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
Hindawi Limited
2014-01-01
|
| Серии: | Mathematical Problems in Engineering |
| Online-ссылка: | http://dx.doi.org/10.1155/2014/567680 |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|