Wird geladen...
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...
Gespeichert in:
Hauptverfasser: | , , |
---|---|
Format: | Artigo |
Sprache: | Inglês |
Veröffentlicht: |
Hindawi Limited
2014-01-01
|
Schriftenreihe: | Mathematical Problems in Engineering |
Online Zugang: | http://dx.doi.org/10.1155/2014/567680 |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|