No Detail Found!

On solving uncooperative linear bilevel multi-follower programming problems

Author(s)
Fatemeh Moslemi Department of Mathematics, Faculty of Mathematical Sciences and Computer, Shahid Chamran University of Ahvaz, Ahvaz, Iran
Habibe Sadeghi Department of Mathematics, Faculty of Mathematical Sciences and Computer, Shahid Chamran University of Ahvaz, Ahvaz, Iran
Abstract
The relationship between the reference-uncooperative linear bilevel two-follower decision making and the multiobjective decision making has been recently considered (Sadeghi and Moslemi, 2019). In this paper, we address the foregoing relation for the uncooperative linear bilevel multi-follower programming (ULBMFP) model with k 2 followers. Furthermore, we consider some geometric properties of the feasible solutions set of the ULBMFP problem. Moreover, an algorithm to find an optimal solution for the ULBMFP problem was proposed. Ultimately, some numerical examples to illustrate the proposed algorithm were provided.
Publication Details
Page(s) 1-12
DOI DOI not available
Published Journal: Pakistan Journal of Statistics and Operation Research, Volume: 18, Issue: 1, Year: 2022

Request the full text from PASTIC

Keywords
Multi-objective programming, Multi-follower programming, Bilevel programming, Efficient set
0

Citations

0

Downloads

53

Views