This paper deals with a class of biobjectivemixedbinary linear programs having a multiple-choice constraint, which are found in applications such as Pareto set-reduction problems, single-supplier selection, and inve...
详细信息
This paper deals with a class of biobjectivemixedbinary linear programs having a multiple-choice constraint, which are found in applications such as Pareto set-reduction problems, single-supplier selection, and investment decisions, among others. Two objective space-search algorithms are presented. The first algorithm, termed line search and linear programming filtering, is a two-phase procedure. Phase 1 searches for supported Pareto outcomes using the parametric weighted sum method, and Phase 2 searches for unsupported Pareto outcomes by solving a sequence of auxiliary mixedbinary linear programs. An effective linear programming filtering procedure excludes arty previous outcomes found to be dominated. The second algorithm, termed linear programming decomposition and filtering, decomposes the mixedbinary problem by iteratively fixing binary variables and uses the linear programming filtering procedure to prune out any dominated outcomes. Computational experiments show the effectiveness of the linear programming filtering and suggest that both algorithms run faster than existing general-purpose objective space-search procedures.
暂无评论