Lexicographic multi-objective linear programming using grossone methodology: Theory and algorithm

Marco Cococcioni

doi:10.1016/j.amc.2017.05.058

2018-02-01

Marco Cococcioni

M. Pappalardo

Yaroslav D. Sergeyev *

DOI：10.1016/j.amc.2017.05.058

原文链接

查看原文

摘要

En 中文

Numerous problems arising in engineering applications can have several objectives to be satisfied. An important class of problems of this kind is lexicographic multi-objective problems where the first objective is incomparably more important than the second one which, in its turn, is incomparably more important than the third one, etc. In this paper, Lexicographic Multi-Objective Linear Programming (LMOLP) problems are considered. To tackle them, traditional approaches either require solution of a series of linear programming problems or apply a scalarization of weighted multiple objectives into a single-objective function. The latter approach requires finding a set of weights that guarantees the equivalence of the original problem and the single-objective one and the search of correct weights can be very time consuming. In this work a new approach for solving LMOLP problems using a recently introduced computational methodology allowing one to work numerically with infinities and infinitesimals is proposed. It is shown that a smart application of infinitesimal weights allows one to construct a single-objective problem avoiding the necessity to determine finite weights. The equivalence between the original multiobjective problem and the new single-objective one is proved. A simplex-based algorithm working with finite and infinitesimal numbers is proposed, implemented, and discussed. Results of some numerical experiments are provided. (C) 2017 Elsevier Inc. All rights reserved.

Keyword:

Multi-objective optimization

Lexicographic problems

Numerical infinitesimals

Grossone infinity computing