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

Full description

Bibliographic Details

Published in:	Naval research logistics Vol. 65; no. 3; pp. 203 - 217
Main Authors:	Tohidi, G., Hassasi, H.
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.04.2018 Wiley Subscription Services, Inc
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!