Title
Solving bilevel quadratic programming problems and its application
Abstract
Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the nonlinear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.
Year
DOI
Venue
2011
10.1007/978-3-642-23854-3_20
KES (3)
Keywords
Field
DocType
traditional approach,marketing programming application,novel approach,application result,bilevel problem,double layer programming problem,bilevel programming,new proposed approach,bilevel quadratic programming problem
Mathematical optimization,Logistic distribution,Nonlinear system,Bilevel optimization,Computer science,Ergodic theory,Quadratic equation,Quadratic programming,Double layer (surface science)
Conference
Citations 
PageRank 
References 
0
0.34
8
Authors
2
Name
Order
Citations
PageRank
Shamshul Bahar Yaakob1265.70
Junzo Watada241184.53