טוען...
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...
שמור ב:
| Main Authors: | , , |
|---|---|
| פורמט: | Artigo |
| שפה: | Inglês |
| יצא לאור: |
Hindawi Limited
2014-01-01
|
| סדרה: | Mathematical Problems in Engineering |
| גישה מקוונת: | http://dx.doi.org/10.1155/2014/567680 |
| תגים: |
הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|