source: html/ch09.html @ 1860

Last change on this file since 1860 was 561, checked in by ladanyi, 12 years ago

Cbc static pages moved

  • Property svn:eol-style set to native
  • Property svn:keywords set to Author Date Id Revision
File size: 12.9 KB
Line 
1<?xml version="1.0" encoding="ISO-8859-1" standalone="no"?>
2<html xmlns="http://www.w3.org/1999/xhtml"><head><title>Chapter 9. 
3  Messages
4  </title><meta name="generator" content="DocBook XSL Stylesheets V1.61.2"/><link rel="home" href="index.html" title="CBC User Guide"/><link rel="up" href="index.html" title="CBC User Guide"/><link rel="previous" href="ch08.html" title="Chapter 8. &#10;More Samples&#10;"/><link rel="next" href="apa.html" title="Appendix A. FAQ"/></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 9. 
5  Messages
6  </th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch08.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="apa.html">Next</a></td></tr></table><hr/></div><div class="chapter" lang="en"><div class="titlepage"><div><div><h2 class="title"><a id="messages"/>Chapter 9. 
7  Messages
8  </h2></div></div><div/></div><p>
9  Messages and codes passed by CBC are listed in the
10  tables below.  For a complete list, see <tt class="filename">COIN/Cbc/CbcMessages.cpp</tt>. The notation used is the same as for the <tt class="function">printf</tt> in the C programming language.
11  </p><div class="itemizedlist"><ul type="disc"><li>
12    <tt class="computeroutput">%s</tt> is a string
13    </li><li>
14    <tt class="computeroutput">%d</tt> is an integer
15    </li><li>
16    <tt class="computeroutput">%g</tt> or <tt class="computeroutput">%f</tt>
17    is a floating point value
18    </li></ul></div><p>
19
20  </p><p>There are several log levels. Setting the log level to be <i class="parameter"><tt>i</tt></i> produces the log messages for level <i class="parameter"><tt>i</tt></i> and all levels less than <i class="parameter"><tt>i</tt></i>.
21 </p><div class="itemizedlist"><ul type="disc"><li>
22    Log Level 0: Switches off all CBC messages, but one.
23    </li><li>
24    Log Level 1: The default. 
25    </li><li>
26    Log Level 2: Substantial amount of information, e.g., message 15 is generated once per node. Can be useful when the evaluation at each node is slow.
27    </li><li>
28    Log Level 3: Tremendous amount of information, e.g., multiple messages per node.
29    </li></ul></div><div class="table"><a id="id3004901"/><p class="title"><b>Table 9.1. 
30  CBC Messages Passed At Log Level 0
31  </b></p><table summary="&#10;  CBC Messages Passed At Log Level 0&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
32      Code
33      </th><th> </th><th align="left">
34      Text and notes
35      </th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left">
36      3007
37      </td><td> </td><td align="left"><tt class="computeroutput">No integer variables - nothing to do</tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
38
39      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3005046"/><p class="title"><b>Table 9.2. 
40  CBC Messages Passed At or Above Log Level 1
41  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 1&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
42      Code
43      </th><th> </th><th align="left">
44      Text and notes
45      </th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left">
46      1
47      </td><td> </td><td align="left"><tt class="computeroutput">Search completed - best objective %g, took %d iterations and %d nodes
48      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
49     
50      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
51      3
52      </td><td> </td><td align="left"><tt class="computeroutput">Exiting on maximum nodes
53      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
54     
55      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
56      4
57      </td><td> </td><td align="left"><tt class="computeroutput">
58      Integer solution of %g found after %d iterations and %d nodes
59      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
60     
61      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
62      5
63      </td><td> </td><td align="left"><tt class="computeroutput">
64      Partial search - best objective %g (best possible %g), took %d iterations and %d nodes
65      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
66     
67      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
68      6
69      </td><td> </td><td align="left"><tt class="computeroutput">
70      The LP relaxation is infeasible or too expensive
71      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
72     
73      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
74      9
75      </td><td> </td><td align="left"><tt class="computeroutput">
76      Objective coefficients multiple of %g
77      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
78     
79      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
80      10
81      </td><td> </td><td align="left"><tt class="computeroutput">
82      After %d nodes, %d on tree, %g best solution, best possible %g
83      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
84     
85      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
86      11
87      </td><td> </td><td align="left"><tt class="computeroutput">
88      Exiting as integer gap of %g less than %g or %g%%
89      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
90           
91      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
92      12
93      </td><td> </td><td align="left"><tt class="computeroutput">
94      Integer solution of %g found by heuristic after %d iterations and %d nodes
95      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
96     
97      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
98      13
99      </td><td> </td><td align="left"><tt class="computeroutput">
100      At root node, %d cuts changed objective from %g to %g in %d passes
101      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
102     
103      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
104      14
105      </td><td> </td><td align="left"><tt class="computeroutput">
106      Cut generator %d (%s) - %d row cuts (%d active), %d column cuts %? in %g seconds - new frequency is %d
107      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
108     
109      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
110      16
111      </td><td> </td><td align="left"><tt class="computeroutput">
112      Integer solution of %g found by strong branching after %d iterations and %d nodes
113      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
114     
115      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
116      17
117      </td><td> </td><td align="left"><tt class="computeroutput">
118      %d solved, %d variables fixed, %d tightened
119      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
120     
121      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
122      18
123      </td><td> </td><td align="left"><tt class="computeroutput">
124      After tightenVubs, %d variables fixed, %d tightened
125      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
126     
127      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
128      19
129      </td><td> </td><td align="left"><tt class="computeroutput">
130      Exiting on maximum solutions
131      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
132     
133      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
134      20
135      </td><td> </td><td align="left"><tt class="computeroutput">
136      Exiting on maximum time
137      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
138     
139      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
140      23
141      </td><td> </td><td align="left"><tt class="computeroutput">
142      Cutoff set to %g - equivalent to best solution of %g
143      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
144     
145      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
146      24
147      </td><td> </td><td align="left"><tt class="computeroutput">
148      Integer solution of %g found by subtree after %d iterations and %d nodes
149      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
150     
151      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
152      26
153      </td><td> </td><td align="left"><tt class="computeroutput">
154      Setting priorities for objects %d to %d inclusive (out of %d)
155      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
156     
157      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
158      3008
159      </td><td> </td><td align="left"><tt class="computeroutput">
160      Strong branching is fixing too many variables, too expensively!
161      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
162     
163      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3006409"/><p class="title"><b>Table 9.3. 
164  CBC Messages Passed At or Above Log Level 2
165  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 2&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
166      Code
167      </th><th> </th><th align="left">
168      Text and notes
169      </th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left">
170      15
171      </td><td> </td><td align="left"><tt class="computeroutput">
172      Node %d Obj %g Unsat %d depth %d
173      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
174     
175      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
176      21
177      </td><td> </td><td align="left"><tt class="computeroutput">
178      On closer inspection node is infeasible
179      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
180     
181      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
182      22
183      </td><td> </td><td align="left"><tt class="computeroutput">
184      On closer inspection objective value of %g above cutoff of %g
185      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
186     
187      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
188      23
189      </td><td> </td><td align="left"><tt class="computeroutput">
190      Allowing solution, even though largest row infeasibility is %g
191      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
192     
193      </p></td><td class="auto-generated"> </td></tr></tbody></table></div><div class="table"><a id="id3006810"/><p class="title"><b>Table 9.4. 
194  CBC Messages Passed At or Above Log Level 3
195  </b></p><table summary="&#10;  CBC Messages Passed At or Above Log Level 3&#10;  " border="0"><colgroup><col/><col/><col/><col/></colgroup><thead><tr><th align="center">
196      Code
197      </th><th> </th><th align="left">
198      Text and notes
199      </th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left">
200      7
201      </td><td> </td><td align="left"><tt class="computeroutput">
202      Strong branching on %d (%d), down %g (%d) up %g (%d) value %g
203      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
204     
205      </p></td><td class="auto-generated"> </td></tr><tr><td align="left">
206      25
207      </td><td> </td><td align="left"><tt class="computeroutput">
208      %d cleanup iterations before strong branching
209      </tt></td><td class="auto-generated"> </td></tr><tr><td colspan="2"> </td><td align="left"><p>
210     
211      </p></td><td class="auto-generated"> </td></tr></tbody></table></div></div><div class="navfooter"><hr/><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="ch08.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="apa.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Chapter 8. 
212More Samples
213 </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> Appendix A. FAQ</td></tr></table></div></body></html>
Note: See TracBrowser for help on using the repository browser.