Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology

DOI10.1016/j.cnsns.2020.105177zbMath1451.90140OpenAlexW3000250712MaRDI QIDQ2204444

Alessandro Cudazzo, Yaroslav D. Sergeyev, Massimo Pappalardo, Marco Cococcioni

Publication date: 15 October 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2020.105177

zbMATH Keywords

multi-objective optimizationmixed integer linear programminglexicographic optimizationnumerical infinitesimalsgrossone methodology

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items

Simulation of hybrid systems under Zeno behavior using numerical infinitesimals ⋮ Non-standard analysis revisited: an easy axiomatic presentation oriented towards numerical applications ⋮ Novel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shells ⋮ On the use of the infinity computer architecture to set up a dynamic precision floating-point arithmetic ⋮ A constructive sequence algebra for the calculus of indications ⋮ On the topological convergence of multi-rule sequences of sets and fractal patterns ⋮ Spherical separation with infinitely far center ⋮ Observability in the univalent universe ⋮ Lower and upper estimates of the quantity of algebraic numbers ⋮ Iterative grossone-based computation of negative curvature directions in large-scale optimization ⋮ A new cutting plane method for lexicographic multi-objective integer linear programming ⋮ Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives ⋮ Computation of higher order Lie derivatives on the infinity computer ⋮ Generalizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal Quantities ⋮ Noise-induced kinetic transition in two-component environment ⋮ The big-M method with the numerical infinite \(M\) ⋮ Computationally efficient approach for solving lexicographic multicriteria optimization problems ⋮ Unnamed Item ⋮ Non-Archimedean game theory: a numerical approach ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ Non-Archimedean zero-sum games ⋮ The algorithmic numbers in non-Archimedean numerical computing environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metamathematical investigations on the theory of grossone
• Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
• Boolean lexicographic optimization: algorithms \& applications
• The use of grossone in mathematical programming and operations research
• Computing sums of conditionally convergent and divergent series using the concept of grossone
• Interpretation of percolation in terms of infinity computations
• Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
• Higher order numerical differentiation on the infinity computer
• Fibonacci words, hyperbolic tilings and grossone
• Taking the Pirahã seriously
• Using grossone to count the number of elements of infinite sets and the connection with bijections
• Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
• Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
• The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
• On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
• The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system
• A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
• Non-Archimedean game theory: a numerical approach
• Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
• Non-convex multi-objective optimization
• Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
• Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
• Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
• Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
• The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
• Counting systems and the first Hilbert problem
• Methodology of Numerical Computations with Infinities and Infinitesimals
• A Study of Mathematical Determination through Bertrand’s Paradox

This page was built for publication: Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology