The application of generalized Benders decomposition to certain nonconcave programs

DOI10.1016/0898-1221(91)90172-ZzbMath0719.90059OpenAlexW2060756156MaRDI QIDQ2640445

C. Zappe, A. Victor Cabot

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90172-z

zbMATH Keywords

cutting-plane algorithmcomplicating variablesGeneralized Benders Decomposition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (2)

Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support ⋮ Convexity and optimization with copulæ structured probabilistic constraints

Cites Work

• Partitioning procedures for solving mixed-variables programming problems
• Generalized Benders decomposition
• On von Neumann's minimax theorem
• Quasi-Concave Programming
• Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming
• Maximizing the sum of certain quasiconcave functions using generalized benders decomposition
• Pseudo-Convex Functions
• The Direct Power of Adjacent Vertex Programming Methods
• Convergence Conditions for Nonlinear Programming Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The application of generalized Benders decomposition to certain nonconcave programs