This paper presents a new possibilistic programming approach to the portfolio selection problem. It is based on two issues: the approximation of the rates of return on securities by means of fuzzy numbers of trapezoidal form, for which we use the interval-valued ex-pectation defined by Dubois...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...

The generalized assignment problem (GAP) examines the maximum profit assignment of jobs to processors such that each job is assigned to precisely one processor subject to capacity restrictions on the processors. Due to the fact that the GAP is an NP-hard integer program dual prices are not...

The multiple-choice nested knapsack problem (MCKP) is a generalization of the ordinary knapsack problem, where the set of items is partitioned into classes. The binary choice of selecting an item is replaced by taking exactly one item out of each class of items. Due to the fact that the MCKP is...

An allocation's ordinal efficiency deficit (OED) is defined as the greatest ordinal efficiency loss that can result from its application. More precisely, an allocation's OED is the negative of the greatest total amount by which it may be stochastically dominated by another feasible allocation....