A method for decomposing mixed-integer linear programming problems with angular structure

An algorithm is proposed for solving mixed-integer linear programming problems with an angular structure. The problem cannot be relaxed simultaneously relative to all the coupling constraints. The decomposition procedure consists of first relaxing the problem relative to the coupling constraint for the integer variables, and secondly decomposing it with respect to the coupling constraint for the continuous variables. An algorithm for executing the second part of the procedure efficiently is presented