An efficient interior-point method for convex multicriteria optimization problems
An efficient interior-point method for convex multicriteria optimization problems
In multicriteria optimization, several objective functions have to be minimized simultaneously. We propose a new efficient method for approximating the solution set of a multicriteria optimization problem, where the objective functions involved are arbitrary convex functions and the set of feasible points is convex. The method is based on generating warm-start points for an efficient interior-point algorithm, while the approximation computed consists of a finite set of discrete points. Polynomial-time complexity results for the method proposed are derived. In these estimates, the number of operations per point decreases when the number of points generated for the approximation increases. This reduced theoretical complexity estimate is a novel feature and is not observed in standard solution techniques for multicriteria optimization problems.
convex multicriteria optimization, interior point, polynomial time
825-845
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
November 2006
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Fliege, Jörg
(2006)
An efficient interior-point method for convex multicriteria optimization problems.
Mathematics of Operations Research, 31 (4), .
(doi:10.1287/moor.1060.0221).
Abstract
In multicriteria optimization, several objective functions have to be minimized simultaneously. We propose a new efficient method for approximating the solution set of a multicriteria optimization problem, where the objective functions involved are arbitrary convex functions and the set of feasible points is convex. The method is based on generating warm-start points for an efficient interior-point algorithm, while the approximation computed consists of a finite set of discrete points. Polynomial-time complexity results for the method proposed are derived. In these estimates, the number of operations per point decreases when the number of points generated for the approximation increases. This reduced theoretical complexity estimate is a novel feature and is not observed in standard solution techniques for multicriteria optimization problems.
This record has no associated files available for download.
More information
Published date: November 2006
Keywords:
convex multicriteria optimization, interior point, polynomial time
Organisations:
Operational Research
Identifiers
Local EPrints ID: 48858
URI: http://eprints.soton.ac.uk/id/eprint/48858
ISSN: 0364-765X
PURE UUID: ec902ced-e061-4d88-ab4b-be395edc9ce2
Catalogue record
Date deposited: 16 Oct 2007
Last modified: 16 Mar 2024 03:57
Export record
Altmetrics
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
