EFFICIENT RESOURCE ALLOCATION IN A BILEVEL HIERARCHY WITH KNAPSACK AND ASSIGNMENT LOWER-LEVEL PROBLEMS

作者: Behdad Beheshti

DOI:

关键词:

摘要: Bilevel optimization problems model a decision-making process with two-level hierarchy of independent decision-makers, namely, the leader and follower. The decisions are performed in predetermined sequence acting first. Consequently, follower solves an problem which contains parameters (e.g., right-hand sides follower's constraints) that functionally dependent on leader's decisions. On other hand, objective and, possibly, constraints also functions both decision variables. Therefore, course should take into account rational response, i.e., optimal solutions to problem. This dissertation is focused development exact solution approaches for bilevel programs combinatorial structures lower-level problems. In particular, we consider models arising resource distribution systems involve decision-making hierarchies knapsack assignment constraints. We discuss design implementation novel techniques, exploit structural properties underlying superiority proposed demonstrated through extensive computational experiments.

参考文章(56)
Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger, A Complexity and Approximability Study of the Bilevel Knapsack Problem Integer Programming and Combinatorial Optimization. pp. 98- 109 ,(2013) , 10.1007/978-3-642-36694-9_9
Jong-Shi Pang, Zhi-Quan Luo, Daniel Ralph, Mathematical Programs with Equilibrium Constraints ,(1996)
Leonidas S. Pitsoulis, P. M. Pardalos, Nonlinear assignment problems : algorithms and applications Kluwer Academic Publishers. ,(2000)
C. Audet, P. Hansen, B. Jaumard, G. Savard, Links Between Linear Bilevel and Mixed 0–1 Programming Problems Journal of Optimization Theory and Applications. ,vol. 93, pp. 273- 300 ,(1997) , 10.1023/A:1022645805569
Jonathan F. Bard, John Plummer, Jean Claude Sourie, A bilevel programming approach to determining tax credits for biofuel production European Journal of Operational Research. ,vol. 120, pp. 30- 46 ,(2000) , 10.1016/S0377-2217(98)00373-7
Xiaotie Deng, Complexity Issues in Bilevel Linear Programming Multilevel Optimization: Algorithms and Applications. pp. 149- 164 ,(1998) , 10.1007/978-1-4613-0307-7_6
Panos M Pardalos, Somesh Jha, Complexity of uniqueness and local search in quadratic 0–1 programming Operations Research Letters. ,vol. 11, pp. 119- 123 ,(1992) , 10.1016/0167-6377(92)90043-3