Originally posted by: open_ball
Hi,
I was wondering if it is possible to solve my model with Benders Decomposition in OPL without using any other language. In the following link, it is stated that "Bender's decomposition is not built into CPLEX, so you will have to implement this algorithm yourself. However, the C++ and C APIs of CPLEX enable you to implement this technique. Users are urged to assess carefully whether they should use the C or C++ API."
http://www-01.ibm.com/support/docview.wss?uid=swg21400072
However, I am not quite sure if this is for the old version, because when I check the examples, there is a Benders mod file. Having said that when I go through that example, since it is not clear, I could not fully understand the implementation. I could not see where the feasibility and optimality cuts are generated and where the sub problem is created?
If we are able to implement Benders in OPL, is there a better example to understand how to implement the algorithm in OPL.
#DecisionOptimization#OPLusingCPLEXOptimizer