Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem

We formulate the problem of optimizing a convex function over the weakly efficient set of a multicriteria affine fractional program as a special biconvex problem. We propose a decomposition algorithm for solving the latter problem. The proposed algorithm is a branch-and-bound procedure taking into a...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 28; číslo 2; s. 81 - 92
Hlavní autori: Q. Tuyen, Hoang, D. Muu, Le
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.03.2001
Predmet:
Affine fractional
Biconvex programming
Decomposition
Optimization over the weakly efficient set
Weakly efficient
Optimization over the weakly efficient set
Biconvex programming
Decomposition
Weakly efficient
Affine fractional
ISSN:0167-6377, 1872-7468
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We formulate the problem of optimizing a convex function over the weakly efficient set of a multicriteria affine fractional program as a special biconvex problem. We propose a decomposition algorithm for solving the latter problem. The proposed algorithm is a branch-and-bound procedure taking into account the affine fractionality of the criterion functions.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(01)00052-9