Lagrangean decomposition for integer nonlinear programming with linear constraints (Q1181738)

For the integer nonlinear programming problem \(\min f(x)\), \(Ax=b\), \(Bx\leq d\), \(x\in X\), where \(X=\{0,1\}^ n\), \(b\in R^ m\), \(A\in R^{m\times n}\), \(B\in R^{q\times m}\), the authors introduce additional variables so that, via these variables and extra conditions, the problem is transformed to a continuous nonlinear programming problem and an integer linear one. The paper contains conditions for this type of problem- splitting and also solution algorithms.