Maximum entropy approach for solving pessimistic bilevel programming problems

Citation metadata

Date: Feb. 2017
Publisher: Springer
Document Type: Report
Length: 179 words

Document controls

Main content

Abstract :

To access, purchase, authenticate, or subscribe to the full-text of this article, please visit this link: http://dx.doi.org/10.1007/s11859-017-1217-6 Byline: Yue Zheng (1), Xiangzhi Zhuo (1), Jingxiao Chen (1) Keywords: bilevel programming; pessimistic formulation; maximum entropy approach; O 221 Abstract: 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 then present a maximum entropy approach for solving the pessimistic bilevel programming problem. Finally, two examples illustrate the feasibility of the proposed approach. Author Affiliation: (1) School of Management, Huaibei Normal University, Huaibei 235000, Anhui, China Article History: Registration Date: 04/01/2017 Received Date: 25/02/2016 Online Date: 10/01/2017 Article note: Foundation item: Supported by the National Natural Science Foundation of China (11501233), the Key Project of Anhui Province University Excellent Youth Support Plan ( gxyqZD2016102) Biography: ZHENG Yue, male, Associate professor, research direction: optimization theory and application.

Source Citation

Source Citation   

Gale Document Number: GALE|A476852183