Hi, I'm programming a linear programming model in C++ via CPLEX where the number of constraints is exponential. I'm looking for an optimal fractional solution and I would like to not add all the constraints from the beginning (because of the number of the number of constraints). So I have a separation oracle. I tried to use lazy constraint callback but I read that the lazy constraint callback is called only when an integer feasible candidate is found. I tried to use the user cut callback, but the callback was not called. I would like to know how can I implement this model where some constraints are added on demand. Regards, Hugo. asked 21 Oct '16, 14:44 HugoBraga 
You have two options as follows:
answered 21 Oct '16, 16:36 Ehsan ♦ 1
Just to be clear about Ehsan's first solution, unless you turn off the hotstart indicator (it is on by default), CPLEX will start the solution of each subsequent problem by trying to "repair" the basis of the optimal solution to the previous problem (most likely by doing a few dual simplex pivots). That can be pretty efficient.
(21 Oct '16, 19:54)
Paul Rubin ♦♦
