Premium
A face search heuristic algorithm for optimizing over the efficient set
Author(s) -
Benson Harold P.,
Sayin Serpil
Publication year - 1993
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199302)40:1<103::aid-nav3220400107>3.0.co;2-a
Subject(s) - heuristic , set (abstract data type) , face (sociological concept) , computer science , mathematical optimization , algorithm , linear programming , set cover problem , function (biology) , artificial intelligence , mathematics , evolutionary biology , biology , social science , sociology , programming language
The problem of optimizing a linear function over the efficient set of a multiple objective linear program is an important but difficult problem in multiple criteria decision making. In this article we present a flexible face search heuristic algorithm for the problem. Preliminary computational experiments indicate that the algorithm gives very good estimates of the global optimum with relatively little computational effort. © 1993 John Wiley & Sons, Inc.