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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Communications in nonlinear science & numerical simulation Ročník 84; s. 105177
Hlavní autori:	Cococcioni, Marco, Cudazzo, Alessandro, Pappalardo, Massimo, Sergeyev, Yaroslav D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.05.2020 Elsevier Science Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!