A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs

We present an algorithm for generating a subset of non-dominated vectors of multiple objective mixed integer linear programming. Starting from an initial non-dominated vector, the procedure finds at each iteration a new one that maximizes the infinity-norm distance from the set dominated by the prev...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 180; no. 3; pp. 1011 - 1027
Main Authors:	Sylva, John, Crema, Alejandro
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.08.2007 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Applied sciences Exact sciences and technology Integer programming Linear programming Mathematical programming Multiple objective programming Operational research and scientific management Operational research. Management science Parametric programming Studies Vector space Integer programming Multiple objective programming Parametric programming Linear programming Mixed integer programming Multiobjective programming
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!