Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model
This paper presents a new linear optimization model that is both geometric and bilevel. After giving the definitions, optimality conditions and an algorithm based on the method of branch-and-bound to implicitly enumerate all the combinations for the complementary slackness conditions are derived.
scientific article; zbMATH DE number 4191410
scientific article