Originally posted by: melike
Hi,
I have an integer programming model to solve with CPLEX 10.1 Callable Library. I know that Cplex wastes lots of time to prove optimality of a solution. When i put a time limit to Cplex and solve the model, it gives optimal solution within time limit or hits time and gives integer feasible solution. In the second case, we can think that Cplex may find a good integer feasible solution using less time and it struggles to prove optimality by turning around the same integer feasible solution or make little deviation from the feasible solution for additional time. I want to learn how behave objective function with increasing time for the second case!
I want to obtain first integer feasible solution (of course, not trivial solution) or other feasible integer solutions within the time limit. Because additional time may not be meaningful to impose for finding better solution within high computational time limit.
Is there any suggestion, solution pooling or stg by using Cplex Callable Library?
thanks
melike
#CPLEXOptimizers#DecisionOptimization