Laddar...
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...
Sparad:
| Huvudupphovsmän: | , , |
|---|---|
| Materialtyp: | Artigo |
| Språk: | Inglês |
| Publicerad: |
Hindawi Limited
2014-01-01
|
| Serie: | Mathematical Problems in Engineering |
| Länkar: | http://dx.doi.org/10.1155/2014/567680 |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|