Originally posted by: Mathsg

Hi respected members, 

I am getting conflicts in flow conservation constraint. I am interested to make a multicast flow (tree) from one source to multiple distination nodes. i have declared a tuple for flow in which i have source, distination array and its bandwidth like 

tuple flow{
key int id;
int src;
int dest_multi[multi];
float flow_bw[flowss];
float m[requests];
int starting[SSC];
int ending[SSC];
}
{flow} flows = ...; 

and for this i have write a flow conservation constraint to make a path between source and set of distination node like 

forall(i in flows, u in nodes: u==i.src)
      Const1:
      sum(v in nodes)(k[i][u][v]-k[i][v][u])==1;
      forall(i in flows, u in nodes, o in multi: u==i.dest_multi[o])
      Const2:
      sum(v in nodes)(k[i][u][v]-k[i][v][u])==-1; 
      forall(i in flows, u in nodes, o in multi: u!=i.src && u!=i.dest_multi[o])
      Const3:
      sum(v in nodes)(k[i][u][v]-k[i][v][u])==0; 
      forall ( i in flows, u in nodes, v in nodes) 

And now i am getting conflicts in Const2 and Const3. 

Below are the window of conflicts and and relaxations. I need yours kind advice. Yours valuble comments and suggestions will be highly appricated. thank you

Originally posted by: EdKlotz

I'm not really sure what your question is, but if you are having trouble interpreting the conflict info provided by OPL, I suggest you export an LP file of the infeasible model, read it into interactive CPLEX, run the conflict refiner, then export the .clp file to get details of the conflict containing the individual constraints and bounds.

Also, with a network and conservation of flow constraints, the infeasibility typically doesn't directly involve those constraints.   Rather, it involves either too much demand or too little supply, or bounds on some of the arcs that make it impossible for enough supply to pass through the network to meet the demand.   Rather than look at the individual conservation of flow constraints, you may want to look at the sum of those constraints, which cancels out a lot of the arcs.   That sum of constraints is provided in the .clp file exported by interactive CPLEX.