| Article ID: | iaor20122529 |
| Volume: | 6 |
| Issue: | 3 |
| Start Page Number: | 537 |
| End Page Number: | 543 |
| Publication Date: | Mar 2012 |
| Journal: | Optimization Letters |
| Authors: | Puerto Justo, Blanco Vctor |
| Keywords: | programming: multiple criteria, programming: integer |
This paper presents a new complexity result for solving multiobjective integer programming problems. We prove that encoding the entire set of nondominated solutions of the problem in a short sum of rational functions is polynomially doable, when the dimension of the decision space is fixed. This result extends a previous result presented in De Loera et al. (2009) in that there the number of the objective functions is assumed to be fixed whereas ours allows this number to vary.