Pareto Optima of Multicriteria Integer Linear Programs

Details Pareto Optima of Multicriteria Integer Linear Programs Pareto Optima of Multicriteria Integer Linear Programs

2007-07-10

arxiv.org/abs/0707.1362v1

Mathematics

Optimization and Control

17 pages, 1 figure

Scientific paper

We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and of the outcome space are considered fixed constants. In particular we construct: 1. polynomial-time algorithms to exactly determine the number of Pareto optima and Pareto strategies; 2. a polynomial-space polynomial-delay prescribed-order enumeration algorithm for arbitrary projections of the Pareto set; 3. an algorithm to minimize the distance of a Pareto optimum from a prescribed comparison point with respect to arbitrary polyhedral norms; 4. a fully polynomial-time approximation scheme for the problem of minimizing the distance of a Pareto optimum from a prescribed comparison point with respect to the Euclidean norm.

Affiliated with

Also associated with

No associations

Rating

Pareto Optima of Multicriteria Integer Linear Programs 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 Pareto Optima of Multicriteria Integer Linear Programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pareto Optima of Multicriteria Integer Linear Programs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453336