REFINEOPS

This specifies when the solution refiner should be executed to reduce solution infeasibilities. The refiner will attempt to satisfy the target tolerances for all original linear constraints before presolve or scaling has been applied.

Integer

Bit	Meaning
0	Run the solution refiner on an optimal solution of a non-global problem.
1	Run the solution refiner when a new solution is found during a global search. The refiner will be applied to the presolved solution before any post-solve operations are applied.
3	Run the solution refiner on each node of the MIP search.
4	Run the solution refiner on an optimal solution before postsolve on a non-global problem.
5	Apply the iterative refiner to refine the solution.
6	Use higher precision in the iterative refinement.
7	If set, the iterative refiner will use the primal simplex algorithm.
8	If set, the iterative refiner will use the dual simplex algorithm.
9	Refine MIP solutions such that rounding them keeps the problem feasible when reoptimized.
10	Attempt to refine MIP solutions such that rounding them keeps the problem feasible when reoptimized, but accept integers solutions even if refinement fails.

19 (bits 0, 1 and 4 are set)

If neither the 7th nor 8th bit is set, the refiner will use the primal simplex if the primal violations are larger than the dual violations, otherwise it will use the dual simplex.

If both the 7th and 8th bit are set then the refiner will split the problem into a primal feasible and dual feasible part, and solve the first with primal simplex and the second with dual simplex.

XPRSlpoptimize ( LPOPTIMIZE), XPRSmipoptimize ( MIPOPTIMIZE).

LPREFINEITERLIMIT, FEASTOLTARGET, OPTIMALITYTOLTARGET, MIPTOLTARGET.