zbMATH — the first resource for mathematics

Generalized cross decomposition applied to nonlinear integer programming problems: Duality gaps and convexification in parts. (English) Zbl 0817.90070
Summary: We study the lower bounds on the optimal objective function value of nonlinear pure integer programming problems obtainable by convexification in parts, achieved by using generalized Benders or cross decomposition, and compare them to the best lower bounds obtainable by the convexification introduced by the Lagrangean dual, i.e. by Lagrangean relaxation together with subgradient optimization or (nonlinear) Dantzig- Wolfe decomposition. We show how to obtain a number of different bounds and specify the known relations between them. In one case generalized cross decomposition can automatically yield the best of the Benders decomposition bound and the Lagrangean dual bound, without any a priori knowledge of which is the best. In another case the cross decomposition bound dominates the Lagrangean dual bound.

90C10 Integer programming
90C30 Nonlinear programming
Full Text: DOI
[1] DOI: 10.1007/BF01386316 · Zbl 0109.38302
[2] Dantzig G.B., Linear Programming and Extensions (1963) · Zbl 0108.33103
[3] DOI: 10.1287/opre.8.1.101 · Zbl 0093.32806
[4] DOI: 10.1007/BF00934810 · Zbl 0229.90024
[5] Geoffrion A.M., Mathematical Programming Study 2 pp 82– (1974) · Zbl 0395.90056
[6] DOI: 10.1007/BF01580223 · Zbl 0284.90057
[7] DOI: 10.1007/BF01580863 · Zbl 0715.90078
[8] Holmberg K., Cross Decomposition Applied to Integer Programming Problems: Duality Gaps and Convexification in Parts (1990) · Zbl 0864.90095
[9] Poljak B.T., Soviet Mathematics Doklady 8 pp 596– (1967)
[10] DOI: 10.1016/0041-5553(69)90061-5 · Zbl 0229.65056
[11] Van Roy T.J., Mathematical Programming 25 pp 46– (1969)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.