Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts

DOI10.1080/02331939208843769zbMath0817.90070OpenAlexW2042372293MaRDI QIDQ4327896

Kaj Holmberg

Publication date: 1 August 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939208843769

zbMATH Keywords

Lagrange multipliersLagrangean relaxationlower boundsgeneralized Benders decompositionsubgradient optimizationnonlinear pure integer programmingconvexification in parts

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30)

Related Items (3)

Solving the staircase cost facility location problem with decomposition and piecewise linearization ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ Constraint partitioning in penalty formulations for solving temporal planning problems

Cites Work

• Unnamed Item
• Unnamed Item
• On the convergence of cross decomposition
• Partitioning procedures for solving mixed-variables programming problems
• Generalized Benders decomposition
• Decomposition Principle for Linear Programs
• Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts
• Validation of subgradient optimization
• Minimization of unsmooth functionals

This page was built for publication: Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts