Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems
From MaRDI portal
Publication:5122309
DOI10.1007/978-3-030-40616-5_28zbMath1465.65049OpenAlexW3005624414MaRDI QIDQ5122309
Alessandro Cudazzo, Marco Cococcioni, Massimo Pappalardo, Yaroslav D. Sergeyev
Publication date: 22 September 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-40616-5_28
multi-objective optimizationmixed integer linear programminglexicographic optimizationnumerical infinitesimals
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Multi-objective and goal programming (90C29)
Related Items (2)
Cites Work
- Unnamed Item
- Metamathematical investigations on the theory of grossone
- Unconventional computation and natural computation. 14th international conference, UCNC 2015, Auckland, New Zealand, August 30 -- September 3, 2015. Proceedings
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Non-Archimedean game theory: a numerical approach
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Counting systems and the first Hilbert problem
- Methodology of Numerical Computations with Infinities and Infinitesimals
- A new applied approach for executing computations with infinite and infinitesimal quantities
This page was built for publication: Grossone Methodology for Lexicographic Mixed-Integer Linear Programming Problems