Optimization Online


A Decision Space Algorithm for Multiobjective Convex Quadratic Integer Optimization

Marianna De Santis (marianna.desantis***at***uniroma1.it)
Gabriele Eichfelder (Gabriele.Eichfelder***at***tu-ilmenau.de)

Abstract: We present a branch-and-bound algorithm for minimizing multiple convex quadratic objective functions over integer variables. Our method looks for efficient points by fixing subsets of variables to integer values and by using lower bounds in the form of hyperplanes in the image space derived from the continuous relaxations of the restricted objective functions. We show that the algorithm stops after finitely many fixings of variables with detecting both the full efficient and the nondominated set of multiobjective strictly convex quadratic integer problems. A major advantage of the approach is that the expensive calculations are done in a preprocessing phase so that the nodes in the branch-and-bound tree can be enumerated fast. We show numerical experiments on biobjective instances and on instances with three and four objectives.

Keywords: Multiobjective Optimization, Convex Quadratic Optimization, Integer Quadratic Programming, Branch-and-Bound Algorithm

Category 1: Other Topics (Multi-Criteria Optimization )

Category 2: Integer Programming ((Mixed) Integer Nonlinear Programming )


Download: [PDF]

Entry Submitted: 07/02/2020
Entry Accepted: 07/02/2020
Entry Last Modified: 07/03/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society