Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem (Q1174273): Difference between revisions

An algorithm is described for generating an approximate representation of the noninferior set in the object space of biobjective mixed-integer linear programming problems. It modifies the so-called NISE-method [see the author and \textit{J. L. Cohon}, Eur. J. Oper. Res. 41, No. 3, 355-366 (1989; Zbl 0681.90071)] by using the weighted Chebyshev procedure of \textit{R. E. Steuer} and \textit{E. Choo} [Math. Program. 26, 326-344 (1983; Zbl 0506.90075)] to guide the search for noninferior points. The algorithm provides an approximation of the noninferior set with desired accuracy with as few points as possible. It is illustrated by an example of a biobjective location problem.