Učitavanje...
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...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Hindawi Limited
2014-01-01
|
| Serija: | Mathematical Problems in Engineering |
| Online pristup: | http://dx.doi.org/10.1155/2014/567680 |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|