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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
