Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model (Q757251)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4191410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using branch-and-bound to solve bi-level geometric programming problems: A new optimization model |
scientific article; zbMATH DE number 4191410 |
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
0 references
0.8040118217468262
0 references
0.7881792187690735
0 references
0.7807402610778809
0 references
