The application of generalized Benders decomposition to certain nonconcave programs (Q2640445)
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 4187462
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The application of generalized Benders decomposition to certain nonconcave programs |
scientific article; zbMATH DE number 4187462 |
Statements
The application of generalized Benders decomposition to certain nonconcave programs (English)
0 references
1991
0 references
This paper presents a modification of A. M. Geoffrion's cutting-plane algorithm for solving a class of nonconcave mathematical programming problems with complicating variables. In particular, Generalized Benders Decomposition (GBD) is modified to solve certain optimization problems with complicating variables where the objective function is pseudoconcave and the constraint functions are quasi-concave when the complicating variables are rendered fixed.
0 references
cutting-plane algorithm
0 references
complicating variables
0 references
Generalized Benders Decomposition
0 references
0 references
0.8168805241584778
0 references
0.8111954927444458
0 references
0.791791558265686
0 references
0.7588871121406555
0 references
