Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming

George Mavrotas

doi:10.1016/j.amc.2005.01.038

2005-12-01

PRE

George Mavrotas *

D. Diakoulaki

DOI：10.1016/j.amc.2005.01.038

原文链接

原文求助

摘要

En 中文

The paper describes the Multi-Criteria Branch and Bound (MCBB) algorithm. a vector maximization algorithm capable of deriving all efficient extreme points, for small and medium-sized Mixed 0-1 Multiple Objective Linear Programming (Mixed 0-1 MOLP). Particular emphasis is given to computational aspects aiming principally at accelerating the solution procedure. For facilitating the decision maker's search toward the most preferred efficient solution, the notion of efficient combinations of the binary variables is further exploited. It is also shown that the MCBB algorithm can be used in single objective problems (Mixed Integer LP problems) in order to determine all alternative optima, as well as in Mixed Integer MOLP problems and Pure 0-1 MOLP problems that frequently arise in practice. A computational experiment is included in the paper in order to illustrate the performance of the algorithm. (c) 2005 Elsevier Inc. All rights reserved.

Keyword:

multiple objective programming

mixed integer programming

branch and bound

期刊

Applied Mathematics and Computation

IF:

3.4

论文数:

2.3W

被引数:

3.3W

机构

暂无机构信息

引用论文

Three-Year Intervention Effects on Food and Beverage Intake—Results from the Quasi-Experimental Copenhagen School Child Intervention Study (CoSCIS)

International Journal of Environmental Research and Public Health

IF0

2021-10-08

OAAI

Xuan Ren; Britt Wang Jensen; Sofus Christian Larsen; Jeanett Friis Rohde; Ina Olmer Specht; Birgit Marie Nielsen; Ida Husby; Anna Bugge; Lars Bo Andersen; Ellen Trolle; Berit Lilienthal Heitmann

Sympathetic cross-innervation of SHR and genetic controls suggests a trophic influence on vascular muscle membranes.

Circulation Research

IF0

1981-12-01