Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem

摘要: The paper presents a finite branch-and-bound variant of an outcome-based algorithm proposed by Benson and Lee for minimizing lower-semicontinuous function over the efficient set bicriteria linear programming problem. Similarly to Benson-Lee algorithm, we work primarily in outcome space. Dissimilarly, instead constructing sequence consecutive edges space, use idea generating refining partitions covering at most two-dimensional Computational experience is also presented.