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

DOI10.1007/BF01585169MaRDI QIDQ1321648zbMATH OpenFDO

Authors Phan Thien Thach, Hiroshi Konno

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)

Recommendations

• On solving a d.c. programming problem by a sequence of linear programs
• Publication:3483926
• A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem

Cites work

• scientific article; zbMATH DE number 3910151 (Why is no real title available?)
• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 4011808 (Why is no real title available?)
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A decomposition method using a pricing mechanism for min concave cost flow problems with a hierarchical structure
• An elementary survey of general duality theory in mathematical programming
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Convex Analysis
• Decomposition in global optimization
• Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
• Mathematical programs with a two-dimensional reverse convex constraint
• On abstract duality in mathematical programming
• On general decomposition schemes in mathematical programming
• Optimization and nonsmooth analysis
• 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
• Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space
• The Decomposition Algorithm for Linear Programs

Cited in

(3)

• scientific article; zbMATH DE number 3307155 (Why is no real title available?)
• D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
• A proximal extension of the column generation method to nonconvex conic optimization providing bounds for the duality gap

This page was built for publication: A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321648)