Diff of the two buildlogs: -- --- b1/build.log 2024-10-14 08:41:53.936863621 +0000 +++ b2/build.log 2024-10-14 08:43:44.608142294 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Sun Oct 13 20:39:19 -12 2024 -I: pbuilder-time-stamp: 1728895159 +I: Current time: Mon Oct 14 22:42:03 +14 2024 +I: pbuilder-time-stamp: 1728895323 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration @@ -30,52 +30,84 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/31123/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/D01_modify_environment starting +debug: Running on virt64z. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Oct 14 08:42 /bin/sh -> /bin/bash +I: Setting pbuilder2's login shell to /bin/bash +I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='armhf' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=3 ' - DISTRIBUTION='trixie' - HOME='/root' - HOST_ARCH='armhf' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="32" [3]="1" [4]="release" [5]="arm-unknown-linux-gnueabihf") + BASH_VERSION='5.2.32(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=armhf + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=4 ' + DIRSTACK=() + DISTRIBUTION=trixie + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=arm + HOST_ARCH=armhf IFS=' ' - INVOCATION_ID='e20ef40834e84bc9982182b321e9c6e0' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='31123' - PS1='# ' - PS2='> ' + INVOCATION_ID=a876c4baf33f4c278a14f3786ecd8237 + LANG=C + LANGUAGE=it_CH:it + LC_ALL=C + MACHTYPE=arm-unknown-linux-gnueabihf + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnueabihf + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=23519 PS4='+ ' - PWD='/' - SHELL='/bin/bash' - SHLVL='2' - SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.9nvLgsh4/pbuilderrc_0seG --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.9nvLgsh4/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='113' - SUDO_UID='107' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://10.0.0.15:3142/' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.9nvLgsh4/pbuilderrc_Tn0A --distribution trixie --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.9nvLgsh4/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=110 + SUDO_UID=103 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://10.0.0.15:3142/ I: uname -a - Linux virt32c 6.1.0-26-armmp-lpae #1 SMP Debian 6.1.112-1 (2024-09-30) armv7l GNU/Linux + Linux i-capture-the-hostname 6.1.0-26-arm64 #1 SMP Debian 6.1.112-1 (2024-09-30) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/31123/tmp/hooks/D02_print_environment finished +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -194,7 +226,7 @@ Get: 71 http://deb.debian.org/debian trixie/main armhf dh-python all 6.20240824 [109 kB] Get: 72 http://deb.debian.org/debian trixie/main armhf python3-all armhf 3.12.6-1 [1040 B] Get: 73 http://deb.debian.org/debian trixie/main armhf python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 31.4 MB in 2s (14.7 MB/s) +Fetched 31.4 MB in 1s (54.1 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:armhf. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19508 files and directories currently installed.) @@ -447,8 +479,8 @@ Setting up tzdata (2024a-4) ... Current default time zone: 'Etc/UTC' -Local time is now: Mon Oct 14 08:40:38 UTC 2024. -Universal Time is now: Mon Oct 14 08:40:38 UTC 2024. +Local time is now: Mon Oct 14 08:42:37 UTC 2024. +Universal Time is now: Mon Oct 14 08:42:37 UTC 2024. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -517,7 +549,11 @@ Building tag database... -> Finished parsing the build-deps I: Building the package -I: Running cd /build/reproducible-path/python-pulp-2.7.0+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../python-pulp_2.7.0+dfsg-4_source.changes +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for trixie +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/A99_set_merged_usr finished +hostname: Name or service not known +I: Running cd /build/reproducible-path/python-pulp-2.7.0+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../python-pulp_2.7.0+dfsg-4_source.changes dpkg-buildpackage: info: source package python-pulp dpkg-buildpackage: info: source version 2.7.0+dfsg-4 dpkg-buildpackage: info: source distribution unstable @@ -553,12 +589,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO @@ -759,7 +795,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b9bff09a6d014e25a94a72fd6aba8c35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9bff09a6d014e25a94a72fd6aba8c35-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/019c6bd31bd8451991ffe97ac04033e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/019c6bd31bd8451991ffe97ac04033e9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -782,7 +818,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/24b234f44e9b40258d5a936d3165d037-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/24b234f44e9b40258d5a936d3165d037-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dcaf5d7f83904a45a3482cb2ad7d04b4-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/dcaf5d7f83904a45a3482cb2ad7d04b4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -800,7 +836,7 @@ Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 @@ -813,7 +849,7 @@ Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.02 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 @@ -832,7 +868,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 @@ -867,11 +903,11 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 14 columns -Cbc0038I Mini branch and bound did not improve solution (0.10 seconds) -Cbc0038I After 0.10 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.09 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.11 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -880,7 +916,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.11 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -897,17 +933,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.10 -Time (Wallclock seconds): 0.11 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.11 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/70766561a4a9435ca0de70fcbdf3511d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70766561a4a9435ca0de70fcbdf3511d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/121f16dd2bbc4fcb9cdab21b9bae7924-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/121f16dd2bbc4fcb9cdab21b9bae7924-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -926,7 +962,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 48 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 38 columns -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 @@ -952,7 +988,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.29 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.15 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -987,145 +1023,186 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 15 integers at bound fixed and 30 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 96 rows 81 columns -Cbc0038I Mini branch and bound did not improve solution (0.51 seconds) -Cbc0038I After 0.51 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.49 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.51 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.28 seconds) +Cbc0038I After 0.28 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.26 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.28 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.116 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.182 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.033 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.101 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.065 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.028 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (1.78 seconds) +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.054 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.103 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.058 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.93 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 33 rows 47 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (3.27 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (1.84 seconds) Cbc0032I Strong branching done 966 times (8486 iterations), fathomed 27 nodes and fixed 39 variables Cbc0035I Maximum depth 13, 186 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 -Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.116 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.253 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.033 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.175 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.065 seconds) -TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.096 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.054 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.151 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.106 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) +TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.069 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.010 seconds) +ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 94 Total iterations: 4740 -Time (CPU seconds): 3.06 -Time (Wallclock seconds): 3.29 +Time (CPU seconds): 1.83 +Time (Wallclock seconds): 1.85 Option for printingOptions changed from normal to all -Total time (CPU seconds): 3.06 (Wallclock seconds): 3.30 +Total time (CPU seconds): 1.83 (Wallclock seconds): 1.85 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/60731f769fc647328d6be1f5b291020e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60731f769fc647328d6be1f5b291020e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d82c576c29c740c5ae728f08038cc039-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d82c576c29c740c5ae728f08038cc039-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1616 RHS -At line 1837 BOUNDS -At line 2048 ENDATA -Problem MODEL has 220 rows, 210 columns and 760 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -133.115 - 0.00 seconds -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 121 rows, 120 columns (120 integer (120 of which binary)) and 420 elements -Cbc0038I Initial state - 12 integers unsatisfied sum - 3.34177 -Cbc0038I Solution found of -132.85 -Cbc0038I Before mini branch and bound, 108 integers at bound fixed and 0 continuous -Cbc0038I Full problem 121 rows 120 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) -Cbc0038I Round again with cutoff of -132.876 -Cbc0038I Reduced cost fixing fixed 59 variables on major pass 2 -Cbc0038I Pass 1: suminf. 0.32346 (11) obj. -132.876 iterations 31 -Cbc0038I Pass 2: suminf. 4.41653 (12) obj. -132.876 iterations 7 -Cbc0038I Pass 3: suminf. 3.20950 (12) obj. -132.876 iterations 11 -Cbc0038I Pass 4: suminf. 4.22823 (12) obj. -132.876 iterations 9 -Cbc0038I Pass 5: suminf. 4.93829 (13) obj. -132.876 iterations 5 -Cbc0038I Pass 6: suminf. 4.41653 (12) obj. -132.876 iterations 7 -Cbc0038I Pass 7: suminf. 4.41653 (12) obj. -132.876 iterations 4 -Cbc0038I Pass 8: suminf. 4.18246 (12) obj. -132.876 iterations 7 -Cbc0038I Pass 9: suminf. 4.93829 (13) obj. -132.876 iterations 4 -Cbc0038I Pass 10: suminf. 3.21784 (11) obj. -132.876 iterations 12 -Cbc0038I Pass 11: suminf. 4.18246 (12) obj. -132.876 iterations 10 -Cbc0038I Pass 12: suminf. 3.08263 (12) obj. -132.876 iterations 10 -Cbc0038I Pass 13: suminf. 0.32346 (11) obj. -132.876 iterations 11 -Cbc0038I Pass 14: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 15: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 16: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 17: suminf. 0.32346 (11) obj. -132.876 iterations 2 -Cbc0038I Pass 18: suminf. 0.32346 (11) obj. -132.876 iterations 2 -Cbc0038I Pass 19: suminf. 0.32346 (11) obj. -132.876 iterations 1 -Cbc0038I Pass 20: suminf. 0.33429 (12) obj. -132.876 iterations 2 -Cbc0038I Pass 21: suminf. 0.32346 (11) obj. -132.876 iterations 2 -Cbc0038I Pass 22: suminf. 0.32346 (11) obj. -132.876 iterations 1 -Cbc0038I Pass 23: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 24: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 25: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 26: suminf. 0.33429 (12) obj. -132.876 iterations 2 -Cbc0038I Pass 27: suminf. 0.32346 (11) obj. -132.876 iterations 2 -Cbc0038I Pass 28: suminf. 0.32346 (11) obj. -132.876 iterations 0 -Cbc0038I Pass 29: suminf. 0.33429 (12) obj. -132.876 iterations 1 -Cbc0038I Pass 30: suminf. 0.33429 (12) obj. -132.876 iterations 1 +At line 1655 RHS +At line 1876 BOUNDS +At line 2087 ENDATA +Problem MODEL has 220 rows, 210 columns and 800 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -128.052 - 0.00 seconds +Cgl0004I processed model has 209 rows, 200 columns (200 integer (200 of which binary)) and 760 elements +Cutoff increment increased from 1e-05 to 0.04995 +Cbc0038I Initial state - 24 integers unsatisfied sum - 5.99992 +Cbc0038I Pass 1: suminf. 1.61188 (6) obj. -125.465 iterations 104 +Cbc0038I Pass 2: suminf. 0.80619 (4) obj. -123.222 iterations 4 +Cbc0038I Solution found of -112.35 +Cbc0038I Rounding solution of -113.3 is better than previous of -112.35 + +Cbc0038I Before mini branch and bound, 172 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 12 rows 15 columns +Cbc0038I Mini branch and bound improved solution from -113.3 to -123 (0.03 seconds) +Cbc0038I Round again with cutoff of -123.6 +Cbc0038I Reduced cost fixing fixed 2 variables on major pass 2 +Cbc0038I Pass 3: suminf. 1.61188 (6) obj. -125.465 iterations 0 +Cbc0038I Pass 4: suminf. 0.93017 (5) obj. -123.6 iterations 25 +Cbc0038I Pass 5: suminf. 1.03383 (5) obj. -123.6 iterations 33 +Cbc0038I Pass 6: suminf. 1.03383 (5) obj. -123.6 iterations 8 +Cbc0038I Pass 7: suminf. 1.32424 (5) obj. -123.6 iterations 19 +Cbc0038I Pass 8: suminf. 2.13153 (25) obj. -123.6 iterations 86 +Cbc0038I Pass 9: suminf. 1.62964 (7) obj. -123.6 iterations 72 +Cbc0038I Pass 10: suminf. 1.38555 (6) obj. -123.6 iterations 30 +Cbc0038I Pass 11: suminf. 1.19455 (5) obj. -123.6 iterations 8 +Cbc0038I Pass 12: suminf. 1.18788 (5) obj. -123.6 iterations 18 +Cbc0038I Pass 13: suminf. 1.07771 (5) obj. -123.6 iterations 19 +Cbc0038I Pass 14: suminf. 1.19455 (5) obj. -123.6 iterations 15 +Cbc0038I Pass 15: suminf. 2.14706 (25) obj. -123.6 iterations 75 +Cbc0038I Pass 16: suminf. 1.95797 (23) obj. -123.6 iterations 13 +Cbc0038I Pass 17: suminf. 1.91061 (19) obj. -123.6 iterations 99 +Cbc0038I Pass 18: suminf. 1.91061 (19) obj. -123.6 iterations 0 +Cbc0038I Pass 19: suminf. 1.81435 (5) obj. -125.113 iterations 67 +Cbc0038I Pass 20: suminf. 1.24786 (4) obj. -123.6 iterations 6 +Cbc0038I Pass 21: suminf. 1.36182 (4) obj. -123.6 iterations 11 +Cbc0038I Pass 22: suminf. 1.36182 (4) obj. -123.6 iterations 3 +Cbc0038I Pass 23: suminf. 1.42021 (4) obj. -123.6 iterations 10 +Cbc0038I Pass 24: suminf. 1.52778 (6) obj. -123.6 iterations 62 +Cbc0038I Pass 25: suminf. 1.24793 (5) obj. -123.6 iterations 106 +Cbc0038I Pass 26: suminf. 1.73760 (5) obj. -123.6 iterations 56 +Cbc0038I Pass 27: suminf. 1.00866 (3) obj. -124.22 iterations 18 +Cbc0038I Pass 28: suminf. 0.90903 (3) obj. -123.6 iterations 12 +Cbc0038I Pass 29: suminf. 0.90903 (3) obj. -123.6 iterations 4 +Cbc0038I Pass 30: suminf. 1.19668 (3) obj. -123.6 iterations 13 +Cbc0038I Pass 31: suminf. 1.73995 (6) obj. -123.6 iterations 72 +Cbc0038I Pass 32: suminf. 0.94407 (5) obj. -123.6 iterations 42 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 104 integers at bound fixed and 0 continuous -Cbc0038I Full problem 121 rows 120 columns, reduced to 6 rows 5 columns -Cbc0038I Mini branch and bound did not improve solution (0.11 seconds) -Cbc0038I After 0.11 seconds - Feasibility pump exiting with objective of -132.85 - took 0.09 seconds -Cbc0012I Integer solution of -132.85 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) -Cbc0006I The LP relaxation is infeasible or too expensive -Cbc0013I At root node, 0 cuts changed objective from -133.11456 to -133.11456 in 1 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 17 column cuts (17 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0038I Before mini branch and bound, 154 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 12 rows 26 columns +Cbc0038I Mini branch and bound improved solution from -123 to -124.85 (0.08 seconds) +Cbc0038I Round again with cutoff of -125.55 +Cbc0038I Reduced cost fixing fixed 8 variables on major pass 3 +Cbc0038I Pass 32: suminf. 1.68398 (7) obj. -125.55 iterations 15 +Cbc0038I Pass 33: suminf. 1.28480 (6) obj. -125.55 iterations 7 +Cbc0038I Pass 34: suminf. 1.09410 (5) obj. -125.55 iterations 10 +Cbc0038I Pass 35: suminf. 1.17947 (5) obj. -125.55 iterations 21 +Cbc0038I Pass 36: suminf. 1.69147 (6) obj. -125.55 iterations 87 +Cbc0038I Pass 37: suminf. 0.88292 (4) obj. -125.55 iterations 98 +Cbc0038I Pass 38: suminf. 0.93080 (4) obj. -125.55 iterations 78 +Cbc0038I Pass 39: suminf. 1.27641 (5) obj. -125.55 iterations 49 +Cbc0038I Pass 40: suminf. 1.24731 (5) obj. -125.55 iterations 10 +Cbc0038I Pass 41: suminf. 0.73983 (4) obj. -125.55 iterations 91 +Cbc0038I Pass 42: suminf. 0.65893 (3) obj. -125.55 iterations 8 +Cbc0038I Pass 43: suminf. 0.56366 (4) obj. -125.55 iterations 72 +Cbc0038I Pass 44: suminf. 0.65893 (3) obj. -125.55 iterations 68 +Cbc0038I Pass 45: suminf. 2.18144 (7) obj. -125.55 iterations 43 +Cbc0038I Pass 46: suminf. 1.90072 (6) obj. -125.55 iterations 10 +Cbc0038I Pass 47: suminf. 1.63690 (5) obj. -125.55 iterations 95 +Cbc0038I Pass 48: suminf. 1.16242 (5) obj. -125.55 iterations 82 +Cbc0038I Pass 49: suminf. 1.34260 (5) obj. -125.55 iterations 68 +Cbc0038I Pass 50: suminf. 1.16242 (5) obj. -125.55 iterations 14 +Cbc0038I Pass 51: suminf. 1.58912 (6) obj. -125.55 iterations 35 +Cbc0038I Pass 52: suminf. 0.95466 (5) obj. -125.55 iterations 105 +Cbc0038I Pass 53: suminf. 0.99822 (4) obj. -125.55 iterations 89 +Cbc0038I Pass 54: suminf. 0.96650 (4) obj. -125.55 iterations 9 +Cbc0038I Pass 55: suminf. 3.71371 (24) obj. -125.55 iterations 46 +Cbc0038I Pass 56: suminf. 1.43428 (6) obj. -125.55 iterations 30 +Cbc0038I Pass 57: suminf. 1.29810 (5) obj. -125.55 iterations 97 +Cbc0038I Pass 58: suminf. 1.33341 (5) obj. -125.55 iterations 62 +Cbc0038I Pass 59: suminf. 1.29810 (5) obj. -125.55 iterations 17 +Cbc0038I Pass 60: suminf. 1.44768 (23) obj. -125.55 iterations 32 +Cbc0038I Pass 61: suminf. 1.03742 (5) obj. -125.55 iterations 33 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 142 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 18 rows 24 columns +Cbc0038I Mini branch and bound did not improve solution (0.13 seconds) +Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of -124.85 - took 0.12 seconds +Cbc0012I Integer solution of -124.85 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Full problem 209 rows 200 columns, reduced to 12 rows 13 columns +Cbc0031I 11 added rows had average density of 8.6363636 +Cbc0013I At root node, 44 cuts changed objective from -128.052 to -124.7 in 5 passes +Cbc0014I Cut generator 0 (Probing) - 28 row cuts average 7.1 elements, 5 column cuts (5 active) in 0.002 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 5 row cuts average 20.6 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 18 row cuts average 8.5 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -132.85, took 0 iterations and 0 nodes (0.11 seconds) -Cbc0035I Maximum depth 0, 59 variables fixed on reduced cost -Cuts at root node changed objective from -133.115 to -133.115 -Probing was tried 1 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 39 row cuts average 17.6 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 7 (ZeroHalf) - 5 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1 +Cbc0001I Search completed - best objective -124.85, took 63 iterations and 0 nodes (0.17 seconds) +Cbc0035I Maximum depth 0, 51 variables fixed on reduced cost +Cuts at root node changed objective from -128.052 to -124.7 +Probing was tried 5 times and created 33 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Gomory was tried 5 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Knapsack was tried 5 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Clique was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +FlowCover was tried 5 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 5 times and created 39 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +ZeroHalf was tried 5 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Result - Optimal solution found -Objective value: -132.85000000 +Objective value: -124.85000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.11 -Time (Wallclock seconds): 0.12 +Total iterations: 63 +Time (CPU seconds): 0.16 +Time (Wallclock seconds): 0.17 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.12 (Wallclock seconds): 0.12 +Total time (CPU seconds): 0.16 (Wallclock seconds): 0.18 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/73bc8df73ac64bf3a50bcec41dcd5495-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73bc8df73ac64bf3a50bcec41dcd5495-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/717ea2fe77c94e12b64549a237b1e7aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/717ea2fe77c94e12b64549a237b1e7aa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1137,173 +1214,157 @@ Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 1.20459 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 43.5 iterations 4 -Cbc0038I Solution found of 43.5 -Cbc0038I Relaxing continuous gives 43.5 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.743732 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 121.5 iterations 3 +Cbc0038I Solution found of 121.5 +Cbc0038I Relaxing continuous gives 121.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 109.35 +Cbc0038I Pass 2: suminf. 0.05898 (1) obj. 109.35 iterations 1 +Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 109.35 iterations 3 +Cbc0038I Solution found of 109.35 +Cbc0038I Relaxing continuous gives 93.5 +Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 1 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 7 columns Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I Round again with cutoff of 39.15 -Cbc0038I Pass 2: suminf. 0.03175 (1) obj. 39.15 iterations 1 -Cbc0038I Pass 3: suminf. 0.49735 (2) obj. 39.15 iterations 4 -Cbc0038I Pass 4: suminf. 0.59990 (2) obj. 39.15 iterations 3 -Cbc0038I Pass 5: suminf. 0.24188 (2) obj. 39.15 iterations 2 -Cbc0038I Pass 6: suminf. 0.67510 (3) obj. 39.15 iterations 4 -Cbc0038I Pass 7: suminf. 0.35901 (2) obj. 39.15 iterations 3 -Cbc0038I Pass 8: suminf. 0.19234 (1) obj. 39.15 iterations 1 -Cbc0038I Pass 9: suminf. 0.47764 (2) obj. 39.15 iterations 3 -Cbc0038I Pass 10: suminf. 0.49218 (2) obj. 39.15 iterations 2 -Cbc0038I Pass 11: suminf. 0.25803 (1) obj. 39.15 iterations 10 -Cbc0038I Pass 12: suminf. 0.27636 (3) obj. 39.15 iterations 3 -Cbc0038I Pass 13: suminf. 0.46359 (3) obj. 39.15 iterations 5 -Cbc0038I Pass 14: suminf. 0.25153 (3) obj. 39.15 iterations 4 -Cbc0038I Pass 15: suminf. 0.64486 (2) obj. 39.15 iterations 5 -Cbc0038I Pass 16: suminf. 0.64486 (2) obj. 39.15 iterations 0 -Cbc0038I Pass 17: suminf. 0.31133 (1) obj. 39.15 iterations 3 -Cbc0038I Pass 18: suminf. 0.30129 (2) obj. 39.15 iterations 3 -Cbc0038I Pass 19: suminf. 0.42264 (2) obj. 39.15 iterations 2 -Cbc0038I Pass 20: suminf. 0.57917 (3) obj. 39.15 iterations 7 -Cbc0038I Pass 21: suminf. 0.57917 (3) obj. 39.15 iterations 0 -Cbc0038I Pass 22: suminf. 0.86225 (3) obj. 39.15 iterations 4 -Cbc0038I Pass 23: suminf. 0.44149 (3) obj. 39.15 iterations 5 -Cbc0038I Pass 24: suminf. 0.12443 (2) obj. 39.15 iterations 7 -Cbc0038I Pass 25: suminf. 0.00000 (0) obj. 39.15 iterations 2 -Cbc0038I Solution found of 39.15 -Cbc0038I Relaxing continuous gives 30.5 -Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns -Cbc0038I Mini branch and bound improved solution from 30.5 to 7.5 (0.05 seconds) -Cbc0038I Round again with cutoff of 5.99999 -Cbc0038I Pass 26: suminf. 0.48445 (3) obj. 5.99999 iterations 2 -Cbc0038I Pass 27: suminf. 0.75689 (3) obj. 5.99999 iterations 2 -Cbc0038I Pass 28: suminf. 0.57171 (2) obj. 5.99999 iterations 3 -Cbc0038I Pass 29: suminf. 0.73387 (2) obj. 5.99999 iterations 2 -Cbc0038I Pass 30: suminf. 0.40302 (2) obj. 5.99999 iterations 6 -Cbc0038I Pass 31: suminf. 0.11452 (3) obj. 5.99999 iterations 3 -Cbc0038I Pass 32: suminf. 0.27111 (2) obj. 5.99999 iterations 6 -Cbc0038I Pass 33: suminf. 0.22004 (2) obj. 5.99999 iterations 3 -Cbc0038I Pass 34: suminf. 0.27111 (2) obj. 5.99999 iterations 2 -Cbc0038I Pass 35: suminf. 0.59076 (3) obj. 5.99999 iterations 9 -Cbc0038I Pass 36: suminf. 0.44694 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 37: suminf. 0.52250 (2) obj. 5.99999 iterations 2 -Cbc0038I Pass 38: suminf. 1.09997 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 39: suminf. 0.64917 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 40: suminf. 0.72736 (2) obj. 5.99999 iterations 2 -Cbc0038I Pass 41: suminf. 0.75778 (3) obj. 5.99999 iterations 8 -Cbc0038I Pass 42: suminf. 0.12296 (2) obj. 5.99999 iterations 4 -Cbc0038I Pass 43: suminf. 0.59612 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 44: suminf. 0.39593 (3) obj. 5.99999 iterations 3 -Cbc0038I Pass 45: suminf. 0.73248 (3) obj. 5.99999 iterations 2 -Cbc0038I Pass 46: suminf. 0.64800 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 47: suminf. 0.94408 (3) obj. 5.99999 iterations 3 -Cbc0038I Pass 48: suminf. 0.77959 (3) obj. 5.99999 iterations 2 -Cbc0038I Pass 49: suminf. 0.63735 (3) obj. 5.99999 iterations 10 -Cbc0038I Pass 50: suminf. 0.42679 (3) obj. 5.99999 iterations 4 -Cbc0038I Pass 51: suminf. 0.58817 (3) obj. 5.99999 iterations 3 -Cbc0038I Pass 52: suminf. 0.83711 (2) obj. 5.99999 iterations 9 -Cbc0038I Pass 53: suminf. 0.74399 (3) obj. 5.99999 iterations 3 -Cbc0038I Pass 54: suminf. 0.83711 (2) obj. 5.99999 iterations 2 -Cbc0038I Pass 55: suminf. 0.85476 (3) obj. 5.99999 iterations 12 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 26 columns -Cbc0038I Mini branch and bound improved solution from 7.5 to 6.5 (0.10 seconds) -Cbc0038I Round again with cutoff of 4.19999 -Cbc0038I Pass 55: suminf. 0.51519 (3) obj. 4.19999 iterations 0 -Cbc0038I Pass 56: suminf. 0.72710 (3) obj. 4.19999 iterations 2 -Cbc0038I Pass 57: suminf. 0.59603 (2) obj. 4.19999 iterations 3 -Cbc0038I Pass 58: suminf. 0.70955 (2) obj. 4.19999 iterations 2 -Cbc0038I Pass 59: suminf. 0.92106 (3) obj. 4.19999 iterations 14 -Cbc0038I Pass 60: suminf. 0.92106 (3) obj. 4.19999 iterations 0 -Cbc0038I Pass 61: suminf. 0.73172 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 62: suminf. 0.73172 (3) obj. 4.19999 iterations 0 -Cbc0038I Pass 63: suminf. 0.76518 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 64: suminf. 0.57811 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 65: suminf. 0.69167 (3) obj. 4.19999 iterations 5 -Cbc0038I Pass 66: suminf. 0.36477 (2) obj. 4.19999 iterations 3 -Cbc0038I Pass 67: suminf. 0.97488 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 68: suminf. 0.77730 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 69: suminf. 0.84380 (3) obj. 4.19999 iterations 2 -Cbc0038I Pass 70: suminf. 0.35301 (3) obj. 4.19999 iterations 7 -Cbc0038I Pass 71: suminf. 0.13320 (2) obj. 4.19999 iterations 4 -Cbc0038I Pass 72: suminf. 0.35023 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 73: suminf. 0.61692 (3) obj. 4.19999 iterations 8 -Cbc0038I Pass 74: suminf. 0.39285 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 75: suminf. 0.34693 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 76: suminf. 0.97671 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 77: suminf. 0.51962 (3) obj. 4.19999 iterations 2 -Cbc0038I Pass 78: suminf. 0.53597 (3) obj. 4.19999 iterations 3 -Cbc0038I Pass 79: suminf. 0.20425 (2) obj. 4.19999 iterations 3 -Cbc0038I Pass 80: suminf. 1.23200 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 81: suminf. 0.54283 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 82: suminf. 0.67785 (3) obj. 4.19999 iterations 6 -Cbc0038I Pass 83: suminf. 0.51930 (3) obj. 4.19999 iterations 4 -Cbc0038I Pass 84: suminf. 0.77554 (3) obj. 4.19999 iterations 2 +Cbc0038I Round again with cutoff of 74.8 +Cbc0038I Pass 4: suminf. 0.22670 (1) obj. 74.8 iterations 0 +Cbc0038I Pass 5: suminf. 0.16121 (1) obj. 74.8 iterations 5 +Cbc0038I Pass 6: suminf. 0.78948 (2) obj. 74.8 iterations 11 +Cbc0038I Pass 7: suminf. 0.00000 (0) obj. 74.8 iterations 3 +Cbc0038I Solution found of 74.8 +Cbc0038I Relaxing continuous gives 74.5 +Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 1 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Mini branch and bound improved solution from 74.5 to 6.5 (0.02 seconds) +Cbc0038I Round again with cutoff of 4.54999 +Cbc0038I Pass 8: suminf. 0.61812 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 9: suminf. 0.53574 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 10: suminf. 0.24259 (2) obj. 4.54999 iterations 4 +Cbc0038I Pass 11: suminf. 0.39331 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 12: suminf. 0.27112 (2) obj. 4.54999 iterations 9 +Cbc0038I Pass 13: suminf. 0.27112 (2) obj. 4.54999 iterations 0 +Cbc0038I Pass 14: suminf. 0.80056 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 15: suminf. 0.69824 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 16: suminf. 0.52278 (2) obj. 4.54999 iterations 5 +Cbc0038I Pass 17: suminf. 0.35181 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 18: suminf. 0.35181 (3) obj. 4.54999 iterations 0 +Cbc0038I Pass 19: suminf. 0.50637 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 20: suminf. 0.44967 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 21: suminf. 0.50439 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 22: suminf. 0.75517 (3) obj. 4.54999 iterations 5 +Cbc0038I Pass 23: suminf. 0.51003 (2) obj. 4.54999 iterations 3 +Cbc0038I Pass 24: suminf. 1.36421 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 25: suminf. 1.04759 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 26: suminf. 0.83278 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 27: suminf. 0.69824 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 28: suminf. 0.52278 (2) obj. 4.54999 iterations 5 +Cbc0038I Pass 29: suminf. 0.35181 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 30: suminf. 0.35181 (3) obj. 4.54999 iterations 0 +Cbc0038I Pass 31: suminf. 0.50637 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 32: suminf. 0.44967 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 33: suminf. 0.50439 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 34: suminf. 0.46887 (3) obj. 4.54999 iterations 12 +Cbc0038I Pass 35: suminf. 0.46887 (3) obj. 4.54999 iterations 0 +Cbc0038I Pass 36: suminf. 0.77395 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 37: suminf. 0.61011 (3) obj. 4.54999 iterations 1 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns -Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) -Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 6.5 - took 0.13 seconds -Cbc0012I Integer solution of 6.5 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) +Cbc0038I Mini branch and bound improved solution from 6.5 to 3.5 (0.05 seconds) +Cbc0038I Round again with cutoff of 2.44999 +Cbc0038I Pass 37: suminf. 0.63250 (3) obj. 2.44999 iterations 0 +Cbc0038I Pass 38: suminf. 0.49288 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 39: suminf. 0.27593 (2) obj. 2.44999 iterations 4 +Cbc0038I Pass 40: suminf. 0.36769 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 41: suminf. 1.07586 (3) obj. 2.44999 iterations 6 +Cbc0038I Pass 42: suminf. 0.40736 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 43: suminf. 0.85823 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 44: suminf. 0.71895 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 45: suminf. 0.67928 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 46: suminf. 0.28708 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 47: suminf. 1.25987 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 48: suminf. 0.70769 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 49: suminf. 0.38967 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 50: suminf. 0.94599 (3) obj. 2.44999 iterations 6 +Cbc0038I Pass 51: suminf. 0.66511 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 52: suminf. 0.71936 (3) obj. 2.44999 iterations 1 +Cbc0038I Pass 53: suminf. 0.63249 (3) obj. 2.44999 iterations 8 +Cbc0038I Pass 54: suminf. 0.32118 (3) obj. 2.44999 iterations 8 +Cbc0038I Pass 55: suminf. 0.50365 (3) obj. 2.44999 iterations 5 +Cbc0038I Pass 56: suminf. 0.45036 (2) obj. 2.44999 iterations 3 +Cbc0038I Pass 57: suminf. 0.50319 (2) obj. 2.44999 iterations 3 +Cbc0038I Pass 58: suminf. 1.19037 (3) obj. 2.44999 iterations 6 +Cbc0038I Pass 59: suminf. 0.92842 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 60: suminf. 0.86532 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 61: suminf. 1.05706 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 62: suminf. 0.97647 (3) obj. 2.44999 iterations 1 +Cbc0038I Pass 63: suminf. 1.12891 (3) obj. 2.44999 iterations 7 +Cbc0038I Pass 64: suminf. 0.70905 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 65: suminf. 0.56086 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 66: suminf. 0.56086 (3) obj. 2.44999 iterations 0 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 26 columns +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 3.5 - took 0.07 seconds +Cbc0012I Integer solution of 3.5 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0031I 4 added rows had average density of 17.5 +Cbc0031I 4 added rows had average density of 16.5 Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.012 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 567 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 447 row cuts average 11.5 elements, 0 column cuts (0 active) in 0.062 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 513 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.031 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 64 row cuts average 8.8 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 363 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 6.5 best solution, best possible 0 (0.61 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0004I Integer solution of 5.5 found after 2402 iterations and 306 nodes (0.96 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0016I Integer solution of 4.5 found by strong branching after 3282 iterations and 510 nodes (1.16 seconds) +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (1 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 567 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.025 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 469 row cuts average 11.8 elements, 0 column cuts (0 active) in 0.045 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 486 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 79 row cuts average 9.1 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 323 row cuts average 19.1 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 3.5 best solution, best possible 0 (0.28 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0016I Integer solution of 3.5 found by strong branching after 4210 iterations and 866 nodes (1.59 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0010I After 1000 nodes, 9 on tree, 3.5 best solution, best possible 0 (1.76 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0016I Integer solution of 2.5 found by strong branching after 5773 iterations and 1419 nodes (2.29 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0010I After 2000 nodes, 5 on tree, 2.5 best solution, best possible 0 (2.90 seconds) -Cbc0010I After 3000 nodes, 2 on tree, 2.5 best solution, best possible 0 (3.95 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0001I Search completed - best objective 2.5, took 43347 iterations and 19879 nodes (4.04 seconds) -Cbc0032I Strong branching done 13036 times (28832 iterations), fathomed 482 nodes and fixed 619 variables -Cbc0041I Maximum depth 14, 568 variables fixed on reduced cost (complete fathoming 976 times, 16791 nodes taking 32766 iterations) +Cbc0010I After 1000 nodes, 7 on tree, 3.5 best solution, best possible 0 (0.85 seconds) +Cbc0016I Integer solution of 2.5 found by strong branching after 5277 iterations and 1199 nodes (0.97 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0010I After 2000 nodes, 4 on tree, 2.5 best solution, best possible 0 (1.38 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0001I Search completed - best objective 2.5, took 45131 iterations and 21146 nodes (1.87 seconds) +Cbc0032I Strong branching done 11940 times (27585 iterations), fathomed 413 nodes and fixed 636 variables +Cbc0041I Maximum depth 13, 563 variables fixed on reduced cost (complete fathoming 965 times, 18214 nodes taking 35614 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) -Gomory was tried 100 times and created 567 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) -Knapsack was tried 100 times and created 447 cuts of which 0 were active after adding rounds of cuts (0.062 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 100 times and created 513 cuts of which 0 were active after adding rounds of cuts (0.031 seconds) -FlowCover was tried 100 times and created 64 cuts of which 0 were active after adding rounds of cuts (0.010 seconds) -TwoMirCuts was tried 100 times and created 363 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) +Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +Gomory was tried 100 times and created 567 cuts of which 0 were active after adding rounds of cuts (0.025 seconds) +Knapsack was tried 100 times and created 469 cuts of which 0 were active after adding rounds of cuts (0.045 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 100 times and created 486 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) +FlowCover was tried 100 times and created 79 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +TwoMirCuts was tried 100 times and created 323 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 2.50000000 -Enumerated nodes: 19879 -Total iterations: 43347 -Time (CPU seconds): 3.60 -Time (Wallclock seconds): 4.05 +Enumerated nodes: 21146 +Total iterations: 45131 +Time (CPU seconds): 1.86 +Time (Wallclock seconds): 1.88 Option for printingOptions changed from normal to all -Total time (CPU seconds): 3.60 (Wallclock seconds): 4.06 +Total time (CPU seconds): 1.86 (Wallclock seconds): 1.88 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d2acd0de67c046ed9f5c3f665dfcfc05-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d2acd0de67c046ed9f5c3f665dfcfc05-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c2420402ee644977b17fdf97f96d16a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2420402ee644977b17fdf97f96d16a9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1326,7 +1387,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/93eb974bf5ef4b78b07ad240f73412ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93eb974bf5ef4b78b07ad240f73412ac-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a5c70b1231dc4352b283c0c7f0eab59e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a5c70b1231dc4352b283c0c7f0eab59e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1353,23 +1414,20 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/629e9a6e085f48608ea94109b0569bbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/629e9a6e085f48608ea94109b0569bbb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f0c401465eab4e45a8d53aa3bfb19d5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0c401465eab4e45a8d53aa3bfb19d5b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 72 RHS -At line 81 BOUNDS -At line 94 ENDATA -Problem MODEL has 8 rows, 12 columns and 24 elements +At line 10 COLUMNS +At line 25 RHS +At line 31 BOUNDS +At line 33 ENDATA +Problem MODEL has 5 rows, 2 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1381,190 +1439,45 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/f4cc4cb128e646309dc04a6484d74336-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4cc4cb128e646309dc04a6484d74336-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 251.5 -After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/4c4d2b190416456bae1964c77d3e51d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4c4d2b190416456bae1964c77d3e51d7-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.08571 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.01 seconds) -Cbc0031I 2 added rows had average density of 3.5 -Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.02 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.06667 to -1.05 -Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.05000000 -Enumerated nodes: 0 -Total iterations: 4 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/d89b2fe0c3fb4ddea69f75e12c438fd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d89b2fe0c3fb4ddea69f75e12c438fd1-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 29 ENDATA -Problem MODEL has 3 rows, 7 columns and 8 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements -0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 246.5 -Optimal - objective value 246.5 -After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0b9ecb8c2d6948f89af8d51e517b9964-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b9ecb8c2d6948f89af8d51e517b9964-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/90530e9994aa4aeca551dd4c689cc871-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90530e9994aa4aeca551dd4c689cc871-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d92e059fb7ce44c7835e476431b1d562-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d92e059fb7ce44c7835e476431b1d562-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 38 RHS -At line 42 BOUNDS -At line 50 ENDATA -Problem MODEL has 3 rows, 7 columns and 8 elements +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 3 +Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 @@ -1582,112 +1495,75 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.01 +Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 - -/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' - """ -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/843bf6473a3243e692e9a020dc8e832d-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/843bf6473a3243e692e9a020dc8e832d-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 25 COLUMNS -At line 71 RHS -At line 92 BOUNDS -At line 93 ENDATA -Problem MODEL has 20 rows, 9 columns and 36 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements -0 Obj -0 Dual inf 224.99999 (8) -10 Obj 863.25 -Optimal - objective value 863.25 -After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9d432afef5984a06b4c31e2ab709c438-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d432afef5984a06b4c31e2ab709c438-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0efed8d24fb64458adc6fda9f39354d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0efed8d24fb64458adc6fda9f39354d4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements +Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.02 seconds) +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8300 to 8300 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 8300.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8c61dce3fd0b41a4a89bbbf1ac12a119-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c61dce3fd0b41a4a89bbbf1ac12a119-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/02670602634e4010ad88e4b71a6f0db5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02670602634e4010ad88e4b71a6f0db5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 36 RHS -At line 40 BOUNDS -At line 47 ENDATA -Problem MODEL has 3 rows, 6 columns and 9 elements +At line 24 RHS +At line 28 BOUNDS +At line 32 ENDATA +Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 300 - 0.00 seconds +Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 +Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1699,20 +1575,20 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d60a3cf33081442ba2ccb6d983d1473a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d60a3cf33081442ba2ccb6d983d1473a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9841b92b62604fb2a41e3889843d546b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9841b92b62604fb2a41e3889843d546b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -1740,89 +1616,99 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3fe91ccb178c420cb2d7552d8ae84b12-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fe91ccb178c420cb2d7552d8ae84b12-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2044c51b9f364384a3522707db78afbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2044c51b9f364384a3522707db78afbf-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements +At line 36 RHS +At line 40 BOUNDS +At line 47 ENDATA +Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.02 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.02 seconds) +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 251.5 to 251.5 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 251.50000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b620fa4dceda446d97aa5e101fae9cd8-pulp.mps mips /tmp/b620fa4dceda446d97aa5e101fae9cd8-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/b620fa4dceda446d97aa5e101fae9cd8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e783bfef6e0149bbae6080868b58784f-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/e783bfef6e0149bbae6080868b58784f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/b620fa4dceda446d97aa5e101fae9cd8-pulp.mst. -MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.02 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.22 seconds) -Cbc0006I The LP relaxation is infeasible or too expensive -Cbc0045I Solution of 12 already found by heuristic -Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/a0d51a0224ad483aaef30c67df0df052-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0d51a0224ad483aaef30c67df0df052-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 14 COLUMNS +At line 85 RHS +At line 95 BOUNDS +At line 113 ENDATA +Problem MODEL has 9 rows, 14 columns and 28 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 15005 - 0.00 seconds +Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.024975 +Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 15005 to 15005 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1834,42 +1720,20 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 15005.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.25 -Time (Wallclock seconds): 0.26 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.30 (Wallclock seconds): 0.32 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/a66357ab113442088640bb0b4f4e9b40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a66357ab113442088640bb0b4f4e9b40-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/865094363e6d4f6383ff45bf36de7c85-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/865094363e6d4f6383ff45bf36de7c85-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a16a5fb2c06e4379a346b4af3cdc9bd9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a16a5fb2c06e4379a346b4af3cdc9bd9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1901,16 +1765,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d43aea7774164f1b92ffcc3343628866-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d43aea7774164f1b92ffcc3343628866-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e31cba0472164996a5dc01bdd6c1360b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e31cba0472164996a5dc01bdd6c1360b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1942,16 +1806,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/45244ba0959148fd9f5b38a1a2c7582e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45244ba0959148fd9f5b38a1a2c7582e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/281d9c39b436483e81739c85b511ceb4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/281d9c39b436483e81739c85b511ceb4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1982,17 +1846,17 @@ Objective value: 8660.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/afe2960a83f5473282fef07d322000a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afe2960a83f5473282fef07d322000a8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/52b39c5ea85c4d369eab5ef8461e45f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52b39c5ea85c4d369eab5ef8461e45f5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2024,16 +1888,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/81c032266b354d5397131a53c163a73e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81c032266b354d5397131a53c163a73e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e6f1bb736cb44a2aa12327c06579b728-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6f1bb736cb44a2aa12327c06579b728-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2065,16 +1929,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/867a0ac0b2844ff0b97c4433a2e79788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/867a0ac0b2844ff0b97c4433a2e79788-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0865bd8da73e4dd09fc0b237295c94d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0865bd8da73e4dd09fc0b237295c94d4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2106,16 +1970,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/27fec268f41c453a81b78fb472f15d07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27fec268f41c453a81b78fb472f15d07-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/15eb6638d7e44d40a48eef8105872cf0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/15eb6638d7e44d40a48eef8105872cf0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2147,16 +2011,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5846cd87f14b4c3c824213b35657e2ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5846cd87f14b4c3c824213b35657e2ca-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4d7a52feaf914762b9f4e3ddeed9c5e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d7a52feaf914762b9f4e3ddeed9c5e0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2188,11 +2052,492 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/afe23686327f40a5861009806ef894e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afe23686327f40a5861009806ef894e9-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8840 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8840 to 8840 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8840.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/7b10d785a0a842fc8087ce1a5956ceff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b10d785a0a842fc8087ce1a5956ceff-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8870 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8870 to 8870 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8870.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/c81ce31686cd4b45b3802e051c5a4202-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c81ce31686cd4b45b3802e051c5a4202-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8900 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8900 to 8900 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8900.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/b9ca26c0da14426590447b1574236f36-pulp.mps mips /tmp/b9ca26c0da14426590447b1574236f36-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/b9ca26c0da14426590447b1574236f36-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements +Coin0008I MODEL read with 0 errors +opening mipstart file /tmp/b9ca26c0da14426590447b1574236f36-pulp.mst. +MIPStart values read for 3213 variables. +Option for timeMode changed from cpu to elapsed +Continuous objective value is 12 - 0.01 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.13 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0045I Solution of 12 already found by heuristic +Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 12.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.15 +Time (Wallclock seconds): 0.15 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.19 (Wallclock seconds): 0.19 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/7a2554854b784aceaefd0158cdaa95eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7a2554854b784aceaefd0158cdaa95eb-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 251.5 +After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/a06b36ef2e5143549964c787d4dee261-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a06b36ef2e5143549964c787d4dee261-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.08571 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) +Cbc0031I 2 added rows had average density of 3.5 +Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.06667 to -1.05 +Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.05000000 +Enumerated nodes: 0 +Total iterations: 4 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/b607e0e9c3594ff691f733a4e84dbfc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b607e0e9c3594ff691f733a4e84dbfc5-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 24 RHS +At line 28 BOUNDS +At line 29 ENDATA +Problem MODEL has 3 rows, 7 columns and 8 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements +0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 246.5 +Optimal - objective value 246.5 +After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/c0f96eedbfc7408fa0e65bed2ca72ec2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0f96eedbfc7408fa0e65bed2ca72ec2-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.00000000 +Enumerated nodes: 0 +Total iterations: 6 +Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/f4c166bf62184239a8160aef801cf92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4c166bf62184239a8160aef801cf92d-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 38 RHS +At line 42 BOUNDS +At line 50 ENDATA +Problem MODEL has 3 rows, 7 columns and 8 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) +Cbc0031I 1 added rows had average density of 3 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 246.50000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.01 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/090fa864100043b58d3b3d473a68c892-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/090fa864100043b58d3b3d473a68c892-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 10 COLUMNS +At line 42 RHS +At line 48 BOUNDS +At line 49 ENDATA +Problem MODEL has 5 rows, 6 columns and 25 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements +0 Obj 0 Primal inf 405.05674 (3) +2 Obj 0.52 +Optimal - objective value 0.52 +Optimal objective 0.52 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/902357e8dbb048d48f5a14baa67947a5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/902357e8dbb048d48f5a14baa67947a5-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8600 to 8600 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8600.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/4d79d758ce9349f88de5fa38f667b243-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d79d758ce9349f88de5fa38f667b243-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 110 RHS +At line 119 BOUNDS +At line 140 ENDATA +Problem MODEL has 8 rows, 20 columns and 36 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.01 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.01 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 13 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 + +/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' + """ Status: Optimal x = 4.0 y = -1.0 @@ -2226,41 +2571,41 @@ 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - -x_0 = 0.0 -x_1 = 1.0 +x_0 = 1.0 +x_1 = 0.0 x_2 = 1.0 -x_3 = 1.0 +x_3 = 0.0 x_4 = 1.0 -x_5 = 0.0 +x_5 = 1.0 x_6 = 1.0 -x_7 = 1.0 +x_7 = 0.0 x_8 = 1.0 -x_9 = 0.0 +x_9 = 1.0 Status: Optimal s_0 = 0.0 s_1 = 0.0 -s_2 = 1.0 -w_0 = 0.5 -w_1 = 1.0 +s_2 = 0.0 +w_0 = 2.0 +w_1 = 0.5 w_2 = 0.0 x_0 = 0.0 -x_1 = 0.0 -x_10 = 0.0 -x_11 = 0.0 +x_1 = 1.0 +x_10 = 1.0 +x_11 = 1.0 x_12 = 1.0 -x_13 = 1.0 +x_13 = 0.0 x_14 = 0.0 x_15 = 1.0 -x_16 = 0.0 +x_16 = 1.0 x_17 = 0.0 x_18 = 1.0 -x_19 = 1.0 +x_19 = 0.0 x_2 = 0.0 -x_3 = 1.0 +x_3 = 0.0 x_4 = 1.0 x_5 = 0.0 -x_6 = 1.0 -x_7 = 1.0 +x_6 = 0.0 +x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 objective= 2.5 @@ -2320,101 +2665,9 @@ 8 passed and 0 failed. Test passed. Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_A_D = 0.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.0 -P0 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -The_Gemstone_Tool_Problem: -MAXIMIZE -25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 -SUBJECT TO -Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - - steelpurchase <= 0 - -molding_capacity0: production_0_pliers + production_0_wrenches <= 21 - -assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 - -capacity_wrenches0: production_0_wrenches <= 15 - -capacity_pliers0: production_0_pliers <= 16 - -Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - - steelpurchase <= 0 - -molding_capacity1: production_1_pliers + production_1_wrenches <= 21 - -assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 - -capacity_wrenches1: production_1_wrenches <= 15 - -capacity_pliers1: production_1_pliers <= 16 - -Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - - steelpurchase <= 0 - -molding_capacity2: production_2_pliers + production_2_wrenches <= 21 - -assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 - -capacity_wrenches2: production_2_wrenches <= 15 - -capacity_pliers2: production_2_pliers <= 16 - -Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - - steelpurchase <= 0 - -molding_capacity3: production_3_pliers + production_3_wrenches <= 21 - -assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 - -capacity_wrenches3: production_3_wrenches <= 15 - -capacity_pliers3: production_3_pliers <= 16 - -VARIABLES -production_0_pliers Continuous -production_0_wrenches Continuous -production_1_pliers Continuous -production_1_wrenches Continuous -production_2_pliers Continuous -production_2_wrenches Continuous -production_3_pliers Continuous -production_3_wrenches Continuous -steelpurchase Continuous - -Status: Optimal -production_0_pliers = 4.75 -production_0_wrenches = 15.0 -production_1_pliers = 4.75 -production_1_wrenches = 15.0 -production_2_pliers = 8.5 -production_2_wrenches = 12.5 -production_3_pliers = 16.0 -production_3_wrenches = 5.0 -steelpurchase = 27.25 -Total price = 863.25 +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -2452,6 +2705,30 @@ Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +Status: Optimal +Solution Written to sudokuout.txt +Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 @@ -2459,58 +2736,25 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 Status: Optimal -Solution Written to sudokuout.txt -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = 0.0 -Patt_P13 = 0.0 -Patt_P14 = 0.0 -Patt_P2 = 137.0 -Patt_P3 = 0.0 -Patt_P4 = 0.0 -Patt_P5 = 0.0 -Patt_P6 = 0.0 -Patt_P7 = 0.0 -Patt_P8 = 0.0 -Patt_P9 = 100.0 -Surp_5 = 2.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 246.50000000000003 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Ingr_BEEF = 60.0 -Ingr_CHICKEN = 0.0 -Ingr_GEL = 40.0 -Ingr_MUTTON = 0.0 -Ingr_RICE = 0.0 -Ingr_WHEAT = 0.0 -Total Cost of Ingredients per can = 0.52 +Route_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -2601,109 +2845,268 @@ Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 +Route_B_1 = 270.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8810.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 280.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8840.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 290.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8870.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 300.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8900.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Status: Optimal +Ingr_BEEF = 60.0 +Ingr_CHICKEN = 0.0 +Ingr_GEL = 40.0 +Ingr_MUTTON = 0.0 +Ingr_RICE = 0.0 +Ingr_WHEAT = 0.0 +Total Cost of Ingredients per can = 0.52 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +The_Gemstone_Tool_Problem: +MAXIMIZE +25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 +SUBJECT TO +Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches + - steelpurchase <= 0 + +molding_capacity0: production_0_pliers + production_0_wrenches <= 21 + +assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 + +capacity_wrenches0: production_0_wrenches <= 15 + +capacity_pliers0: production_0_pliers <= 16 + +Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches + - steelpurchase <= 0 + +molding_capacity1: production_1_pliers + production_1_wrenches <= 21 + +assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 + +capacity_wrenches1: production_1_wrenches <= 15 + +capacity_pliers1: production_1_pliers <= 16 + +Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches + - steelpurchase <= 0 + +molding_capacity2: production_2_pliers + production_2_wrenches <= 21 + +assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 + +capacity_wrenches2: production_2_wrenches <= 15 + +capacity_pliers2: production_2_pliers <= 16 + +Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches + - steelpurchase <= 0 + +molding_capacity3: production_3_pliers + production_3_wrenches <= 21 + +assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 + +capacity_wrenches3: production_3_wrenches <= 15 + +capacity_pliers3: production_3_pliers <= 16 + +VARIABLES +production_0_pliers Continuous +production_0_wrenches Continuous +production_1_pliers Continuous +production_1_wrenches Continuous +production_2_pliers Continuous +production_2_wrenches Continuous +production_3_pliers Continuous +production_3_wrenches Continuous +steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a94f4b4c9f6d40399ba5ce2ade713752-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a94f4b4c9f6d40399ba5ce2ade713752-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b76ad14036b84d38b5cf5a16005b1a74-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/b76ad14036b84d38b5cf5a16005b1a74-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 25 COLUMNS +At line 71 RHS +At line 92 BOUNDS +At line 93 ENDATA +Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8840 to 8840 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8840.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - +Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements +0 Obj -0 Dual inf 224.99999 (8) +10 Obj 863.25 +Optimal - objective value 863.25 +After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/78bc34943db547b8b100d4c41baca21b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78bc34943db547b8b100d4c41baca21b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eb9695d3000645a7a26e90b13f5159e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb9695d3000645a7a26e90b13f5159e1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) +Cbc0031I 1 added rows had average density of 14 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8870 to 8870 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 8870.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 +Total iterations: 1 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3e562a81daa8449fa7c12b0d9a150b9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e562a81daa8449fa7c12b0d9a150b9c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2ce2d45e9bc940098a3441cf419d4d1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ce2d45e9bc940098a3441cf419d4d1f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8900 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Continuous objective value is 12 - 0.01 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 12 +Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) +Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds +Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.15 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8900 to 8900 +Cuts at root node changed objective from 12 to 12 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2715,20 +3118,20 @@ Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.14 +Time (Wallclock seconds): 0.16 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.17 (Wallclock seconds): 0.19 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fff8f4ff22b14d42b1334c2111c554af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fff8f4ff22b14d42b1334c2111c554af-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0434d0b517484fe2a1db2b67c036e282-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0434d0b517484fe2a1db2b67c036e282-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -2745,10 +3148,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 30 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2765,17 +3168,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/521f6c7f1cba461499817a6181b7b2fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/521f6c7f1cba461499817a6181b7b2fc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/64bbc454ac0543d49039458cc4b8f775-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64bbc454ac0543d49039458cc4b8f775-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -2798,10 +3201,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 28 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) -Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.14 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2818,17 +3221,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.13 -Time (Wallclock seconds): 0.15 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.15 (Wallclock seconds): 0.16 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f9294d2d99144f0dbf20e95da2929f02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9294d2d99144f0dbf20e95da2929f02-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2daeafcfd1fe45a09492387e9be1e071-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2daeafcfd1fe45a09492387e9be1e071-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -2838,7 +3241,7 @@ Problem MODEL has 352 rows, 730 columns and 3104 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 9 fixed, 0 tightened bounds, 2 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 12 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions @@ -2853,10 +3256,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 26 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) -Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.14 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2873,17 +3276,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.15 -Time (Wallclock seconds): 0.15 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.16 (Wallclock seconds): 0.17 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/188cef1b7b7d432692a9633884004523-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/188cef1b7b7d432692a9633884004523-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/606136273f474153b61c4005974a8f65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/606136273f474153b61c4005974a8f65-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -2893,7 +3296,7 @@ Problem MODEL has 353 rows, 730 columns and 3185 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -2908,10 +3311,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.15 seconds) -Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.15 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2928,17 +3331,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.16 -Time (Wallclock seconds): 0.16 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.17 (Wallclock seconds): 0.18 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/153d63e2f4e243a6aee9000281750599-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/153d63e2f4e243a6aee9000281750599-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/846a84c69fe84681a25ee3c48b38c3ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/846a84c69fe84681a25ee3c48b38c3ae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -2948,7 +3351,7 @@ Problem MODEL has 354 rows, 730 columns and 3266 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -2961,10 +3364,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 1 continuous -Cbc0038I Mini branch and bound did not improve solution (0.15 seconds) -Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.15 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2981,17 +3384,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.15 -Time (Wallclock seconds): 0.16 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.16 (Wallclock seconds): 0.17 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c52e9476549e4d62b8d7936738d00ffe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c52e9476549e4d62b8d7936738d00ffe-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/14919837cd354835af16f31b08a5bec8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14919837cd354835af16f31b08a5bec8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -3001,7 +3404,7 @@ Problem MODEL has 355 rows, 730 columns and 3347 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions Cgl0003I 7 fixed, 0 tightened bounds, 1 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions @@ -3014,10 +3417,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.15 seconds) -Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.15 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3034,17 +3437,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.16 -Time (Wallclock seconds): 0.16 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.17 (Wallclock seconds): 0.17 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/74976a26215a4d92a3f9fc9ac317d04e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74976a26215a4d92a3f9fc9ac317d04e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dc3362f73b0f46208e5a944d937144dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc3362f73b0f46208e5a944d937144dc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -3054,7 +3457,7 @@ Problem MODEL has 356 rows, 730 columns and 3428 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 11 fixed, 0 tightened bounds, 6 strengthened rows, 27 substitutions Cgl0003I 7 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -3068,10 +3471,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) -Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.16 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.10 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3088,17 +3491,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.17 -Time (Wallclock seconds): 0.17 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.18 (Wallclock seconds): 0.19 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a68e9e49338c4bc48d28daa0af0c0c72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a68e9e49338c4bc48d28daa0af0c0c72-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2e47e70ba754480ba2aef1d7e4e2dc00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e47e70ba754480ba2aef1d7e4e2dc00-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -3108,7 +3511,7 @@ Problem MODEL has 357 rows, 730 columns and 3509 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 17 fixed, 0 tightened bounds, 7 strengthened rows, 23 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -3121,10 +3524,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.18 seconds) -Cbc0038I After 0.18 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.18 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.18 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3141,17 +3544,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.14 -Time (Wallclock seconds): 0.19 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.15 (Wallclock seconds): 0.21 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ea4f7c8c26524698b704c407a8326811-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea4f7c8c26524698b704c407a8326811-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/685683bbdb75430b83f0bbddf7f15f42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/685683bbdb75430b83f0bbddf7f15f42-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -3161,7 +3564,7 @@ Problem MODEL has 358 rows, 730 columns and 3590 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 22 fixed, 0 tightened bounds, 8 strengthened rows, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions @@ -3171,10 +3574,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.21 seconds) -Cbc0038I After 0.21 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.21 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.21 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3191,17 +3594,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.15 -Time (Wallclock seconds): 0.22 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.16 (Wallclock seconds): 0.24 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bf2bb29f7f0b4eb2be46798d0bb9ee60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf2bb29f7f0b4eb2be46798d0bb9ee60-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7337d1c1330240399a735da611f3440c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7337d1c1330240399a735da611f3440c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -3211,7 +3614,7 @@ Problem MODEL has 359 rows, 730 columns and 3671 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 84 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions @@ -3220,10 +3623,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3240,17 +3643,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.13 -Time (Wallclock seconds): 0.14 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.13 (Wallclock seconds): 0.16 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bfe58eb1a21b4e0292d2d2c11035a67a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfe58eb1a21b4e0292d2d2c11035a67a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4b78c80b34554d12a16b1210c461a940-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b78c80b34554d12a16b1210c461a940-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -3279,17 +3682,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.14 -Time (Wallclock seconds): 0.15 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.16 (Wallclock seconds): 0.17 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ccfee673764b413e9285116a82238656-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ccfee673764b413e9285116a82238656-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5f883b80e5c949c69735acec0b1534af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f883b80e5c949c69735acec0b1534af-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -3321,17 +3724,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.16 -Time (Wallclock seconds): 0.17 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.17 (Wallclock seconds): 0.18 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6ce4f2ac1a5649af8e8773ba417275c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ce4f2ac1a5649af8e8773ba417275c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/00b8bb1f0462408ba736c2427feccc44-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00b8bb1f0462408ba736c2427feccc44-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -3341,7 +3744,7 @@ Problem MODEL has 362 rows, 730 columns and 3914 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 75 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -3380,8 +3783,8 @@ Cbc0038I Pass 30: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) -Cbc0038I After 0.16 seconds - Feasibility pump exiting - took 0.01 seconds +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -3392,7 +3795,7 @@ Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.17 seconds) +Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.09 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3409,58 +3812,17 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.15 -Time (Wallclock seconds): 0.17 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.17 (Wallclock seconds): 0.18 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/0883e131ab0845f6b638802a89193fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0883e131ab0845f6b638802a89193fae-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8600.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/667b312d5a604ac9bf215fdb1297cd9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/667b312d5a604ac9bf215fdb1297cd9b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7c8dd4eadbd045e3bb77d677db9b6ee9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c8dd4eadbd045e3bb77d677db9b6ee9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3482,7 +3844,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/416b938f9b574d879c26dd77e81fef28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/416b938f9b574d879c26dd77e81fef28-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a03ea2a0b37e451e83ad2a306ea2753f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a03ea2a0b37e451e83ad2a306ea2753f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3514,16 +3876,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/47b3fbb05e5a49868f2b2c1d26bc9ca4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47b3fbb05e5a49868f2b2c1d26bc9ca4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f59eb0e337414cf0a135523b476135c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f59eb0e337414cf0a135523b476135c9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3545,7 +3907,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/594bc5dc40ac4c1299daaea8343d923a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/594bc5dc40ac4c1299daaea8343d923a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2200bbdc52274fa9871a27dd81fc7656-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2200bbdc52274fa9871a27dd81fc7656-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3558,8 +3920,8 @@ Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -3568,7 +3930,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3585,17 +3947,17 @@ Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cdcc2adce9904039838cf475d9612530-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdcc2adce9904039838cf475d9612530-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/075d02b583054191bbc054cdc42d9723-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/075d02b583054191bbc054cdc42d9723-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3619,7 +3981,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d1048b5a82084a4a82f6df6d68f32e8c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1048b5a82084a4a82f6df6d68f32e8c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/df1c160d4e204a64807c25722ef01a11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df1c160d4e204a64807c25722ef01a11-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3632,8 +3994,8 @@ Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3651,16 +4013,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d16c9f3c085f465592c4a60027d519ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d16c9f3c085f465592c4a60027d519ef-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3c621205c0e64e84b23d7dc6f24638f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c621205c0e64e84b23d7dc6f24638f7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3678,13 +4040,13 @@ After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9543ad8f221740eaa96c8b57b20268e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9543ad8f221740eaa96c8b57b20268e6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e07751630eb44fca80ce17ae7084c04a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e07751630eb44fca80ce17ae7084c04a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3697,7 +4059,7 @@ Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 @@ -3706,7 +4068,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.02 seconds) +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3723,17 +4085,17 @@ Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d59b8a5cc19f4b20ac01bf94476a377a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d59b8a5cc19f4b20ac01bf94476a377a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c86184113b5a4a048962a77fb6149a18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c86184113b5a4a048962a77fb6149a18-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3747,7 +4109,7 @@ Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) Cbc0031I 1 added rows had average density of 4 @@ -3776,206 +4138,33 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/677b44fbee4d47159da462fd2cef0da2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/677b44fbee4d47159da462fd2cef0da2-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 32 ENDATA -Problem MODEL has 3 rows, 3 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 300.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/b9d14091e79947cc9a3c2918e2b829db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9d14091e79947cc9a3c2918e2b829db-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0.97 to -1.79769e+308 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 0.97000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/4cadffb0f2b94121b7b8ea56149b9bd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4cadffb0f2b94121b7b8ea56149b9bd1-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 13 COLUMNS -At line 84 RHS -At line 93 BOUNDS -At line 109 ENDATA -Problem MODEL has 8 rows, 15 columns and 30 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8300 to 8300 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8300.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/19f7b11c4da347ad82f62a3e605209d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19f7b11c4da347ad82f62a3e605209d4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/82c81b016c5944d89525bda99a0efdd1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82c81b016c5944d89525bda99a0efdd1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements +At line 72 RHS +At line 81 BOUNDS +At line 94 ENDATA +Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.01 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 228100.00000000 -Enumerated nodes: 0 -Total iterations: 13 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/b54141b99773441f9813274417c8008d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b54141b99773441f9813274417c8008d-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 14 COLUMNS -At line 85 RHS -At line 95 BOUNDS -At line 113 ENDATA -Problem MODEL has 9 rows, 14 columns and 28 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 15005 - 0.00 seconds -Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.024975 -Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 15005 to 15005 +Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3987,84 +4176,15 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.02 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/86db048a442c466a9c7c8c558c65e9c9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/86db048a442c466a9c7c8c558c65e9c9-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/6f3bbbf71fac4e04980cddd44785c334-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f3bbbf71fac4e04980cddd44785c334-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.02 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 12 -Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.25 seconds) -Cbc0038I After 0.25 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.25 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.26 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 12 to 12 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 12.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.24 -Time (Wallclock seconds): 0.28 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.28 (Wallclock seconds): 0.35 - ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" @@ -4095,7 +4215,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CHOCO_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.CHOCO_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.CHOCO_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CHOCO_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulpTestAll) @@ -4173,7 +4293,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.COINMP_DLLTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.COINMP_DLLTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.COINMP_DLLTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.COINMP_DLLTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.COINMP_DLLTest.test_pulpTestAll) @@ -4258,7 +4378,7 @@ Test if makeDict is returning the expected value. ... ok test_makeDict_default_value (pulp.tests.test_pulp.COIN_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... ok -test_measuring_solving_time (pulp.tests.test_pulp.COIN_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.COIN_CMDTest.test_measuring_solving_time) ... ok test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.COIN_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... ok test_pulpTestAll (pulp.tests.test_pulp.COIN_CMDTest.test_pulpTestAll) @@ -4336,7 +4456,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CPLEX_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CPLEX_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulpTestAll) @@ -4414,7 +4534,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CPLEX_PYTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_PYTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_PYTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CPLEX_PYTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CPLEX_PYTest.test_pulpTestAll) @@ -4492,7 +4612,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GLPK_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.GLPK_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.GLPK_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GLPK_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GLPK_CMDTest.test_pulpTestAll) @@ -4570,7 +4690,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GUROBITest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.GUROBITest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.GUROBITest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GUROBITest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GUROBITest.test_pulpTestAll) @@ -4648,7 +4768,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GUROBI_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.GUROBI_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.GUROBI_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GUROBI_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulpTestAll) @@ -4726,7 +4846,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.HiGHS_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.HiGHS_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.HiGHS_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.HiGHS_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulpTestAll) @@ -4804,7 +4924,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.MIPCL_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.MIPCL_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.MIPCL_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.MIPCL_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulpTestAll) @@ -4882,7 +5002,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.MOSEKTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.MOSEKTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.MOSEKTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.MOSEKTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.MOSEKTest.test_pulpTestAll) @@ -4960,7 +5080,7 @@ Test if makeDict is returning the expected value. ... ok test_makeDict_default_value (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... ok -test_measuring_solving_time (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_measuring_solving_time) ... ok test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... ok test_pulpTestAll (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulpTestAll) @@ -5038,7 +5158,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.PYGLPKTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.PYGLPKTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.PYGLPKTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.PYGLPKTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.PYGLPKTest.test_pulpTestAll) @@ -5116,7 +5236,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.SCIP_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.SCIP_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.SCIP_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.SCIP_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.SCIP_CMDTest.test_pulpTestAll) @@ -5194,7 +5314,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.XPRESS_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_CMDTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.XPRESS_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulpTestAll) @@ -5272,7 +5392,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.XPRESS_PyTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_PyTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_PyTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.XPRESS_PyTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.XPRESS_PyTest.test_pulpTestAll) @@ -5350,7 +5470,7 @@ Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.YAPOSIBTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" -test_measuring_solving_time (pulp.tests.test_pulp.YAPOSIBTest.test_measuring_solving_time) ... skipped 'test known to fail on armel' +test_measuring_solving_time (pulp.tests.test_pulp.YAPOSIBTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.YAPOSIBTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.YAPOSIBTest.test_pulpTestAll) @@ -5401,51 +5521,63 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 11.831s +Ran 1005 tests in 32.936s + +OK (skipped=885) -OK (skipped=887) -Route_B_1 = 270.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8810.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 280.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8840.0 Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 290.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8870.0 +production_0_pliers = 4.75 +production_0_wrenches = 15.0 +production_1_pliers = 4.75 +production_1_wrenches = 15.0 +production_2_pliers = 8.5 +production_2_wrenches = 12.5 +production_3_pliers = 16.0 +production_3_wrenches = 5.0 +steelpurchase = 27.25 +Total price = 863.25 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +P2 = [0, 0, 2] +P3 = [0, 1, 0] +P4 = [0, 1, 1] +P5 = [0, 2, 0] +P6 = [1, 0, 0] +P7 = [1, 0, 1] +P8 = [1, 1, 0] +P9 = [1, 2, 0] +P10 = [2, 0, 0] +P11 = [2, 0, 1] +P12 = [2, 1, 0] +P13 = [3, 0, 0] +P14 = [4, 0, 0] Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 300.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8900.0 +Patt_P0 = 0.0 +Patt_P1 = 0.0 +Patt_P10 = 0.0 +Patt_P11 = 26.0 +Patt_P12 = 0.0 +Patt_P13 = 0.0 +Patt_P14 = 0.0 +Patt_P2 = 137.0 +Patt_P3 = 0.0 +Patt_P4 = 0.0 +Patt_P5 = 0.0 +Patt_P6 = 0.0 +Patt_P7 = 0.0 +Patt_P8 = 0.0 +Patt_P9 = 100.0 +Surp_5 = 2.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 246.50000000000003 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') Status: Optimal Status: Optimal Status: Optimal @@ -5460,18 +5592,6 @@ Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8600.0 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] @@ -5489,78 +5609,19 @@ Surplus_9 = 0 objective = 246.5 Status: Optimal -Patt_A = 225.0 -Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 +Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 -Route_B_3 = 1700.0 +Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 -Route_C_1 = 0.0 -Route_C_2 = 0.0 -Route_C_3 = 100.0 -Route_C_4 = 0.0 -Route_C_5 = 0.0 -Total Cost of Transportation = 8300.0 -Status: Optimal -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -Status: Optimal -Route_('Chicago',_'Gary') = 4000.0 -Route_('Chicago',_'Tempe') = 2000.0 -Route_('Cincinatti',_'Albany') = 2000.0 -Route_('Cincinatti',_'Houston') = 3000.0 -Route_('Kansas_City',_'Houston') = 4000.0 -Route_('Kansas_City',_'Tempe') = 2000.0 -Route_('Pittsburgh',_'Chicago') = 3000.0 -Route_('Pittsburgh',_'Cincinatti') = 2000.0 -Route_('Pittsburgh',_'Gary') = 2000.0 -Route_('Pittsburgh',_'Kansas_City') = 3000.0 -Route_('Youngstown',_'Albany') = 1000.0 -Route_('Youngstown',_'Chicago') = 3000.0 -Route_('Youngstown',_'Cincinatti') = 3000.0 -Route_('Youngstown',_'Kansas_City') = 3000.0 -Total Cost of Transportation = 15005.0 -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.0 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 Test that logic put in place for deprecation handling of indexs works Testing 'indexs' param continues to work for LpVariable.dicts Testing 'indexs' param continues to work for LpVariable.matrix @@ -5582,6 +5643,7 @@ Testing logPath argument Testing makeDict general behavior Testing makeDict default value behavior + Testing measuring optimization time Testing that `readsol` can parse CPLEX mipopt solution Testing the availability of the function pulpTestAll Testing zero subtraction @@ -5633,6 +5695,7 @@ Testing logPath argument Testing makeDict general behavior Testing makeDict default value behavior + Testing measuring optimization time Testing that `readsol` can parse CPLEX mipopt solution Testing the availability of the function pulpTestAll Testing zero subtraction @@ -5827,90 +5890,90 @@ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12 creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/coin_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/core.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/choco_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/coin_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/core.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/choco_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/run_tests.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/core.py to core.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/core.py to core.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc /usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/sparse.py to sparse.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/constants.py to constants.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/sparse.py to sparse.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt @@ -5940,12 +6003,14 @@ dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: not including original source code in upload I: copying local configuration +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/23519/tmp/hooks/B01_cleanup finished I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env -I: removing directory /srv/workspace/pbuilder/31123 and its subdirectories -I: Current time: Sun Oct 13 20:41:47 -12 2024 -I: pbuilder-time-stamp: 1728895307 +I: removing directory /srv/workspace/pbuilder/23519 and its subdirectories +I: Current time: Mon Oct 14 22:43:39 +14 2024 +I: pbuilder-time-stamp: 1728895419