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...

Celý popis

Podrobná bibliografia

Vydané v:	Naval research logistics Ročník 65; číslo 3; s. 203 - 217
Hlavní autori:	Tohidi, G., Hassasi, H.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken, USA John Wiley & Sons, Inc 01.04.2018 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!