This paper proposes a bi-level linear programming problem with linear constraints, in which the linear objective functions are to be maximized with different rough goals, the suggested approach in this paper is mainly based on the iterative goal programming method of Dauer and Krueger to develop the optimal solution of the bi-level decisionmaker, then we uses the concepts of tolerance membershi...

in this paper, shortest path design problem (spdp) in which the path is incident to all cells is considered. the bi-directional path is one of the known types of configuration of networks for automated guided vehi-cles (agv).to solve this problem, two algorithms are developed. for each algorithm an integer linear pro-gramming (ilp) is determined. the objective functions of both algorithms are t...

In this paper we study the bilevel linear programming problem with multiple objective functions at the upper level, with particular focus on the bi-objective case. We examine some properties of this problem and propose a methodological approach based on the reformulation of the problem as a multiobjective mixed 0-1 linear programming problem. The basic idea consists in applying a reference poin...

In this paper, a Multi-Choice Stochastic Bi-Level Programming Problem (MCSBLPP) is considered where all the parameters of constraints are followed by normal distribution. The cost coefficients of the objective functions are multi-choice types. At first, all the probabilistic constraints are transformed into deterministic constraints using stochastic programming approach. Further, a general tran...

This paper proposes a kind of bi-level linear programming problem, in which there are two decision makers in a hierarchy and they have a common variable. To deal with this bi-level problem, we introduce a virtual decision maker, who controls the common variable to maximize the sum of the objective functions of the upper and lower level decision maker (the leader and follower). To illustrate the...