problem.addmipsol
problem.addmipsol |
Purpose
Adds a new feasible, infeasible or partial MIP solution for the problem to the Optimizer.
Synopsis
problem.addmipsol (mipsolval, mipsolcol, solname)
Arguments
|
mipsolval
|
Array containing solution values.
|
|
mipsolcol
|
Optional integer array containing the column indices for the solution values provided in
mipsolval. It is optional when the length of mipsolval is equal to
COLS, in which case it is assumed that
mipsolval provides a complete solution vector.
|
|
solname
|
An optional name to associate with the solution.
|
Further information
1. The function returns immediately after passing the solution to the Optimizer. The solution is placed in a pool until the Optimizer is able to analyze the solution during a MIP solve.
2. If the provided solution is found to be infeasible, a limited local search heuristic will be run in an attempt to find a close feasible integer solution.
3. If a partial solution is provided, global columns will be fixed to any provided values and a limited local search will be run in an attempt to find integer feasible values for the remaining unspecified columns. Values provided for continuous column in partial solutions are currently ignored.
4. The
problem.addcbusersolnotify callback function can be used to discover the outcome of a loaded solution. The optional name provided as
solname will be returned in the callback function.
5. If one or more solutions are loaded during the
problem.addcboptnode callback, the Optimizer will process all loaded solutions and fire the callback again. This will be repeated as long as new solutions are loaded during the callback.
Related topics