An Algorithm for Approximating High-Order Pareto Frontier in Multiobjective Integer Linear Problems

An algorithm for approximating the Pareto frontier (PF) in multiobjective integer linear problems is presented. As known, the feasible set in the objective space (FSOS) for an integer linear programming problem is not convex and only a few points of its Pareto frontier (so called supported points) c...

Full description

Bibliographic Details
Main Author: Bushenkov, Vladimir (author)
Other Authors: Fernandes, Manuela (author)
Format: lecture
Language:eng
Published: 2012
Subjects:
Multiobjective optimization
Pareto frontier
Integer Linear Programming
Online Access:http://hdl.handle.net/10174/4543
Country:Portugal
Oai:oai:dspace.uevora.pt:10174/4543

Internet

http://hdl.handle.net/10174/4543

Similar Items