16.01.2015 Views

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

GAMS — The Solver Manuals - Available Software

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

CPLEX 11 199<br />

rinsheur (integer)<br />

Cplex implements a heuristic known a Relaxation Induced Neighborhood Search (RINS) for MIP and<br />

MIQCP problems. RINS explores a neighborhood of the current incumbent to try to find a new, improved<br />

incumbent. It formulates the neighborhood exploration as a MIP, a subproblem known as the subMIP, and<br />

truncates the subMIP solution by limiting the number of nodes explored in the search tree.<br />

Parameter rinsheur controls how often RINS is invoked. A value of 100, for example, means that RINS is<br />

invoked every hundredth node in the tree.<br />

(default = 0)<br />

-1 Disable RINS<br />

0 Automatic<br />

rngrestart (string)<br />

Write ranging information, in <strong>GAMS</strong> readable format, to the file named. Options objrng and rhsrng are<br />

used to specify which <strong>GAMS</strong> variables or equations are included.<br />

(default = ranging information is printed to the listing file)<br />

scaind (integer)<br />

This option influences the scaling of the problem matrix.<br />

(default = 0)<br />

-1 No scaling<br />

0 Standard scaling. An equilibration scaling method is implemented which is generally very effective.<br />

1 Modified, more aggressive scaling method. This method can produce improvements on some problems.<br />

This scaling should be used if the problem is observed to have difficulty staying feasible during the<br />

solution process.<br />

siftalg (integer)<br />

Sets the algorithm to be used for solving sifting subproblems.<br />

(default = 0)<br />

0 Automatic<br />

1 Primal simplex<br />

2 Dual simplex<br />

3 Network simplex<br />

4 Barrier<br />

siftdisplay (integer)<br />

Determines the amount of sifting progress information to be displayed.<br />

(default = 1)<br />

0 No display<br />

1 Display major iterations<br />

2 Display LP subproblem information<br />

siftitlim (integer)<br />

Sets the maximum number of sifting iterations that may be performed if convergence to optimality has not<br />

been reached.<br />

(default = large)

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!