The application of generalized Benders decomposition to certain nonconcave programs
From MaRDI portal
Publication:2640445
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.
Recommendations
- Extension of the generalized benders' decomposition
- Nonconvex sensitivity-based generalized Benders decomposition
- Nonlinear Programs with Complicating Variables: Theoretical Analysis and Numerical Experience
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- scientific article; zbMATH DE number 4106600
Cites work
- Convergence Conditions for Nonlinear Programming Algorithms
- Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
- Generalized Benders decomposition
- scientific article; zbMATH DE number 3748742 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Maximizing the sum of certain quasiconcave functions using generalized benders decomposition
- On von Neumann's minimax theorem
- Partitioning procedures for solving mixed-variables programming problems
- Pseudo-Convex Functions
- Quasi-Concave Programming
- The Direct Power of Adjacent Vertex Programming Methods
Cited in
(9)- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Convexity and optimization with copulæ structured probabilistic constraints
- Nonlinear Programs with Complicating Variables: Theoretical Analysis and Numerical Experience
- Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
- Extension of the generalized benders' decomposition
- A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints
- Nonconvex sensitivity-based generalized Benders decomposition
- Generalized Benders' decomposition for topology optimization problems
- Benders decomposition for variational inequalities
This page was built for publication: The application of generalized Benders decomposition to certain nonconcave programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640445)
