GAMS — The Solver Manuals - Available Software

202 CPLEX 11
populate procedure again. If the GAMS program terminates normally (not compilation or execution time
error) the search for new alternative solutions will be repeated.
solnpoolprefix (string)
(default = soln)
solnpoolreplace (integer)
(default = 0)
0 Replace the first solution (oldest) by the most recent solution; first in, first out
1 Replace the solution which has the worst objective
2 Replace solutions in order to build a set of diverse solutions
solvefinal (integer)
Sometimes the solution process after the branch-and-cut that solves the problem with fixed discrete variables
takes a long time and the user is interested in the primal values of the solution only. In these cases,
solvefinal can be used to turn this final solve off. Without the final solve no proper marginal values are
available and only zeros are returned to GAMS.
(default = 1)
0 Do not solve the fixed problem
1 Solve the fixed problem and return duals
startalg (integer)
Selects the algorithm to use for the initial relaxation of a MIP.
(default = 0)
0 Automatic
1 Primal simplex
2 Dual simplex
3 Network simplex
4 Barrier
5 Sifting
6 Concurrent
strongcandlim (integer)
Limit on the length of the candidate list for strong branching (varsel = 3).
(default = 10)
strongitlim (integer)
Limit on the number of iterations per branch in strong branching (varsel = 3). The default value of 0 causes
the limit to be chosen automatically which is normally satisfactory. Try reducing this value if the time per
node seems excessive. Try increasing this value if the time per node is reasonable but Cplex is making little
progress.
(default = 0)
subalg (integer)
Strategy for solving linear sub-problems at each node.
(default = 0)
0 Automatic
1 Primal simplex
2 Dual simplex