2010
DOI: 10.1007/s10898-010-9541-9
|View full text |Cite
|
Sign up to set email alerts
|

Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem

Abstract: Multi-objective optimisation, Efficient solutions, Preferred solutions, Knapsack problems, Interactive procedures, Multi-criteria portfolio selection,

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…where A is de…ned by a set of constraints on weights (for example, perhaps the weight associated with population 1 may be less than or equal to the three quarters of the weight associated with population 2). As it happens, algorithms for …nding A-e¢ cient solutions to MCO problems have been an active area for research in recent years (Liesiö et al, 2007;Argyris et al, 2011).…”
Section: De…nitionmentioning
confidence: 99%
See 1 more Smart Citation
“…where A is de…ned by a set of constraints on weights (for example, perhaps the weight associated with population 1 may be less than or equal to the three quarters of the weight associated with population 2). As it happens, algorithms for …nding A-e¢ cient solutions to MCO problems have been an active area for research in recent years (Liesiö et al, 2007;Argyris et al, 2011).…”
Section: De…nitionmentioning
confidence: 99%
“…Indeed, while algorithms for multicriteria linear programs have been well-known for some time (Steuer, 1986), algorithms for multicriteria integer and combinatorial problems are very much a live research …eld (Ehrgott and Gandibleux, 2000;Alves and Clímaco, 2007). To identify the A-e¢ cient solutions for problem (14) we use a computer code which implements the algorithm described in Argyris et al (2011). The idea of the algorithm is form a single combinatorial optimisation problem with both choice of alternative x and weights A k variable, and solve multiple times, progressively cutting o¤ solutions after they have been identi…ed.…”
Section: Analysis Of the Discrete Versionmentioning
confidence: 99%
“…The second column of Table 7 shows the result of the first step of the proposed procedure (Section 3.3) for comparing portfolios. That is, the PROMETHEE V classical solution given by (6), in which, c = p = 14. The third and fourth columns correspond to results of the second step.…”
Section: C-optimum Promethee V Applicationmentioning
confidence: 99%
“…Some alternatives have positive scores (net flows) and others have negative scores. Mavrotas et al(2006) mention that this issue was not clarified in previous studies on PROMETHEE V, since all the signs of the net flow should be positive in the objective function in(6). They suggest transforming all the net flows from PROMETHEE II into non-negative scores by changing the scaling of the net flows, with the following transformation:…”
mentioning
confidence: 99%
“…Several studies have been proposed as for example in [5], [38], [39] and [49]. Often the aim is to define a new methodology to tackle these problems as in [4], [6] or [40].…”
Section: Introductionmentioning
confidence: 99%