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ženo v:

Podrobná bibliografie
Vydáno v:	Communications in nonlinear science & numerical simulation Ročník 84; s. 105177
Hlavní autoři:	Cococcioni, Marco, Cudazzo, Alessandro, Pappalardo, Massimo, Sergeyev, Yaroslav D.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 01.05.2020 Elsevier Science Ltd
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!