Short Rational Generating Functions For Multiobjective Linear Integer Programming

Details Short Rational Generating Functions For Multiobjective Linear Integer Programming Short Rational Generating Functions For Multiobjective Linear Integer Programming

2007-12-27

arxiv.org/abs/0712.4295v3

Mathematics

Optimization and Control

18 pages

Scientific paper

This paper presents algorithms for solving multiobjective integer programming problems. The algorithm uses Barvinok's rational functions of the polytope that defines the feasible region and provides as output the entire set of nondominated solutions for the problem. Theoretical complexity results on the algorithm are provided in the paper. Specifically, we prove that encoding the entire set of nondominated solutions of the problem is polynomially doable, when the dimension of the decision space is fixed. In addition, we provide polynomial delay algorithms for enumerating this set. An implementation of the algorithm shows that it is useful for solving multiobjective integer linear programs.

Affiliated with

Also associated with

No associations

Rating

Short Rational Generating Functions For Multiobjective Linear Integer Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Short Rational Generating Functions For Multiobjective Linear Integer Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Short Rational Generating Functions For Multiobjective Linear Integer Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508035