Originally posted by: Mathsg
Hi,
I am solving networking planing problem by column generation approache in which i have 6 node topology. Source and destination are connected through k shortest path.
i have decompose the problem into master and sub problem. i am going to minimize the cost of flow. In the master problem i have cosider 2 k shortest path for each flow between source and destination which give me current solution for the flows and sub problem can generate new path which can imporve our objective i.e., minimize the cost. path is made up of connecting different link and combine them i.e., hope count. Now i am confused that how to write the next iteration for updating the master problem as i have get reduced cost from sub problem which means there a path i.e., links that can improve our master problem objective. i have written it but it give me an error. can you help me ? it would be highly appricated and i am looking forward to hearing from you. thank u
#CPLEXOptimizers#DecisionOptimization