Global optimization of nonlinear bilevel programming problems (Q5942317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 00:52, 30 January 2024

scientific article; zbMATH DE number 1638245
Language Label Description Also known as
English
Global optimization of nonlinear bilevel programming problems
scientific article; zbMATH DE number 1638245

    Statements

    Global optimization of nonlinear bilevel programming problems (English)
    0 references
    28 August 2001
    0 references
    The known approaches to bilevel programming problems (BLPP) normally reduce BLPP to an one level programming problem replacing the lower level minimization problem with equations of KKT conditions. However, strong assumptions should be satisfied in order to guarantee the solution to the last problem be also the solution to the original problem. The proposed approach, although uses the KKT conditions, can overcome the limitations of the previous methods. A developed method is based on the branch and bound framework known as \( \alpha\)BB. For the problems involving twice differentiable nonlinear nonconvex functions epsilon global optimality is theoretically guaranteed in finite number of iterations. Several known examples of BLPP problems are solved using the proposed method.
    0 references
    bilevel programming
    0 references
    global optimization
    0 references
    nonconvex optimization
    0 references
    nonlinear optimization
    0 references

    Identifiers