On the posynomial fractional programming problems

The posynomial fractional programming (PFP) problem arises from the summation minimization of several quotient terms, which are composed of posynomial terms appearing in the objective function subject to given posynomial constraints. This paper proposes an approximate approach to solving a PFP probl...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 143; číslo 1; s. 42 - 52
Hlavní autor: Chang, Ching-Ter
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.11.2002
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Fractional programming
Goal programming
Linear programming
Operations research
Optimization
Piecewise linear function
Posynomial
Studies
Posynomial
Piecewise linear function
Fractional programming
Goal programming
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The posynomial fractional programming (PFP) problem arises from the summation minimization of several quotient terms, which are composed of posynomial terms appearing in the objective function subject to given posynomial constraints. This paper proposes an approximate approach to solving a PFP problem. A linear programming relaxation is derived for the problem based on piecewise linearization techniques, which first convert a posynomial term into the sum of absolute terms; these absolute terms are then linearized by some linearization techniques. The proposed approach could reach a solution as close as possible to a global optimum.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00331-9