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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

CONOPT 113<br />

If possible, you should try to reformulate a DNLP model to an equivalent or approximately equivalent form as<br />

described in section 7.<br />

Most modelers should not be concerned with algorithmic details such as choice of algorithmic sub-components<br />

or tolerances. CONOPT has considerable build-in logic that selects a solution approach that seems to be best<br />

suited for the type of model at hand, and the approach is adjusted dynamically as information about the behavior<br />

of the model is collected and updated. <strong>The</strong> description of the CONOPT algorithm has therefore been moved<br />

to Appendix A and most modelers can skip it. However, if you are solving very large or complex models or if<br />

you are experiencing solution difficulties you may benefit from using non-standard tolerances or options, in which<br />

case you will need some understanding of what CONOPT is doing to your model. Some guidelines for selecting<br />

options can be found at the end of Appendix A and a list of all options and tolerances is shown in Appendix B.<br />

<strong>The</strong> main text of this User’s Guide will give a short overview over the iteration output you will see on the<br />

screen (section 2), and explain the termination messages (section 3). We will then discuss function evaluation<br />

errors (section 4), the use of options (section 5), and give a CONOPT perspective on good model formulation<br />

including topics such as initial values and bounds, simplification of expressions, and scaling (section 6). Finally,<br />

we will discuss the difference between NLP and DNLP models (section 7). <strong>The</strong> text is mainly concerned with the<br />

new CONOPT3 but most of it will also cover the older versions of CONOPT and we will use the generic name<br />

CONOPT when referring to the solver. Some features are only available in the latest CONOPT3 or in CONOPT2<br />

and CONOPT1 in which case we will mention it explicitly. Messages from the older versions of CONOPT may<br />

have a format that is slightly different from the one shown here.<br />

2 Iteration Output<br />

On most machines you will by default get a logline on your screen or terminal at regular intervals. <strong>The</strong> iteration<br />

log may look something like this:<br />

C O N O P T 3 Windows NT/95/98 version 3.01F-011-046<br />

Copyright (C) ARKI Consulting and Development A/S<br />

Bagsvaerdvej 246 A<br />

DK-2880 Bagsvaerd, Denmark<br />

Using default options.<br />

Reading data<br />

Iter Phase Ninf Infeasibility RGmax NSB Step InItr MX OK<br />

0 0 1.6354151782E+01 (Input point)<br />

Pre-triangular equations: 2<br />

Post-triangular equations: 1<br />

1 0 1.5354151782E+01 (After pre-processing)<br />

2 0 3.0983571843E+00 (After scaling)<br />

10 0 12 3.0814290456E+00 0.0E+00 T T<br />

20 0 12 3.0814290456E+00 0.0E+00 T T<br />

30 0 13 3.0814290456E+00 0.0E+00 F F<br />

40 0 18 2.3738740159E+00 2.3E-02 T T<br />

50 0 23 2.1776589484E+00 0.0E+00 F F<br />

Iter Phase Ninf Infeasibility RGmax NSB Step InItr MX OK<br />

60 0 33 2.1776589484E+00 0.0E+00 T T<br />

70 0 43 2.1776589484E+00 0.0E+00 F F<br />

80 0 53 2.1776589484E+00 0.0E+00 F F<br />

90 0 63 2.1776589484E+00 0.0E+00 F F<br />

100 0 73 2.1776589484E+00 0.0E+00 F F<br />

110 0 83 2.1776589484E+00 0.0E+00 F F<br />

120 0 93 2.1776589484E+00 0.0E+00 F F

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

Saved successfully!

Ooh no, something went wrong!