Linear programming is a very well known and deeply applied field of optimization theory.
One of its most famous and used algorithms is the so called Simplex algorithm …

This work aims at reviewing the state of the art of the field of lexicographic multi/many-
objective optimization. The discussion starts with a review of the literature, emphasizing the …

In the previous work (see [1]) the authors have shown how to solve a Lexicographic Multi-
Objective Linear Programming (LMOLP) problem using the Grossone methodology …

This paper introduces a new class of optimization problems, called Mixed Pareto-
Lexicographic Multi-objective Optimization Problems (MPL-MOPs), to provide a suitable …

In this paper, we deal with the computation of Lie derivatives, which are required, for
example, in some numerical methods for the solution of differential equations. One common …

This article concerns the study of mixed Pareto-lexicographic multiobjective optimization
problems where the objectives must be partitioned in multiple priority levels (PLs). A PL is a …

We consider an iterative computation of negative curvature directions, in large-scale
unconstrained optimization frameworks, needed for ensuring the convergence toward …

Numerical computing is a key part of the traditional computer architecture. Almost all
traditional computers implement the IEEE 754-1985 binary floating point standard to …

In this paper we consider the Pure and Impure Prisoner's Dilemmas. Our purpose is to
theoretically extend them when using non-Archimedean quantities and to work with them …

Zero-sum games are a well known class of game theoretic models, which are widely used in
several economics and engineering applications. It is known that any two-player finite zero …