[Dip] non-empty intersection of column sets in subproblem

[Shahin Gelareh]

hellp everybody

Imagine we have a set of constraints like "x_{ijk}+x_{kji}+x_{jki} =1
\forall i, j,\neq i , k\neq i,j" is left to be solved in teh subproblem.

this set does not show a block angular structure and cannot be easily
decomposed to different blocks.

I wonder if we set a block for every ijk, say subproblem_{123} ==>
{x_{123}+x_{321}+x_{231} =1}
and given that I do not receive any error message from Dip, how is that
managed in DIP, in general.

How do the blocks communicate for the shared columns, do they actually need
to communicate? how the contribution of the same column appearing in two or
more blocks is calculated.

thanks in advance
Shahin
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/dip/attachments/20121022/64ce0821/attachment.html>