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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Communications in nonlinear science & numerical simulation Jg. 84; S. 105177
Hauptverfasser:	Cococcioni, Marco, Cudazzo, Alessandro, Pappalardo, Massimo, Sergeyev, Yaroslav D.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 01.05.2020 Elsevier Science Ltd
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!