The University of Southampton
University of Southampton Institutional Repository

Constructing approximations to the efficient set of convex quadratic multiobjective problems

Constructing approximations to the efficient set of convex quadratic multiobjective problems
Constructing approximations to the efficient set of convex quadratic multiobjective problems
In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, no single solution can adequately represent the whole set of optimal points. We propose a new efficient method for approximating the solution set of a convex quadratic multiobjective programming problem. The method is based on a warm-start interior point algorithm for which we derive complexity results, thereby extending previous results by Yildirim & Wright. Numerical results on bicriteria problems from power plant optimization and portfolio optimization show that the method is an order of magnitude faster than standard methods applied to the problems considered.
multicriteria optimization, interior-point methods, warm-start
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Heseler, Andree
93042f5a-a954-425e-8d27-eb01d005c106
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Heseler, Andree
93042f5a-a954-425e-8d27-eb01d005c106

Fliege, Jörg and Heseler, Andree (2004) Constructing approximations to the efficient set of convex quadratic multiobjective problems. Optimization Online.

Record type: Article

Abstract

In multicriteria optimization, several objective functions have to be minimized simultaneously. For this kind of problem, no single solution can adequately represent the whole set of optimal points. We propose a new efficient method for approximating the solution set of a convex quadratic multiobjective programming problem. The method is based on a warm-start interior point algorithm for which we derive complexity results, thereby extending previous results by Yildirim & Wright. Numerical results on bicriteria problems from power plant optimization and portfolio optimization show that the method is an order of magnitude faster than standard methods applied to the problems considered.

This record has no associated files available for download.

More information

Published date: 12 February 2004
Keywords: multicriteria optimization, interior-point methods, warm-start
Organisations: Operational Research

Identifiers

Local EPrints ID: 54089
URI: http://eprints.soton.ac.uk/id/eprint/54089
PURE UUID: 14c4d084-4103-4a1e-bbb3-e1fe1ce78ae6
ORCID for Jörg Fliege: ORCID iD orcid.org/0000-0002-4459-5419

Catalogue record

Date deposited: 28 Jul 2008
Last modified: 12 Dec 2021 03:40

Export record

Contributors

Author: Jörg Fliege ORCID iD
Author: Andree Heseler

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×