Xiangzhi Zhuo

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we study a pessimistic linear bilevel multi-follower programming problem in a referential-uncooperative situation (for short, PLBMF-RU) where the followers are uncooperative while having cross reference to decision making information of the other followers. We first give a model and the solution definitions of PLBMF-RU, and then use a simple(More)
Bilevel programming problems are of growing interest both from theoretical and practical points of view. In this paper, we study a pessimistic bilevel programming problem in which the set of solutions of the lower level problem is discrete. We first transform such a problem into a single-level optimization problem by using the maximum-entropy techniques. We(More)
  • 1