Penalty Function Method for Solving Multiobjective Interval Bilevel Linear Programming Problem

In this paper, a penalty function method for multiobjective interval bilevel linear programming (MIBLP) problem is proposed. Firstly, interval order relation is used to transform objective functions. The possibility level based on interval reliability is designed to transform constraint inequalities...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IAENG international journal of computer science Ročník 50; číslo 1; s. 209
Hlavní autori: Wang, Yiyuan, Ding, Xianfeng, Wei, Tingting, Li, Jiaxin, Min, Chao
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hong Kong International Association of Engineers 01.03.2023
Predmet:
Algorithms
Linear programming
Multiple objective analysis
Optimization
Penalty function
ISSN:1819-656X, 1819-9224
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, a penalty function method for multiobjective interval bilevel linear programming (MIBLP) problem is proposed. Firstly, interval order relation is used to transform objective functions. The possibility level based on interval reliability is designed to transform constraint inequalities. Then the MIBLP problem is transformed into multiobjective bilevel linear programming (MBLP) problem with coefficients determination. Secondly, the MBLP problem is converted to a nonlinear optimization problem by using the knowledge of the dual gap, the effective solution, and the linear theory. Then, for this nonlinear problem, we construct a secondorder differentiable function. A penalty term is constructed, which combines this function with the dual gap. Consequently, a penalty function algorithm is proposed. Finally, two numerical examples are used to analyze and verify the feasibility of the model and algorithm.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1819-656X
1819-9224