Approximation schemes for multi-objective optimization with quadratic constraints of fixed CP-rank

Khaled Elbassioni, Trung Thanh Nguyen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Motivated by the power allocation problem in AC (alternating current) electrical systems, we study the multi-objective (combinatorial) optimization problem where a constant number of (nonnegative) linear functions are simultaneously optimized over a given feasible set of 0-1 points defined by quadratic constraints. Such a problem is very hard to solve if no specific assumptions are made on the structure of the constraint matrices. We focus on the case when the constraint matrices are completely positive and have fixed cp-rank. We propose a polynomial-time algorithm which computes an ϵ-Pareto curve for the studied multi-objective problem when both the number of objectives and the number of constraints are fixed, for any constant ϵ > 0. This result is then applied to obtain polynomial-time approximation schemes (PTASes) for two NP-hard problems: multi-criteria power allocation and sum-of-ratios optimization.

Original languageBritish English
Title of host publicationAlgorithmic Decision Theory - 4th International Conference, ADT 2015, Proceedings
EditorsToby Walsh
PublisherSpringer Verlag
Pages273-287
Number of pages15
ISBN (Print)9783319231136
DOIs
StatePublished - 2015
Event4th International Conference on Algorithmic Decision Theory, ADT 2015 - Lexington, United States
Duration: 27 Sep 201530 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9346
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Algorithmic Decision Theory, ADT 2015
Country/TerritoryUnited States
CityLexington
Period27/09/1530/09/15

Fingerprint

Dive into the research topics of 'Approximation schemes for multi-objective optimization with quadratic constraints of fixed CP-rank'. Together they form a unique fingerprint.

Cite this