Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
From MaRDI portal
Recommendations
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Pareto-optimal and lexicographic solutions to mixed-integer problems of linear form in continuous variables
- A dual-based algorithm for solving lexicographic multiple objective programs
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multi-objective branch and bound
Cites work
- A classification of two-dimensional cellular automata using infinite computations
- A generalized Taylor method of order three for the solution of initial value problems in standard and infinity floating-point arithmetic
- A study of mathematical determination through Bertrand's paradox
- Boolean lexicographic optimization: algorithms \& applications
- Compendious lexicographic method for multi-objective optimization
- Computing sums of conditionally convergent and divergent series using the concept of grossone
- Conjugate-symplecticity properties of Euler-Maclaurin methods and their implementation on the infinity computer
- Counting systems and the first Hilbert problem
- Fibonacci words, hyperbolic tilings and grossone
- Higher order numerical differentiation on the infinity computer
- scientific article; zbMATH DE number 2129479 (Why is no real title available?)
- scientific article; zbMATH DE number 6159475 (Why is no real title available?)
- Independence of the grossone-based infinity methodology from non-standard analysis and comments upon logical fallacies in some texts asserting the opposite
- Interpretation of percolation in terms of infinity computations
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Metamathematical investigations on the theory of grossone
- Methodology of Numerical Computations with Infinities and Infinitesimals
- Multi-objective optimization using evolutionary algorithms
- Non-Archimedean game theory: a numerical approach
- Non-convex multi-objective optimization
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems
- Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains
- On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales
- Planar methods and grossone for the conjugate gradient breakdown in nonlinear programming
- Solving ordinary differential equations on the Infinity Computer by working with infinitesimals numerically
- Taking the Pirahã seriously
- The exact (up to infinitesimals) infinite perimeter of the Koch snowflake and its finite area
- The exact measures of the Sierpiński \(d\)-dimensional tetrahedron in connection with a Diophantine nonlinear system
- The Sierpinski curve viewed by numerical computations with infinities and infinitesimals
- The use of grossone in mathematical programming and operations research
- Using grossone to count the number of elements of infinite sets and the connection with bijections
Cited in
(26)- Non-Archimedean zero-sum games
- The algorithmic numbers in non-Archimedean numerical computing environments
- 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
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- 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
- 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
- Non-Archimedean game theory: a numerical approach
- A Simulink-based software solution using the infinity computer methodology for higher order differentiation
- Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm
- Observability in the univalent universe
- Lower and upper estimates of the quantity of algebraic numbers
- scientific article; zbMATH DE number 7614167 (Why is no real title available?)
- Generalizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal Quantities
- A new cutting plane method for lexicographic multi-objective integer linear programming
- Linear programming with infinite, finite, and infinitesimal values in the right-hand side
- Weighting method for non-preemptive multi-objective mathematical programming
- An enhanced conversion scheme for lexicographic, multiobjective integer programs
This page was built for publication: Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2204444)
