A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems

DOI10.1007/BF01585169zbMath0805.90088MaRDI QIDQ1321648

Hiroshi Konno, Phan Thien Thach

Publication date: 1993

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

global optimizationcutting plane methodsd.c. programming methodsnonconvex separable programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Related Items

D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
• Reverse convex programming
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
• Decomposition in global optimization
• Mathematical programs with a two-dimensional reverse convex constraint
• The Decomposition Algorithm for Linear Programs
• Optimization and nonsmooth analysis
• On general decomposition schemes in mathematical programming
• An elementary survey of general duality theory in mathematical programming
• On abstract duality in mathematical programming
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Convex Analysis
• Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space