The Big-M method with the numerical infinite M
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 …
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
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 …
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
Lipschitz global optimization is an important research field with numerous applications in
engineering, electronics, machine learning, optimal decision making, etc. In many of these …
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
This paper introduces a new class of optimization problems, called Mixed Pareto-
Lexicographic Multi-objective Optimization Problems (MPL-MOPs), to provide a suitable …
Lexicographic Multi-objective Optimization Problems (MPL-MOPs), to provide a suitable …
Computation of higher order Lie derivatives on the Infinity Computer
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 …
example, in some numerical methods for the solution of differential equations. One common …
Spherical separation with infinitely far center
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 …
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 …
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
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 …
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
We consider an iterative computation of negative curvature directions, in large-scale
unconstrained optimization frameworks, needed for ensuring the convergence toward …
unconstrained optimization frameworks, needed for ensuring the convergence toward …
Representation of grossone-based arithmetic in simulink for scientific computing
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 …
traditional computers implement the IEEE 754-1985 binary floating point standard to …