Originally posted by: deb711

I am working on very complex disjunctive programming. In the Mixed BIP (minimization) formulation OPL studio , the default lower bound is calculated by LP relaxation in ILOG MIP; which is not useful in my case and is a very inferior bound. Is there a way I can change the lower bound calculation as per a new heuristic or an LP ; and thus intervene in the default branching and bounding process of this commercial solver by using some callback option ?

debashish
#DecisionOptimization
#OPLusingCPLEXOptimizer

Originally posted by: Didier Vidal

Hi,
There is an API for OPL that allows you to load a model with Java, C++ or C# code. From there, you have access to the cplex object and can plug callbacks.

Here is the pointer to the documentation of CPLEX Studio 12.2 for this API: http://publib.boulder.ibm.com/infocenter/cosinfoc/v12r2/index.jsp?topic=/ilog.odms.ide.help/Content/Optimization/Documentation/OPL_Studio/_pubskel/globals/eclipse_and_xplatform/ps_opl1073.html

Regards,

Didier.
#DecisionOptimization
#OPLusingCPLEXOptimizer

Originally posted by: deb711

Hi Didier,
I was looking for a procedure from inside OPL.
I will try the way suggested. Thanks anyway!

regards

Debashish
#DecisionOptimization
#OPLusingCPLEXOptimizer