Projective geometry and the outer approximation algorithm for multiobjective linear programming

Details Projective geometry and the outer approximation algorithm for multiobjective linear programming Projective geometry and the outer approximation algorithm for multiobjective linear programming

2010-06-15

arxiv.org/abs/1006.3085v1

Mathematics

Optimization and Control

27 pages, 12 figures

Scientific paper

A key problem in multiobjective linear programming is to find the set of all efficient extreme points in objective space. In this paper we introduce oriented projective geometry as an efficient and effective framework for solving this problem. The key advantage of oriented projective geometry is that we can work with an "optimally simple" but unbounded efficiency-equivalent polyhedron, yet apply to it the familiar theory and algorithms that are traditionally restricted to bounded polytopes. We apply these techniques to Benson's outer approximation algorithm, using oriented projective geometry to remove an exponentially large complexity from the algorithm and thereby remove a significant burden from the running time.

Affiliated with

Also associated with

No associations

Rating

Projective geometry and the outer approximation algorithm for multiobjective linear 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 Projective geometry and the outer approximation algorithm for multiobjective linear programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Projective geometry and the outer approximation algorithm for multiobjective linear programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99675