Specifies a starting point for the next invocation of the method solve
.
var
. rng
. Starting point information is exploited at the next call of the method solve
. In particular, if the node is being solved with the simplex optimizer, the starting point information provided with this method is used to construct a starting basis for the simplex optimizer.
The starting point information is provided in the parameters of this method. NULL can be passed for any of the parameters. However, if x
is not NULL, var
must not be NULL. Similarly, if pi
is not NULL, rng
must not be NULL.
For all variables given in var
, x[j]
specifies the starting primal value for variable var[j]
. Similarly, for all constraints specified in rng
, pi[i]
specifies the starting dual value for rng[i]
.
When values are not specified for all integer and continuous variables, CPLEX tries to extend this partial solution to a complete solution by solving a MIP over the variables whose values have not been specified by any previous calls to setVectors
. The parameter SubMIPNodeLim
controls the amount of effort CPLEX expends in trying to solve this secondary MIP. If CPLEX finds a complete feasible solution, that solution becomes the incumbent. If the specified values are infeasible, they are retained for use in a subsequent solution repair heuristic. The amount of effort spent in this heuristic can be controlled by the parameter RepairTries
.
Cplex.SolveCallback Class | ILOG.CPLEX Namespace | Cplex.SolveCallback.SetVectors Overload List