The Big-M method with the numerical infinite M

M Cococcioni, L Fiaschi - Optimization Letters, 2021 - Springer
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 …

Pure and mixed lexicographic-paretian many-objective optimization: state of the art

L Lai, L Fiaschi, M Cococcioni, K Deb - Natural Computing, 2023 - Springer
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 …

Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives

YD Sergeyev, MC Nasso, MS Mukhametzhanov… - … of Computational and …, 2021 - Elsevier
Lipschitz global optimization is an important research field with numerous applications in
engineering, electronics, machine learning, optimal decision making, etc. In many of these …

Solving mixed Pareto-Lexicographic multi-objective optimization problems: The case of priority chains

L Lai, L Fiaschi, M Cococcioni - Swarm and Evolutionary Computation, 2020 - Elsevier
This paper introduces a new class of optimization problems, called Mixed Pareto-
Lexicographic Multi-objective Optimization Problems (MPL-MOPs), to provide a suitable …

Computation of higher order Lie derivatives on the Infinity Computer

F Iavernaro, F Mazzia, MS Mukhametzhanov… - … of Computational and …, 2021 - Elsevier
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 …

Spherical separation with infinitely far center

A Astorino, A Fuduli - Soft Computing, 2020 - Springer
We tackle the problem of separating two finite sets of samples by means of a spherical
surface, focusing on the case where the center of the sphere is fixed. Such approach …

Solving the fully fuzzy multi-objective transportation problem based on the common set of weights in DEA

M Bagheri, A Ebrahimnejad… - Journal of Intelligent …, 2020 - content.iospress.com
A transportation problem basically deals with the problem which aims to minimize the total
transportation cost or maximize the total transportation profit of distributing a product from a …

Solving mixed pareto-lexicographic multiobjective optimization problems: the case of priority levels

L Lai, L Fiaschi, M Cococcioni… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
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 …

Iterative grossone-based computation of negative curvature directions in large-scale optimization

R De Leone, G Fasano, M Roma… - Journal of Optimization …, 2020 - Springer
We consider an iterative computation of negative curvature directions, in large-scale
unconstrained optimization frameworks, needed for ensuring the convergence toward …

Representation of grossone-based arithmetic in simulink for scientific computing

A Falcone, A Garro, MS Mukhametzhanov… - Soft Computing, 2020 - Springer
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 …