Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model (Q757251): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Richard S. Segall / rank | |||
Property / reviewed by | |||
Property / reviewed by: Constantin Udrişte / rank | |||
Revision as of 17:30, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model |
scientific article |
Statements
Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model (English)
0 references
1990
0 references
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.
0 references
multilevel mathematical programming
0 references
branch-and-bound
0 references