Solving the Lexicographic Multi-Objective Mixed-Integer Linear Programming Problem using branch-and-bound and grossone methodology

•Lexicographic Multi-Objective Mixed Integer Linear Programming problem (LMILP) is studied.•The Grossone methodology using numerical infinities and infinitesimals is applied to LMILP.•A Grossone-based Branch-and-Bound in combination with Grossone-based simplex is proposed.•Theoretical conditions for...

Full description

Saved in:

Bibliographic Details
Published in:	Communications in nonlinear science & numerical simulation Vol. 84; p. 105177
Main Authors:	Cococcioni, Marco, Cudazzo, Alessandro, Pappalardo, Massimo, Sergeyev, Yaroslav D.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.05.2020 Elsevier Science Ltd
Subjects:	Algorithms Grossone methodology Integer programming Lexicographic optimization Linear programming Lower bounds Mathematical problems Mixed integer Mixed-integer linear programming Multi-objective optimization Numerical infinitesimals Simplex method Upper bounds Lexicographic optimization Numerical infinitesimals Multi-objective optimization Mixed-integer linear programming Grossone methodology
ISSN:	1007-5704, 1878-7274
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!