Geometric Duality for Convex Vector Optimization Problems

Details Geometric Duality for Convex Vector Optimization Problems Geometric Duality for Convex Vector Optimization Problems

2011-09-16

arxiv.org/abs/1109.3592v1

Mathematics

Optimization and Control

21 pages

Scientific paper

Geometric duality theory for multiple objective linear programming problems
turned out to be very useful for the development of efficient algorithms to
generate or approximate the whole set of nondominated points in the outcome
space. This article extends the geometric duality theory to convex vector
optimization problems.

Affiliated with

Also associated with

No associations

Rating

Geometric Duality for Convex Vector Optimization Problems 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 Geometric Duality for Convex Vector Optimization Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric Duality for Convex Vector Optimization Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534878