Lanean...
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...
Gorde:
Egile Nagusiak: | , , |
---|---|
Formatua: | Artigo |
Hizkuntza: | Inglês |
Argitaratua: |
Hindawi Limited
2014-01-01
|
Saila: | Mathematical Problems in Engineering |
Sarrera elektronikoa: | http://dx.doi.org/10.1155/2014/567680 |
Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|