The GOP Approach in Bilevel Linear and Quadratic Problems

Abstract

This chapter presents the primal-relaxed dual decomposition based global optimization approach GOP for bilevel linear and quadratic programming problems as developed by Visweswaran et al. (1996). In section 5.1, the reader is briefly introduced to the bilevel programming literature work. In section 5.2, the bilevel linear problem is formulated followed by the theoretical analysis based on the principles of the GOP algorithm. Section 5.3 presents the modified-GOP approach along with computational studies for bilevel linear programming problems. Finally, section 5.4 presents the theoretical and computational studies for bilevel quadratic programming models based on the GOP principles.