Redundancy and delimitation of the Pareto front Redundancy and delimitation of the Pareto front

The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed single-objective optimization methods to individual linear programming problems, constructed from the given problem. Considering the binding const...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operational research Ročník 25; číslo 3; s. 87
Hlavní autor: Nikolakakou, Christina D.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2025
Springer Nature B.V
Témata:
Algorithms
Binding
Business and Management
Computational Intelligence
Constraints
Decision making
Intersections
Linear programming
Management Science
Multiple objective analysis
Operations Research
Operations Research/Decision Theory
Optimization techniques
Pareto optimum
Redundancy
Review Article
PRMac algorithm
Pareto front
Minimal Multiobjective Linear Programming Problem
Multiobjective Linear Programming
Binding constraints
Cosine algorithm
ISSN:1109-2858, 1866-1505
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!
Popis
Shrnutí:The purpose of this paper is to investigate the constraints shaping the Pareto front in multi-objective linear programming, by applying recently proposed single-objective optimization methods to individual linear programming problems, constructed from the given problem. Considering the binding constraints of these individual linear programming problems, two new constraint sets are proposed, called union-binding and intersection-binding. A definition of binding constraints for a multiobjective problem is given and it is proved that at least the constraints that belonging to the union-binding set are binding constraints for the given multi-objective problem. Furthermore, it is proved that if the intersection-binding set is non-empty, then at least one point resulting from strictly satisfying these constraints belongs to the Pareto set. Hence, the exploration of union-binding and intersection-binding sets facilitates an understanding of both the constraints contributing to finding the Pareto set and those delimiting the Pareto front. Additionally, we interpret the union-binding and intersection-binding sets, using interpretive parameter variables derived from the original multi-objective problem, through a parallel exploitation of recently proposed LP algorithms, PRMac and Cosine. This interpretation leads to the conclusion that exploiting union-binding and intersection-binding sets holds promising prospects for future research. Finally, the present paper defines the minimal multi-objective linear programming problem and proposes a step-by-step solution for the multi-objective problem.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1109-2858
1866-1505
DOI:10.1007/s12351-025-00966-6