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.

XPRESS 573<br />

3.4 Newton-Barrier Options<br />

<strong>The</strong> barrier method is invoked by using one of the options<br />

algorithm barrier<br />

defaultalg 4<br />

<strong>The</strong> barrier method is likely to use more memory than the simplex method. No warm start is done, so if an<br />

advanced basis exists, you may not wish to use the barrier solver.<br />

<strong>The</strong> following options set XPRESS library control variables, and can be used to fine-tune the XPRESS barrier<br />

solver.<br />

Option Description Default<br />

bariterlimit Maximum number of barrier iterations 200<br />

crossover Determines whether the barrier method will cross over to the simplex method<br />

when at optimal solution has been found, in order to provide an end basis.<br />

0: No crossover.<br />

1: Crossover to a basic solution.<br />

1<br />

4 Helpful Hints<br />

<strong>The</strong> comments below should help both novice and experienced <strong>GAMS</strong> users to better understand and make use<br />

of <strong>GAMS</strong>/XPRESS.<br />

• Infeasible and unbounded models <strong>The</strong> fact that a model is infeasible/unbounded can be detected at two<br />

stages: during the presolve and during the simplex or barrier algorithm. In the first case we cannot recover<br />

a solution, nor is any information regarding the infeasible/unbounded constraint or variable provided (at<br />

least in a way that can be returned to <strong>GAMS</strong>). In such a situation, the <strong>GAMS</strong> link will automatically rerun<br />

the model using primal simplex with presolve turned off (this can be avoided by setting the rerun option<br />

to 0). It is possible (but very unlikely) that the simplex method will solve a model to optimality while the<br />

presolve claims the model is infeasible/unbounded (due to feasibility tolerances in the simplex and barrier<br />

algorithms).<br />

• <strong>The</strong> barrier method does not make use of iterlim. Use bariterlim in an options file instead. <strong>The</strong> number<br />

of barrier iterations is echoed to the log and listing file. If the barrier iteration limit is reached during the<br />

barrier algorithm, XPRESS continues with a simplex algorithm, which will obey the iterlim setting.<br />

• Semi-integer variables are not implemented in the link, nor are they supported by XPRESS; if present, they<br />

trigger an error message.

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

Saved successfully!

Ooh no, something went wrong!