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...

Full description

Bibliographic Details

Published in:	Operations research letters Vol. 28; no. 2; pp. 81 - 92
Main Authors:	Q. Tuyen, Hoang, D. Muu, Le
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2001
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!