Abstract
In this paper, an algorithm is developed to solve an indefinite quadratic integer bilevel programming problem with bounded variables. The problem is solved by solving the relaxed problem. A mixed integer cut for finding the integer solution of the given problem is developed. The algorithm is explained with the help of an example.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
