I am using column generation to compute LP bound for the graph coloring problem.
The dual solution to the current restricted master problem (RMP) is used to generate columns with negative reduced costs. to improve its objective value.
For some graphs for some iterations of CG, including a column with the negative reduced cost does not improve RMP, and the RMP is not degenerate.
Can you please suggest possible reasons?
Please sign in to leave a comment.