This method solves the active MIP model using the search strategy specified by goal
.
A Boolean value indicating whether a feasible solution has been found. This solution is not necessarily the optimal solution, if for example the search is prematurely terminated because a limit is encountered.
This is done by pushing goal
onto the goal stack of the root node of the branch-and-cut search tree before starting the search.
Cplex Class | ILOG.CPLEX Namespace | Cplex.Solve Overload List