Problems with multiple objectives and criteria are generally known as multiple criteria
optimization or multiple criteria decision-making (MCDM) problems. So far, these types of …

In this paper, we present an algorithm for the solution of multiparametric mixed integer linear
programming (mp-MILP) problems involving (i) 0-1 integer variables, and,(ii) more than one …

This paper is devoted to the Fermat-Weber problem with mixed gauges in order to take into
account nonsymmetric distances. A geometrical description of the set of solutions is …

As asked by the editors of this special issue, the purpose of this paper is to analyze the
existing literature on multicriteria decision-aid, to bring out the successes and the difficulties …

In this article we show that the boundary of the Pareto critical set of an unconstrained
multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems …

The point-objective problem and the Weber problem are two well-known formulations for
locating a new facility with respect to a set of fixed facilities. When locations are represented …

Convex analysis plays an increasingly important role in different areas of mathematics and
its applications, especially in optimization. One of its main tools is represented by the …

Algorithms for multi-objective optimization problems are designed to generate a single
Pareto optimum (non-dominated solution) or a set of Pareto optima that reflect the …

Real-world applications of multi-objective optimization often involve numerous objective
functions. But while such problems are in general computationally intractable, it is seldom …

A multicriteria optimization problem is said to be Pareto reducible if its weakly efficient
solutions actually are efficient solutions for the problem itself or for a subproblem obtained …