Abstract
The linear-linear and quadratic-linear bilevel programming problems are considered. Their optimistic statement is reduced to a nonconvex mathematical programming problem with the bilinear structure. Approximate algorithms of local and global search in the obtained problems are proposed. The results of computational solving randomly generated test problems are given and analyzed.
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.
