[Couenne] Fwd: time limit in couenne
Md. Noor-E-Alam
mnalam at ualberta.ca
Sat Jan 3 23:35:31 EST 2015
Dear Professor Belotti:
I have tried with the recommended option, but I did not see any such list.
I kept my instance running for more than 13 hours, and saw that it was able
to solve the problem completely. I tried with other solver such as Bonmin,
Knitro, and experienced same issue. The following objective fuction (which
I need to maximize and minimize) is being currently considered:
Sum a[i,j]/(sum a^2[i,j]-(sum a[i,j])^2) and a[i,j] is a binary variable
Please advise me if you have any thought on this.
Thank you.
Noor
On Thu, Jan 1, 2015 at 5:45 PM, Pietro Belotti <petr.7b6 at gmail.com> wrote:
> Dear Noor,
>
> indeed the solver did start, so it is not a matter of problem size.
> However, I could not reproduce this problem and can't understand why
> this happens in your case. If you set the option "print_user_options
> yes" there should be a printout of the options used by Couenne at the
> beginning. This printed list should display "time_limit 50". If that
> line does not appear in the list, then the option was not read from
> couenne.opt. If no such list is there, then for some reason the option
> file is not read. Let me know if you can see that option in the list
> and the solver still goes on after 50 seconds.
>
> Regards,
> Pietro
>
>
> On Thu, Jan 1, 2015 at 5:26 PM, Md. Noor-E-Alam <mnalam at ualberta.ca>
> wrote:
> > Dear Professor Belotti:
> >
> > Thanks. Here, the process does not stop, and it seems the solver started
> to
> > solving the problem as I see as below:
> >
> > Couenne 0.4.7 -- an Open-Source solver for Mixed Integer Nonlinear
> > Optimization
> > Mailing list: couenne at list.coin-or.org
> > Instructions: http://www.coin-or.org/Couenne
> > couenne:
> > ANALYSIS TEST: Error in an AMPL evaluation. Run with "halt_on_ampl_error
> > yes" to see details.
> > NLP0012I
> > Num Status Obj It time
> > Location
> > NLP0014I 1 OPT -3.1881391 235 135.822
> > NLP0014I 2 INFEAS -1.320643 0 0
> > NLP0014I * 1 INFEAS -1.320643 0 0 resolve
> robustness
> > Coin0506I Presolve 3179 (-898) rows, 1349 (-910) columns and 8979 (-1807)
> > elements
> > Clp0006I 0 Obj -9.99e+012 Primal inf 2372.9528 (1)
> > Clp0006I 138 Obj -9.99e+012 Primal inf 1099.1554 (131)
> > Clp0006I 223 Obj -9.99e+012
> > Clp0000I Optimal - objective value -9.99e+012
> > Clp0032I Optimal objective -9.99e+012 - 223 iterations time 0.032,
> Presolve
> > 0.01
> > Clp0000I Optimal - objective value -9.99e+012
> > NLP0014I 4 INFEAS 1.3263245 0 0
> > Clp0000I Optimal - objective value -9.99e+012
> > Cbc0031I 336 added rows had average density of 2
> > Cbc0013I At root node, 336 cuts changed objective from -9.99e+012 to
> > -9.99e+012 in 20 passes
> > Cbc0014I Cut generator 0 (Couenne convexifier cuts) - 3019 row cuts
> average
> > 2.0 elements, 10812 column cuts (11093 active)
> > Cbc0010I After 0 nodes, 0 on tree, 1e+050 best solution, best possible
> > -9.99e+012 (6.08 seconds)
> > Cbc0010I After 100 nodes, 50 on tree, 1e+050 best solution, best possible
> > -9.99e+012 (84.05 seconds)
> > Cbc0010I After 200 nodes, 100 on tree, 1e+050 best solution, best
> possible
> > -9.99e+012 (102.63 seconds)
> > Cbc0010I After 300 nodes, 150 on tree, 1e+050 best solution, best
> possible
> > -9.99e+012 (119.17 seconds)
> > Cbc0010I After 400 nodes, 198 on tree, 1e+050 best solution, best
> possible
> > -9.99e+012 (132.94 seconds)
> > Cbc0010I After 500 nodes, 248 on tree, 1e+050 best solution, best
> possible
> > -9.99e+012 (145.55 seconds)
> > Cbc0010I After 600 nodes, 297 on tree, 1e+050 best solution, best
> possible
> > -9.99e+012 (156.68 seconds)
> > Cbc0010I After 700 nodes, 346 on tree, 1e+050 best solution, best
> possible
> > -9612.0257 (166.73 seconds)
> > Cbc0004I Integer solution of -0.17079602 found after 449099 iterations
> and
> > 756 nodes (170.34 seconds)
> > Cbc0010I After 800 nodes, 391 on tree, -0.17079602 best solution, best
> > possible -9477.0925 (181.09 seconds)
> > Cbc0010I After 900 nodes, 431 on tree, -0.17079602 best solution, best
> > possible -9477.0925 (200.92 seconds)
> > Cbc0010I After 1000 nodes, 478 on tree, -0.17079602 best solution, best
> > possible -9477.0925 (215.48 seconds)
> > Cbc0004I Integer solution of -0.28410845 found after 642844 iterations
> and
> > 1052 nodes (219.02 seconds)
> > Cbc0010I After 1100 nodes, 503 on tree, -0.28410845 best solution, best
> > possible -3934.8276 (229.48 seconds)
> > Cbc0010I After 1200 nodes, 541 on tree, -0.28410845 best solution, best
> > possible -3934.8276 (246.86 seconds)
> > Cbc0010I After 1300 nodes, 589 on tree, -0.28410845 best solution, best
> > possible -3934.8276 (253.94 seconds)
> > Cbc0010I After 1400 nodes, 632 on tree, -0.28410845 best solution, best
> > possible -3464.7821 (284.70 seconds)
> > Cbc0010I After 1500 nodes, 682 on tree, -0.28410845 best solution, best
> > possible -3464.7821 (315.72 seconds)
> > Cbc0010I After 1600 nodes, 725 on tree, -0.28410845 best solution, best
> > possible -3464.7821 (365.02 seconds)
> > Cbc0010I After 1700 nodes, 775 on tree, -0.28410845 best solution, best
> > possible -3464.7821 (381.84 seconds)
> > Cbc0004I Integer solution of -0.69549452 found after 1162777 iterations
> and
> > 1752 nodes (384.45 seconds)
> > Cbc0010I After 1800 nodes, 718 on tree, -0.69549452 best solution, best
> > possible -1497.1288 (394.14 seconds)
> > Cbc0010I After 1900 nodes, 768 on tree, -0.69549452 best solution, best
> > possible -1497.1288 (426.08 seconds)
> > Cbc0010I After 2000 nodes, 816 on tree, -0.69549452 best solution, best
> > possible -1497.1288 (456.98 seconds)
> > Cbc0010I After 2100 nodes, 866 on tree, -0.69549452 best solution, best
> > possible -1497.1288 (474.26 seconds)
> > Cbc0010I After 2200 nodes, 916 on tree, -0.69549452 best solution, best
> > possible -1497.1288 (482.93 seconds)
> > Cbc0010I After 2300 nodes, 955 on tree, -0.69549452 best solution, best
> > possible -1437.8282 (491.52 seconds)
> > Cbc0010I After 2400 nodes, 985 on tree, -0.69549452 best solution, best
> > possible -1278.9137 (509.34 seconds)
> > Cbc0010I After 2500 nodes, 1027 on tree, -0.69549452 best solution, best
> > possible -1278.9137 (537.75 seconds)
> > Cbc0010I After 2600 nodes, 1073 on tree, -0.69549452 best solution, best
> > possible -1278.9137 (550.88 seconds)
> > Cbc0010I After 2700 nodes, 1122 on tree, -0.69549452 best solution, best
> > possible -1278.9137 (558.45 seconds)
> > Cbc0010I After 2800 nodes, 1151 on tree, -0.69549452 best solution, best
> > possible -1008.0625 (571.40 seconds)
> > Cbc0010I After 2900 nodes, 1187 on tree, -0.69549452 best solution, best
> > possible -944.50195 (594.32 seconds)
> > Cbc0010I After 3000 nodes, 1231 on tree, -0.69549452 best solution, best
> > possible -944.50195 (649.49 seconds)
> > Cbc0010I After 3100 nodes, 1280 on tree, -0.69549452 best solution, best
> > possible -944.50195 (660.08 seconds)
> > Cbc0010I After 3200 nodes, 1322 on tree, -0.69549452 best solution, best
> > possible -935.30606 (702.94 seconds)
> > Cbc0010I After 3300 nodes, 1371 on tree, -0.69549452 best solution, best
> > possible -935.30606 (729.48 seconds)
> > Cbc0010I After 3400 nodes, 1415 on tree, -0.69549452 best solution, best
> > possible -935.30606 (747.84 seconds)
> > Cbc0010I After 3500 nodes, 1465 on tree, -0.69549452 best solution, best
> > possible -935.30606 (758.22 seconds)
> > Cbc0010I After 3600 nodes, 1510 on tree, -0.69549452 best solution, best
> > possible -935.30606 (765.43 seconds)
> > Cbc0010I After 3700 nodes, 1551 on tree, -0.69549452 best solution, best
> > possible -905.19719 (788.05 seconds)
> > Cbc0010I After 3800 nodes, 1595 on tree, -0.69549452 best solution, best
> > possible -905.19719 (822.52 seconds)
> > Cbc0010I After 3900 nodes, 1645 on tree, -0.69549452 best solution, best
> > possible -905.19719 (851.35 seconds)
> > Cbc0010I After 4000 nodes, 1689 on tree, -0.69549452 best solution, best
> > possible -905.19719 (866.37 seconds)
> > Cbc0010I After 4100 nodes, 1718 on tree, -0.69549452 best solution, best
> > possible -873.84957 (876.74 seconds)
> > Cbc0010I After 4200 nodes, 1761 on tree, -0.69549452 best solution, best
> > possible -855.04626 (900.88 seconds)
> > Cbc0010I After 4300 nodes, 1804 on tree, -0.69549452 best solution, best
> > possible -855.04626 (919.96 seconds)
> > Cbc0010I After 4400 nodes, 1854 on tree, -0.69549452 best solution, best
> > possible -855.04626 (929.08 seconds)
> > Cbc0010I After 4500 nodes, 1900 on tree, -0.69549452 best solution, best
> > possible -833.78802 (995.90 seconds)
> > Cbc0010I After 4600 nodes, 1943 on tree, -0.69549452 best solution, best
> > possible -833.78802 (1051.57 seconds)
> > Cbc0010I After 4700 nodes, 1993 on tree, -0.69549452 best solution, best
> > possible -833.78802 (1063.96 seconds)
> > Cbc0010I After 4800 nodes, 2043 on tree, -0.69549452 best solution, best
> > possible -833.78802 (1072.19 seconds)
> > Cbc0010I After 4900 nodes, 2061 on tree, -0.69549452 best solution, best
> > possible -783.39437 (1085.38 seconds)
> > Cbc0010I After 5000 nodes, 2093 on tree, -0.69549452 best solution, best
> > possible -783.39437 (1098.21 seconds)
> > Cbc0010I After 5100 nodes, 2126 on tree, -0.69549452 best solution, best
> > possible -768.08458 (1106.84 seconds)
> > Cbc0010I After 5200 nodes, 2156 on tree, -0.69549452 best solution, best
> > possible -766.06154 (1127.18 seconds)
> > Cbc0010I After 5300 nodes, 2203 on tree, -0.69549452 best solution, best
> > possible -766.06154 (1153.15 seconds)
> > Cbc0010I After 5400 nodes, 2250 on tree, -0.69549452 best solution, best
> > possible -766.06154 (1169.72 seconds)
> > Cbc0010I After 5500 nodes, 2300 on tree, -0.69549452 best solution, best
> > possible -766.06154 (1179.17 seconds)
> > Cbc0010I After 5600 nodes, 2341 on tree, -0.69549452 best solution, best
> > possible -667.10164 (1205.76 seconds)
> > Cbc0010I After 5700 nodes, 2376 on tree, -0.69549452 best solution, best
> > possible -667.10164 (1248.46 seconds)
> > Cbc0010I After 5800 nodes, 2426 on tree, -0.69549452 best solution, best
> > possible -667.10164 (1257.34 seconds)
> > Cbc0010I After 5900 nodes, 2468 on tree, -0.69549452 best solution, best
> > possible -641.93096 (1271.95 seconds)
> > Cbc0010I After 6000 nodes, 2514 on tree, -0.69549452 best solution, best
> > possible -641.93096 (1293.99 seconds)
> > Cbc0010I After 6100 nodes, 2562 on tree, -0.69549452 best solution, best
> > possible -641.93096 (1307.85 seconds)
> > Cbc0010I After 6200 nodes, 2612 on tree, -0.69549452 best solution, best
> > possible -641.93096 (1315.67 seconds)
> > Cbc0004I Integer solution of -0.85560728 found after 4335848 iterations
> and
> > 6238 nodes (1317.68 seconds)
> > Cbc0010I After 6300 nodes, 2564 on tree, -0.85560728 best solution, best
> > possible -593.32669 (1325.69 seconds)
> > Cbc0010I After 6400 nodes, 2588 on tree, -0.85560728 best solution, best
> > possible -586.96565 (1336.96 seconds)
> > Cbc0010I After 6500 nodes, 2625 on tree, -0.85560728 best solution, best
> > possible -559.63963 (1352.55 seconds)
> > Cbc0010I After 6600 nodes, 2673 on tree, -0.85560728 best solution, best
> > possible -559.63963 (1403.13 seconds)
> > Cbc0010I After 6700 nodes, 2717 on tree, -0.85560728 best solution, best
> > possible -559.63963 (1417.16 seconds)
> > Cbc0010I After 6800 nodes, 2763 on tree, -0.85560728 best solution, best
> > possible -559.63963 (1425.13 seconds)
> > Cbc0010I After 6900 nodes, 2783 on tree, -0.85560728 best solution, best
> > possible -512.01149 (1437.31 seconds)
> > Cbc0010I After 7000 nodes, 2823 on tree, -0.85560728 best solution, best
> > possible -512.01149 (1446.75 seconds)
> > Cbc0010I After 7100 nodes, 2848 on tree, -0.85560728 best solution, best
> > possible -479.53076 (1457.94 seconds)
> > Cbc0010I After 7200 nodes, 2877 on tree, -0.85560728 best solution, best
> > possible -478.36479 (1523.72 seconds)
> > Cbc0010I After 7300 nodes, 2889 on tree, -0.85560728 best solution, best
> > possible -422.51336 (1533.07 seconds)
> > Cbc0010I After 7400 nodes, 2912 on tree, -0.85560728 best solution, best
> > possible -414.8513 (1544.09 seconds)
> > Cbc0010I After 7500 nodes, 2945 on tree, -0.85560728 best solution, best
> > possible -405.97904 (1563.01 seconds)
> > Cbc0010I After 7600 nodes, 2988 on tree, -0.85560728 best solution, best
> > possible -405.97904 (1585.31 seconds)
> > Cbc0010I After 7700 nodes, 3036 on tree, -0.85560728 best solution, best
> > possible -405.97904 (1597.65 seconds)
> > Cbc0010I After 7800 nodes, 3086 on tree, -0.85560728 best solution, best
> > possible -405.97904 (1605.52 seconds)
> > Cbc0004I Integer solution of -0.86007979 found after 5174816 iterations
> and
> > 7850 nodes (1608.22 seconds)
> > Cbc0010I After 7900 nodes, 3109 on tree, -0.86007979 best solution, best
> > possible -378.1229 (1615.11 seconds)
> > Cbc0010I After 8000 nodes, 3142 on tree, -0.86007979 best solution, best
> > possible -378.1229 (1623.32 seconds)
> > Cbc0010I After 8100 nodes, 3168 on tree, -0.86007979 best solution, best
> > possible -343.23263 (1633.66 seconds)
> > Cbc0010I After 8200 nodes, 3208 on tree, -0.86007979 best solution, best
> > possible -316.99206 (1651.68 seconds)
> > Cbc0010I After 8300 nodes, 3252 on tree, -0.86007979 best solution, best
> > possible -316.99206 (1670.69 seconds)
> > Cbc0010I After 8400 nodes, 3301 on tree, -0.86007979 best solution, best
> > possible -316.99206 (1680.01 seconds)
> > Cbc0010I After 8500 nodes, 3347 on tree, -0.86007979 best solution, best
> > possible -290.86435 (1689.88 seconds)
> > Cbc0010I After 8600 nodes, 3391 on tree, -0.86007979 best solution, best
> > possible -290.86435 (1710.19 seconds)
> > Cbc0010I After 8700 nodes, 3441 on tree, -0.86007979 best solution, best
> > possible -290.86435 (1721.66 seconds)
> > Cbc0010I After 8800 nodes, 3486 on tree, -0.86007979 best solution, best
> > possible -290.86435 (1729.22 seconds)
> > Cbc0010I After 8900 nodes, 3498 on tree, -0.86007979 best solution, best
> > possible -282.52269 (1736.18 seconds)
> > Cbc0010I After 9000 nodes, 3523 on tree, -0.86007979 best solution, best
> > possible -273.70893 (1759.31 seconds)
> > Cbc0010I After 9100 nodes, 3542 on tree, -0.86007979 best solution, best
> > possible -271.75999 (1777.07 seconds)
> > Cbc0010I After 9200 nodes, 3584 on tree, -0.86007979 best solution, best
> > possible -227.1299 (1806.32 seconds)
> > Cbc0010I After 9300 nodes, 3627 on tree, -0.86007979 best solution, best
> > possible -227.1299 (1821.24 seconds)
> > Cbc0010I After 9400 nodes, 3677 on tree, -0.86007979 best solution, best
> > possible -227.1299 (1830.11 seconds)
> > Cbc0010I After 9500 nodes, 3699 on tree, -0.86007979 best solution, best
> > possible -195.47091 (1837.19 seconds)
> > Cbc0010I After 9600 nodes, 3734 on tree, -0.86007979 best solution, best
> > possible -195.47091 (1845.74 seconds)
> > Cbc0010I After 9700 nodes, 3765 on tree, -0.86007979 best solution, best
> > possible -186.78569 (1859.93 seconds)
> > Cbc0010I After 9800 nodes, 3815 on tree, -0.86007979 best solution, best
> > possible -186.78569 (1869.41 seconds)
> > Cbc0010I After 9900 nodes, 3845 on tree, -0.86007979 best solution, best
> > possible -184.55176 (1878.20 seconds)
> > Cbc0010I After 10000 nodes, 3876 on tree, -0.86007979 best solution, best
> > possible -183.45646 (1892.51 seconds)
> > Cbc0010I After 10100 nodes, 3923 on tree, -0.86007979 best solution, best
> > possible -183.45646 (1904.06 seconds)
> > Cbc0010I After 10200 nodes, 3971 on tree, -0.86007979 best solution, best
> > possible -183.45646 (1912.11 seconds)
> > Cbc0010I After 10300 nodes, 4010 on tree, -0.86007979 best solution, best
> > possible -182.08362 (1927.32 seconds)
> > Cbc0010I After 10400 nodes, 4056 on tree, -0.86007979 best solution, best
> > possible -182.08362 (1937.65 seconds)
> > Cbc0010I After 10500 nodes, 4102 on tree, -0.86007979 best solution, best
> > possible -181.67047 (1948.44 seconds)
> > Cbc0010I After 10600 nodes, 4144 on tree, -0.86007979 best solution, best
> > possible -181.67047 (1986.52 seconds)
> > Cbc0010I After 10700 nodes, 4194 on tree, -0.86007979 best solution, best
> > possible -181.67047 (2011.76 seconds)
> > Cbc0010I After 10800 nodes, 4237 on tree, -0.86007979 best solution, best
> > possible -167.59682 (2020.86 seconds)
> > Cbc0010I After 10900 nodes, 4281 on tree, -0.86007979 best solution, best
> > possible -167.59682 (2041.47 seconds)
> > Cbc0010I After 11000 nodes, 4330 on tree, -0.86007979 best solution, best
> > possible -167.59682 (2052.82 seconds)
> > Cbc0010I After 11100 nodes, 4376 on tree, -0.86007979 best solution, best
> > possible -166.82133 (2133.05 seconds)
> >
> > Thanks you again for your help.
> >
> > Noor
> >
> > On Thu, Jan 1, 2015 at 10:52 AM, Pietro Belotti <petr.7b6 at gmail.com>
> wrote:
> >>
> >> Dear Noor,
> >>
> >> first, for future reference please direct all such questions to the
> >> Couenne mailing list, couenne at lists.coin-or.org in order to receive a
> >> faster response.
> >>
> >> Second, I cannot reproduce that behaviour. If I create a file
> >> couenne.opt and add the same line, any solution will stop after 50
> >> seconds. However, if the problem you have is rather large (more than
> >> 1000 variables and/or constraints), it might happen that Couenne is
> >> stuck in the initialization part, i.e., reading and reformulation of
> >> the problem.
> >>
> >> Pietro
> >>
> >>
> >>
> >> On Thu, Jan 1, 2015 at 4:16 PM, Md. Noor-E-Alam <mnalam at ualberta.ca>
> >> wrote:
> >> >
> >> > Dear Professor Belotti:
> >> >
> >> > I am trying to solve a MINLP with AMPL/Couenne, and would like to
> impose
> >> > time limit. I have done this with a couenne.opt file and following
> >> > statement:
> >> >
> >> > time_limit 50
> >> >
> >> >
> >> > I keep it in same directory, but do not see any effect. It seems that
> >> > Couenne does not consider it. Could you please advise me on this.
> >> >
> >> >
> >> > Sincerely
> >> >
> >> >
> >> > Noor
> >>
> >
> >
> >
> > --
> >
> > Best Regards
> >
> > Noor
> >
> > Md. Noor-E-Alam
> > Engineering Management
> > Dept. of Mechanical Engineering
> > University of Alberta
> >
> >
> >
> > --
> >
> > Best Regards
> >
> > Noor
> >
> > Md. Noor-E-Alam
> > Engineering Management
> > Dept. of Mechanical Engineering
> > University of Alberta
> >
> > _______________________________________________
> > Couenne mailing list
> > Couenne at list.coin-or.org
> > http://list.coin-or.org/mailman/listinfo/couenne
>
>
--
Best Regards
Noor
Md. Noor-E-Alam
Engineering Management
Dept. of Mechanical Engineering
University of Alberta
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/couenne/attachments/20150103/a1b42c46/attachment.html>
More information about the Couenne
mailing list