Fractional programming with absolute-value functions

This paper considers a fractional functionals programming problem of the type: maximize z= ∑ 1 nc j|x j|+α ∑ 1 nd j|x j|+β subject to Ax=b, x is unrestricted. In general, adjacent extreme point (simplex-type) methods [Naval Res. Logist. Quart. II (1964) 135] cannot be used to solve this class of pro...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 141; číslo 1; s. 233 - 238
Hlavní autor: Chadha, S.S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 16.08.2002
Elsevier
Elsevier Sequoia S.A
Edice:European Journal of Operational Research
Témata:
Absolute value
Fractional programming
Mathematical models
Problem solving
Studies
Fractional programming
Absolute value
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í:This paper considers a fractional functionals programming problem of the type: maximize z= ∑ 1 nc j|x j|+α ∑ 1 nd j|x j|+β subject to Ax=b, x is unrestricted. In general, adjacent extreme point (simplex-type) methods [Naval Res. Logist. Quart. II (1964) 135] cannot be used to solve this class of problems. However, this work presents the conditions under which simplex-type algorithms can be used to arrive at an optimal solution for a fractional programming problem with an absolute value objective function.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/S0377-2217(01)00262-4