A Global Optimization Method for Nonlinear Bilevel Programming Problems
Published in: IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics, v. 29, no. 6, Dec. 1999, p. 771-776
Posted on RAND.org on January 01, 1999
Nonlinear two-level programming deals with optimization problems in which the constraint region is implicitly determined by another optimization problem. Mathematical programs of this type arise in connection with policy problems to which the Stackelberg leader-follower game is applicable. In this paper, the nonlinear bilevel programming problem is restated as a global optimization problem and a new solution method based on this approach is developed. The most important feature of this new method is that it attempts to take full advantage of the structure in the constraints using some recent global optimization techniques.
Research conducted by
This report is part of the RAND Corporation External publication series. Many RAND studies are published in peer-reviewed scholarly journals, as chapters in commercial books, or as documents published by other organizations.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.