Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a cond...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Naval research logistics Jg. 65; H. 3; S. 203 - 217
Hauptverfasser:	Tohidi, G., Hassasi, H.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken, USA John Wiley & Sons, Inc 01.04.2018 Wiley Subscription Services, Inc
Schlagworte:	adjacency affine independence Algorithms Computation Convexity efficient face Linear programming multiobjective linear programming Multiple objective analysis Search methods top‐down search strategy
ISSN:	0894-069X, 1520-6750
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!