Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm

From MaRDI portal
Publication:2422877

DOI10.1016/j.amc.2017.05.058zbMath1426.90226OpenAlexW2620873085MaRDI QIDQ2422877

Massimo Pappalardo, Yaroslav D. Sergeyev, Marco Cococcioni

Publication date: 21 June 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11568/877746




Related Items (32)

Simulation of hybrid systems under Zeno behavior using numerical infinitesimalsSome paradoxes of infinity revisitedNovel first and second order numerical differentiation techniques and their application to nonlinear analysis of Kirchhoff-Love shellsA constructive sequence algebra for the calculus of indicationsThe use of grossone in elastic net regularization and sparse support vector machinesCounting and optimising maximum phylogenetic diversity setsA Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation ProblemObservability in the univalent universeInfinite numerical computing applied to Hilbert's, Peano's, and Moore's curvesAn iterated greedy algorithm for the planning of yarn‐dyeing boilersForeword to the special issue ``Recent trends in numerical computations: theory and algorithmsIterative grossone-based computation of negative curvature directions in large-scale optimizationA lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardinessA new cutting plane method for lexicographic multi-objective integer linear programmingNovel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivativesComputation of higher order Lie derivatives on the infinity computerSolving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodologyOn strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scalesGrossone Methodology for Lexicographic Mixed-Integer Linear Programming ProblemsInfinite Games on Finite Graphs Using GrossoneA Simulink-Based Infinity Computer Simulator and Some ApplicationsGeneralizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal QuantitiesNoise-induced kinetic transition in two-component environmentThe big-M method with the numerical infinite \(M\)Computationally efficient approach for solving lexicographic multicriteria optimization problemsConjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computerNon-Archimedean game theory: a numerical approachA Simulink-based software solution using the infinity computer methodology for higher order differentiationNon-Archimedean zero-sum gamesIndependence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the oppositeSecurity games over lexicographic ordersThe algorithmic numbers in non-Archimedean numerical computing environments



Cites Work


This page was built for publication: Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm