Načítá se...
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...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Hindawi Limited
2014-01-01
|
| Edice: | Mathematical Problems in Engineering |
| On-line přístup: | http://dx.doi.org/10.1155/2014/567680 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|