2018
DOI: 10.1016/j.amc.2017.05.058
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 li… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

3
88
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 66 publications
(91 citation statements)
references
References 31 publications
3
88
0
Order By: Relevance
“…Following an idea of the x-based lexicographic ordering proposed in [100] it has been shown in [20] how to transform LMOLP into a single-objective LP problem. This is done by multiplying the most important objective by 1, the second by x −1 , the third by x −2 etc., where x −i+1 , 1 ≤ i ≤ r, are infinitesimals and r is a finite number of objectives.…”
Section: 3mentioning
confidence: 99%
See 1 more Smart Citation
“…Following an idea of the x-based lexicographic ordering proposed in [100] it has been shown in [20] how to transform LMOLP into a single-objective LP problem. This is done by multiplying the most important objective by 1, the second by x −1 , the third by x −2 etc., where x −i+1 , 1 ≤ i ≤ r, are infinitesimals and r is a finite number of objectives.…”
Section: 3mentioning
confidence: 99%
“…In particular, metamathematical investigations on the new theory and its consistency can be found in [66]. The methodology described here has been successfully applied in several areas of Mathematics and Computer Science: single and multiple criteria optimization (see [20,32,33,34,43,116]), cellular automata (see [29,30,31]), Euclidean and hyperbolic geometry (see [68,69]), percolation (see [56,57,110]), fractals (see [15,87,89,97,102,110]), infinite series and the Riemann zeta function (see [91,96,99,101,114]), the first Hilbert problem, Turing machines, and supertasks (see [81,93,103,104]), numerical differentiation and numerical solution of ordinary differential equations (see [2,74,95,98,105]), etc. Some of these applications will be discussed in the following pages.…”
Section: Introductionmentioning
confidence: 99%
“…The problem involves multi-objective optimization, and two optimization targets are considered in the proposed model. Although some algorithms, such as the Pareto solution set method [24] and the lexicographic method [25], are efficient for solving multi-objective optimization, the linear weighting-sum method [26] is used here for its better practicability and convenience. The two optimization goals are first normalized to the same range and then processed into a single objective function.…”
Section: Objective Functionmentioning
confidence: 99%
“…In particular, metamathematical investigations on the new theory and its non-contradictory can be found in [17]. The x-based methodology has been successfully applied in several areas of Mathematics and Computer Science: single and multiple criteria optimization (see [21,22,23,24,25]), cellular automata (see [26,27]), Euclidean and hyperbolic geometry (see [28,29]), percolation (see [30]), fractals (see [31,32,33,34,35]), infinite series and the Riemann zeta function (see [36,37,38,39,40]), the first Hilbert problem, Turing machines, and supertasks (see [41,42,20,43]), numerical differentiation and numerical solution of ordinary differential equations (see [44,45,46,47,48]), etc. In this paper, divergent series and Ramanujan summation are studied.…”
Section: Introductionmentioning
confidence: 99%