|
1796 | 1796 | * The CONSINITLP callback is executed before the first LP relaxation is solved. |
1797 | 1797 | * It should add the LP relaxations of all "initial" constraints to the LP. The method should scan the constraints |
1798 | 1798 | * array for constraints that are marked initial via calls to SCIPconsIsInitial() and put the LP relaxation |
1799 | | - * of all initial constraints to the LP with calls to SCIPaddCut(). |
| 1799 | + * of all initial constraints to the LP with calls to SCIPaddRow(). |
1800 | 1800 | * |
1801 | 1801 | * @subsection CONSSEPALP |
1802 | 1802 | * |
|
1805 | 1805 | * the current LP solution. |
1806 | 1806 | * The method is called in the LP solution loop, which means that a valid LP solution exists. |
1807 | 1807 | * |
1808 | | - * Usually, a separation callback searches and produces cuts, that are added with a call to SCIPaddCut(). |
| 1808 | + * Usually, a separation callback searches and produces cuts, that are added with a call to SCIPaddRow(). |
1809 | 1809 | * If the cut should be remembered in the global cut pool, it may also call SCIPaddPoolCut(). |
1810 | 1810 | * If the cut is constructed via multiple calls to SCIPaddVarToRow(), then performance can be improved by calling |
1811 | 1811 | * SCIPcacheRowExtensions() before these additions and SCIPflushRowExtensions() after. |
|
1833 | 1833 | * the given primal solution. |
1834 | 1834 | * The method is not called in the LP solution loop, which means that there is no valid LP solution. |
1835 | 1835 | * |
1836 | | - * Usually, a separation callback searches and produces cuts, that are added with a call to SCIPaddCut(). |
| 1836 | + * Usually, a separation callback searches and produces cuts, that are added with a call to SCIPaddRow(). |
1837 | 1837 | * If the cut should be remembered in the global cut pool, it may also call SCIPaddPoolCut(). |
1838 | 1838 | * If the cut is constructed via multiple calls to SCIPaddVarToRow(), then performance can be improved by calling |
1839 | 1839 | * SCIPcacheRowExtensions() before these additions and SCIPflushRowExtensions() after. |
|
1897 | 1897 | * variables are 0.0). It uses <code>SCIPinferVarLbCons(scip, z, 1.0, c, 0)</code> to apply this assignment (an |
1898 | 1898 | * inference information tag is not needed by the constraint handler and is set to 0). In the conflict analysis, the |
1899 | 1899 | * constraint handler may be asked to resolve the lower bound change on \f$z\f$ with constraint \f$c\f$, that was |
1900 | | - * applied at a time given by a bound change index "bdchgidx". With a call to <code>SCIPvarGetLbAtIndex(z, |
| 1900 | + * applied at a time given by a bound change index "bdchgidx". With a call to <code>SCIPgetVarLbAtIndex(z, |
1901 | 1901 | * bdchgidx)</code>, the handler can find out, that the lower bound of variable \f$z\f$ was set to 1.0 at the given |
1902 | 1902 | * point of time, and should call <code>SCIPaddConflictUb(scip, x, bdchgidx)</code> and <code>SCIPaddConflictUb(scip, y, |
1903 | 1903 | * bdchgidx)</code> to tell SCIP, that the upper bounds of \f$x\f$ and \f$y\f$ at this point of time were the reason for |
|
2697 | 2697 | * It should try to generate general purpose cutting planes in order to separate the current LP solution. |
2698 | 2698 | * The method is called in the LP solution loop, which means that a valid LP solution exists. |
2699 | 2699 | * |
2700 | | - * Usually, the callback searches and produces cuts, that are added with a call to SCIPaddCut(). |
| 2700 | + * Usually, the callback searches and produces cuts, that are added with a call to SCIPaddRow(). |
2701 | 2701 | * If the cut should be added to the global cut pool, it calls SCIPaddPoolCut(). |
2702 | 2702 | * If the cut is constructed via multiple calls to SCIPaddVarToRow(), then performance can be improved by calling |
2703 | 2703 | * SCIPcacheRowExtensions() before these additions and SCIPflushRowExtensions() after. |
|
2726 | 2726 | * relaxations that want to separate an intermediate primal solution vector. Thus, if you do not want to support |
2727 | 2727 | * such external plugins, you do not need to implement this callback method. |
2728 | 2728 | * |
2729 | | - * Usually, the callback searches and produces cuts, that are added with a call to SCIPaddCut(). |
| 2729 | + * Usually, the callback searches and produces cuts, that are added with a call to SCIPaddRow(). |
2730 | 2730 | * If the cut should be added to the global cut pool, it calls SCIPaddPoolCut(). |
2731 | 2731 | * If the cut is constructed via multiple calls to SCIPaddVarToRow(), then performance can be improved by calling |
2732 | 2732 | * SCIPcacheRowExtensions() before these additions and SCIPflushRowExtensions() after. |
|
7228 | 7228 | * infervar), the corresponding bound change (@p bdchgidx, @p boundtype), and the integer (@p inferinfo) that has been |
7229 | 7229 | * supplied during propagation. |
7230 | 7230 | * |
7231 | | - * One can use SCIPvarGetUbAtIndex() or SCIPvarGetLbAtIndex() to detect the bounds before or after the propagation that |
| 7231 | + * One can use SCIPgetVarUbAtIndex() or SCIPgetVarLbAtIndex() to detect the bounds before or after the propagation that |
7232 | 7232 | * should be investigated. Then the bounds that were involved should be passed to SCIP via SCIPaddConflictLb() and |
7233 | 7233 | * SCIPaddConflictUb(). If there is more than one valid explanation of infeasibility, either one can be used. |
7234 | 7234 | * Typically, smaller explanations tend to be better. |
|
7346 | 7346 | * on one problem in parallel. To use this feature \SCIP has to be compiled with an additional make option to |
7347 | 7347 | * enable the threading functionality (e.g. TPI=tny, see \ref MAKE). |
7348 | 7348 | * Then, a concurrent solve can be started by using the <code>concurrentopt</code> command instead of the <code>optimize</code> command |
7349 | | - * in the \SCIP shell, or by calling the interface function SCIPsolveParallel(). |
| 7349 | + * in the \SCIP shell, or by calling the interface function SCIPsolveConcurrent(). |
7350 | 7350 | * To configure the behavior of the concurrent solving mode there are new parameters in the category <code>concurrent/</code> |
7351 | 7351 | * and <code>parallel/</code> which will be explained here shortly. |
7352 | 7352 | * |
|
0 commit comments