In this paper, we present a link between preference-based and multiobjective sequential decision-making. While transforming a multiobjective problem to a preference-based one is quite natural, the other direction is a bit less obvious. We present how this transformation (from preferencebased to multiobjective) can be done under the classic condition that preferences over histories can be repres...

The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...

Through multiobjectivization, a single-objective problem is restated in multiobjective form with the aim of enabling a more efficient search process. Recently, this transformation was applied with success to the hydrophobic-polar (HP) lattice model, which is an abstract representation of the protein structure prediction problem. The use of alternative multiobjective formulations of the problem ...

In this paper, I view and present the multiobjective discrete optimisation problem as a particular case of disjunctive programming where one seeks to identify efficient solutions from within a disjunction formed by a set of systems. The proposed approach lends itself to a simple yet effective iterative algorithm that is able to yield the set of all nondominated points, both supported and nonsup...

Every real-life optimization problem with uncertainty and hesitation can not be a single objective, consequently, class of multiobjective linear problems (MOLOP) appears in the literature. Further, experts assign values uncertain parameters, expert’s opinions about parameters are conflicting nature. There concerning methods based on fuzzy sets, or their other versions available literature that ...