Diff of the two buildlogs: -- --- b1/build.log 2025-01-18 11:17:49.133190946 +0000 +++ b2/build.log 2025-01-18 11:20:14.862627461 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Fri Feb 20 05:39:11 -12 2026 -I: pbuilder-time-stamp: 1771609151 +I: Current time: Sun Jan 19 01:17:54 +14 2025 +I: pbuilder-time-stamp: 1737199074 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -27,54 +27,86 @@ 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/103948/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/1502/tmp/hooks/D01_modify_environment starting +debug: Running on ionos2-i386. +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 Jan 18 11:18 /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/1502/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/1502/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='i386' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=22 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='i386' + 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]="37" [3]="1" [4]="release" [5]="i686-pc-linux-gnu") + BASH_VERSION='5.2.37(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=i386 + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=10 ' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=i686 + HOST_ARCH=i386 IFS=' ' - INVOCATION_ID='9a36e1601ce547d08f03693754409441' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - LD_LIBRARY_PATH='/usr/lib/libeatmydata' - LD_PRELOAD='libeatmydata.so' - 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='103948' - PS1='# ' - PS2='> ' + INVOCATION_ID=0d6a3c4043214132ad74cc2877b7e4b3 + LANG=C + LANGUAGE=de_CH:de + LC_ALL=C + LD_LIBRARY_PATH=/usr/lib/libeatmydata + LD_PRELOAD=libeatmydata.so + MACHTYPE=i686-pc-linux-gnu + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnu + 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=1502 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.TpNhtsAn/pbuilderrc_1rzV --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.TpNhtsAn/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='112' - SUDO_UID='107' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://213.165.73.152:3128' + 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.TpNhtsAn/pbuilderrc_Kyph --distribution unstable --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.TpNhtsAn/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=112 + SUDO_UID=107 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://46.16.76.132:3128 I: uname -a - Linux ionos16-i386 6.1.0-30-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.124-1 (2025-01-12) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.1.0-30-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.124-1 (2025-01-12) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Nov 22 2024 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/103948/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Nov 22 14:40 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/1502/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -200,7 +232,7 @@ Get: 78 http://deb.debian.org/debian unstable/main i386 python3.12 i386 3.12.8-5 [677 kB] Get: 79 http://deb.debian.org/debian unstable/main i386 python3-all i386 3.13.1-2 [1052 B] Get: 80 http://deb.debian.org/debian unstable/main i386 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 41.3 MB in 1s (38.1 MB/s) +Fetched 41.3 MB in 1s (68.3 MB/s) Preconfiguring packages ... Selecting previously unselected package libpython3.13-minimal:i386. (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 ... 19837 files and directories currently installed.) @@ -475,8 +507,8 @@ Setting up tzdata (2025a-1) ... Current default time zone: 'Etc/UTC' -Local time is now: Fri Feb 20 17:39:30 UTC 2026. -Universal Time is now: Fri Feb 20 17:39:30 UTC 2026. +Local time is now: Sat Jan 18 11:18:27 UTC 2025. +Universal Time is now: Sat Jan 18 11:18:27 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -551,7 +583,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/1502/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/1502/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 @@ -598,12 +634,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/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/utilities.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/__init__.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/sparse.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/constants.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 @@ -770,12 +806,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt @@ -974,7 +1010,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e1b23cd71f164dbc84a16c3e7ed2282d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1b23cd71f164dbc84a16c3e7ed2282d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/98fd11408a434d5cb9948fdfc5b539d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98fd11408a434d5cb9948fdfc5b539d4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -997,7 +1033,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/44f8d98c3931427cb7c11cebd4306f05-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/44f8d98c3931427cb7c11cebd4306f05-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/48e8980d1de944218b7bd522ff8b6af6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/48e8980d1de944218b7bd522ff8b6af6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -1028,7 +1064,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.00 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.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.48138 (1) obj. 4.11362e+06 iterations 2 @@ -1047,7 +1083,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 10 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 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.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.43242 (1) obj. 4.18141e+06 iterations 2 @@ -1082,11 +1118,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.03 seconds) -Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.05 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.03 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.06 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 @@ -1095,7 +1131,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 7 iterations and 0 nodes (0.03 seconds) +Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.06 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) @@ -1112,17 +1148,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.06 (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/001fe417018242fcb84cfebf56bec97a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/001fe417018242fcb84cfebf56bec97a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b07821572d324df88453458eb0ac58c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b07821572d324df88453458eb0ac58c9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -1141,7 +1177,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 50 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 36 columns -Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.01 seconds) +Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (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 11 @@ -1167,7 +1203,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 31 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 83 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.09 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.17 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 12 @@ -1202,52 +1238,52 @@ 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.17 seconds) -Cbc0038I After 0.17 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.16 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.30 seconds) +Cbc0038I After 0.30 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.28 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 9 added rows had average density of 59 Cbc0013I At root node, 9 cuts changed objective from 2546.9589 to 2695.6793 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.028 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.046 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 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) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.026 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.46 seconds) +Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.054 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.087 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.018 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) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.049 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.037 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.021 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.90 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 47 rows 56 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 74 rows 77 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.03 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (2.00 seconds) Cbc0032I Strong branching done 1272 times (10385 iterations), fathomed 26 nodes and fixed 41 variables Cbc0035I Maximum depth 11, 238 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2695.68 -Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) -Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.078 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 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 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.055 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) -TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) +Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.054 seconds) +Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.143 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.018 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 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.103 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.037 seconds) +TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.064 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 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 110 Total iterations: 4892 -Time (CPU seconds): 1.02 -Time (Wallclock seconds): 1.03 +Time (CPU seconds): 1.99 +Time (Wallclock seconds): 2.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.02 (Wallclock seconds): 1.03 +Total time (CPU seconds): 1.99 (Wallclock seconds): 2.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/992243dd013347e49a74388cb768e480-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/992243dd013347e49a74388cb768e480-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9cf9392d1a9b481284ff1795eb911b2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cf9392d1a9b481284ff1795eb911b2c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS @@ -1257,130 +1293,132 @@ 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.837 - 0.00 seconds -Cgl0004I processed model has 176 rows, 170 columns (170 integer (170 of which binary)) and 640 elements +Continuous objective value is -155.656 - 0.00 seconds +Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 800 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 19 integers unsatisfied sum - 2.69694 -Cbc0038I Pass 1: suminf. 0.07595 (1) obj. -128.142 iterations 69 -Cbc0038I Solution found of -124.4 -Cbc0038I Before mini branch and bound, 150 integers at bound fixed and 0 continuous -Cbc0038I Full problem 176 rows 170 columns, reduced to 1 rows 2 columns -Cbc0038I Mini branch and bound improved solution from -124.4 to -126.8 (0.01 seconds) -Cbc0038I Round again with cutoff of -127.05 -Cbc0038I Reduced cost fixing fixed 19 variables on major pass 2 -Cbc0038I Pass 2: suminf. 0.07595 (1) obj. -128.142 iterations 0 -Cbc0038I Pass 3: suminf. 0.34568 (1) obj. -127.05 iterations 7 -Cbc0038I Pass 4: suminf. 1.06050 (3) obj. -127.05 iterations 57 -Cbc0038I Pass 5: suminf. 0.21617 (2) obj. -127.05 iterations 56 -Cbc0038I Pass 6: suminf. 0.77201 (2) obj. -127.05 iterations 59 -Cbc0038I Pass 7: suminf. 0.84233 (3) obj. -127.05 iterations 26 -Cbc0038I Pass 8: suminf. 0.29617 (2) obj. -127.05 iterations 49 -Cbc0038I Pass 9: suminf. 0.71140 (2) obj. -127.05 iterations 48 -Cbc0038I Pass 10: suminf. 0.56151 (3) obj. -127.05 iterations 24 -Cbc0038I Pass 11: suminf. 0.45617 (2) obj. -127.05 iterations 21 -Cbc0038I Pass 12: suminf. 0.59019 (2) obj. -127.05 iterations 52 -Cbc0038I Pass 13: suminf. 0.98047 (3) obj. -127.05 iterations 29 -Cbc0038I Pass 14: suminf. 0.33617 (2) obj. -127.05 iterations 35 -Cbc0038I Pass 15: suminf. 0.68110 (2) obj. -127.05 iterations 48 -Cbc0038I Pass 16: suminf. 0.71353 (3) obj. -127.05 iterations 26 -Cbc0038I Pass 17: suminf. 0.08000 (2) obj. -127.05 iterations 64 -Cbc0038I Pass 18: suminf. 0.18182 (1) obj. -127.05 iterations 46 -Cbc0038I Pass 19: suminf. 0.27637 (3) obj. -127.05 iterations 42 -Cbc0038I Pass 20: suminf. 0.27637 (3) obj. -127.05 iterations 4 -Cbc0038I Pass 21: suminf. 0.67388 (2) obj. -127.05 iterations 62 -Cbc0038I Pass 22: suminf. 0.42424 (1) obj. -127.05 iterations 5 -Cbc0038I Pass 23: suminf. 0.07595 (1) obj. -127.442 iterations 27 -Cbc0038I Pass 24: suminf. 0.17284 (1) obj. -127.05 iterations 3 -Cbc0038I Pass 25: suminf. 2.96043 (19) obj. -127.05 iterations 47 -Cbc0038I Pass 26: suminf. 0.71429 (2) obj. -127.05 iterations 21 -Cbc0038I Pass 27: suminf. 0.51932 (3) obj. -127.05 iterations 26 -Cbc0038I Pass 28: suminf. 0.20203 (2) obj. -127.05 iterations 16 -Cbc0038I Pass 29: suminf. 0.17617 (2) obj. -127.05 iterations 1 -Cbc0038I Pass 30: suminf. 0.80231 (2) obj. -127.05 iterations 49 -Cbc0038I Pass 31: suminf. 1.10780 (3) obj. -127.05 iterations 19 -Cbc0038I Rounding solution of -127.5 is better than previous of -126.8 - -Cbc0038I Before mini branch and bound, 131 integers at bound fixed and 0 continuous -Cbc0038I Full problem 176 rows 170 columns, reduced to 14 rows 18 columns -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) -Cbc0038I Round again with cutoff of -127.85 -Cbc0038I Reduced cost fixing fixed 40 variables on major pass 3 -Cbc0038I Pass 31: suminf. 0.07595 (1) obj. -128.142 iterations 0 -Cbc0038I Pass 32: suminf. 0.14815 (1) obj. -127.85 iterations 6 -Cbc0038I Pass 33: suminf. 0.63275 (3) obj. -127.85 iterations 37 -Cbc0038I Pass 34: suminf. 0.45617 (2) obj. -127.85 iterations 39 -Cbc0038I Pass 35: suminf. 0.59019 (2) obj. -127.85 iterations 60 -Cbc0038I Pass 36: suminf. 0.82228 (3) obj. -127.85 iterations 19 -Cbc0038I Pass 37: suminf. 0.41617 (2) obj. -127.85 iterations 51 -Cbc0038I Pass 38: suminf. 0.62049 (2) obj. -127.85 iterations 58 -Cbc0038I Pass 39: suminf. 0.80865 (3) obj. -127.85 iterations 19 -Cbc0038I Pass 40: suminf. 0.49617 (2) obj. -127.85 iterations 13 -Cbc0038I Pass 41: suminf. 0.55988 (2) obj. -127.85 iterations 53 -Cbc0038I Pass 42: suminf. 0.74179 (3) obj. -127.85 iterations 18 -Cbc0038I Pass 43: suminf. 0.74179 (3) obj. -127.85 iterations 2 -Cbc0038I Pass 44: suminf. 0.77201 (2) obj. -127.85 iterations 67 -Cbc0038I Pass 45: suminf. 0.21617 (2) obj. -127.85 iterations 12 -Cbc0038I Pass 46: suminf. 0.81367 (3) obj. -127.85 iterations 9 -Cbc0038I Pass 47: suminf. 0.81367 (3) obj. -127.85 iterations 2 -Cbc0038I Pass 48: suminf. 0.64179 (3) obj. -127.85 iterations 4 -Cbc0038I Pass 49: suminf. 0.64179 (3) obj. -127.85 iterations 1 -Cbc0038I Pass 50: suminf. 0.80231 (2) obj. -127.85 iterations 63 -Cbc0038I Pass 51: suminf. 0.17617 (2) obj. -127.85 iterations 12 -Cbc0038I Pass 52: suminf. 0.64179 (3) obj. -127.85 iterations 10 -Cbc0038I Pass 53: suminf. 1.10865 (3) obj. -127.85 iterations 4 -Cbc0038I Pass 54: suminf. 0.74179 (3) obj. -127.85 iterations 2 -Cbc0038I Pass 55: suminf. 0.77201 (2) obj. -127.85 iterations 61 -Cbc0038I Pass 56: suminf. 0.21617 (2) obj. -127.85 iterations 12 -Cbc0038I Pass 57: suminf. 0.54414 (3) obj. -127.85 iterations 9 -Cbc0038I Pass 58: suminf. 0.54414 (3) obj. -127.85 iterations 0 -Cbc0038I Pass 59: suminf. 0.54414 (3) obj. -127.85 iterations 1 -Cbc0038I Pass 60: suminf. 0.54414 (3) obj. -127.85 iterations 1 +Cbc0038I Initial state - 43 integers unsatisfied sum - 3.78413 +Cbc0038I Pass 1: suminf. 0.59840 (5) obj. -155.163 iterations 111 +Cbc0038I Solution found of -140.65 +Cbc0038I Rounding solution of -141.25 is better than previous of -140.65 + +Cbc0038I Before mini branch and bound, 163 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 41 rows 35 columns +Cbc0038I Mini branch and bound improved solution from -141.25 to -151.2 (0.02 seconds) +Cbc0038I Round again with cutoff of -151.7 +Cbc0038I Reduced cost fixing fixed 3 variables on major pass 2 +Cbc0038I Pass 2: suminf. 0.59840 (5) obj. -155.163 iterations 0 +Cbc0038I Pass 3: suminf. 0.75668 (4) obj. -151.7 iterations 12 +Cbc0038I Pass 4: suminf. 0.34164 (4) obj. -153.007 iterations 5 +Cbc0038I Pass 5: suminf. 0.56098 (6) obj. -151.7 iterations 98 +Cbc0038I Pass 6: suminf. 0.43748 (5) obj. -151.842 iterations 68 +Cbc0038I Pass 7: suminf. 0.48647 (5) obj. -151.7 iterations 14 +Cbc0038I Pass 8: suminf. 1.11335 (6) obj. -151.7 iterations 88 +Cbc0038I Pass 9: suminf. 0.18072 (4) obj. -151.737 iterations 80 +Cbc0038I Pass 10: suminf. 0.19236 (4) obj. -151.7 iterations 5 +Cbc0038I Pass 11: suminf. 0.79871 (6) obj. -151.7 iterations 86 +Cbc0038I Pass 12: suminf. 0.42881 (5) obj. -151.7 iterations 39 +Cbc0038I Pass 13: suminf. 0.60069 (6) obj. -151.7 iterations 20 +Cbc0038I Pass 14: suminf. 0.60069 (6) obj. -151.7 iterations 21 +Cbc0038I Pass 15: suminf. 0.46269 (4) obj. -151.7 iterations 99 +Cbc0038I Pass 16: suminf. 0.42727 (5) obj. -151.7 iterations 71 +Cbc0038I Pass 17: suminf. 0.46269 (4) obj. -151.7 iterations 32 +Cbc0038I Pass 18: suminf. 0.48408 (5) obj. -151.7 iterations 48 +Cbc0038I Pass 19: suminf. 0.92644 (5) obj. -151.7 iterations 32 +Cbc0038I Pass 20: suminf. 0.38849 (4) obj. -151.7 iterations 113 +Cbc0038I Pass 21: suminf. 0.68813 (4) obj. -151.7 iterations 126 +Cbc0038I Pass 22: suminf. 0.68813 (4) obj. -151.7 iterations 5 +Cbc0038I Pass 23: suminf. 0.60419 (3) obj. -151.7 iterations 86 +Cbc0038I Pass 24: suminf. 0.28367 (3) obj. -152.204 iterations 28 +Cbc0038I Pass 25: suminf. 0.44382 (3) obj. -151.7 iterations 4 +Cbc0038I Pass 26: suminf. 0.74922 (5) obj. -151.7 iterations 51 +Cbc0038I Pass 27: suminf. 0.54401 (5) obj. -151.7 iterations 18 +Cbc0038I Pass 28: suminf. 0.83725 (5) obj. -151.7 iterations 26 +Cbc0038I Pass 29: suminf. 0.80655 (5) obj. -151.7 iterations 9 +Cbc0038I Pass 30: suminf. 0.38418 (4) obj. -151.7 iterations 123 +Cbc0038I Pass 31: suminf. 0.38418 (4) obj. -151.7 iterations 6 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 140 integers at bound fixed and 0 continuous -Cbc0038I Full problem 176 rows 170 columns, reduced to 1 rows 2 columns -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -127.5 - took 0.04 seconds -Cbc0012I Integer solution of -127.5 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0038I Full problem 176 rows 170 columns, reduced to 1 rows 2 columns -Cbc0006I The LP relaxation is infeasible or too expensive -Cbc0031I 8 added rows had average density of 9.5 -Cbc0013I At root node, 9 cuts changed objective from -128.83726 to -127.5 in 2 passes -Cbc0014I Cut generator 0 (Probing) - 9 row cuts average 10.9 elements, 3 column cuts (3 active) in 0.001 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) - 9 row cuts average 7.9 elements, 0 column cuts (0 active) in 0.000 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 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) - 5 row cuts average 16.6 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 7 (ZeroHalf) - 1 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -127.5, took 22 iterations and 0 nodes (0.06 seconds) -Cbc0035I Maximum depth 0, 51 variables fixed on reduced cost -Cuts at root node changed objective from -128.837 to -127.5 -Probing was tried 2 times and created 12 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 1 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 1 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 5 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0038I Before mini branch and bound, 136 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 42 rows 54 columns +Cbc0038I Mini branch and bound improved solution from -151.2 to -151.5 (0.10 seconds) +Cbc0038I Round again with cutoff of -152.5 +Cbc0038I Reduced cost fixing fixed 4 variables on major pass 3 +Cbc0038I Pass 31: suminf. 0.59840 (5) obj. -155.163 iterations 0 +Cbc0038I Pass 32: suminf. 0.50271 (4) obj. -152.5 iterations 12 +Cbc0038I Pass 33: suminf. 0.34164 (4) obj. -153.007 iterations 5 +Cbc0038I Pass 34: suminf. 0.66552 (5) obj. -152.5 iterations 82 +Cbc0038I Pass 35: suminf. 0.34164 (4) obj. -152.857 iterations 55 +Cbc0038I Pass 36: suminf. 0.45509 (4) obj. -152.5 iterations 5 +Cbc0038I Pass 37: suminf. 0.65415 (5) obj. -152.5 iterations 61 +Cbc0038I Pass 38: suminf. 0.70276 (5) obj. -152.5 iterations 56 +Cbc0038I Pass 39: suminf. 0.70276 (5) obj. -152.5 iterations 10 +Cbc0038I Pass 40: suminf. 0.77307 (5) obj. -152.5 iterations 82 +Cbc0038I Pass 41: suminf. 0.59840 (5) obj. -152.713 iterations 25 +Cbc0038I Pass 42: suminf. 0.67177 (5) obj. -152.5 iterations 12 +Cbc0038I Pass 43: suminf. 0.95295 (6) obj. -152.5 iterations 94 +Cbc0038I Pass 44: suminf. 0.60951 (6) obj. -152.5 iterations 87 +Cbc0038I Pass 45: suminf. 0.64807 (5) obj. -152.5 iterations 42 +Cbc0038I Pass 46: suminf. 1.05877 (5) obj. -152.5 iterations 53 +Cbc0038I Pass 47: suminf. 0.98024 (5) obj. -152.5 iterations 11 +Cbc0038I Pass 48: suminf. 1.04864 (4) obj. -152.5 iterations 86 +Cbc0038I Pass 49: suminf. 1.02928 (4) obj. -152.5 iterations 7 +Cbc0038I Pass 50: suminf. 0.88609 (4) obj. -152.5 iterations 39 +Cbc0038I Pass 51: suminf. 0.88609 (4) obj. -152.5 iterations 2 +Cbc0038I Pass 52: suminf. 1.02928 (4) obj. -152.5 iterations 32 +Cbc0038I Pass 53: suminf. 1.42510 (6) obj. -152.5 iterations 56 +Cbc0038I Pass 54: suminf. 1.05632 (6) obj. -152.5 iterations 24 +Cbc0038I Pass 55: suminf. 0.84594 (4) obj. -152.5 iterations 92 +Cbc0038I Pass 56: suminf. 0.65002 (4) obj. -152.615 iterations 28 +Cbc0038I Pass 57: suminf. 0.68955 (4) obj. -152.5 iterations 7 +Cbc0038I Pass 58: suminf. 1.01701 (6) obj. -152.5 iterations 87 +Cbc0038I Pass 59: suminf. 0.91090 (6) obj. -152.5 iterations 14 +Cbc0038I Pass 60: suminf. 0.78550 (5) obj. -152.5 iterations 141 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 142 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 41 rows 49 columns +Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) +Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of -151.5 - took 0.14 seconds +Cbc0012I Integer solution of -151.5 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) +Cbc0038I Full problem 220 rows 210 columns, reduced to 41 rows 34 columns +Cbc0031I 15 added rows had average density of 20.066667 +Cbc0013I At root node, 15 cuts changed objective from -155.65629 to -152.21023 in 13 passes +Cbc0014I Cut generator 0 (Probing) - 22 row cuts average 10.5 elements, 4 column cuts (4 active) in 0.006 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 34 row cuts average 35.6 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 25 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 +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) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 91 row cuts average 26.3 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 +Cbc0014I Cut generator 7 (ZeroHalf) - 49 row cuts average 28.5 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, -151.5 best solution, best possible -152.14703 (0.29 seconds) +Cbc0001I Search completed - best objective -151.5, took 221 iterations and 4 nodes (0.34 seconds) +Cbc0032I Strong branching done 174 times (1694 iterations), fathomed 0 nodes and fixed 1 variables +Cbc0035I Maximum depth 1, 49 variables fixed on reduced cost +Cuts at root node changed objective from -155.656 to -152.147 +Probing was tried 24 times and created 48 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Gomory was tried 24 times and created 56 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) +Knapsack was tried 24 times and created 37 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) +Clique was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +FlowCover was tried 13 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +TwoMirCuts was tried 24 times and created 151 cuts of which 0 were active after adding rounds of cuts (0.031 seconds) +ZeroHalf was tried 24 times and created 50 cuts of which 0 were active after adding rounds of cuts (0.025 seconds) Result - Optimal solution found -Objective value: -127.50000000 -Enumerated nodes: 0 -Total iterations: 22 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.06 +Objective value: -151.50000000 +Enumerated nodes: 4 +Total iterations: 221 +Time (CPU seconds): 0.33 +Time (Wallclock seconds): 0.34 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +Total time (CPU seconds): 0.34 (Wallclock seconds): 0.34 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f0d2730be41c40d695531667fc70c04d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0d2730be41c40d695531667fc70c04d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5a3daa0938dc4b1ab06d435aa23aab2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5a3daa0938dc4b1ab06d435aa23aab2b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1392,209 +1430,170 @@ 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 - 0.657901 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 64.5 iterations 3 -Cbc0038I Solution found of 64.5 -Cbc0038I Relaxing continuous gives 64.5 +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.353418 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 33 iterations 5 +Cbc0038I Solution found of 33 +Cbc0038I Relaxing continuous gives 33 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 improved solution from 64.5 to 64.5 (0.00 seconds) -Cbc0038I Round again with cutoff of 58.05 -Cbc0038I Pass 2: suminf. 0.04962 (1) obj. 58.05 iterations 1 -Cbc0038I Pass 3: suminf. 0.26502 (1) obj. 58.05 iterations 4 -Cbc0038I Pass 4: suminf. 0.16245 (1) obj. 58.05 iterations 4 -Cbc0038I Pass 5: suminf. 0.37129 (1) obj. 58.05 iterations 3 -Cbc0038I Pass 6: suminf. 0.77680 (3) obj. 58.05 iterations 10 -Cbc0038I Pass 7: suminf. 0.54165 (2) obj. 58.05 iterations 7 -Cbc0038I Pass 8: suminf. 0.25534 (1) obj. 58.05 iterations 2 -Cbc0038I Pass 9: suminf. 0.03795 (1) obj. 58.05 iterations 4 -Cbc0038I Pass 10: suminf. 0.49578 (1) obj. 58.05 iterations 3 -Cbc0038I Pass 11: suminf. 0.71826 (2) obj. 58.05 iterations 6 -Cbc0038I Pass 12: suminf. 0.72762 (2) obj. 58.05 iterations 4 -Cbc0038I Pass 13: suminf. 0.00000 (0) obj. 58.05 iterations 4 -Cbc0038I Solution found of 58.05 -Cbc0038I Relaxing continuous gives 37.5 -Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0038I Mini branch and bound improved solution from 37.5 to 13.5 (0.02 seconds) -Cbc0038I Round again with cutoff of 10.8 -Cbc0038I Pass 14: suminf. 0.48266 (2) obj. 10.8 iterations 1 -Cbc0038I Pass 15: suminf. 0.83368 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 16: suminf. 0.37151 (3) obj. 10.8 iterations 6 -Cbc0038I Pass 17: suminf. 0.77392 (3) obj. 10.8 iterations 2 -Cbc0038I Pass 18: suminf. 0.33583 (3) obj. 10.8 iterations 2 -Cbc0038I Pass 19: suminf. 0.82463 (3) obj. 10.8 iterations 2 -Cbc0038I Pass 20: suminf. 0.37151 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 21: suminf. 0.34367 (2) obj. 10.8 iterations 9 -Cbc0038I Pass 22: suminf. 0.29542 (1) obj. 10.8 iterations 1 -Cbc0038I Pass 23: suminf. 0.54679 (2) obj. 10.8 iterations 3 -Cbc0038I Pass 24: suminf. 0.62966 (2) obj. 10.8 iterations 2 -Cbc0038I Pass 25: suminf. 0.61996 (2) obj. 10.8 iterations 11 -Cbc0038I Pass 26: suminf. 0.35999 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 27: suminf. 0.68488 (2) obj. 10.8 iterations 8 -Cbc0038I Pass 28: suminf. 0.68488 (2) obj. 10.8 iterations 0 -Cbc0038I Pass 29: suminf. 0.90583 (2) obj. 10.8 iterations 3 -Cbc0038I Pass 30: suminf. 0.68624 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 31: suminf. 0.91961 (3) obj. 10.8 iterations 5 -Cbc0038I Pass 32: suminf. 0.59458 (3) obj. 10.8 iterations 3 -Cbc0038I Pass 33: suminf. 0.35545 (2) obj. 10.8 iterations 4 -Cbc0038I Pass 34: suminf. 0.70371 (3) obj. 10.8 iterations 2 -Cbc0038I Pass 35: suminf. 0.97433 (3) obj. 10.8 iterations 5 -Cbc0038I Pass 36: suminf. 0.48696 (2) obj. 10.8 iterations 5 -Cbc0038I Pass 37: suminf. 0.32685 (2) obj. 10.8 iterations 5 -Cbc0038I Pass 38: suminf. 0.47181 (2) obj. 10.8 iterations 2 -Cbc0038I Pass 39: suminf. 0.28293 (2) obj. 10.8 iterations 9 -Cbc0038I Pass 40: suminf. 0.81445 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 41: suminf. 0.42515 (3) obj. 10.8 iterations 3 -Cbc0038I Pass 42: suminf. 0.74065 (3) obj. 10.8 iterations 4 -Cbc0038I Pass 43: suminf. 0.56846 (2) obj. 10.8 iterations 2 +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 28.8001 +Cbc0038I Pass 2: suminf. 0.01981 (2) obj. 28.8001 iterations 2 +Cbc0038I Pass 3: suminf. 0.66340 (2) obj. 28.8001 iterations 5 +Cbc0038I Pass 4: suminf. 0.66340 (2) obj. 28.8001 iterations 0 +Cbc0038I Pass 5: suminf. 0.01981 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 6: suminf. 0.07941 (1) obj. 28.8001 iterations 8 +Cbc0038I Pass 7: suminf. 0.26795 (1) obj. 28.8001 iterations 2 +Cbc0038I Pass 8: suminf. 0.07941 (1) obj. 28.8001 iterations 2 +Cbc0038I Pass 9: suminf. 0.73935 (3) obj. 28.8001 iterations 8 +Cbc0038I Pass 10: suminf. 0.04921 (1) obj. 28.8001 iterations 5 +Cbc0038I Pass 11: suminf. 0.55178 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 12: suminf. 0.32737 (2) obj. 28.8001 iterations 1 +Cbc0038I Pass 13: suminf. 0.87215 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 14: suminf. 0.55215 (2) obj. 28.8001 iterations 4 +Cbc0038I Pass 15: suminf. 0.55215 (2) obj. 28.8001 iterations 0 +Cbc0038I Pass 16: suminf. 0.52804 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 17: suminf. 0.14185 (1) obj. 28.8001 iterations 1 +Cbc0038I Pass 18: suminf. 0.39560 (1) obj. 28.8001 iterations 3 +Cbc0038I Pass 19: suminf. 0.52659 (2) obj. 28.8001 iterations 9 +Cbc0038I Pass 20: suminf. 0.52659 (2) obj. 28.8001 iterations 0 +Cbc0038I Pass 21: suminf. 0.62650 (3) obj. 28.8001 iterations 4 +Cbc0038I Pass 22: suminf. 0.18907 (2) obj. 28.8001 iterations 2 +Cbc0038I Pass 23: suminf. 0.82928 (2) obj. 28.8001 iterations 2 +Cbc0038I Pass 24: suminf. 0.74578 (2) obj. 28.8001 iterations 8 +Cbc0038I Pass 25: suminf. 0.19213 (1) obj. 28.8001 iterations 3 +Cbc0038I Pass 26: suminf. 0.63985 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 27: suminf. 0.26333 (2) obj. 28.8001 iterations 3 +Cbc0038I Pass 28: suminf. 0.04934 (1) obj. 28.8001 iterations 1 +Cbc0038I Pass 29: suminf. 0.30308 (1) obj. 28.8001 iterations 3 +Cbc0038I Pass 30: suminf. 0.63260 (3) obj. 28.8001 iterations 5 +Cbc0038I Pass 31: suminf. 0.21977 (2) obj. 28.8001 iterations 2 Cbc0038I No solution found this major pass -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 13.5 to 11.5 (0.03 seconds) -Cbc0038I Round again with cutoff of 7.55999 -Cbc0038I Pass 43: suminf. 0.53083 (2) obj. 7.55999 iterations 0 -Cbc0038I Pass 44: suminf. 0.80138 (3) obj. 7.55999 iterations 4 -Cbc0038I Pass 45: suminf. 0.86847 (3) obj. 7.55999 iterations 10 -Cbc0038I Pass 46: suminf. 0.00832 (1) obj. 7.55999 iterations 10 -Cbc0038I Pass 47: suminf. 0.38352 (3) obj. 7.55999 iterations 3 -Cbc0038I Pass 48: suminf. 0.72925 (3) obj. 7.55999 iterations 6 -Cbc0038I Pass 49: suminf. 0.58711 (3) obj. 7.55999 iterations 11 -Cbc0038I Pass 50: suminf. 0.58711 (3) obj. 7.55999 iterations 0 -Cbc0038I Pass 51: suminf. 0.92873 (3) obj. 7.55999 iterations 3 -Cbc0038I Pass 52: suminf. 0.83082 (3) obj. 7.55999 iterations 2 -Cbc0038I Pass 53: suminf. 1.04671 (3) obj. 7.55999 iterations 1 -Cbc0038I Pass 54: suminf. 0.24068 (3) obj. 7.55999 iterations 9 -Cbc0038I Pass 55: suminf. 0.00000 (0) obj. 7.55999 iterations 8 -Cbc0038I Solution found of 7.55999 -Cbc0038I Relaxing continuous gives 7.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 7.5 to 7.5 (0.05 seconds) -Cbc0038I Round again with cutoff of 5.24999 -Cbc0038I Pass 56: suminf. 0.56825 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 57: suminf. 0.59985 (3) obj. 5.24999 iterations 2 -Cbc0038I Pass 58: suminf. 0.48709 (1) obj. 5.24999 iterations 4 -Cbc0038I Pass 59: suminf. 0.43176 (2) obj. 5.24999 iterations 3 -Cbc0038I Pass 60: suminf. 0.48709 (1) obj. 5.24999 iterations 3 -Cbc0038I Pass 61: suminf. 0.60448 (2) obj. 5.24999 iterations 11 -Cbc0038I Pass 62: suminf. 0.09938 (2) obj. 5.24999 iterations 4 -Cbc0038I Pass 63: suminf. 0.63145 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 64: suminf. 0.31190 (3) obj. 5.24999 iterations 4 -Cbc0038I Pass 65: suminf. 0.42541 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 66: suminf. 0.94746 (3) obj. 5.24999 iterations 9 -Cbc0038I Pass 67: suminf. 0.52469 (3) obj. 5.24999 iterations 2 -Cbc0038I Pass 68: suminf. 0.97591 (3) obj. 5.24999 iterations 2 -Cbc0038I Pass 69: suminf. 0.67503 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 70: suminf. 0.84116 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 71: suminf. 0.41045 (3) obj. 5.24999 iterations 7 -Cbc0038I Pass 72: suminf. 0.17817 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 73: suminf. 1.13930 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 74: suminf. 0.82094 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 75: suminf. 0.91716 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 76: suminf. 0.33526 (2) obj. 5.24999 iterations 8 -Cbc0038I Pass 77: suminf. 0.89576 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 78: suminf. 0.35217 (3) obj. 5.24999 iterations 4 -Cbc0038I Pass 79: suminf. 0.33526 (2) obj. 5.24999 iterations 3 -Cbc0038I Pass 80: suminf. 0.94181 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 81: suminf. 0.33526 (2) obj. 5.24999 iterations 5 -Cbc0038I Pass 82: suminf. 0.37321 (3) obj. 5.24999 iterations 7 -Cbc0038I Pass 83: suminf. 0.18310 (3) obj. 5.24999 iterations 1 -Cbc0038I Pass 84: suminf. 0.92427 (3) obj. 5.24999 iterations 3 -Cbc0038I Pass 85: suminf. 0.92427 (3) obj. 5.24999 iterations 0 +Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns +Cbc0038I Mini branch and bound improved solution from 33 to 13 (0.03 seconds) +Cbc0038I Round again with cutoff of 9.60008 +Cbc0038I Pass 31: suminf. 0.14146 (3) obj. 9.60008 iterations 2 +Cbc0038I Pass 32: suminf. 0.99452 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 33: suminf. 0.64306 (3) obj. 9.60008 iterations 1 +Cbc0038I Pass 34: suminf. 0.61986 (3) obj. 9.60008 iterations 1 +Cbc0038I Pass 35: suminf. 0.61986 (3) obj. 9.60008 iterations 0 +Cbc0038I Pass 36: suminf. 0.70439 (2) obj. 9.60008 iterations 10 +Cbc0038I Pass 37: suminf. 0.25581 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 38: suminf. 0.68355 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 39: suminf. 0.41530 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 40: suminf. 0.41530 (3) obj. 9.60008 iterations 0 +Cbc0038I Pass 41: suminf. 1.08081 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 42: suminf. 0.74012 (2) obj. 9.60008 iterations 2 +Cbc0038I Pass 43: suminf. 0.78244 (2) obj. 9.60008 iterations 2 +Cbc0038I Pass 44: suminf. 0.65289 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 45: suminf. 0.46329 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 46: suminf. 0.25581 (3) obj. 9.60008 iterations 1 +Cbc0038I Pass 47: suminf. 0.68355 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 48: suminf. 0.46742 (2) obj. 9.60008 iterations 12 +Cbc0038I Pass 49: suminf. 0.20117 (1) obj. 9.60008 iterations 3 +Cbc0038I Pass 50: suminf. 0.47296 (2) obj. 9.60008 iterations 3 +Cbc0038I Pass 51: suminf. 0.70158 (2) obj. 9.60008 iterations 10 +Cbc0038I Pass 52: suminf. 0.92229 (2) obj. 9.60008 iterations 2 +Cbc0038I Pass 53: suminf. 0.54162 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 54: suminf. 0.32832 (2) obj. 9.60008 iterations 3 +Cbc0038I Pass 55: suminf. 0.74928 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 56: suminf. 0.85810 (2) obj. 9.60008 iterations 11 +Cbc0038I Pass 57: suminf. 1.03575 (3) obj. 9.60008 iterations 3 +Cbc0038I Pass 58: suminf. 0.85810 (2) obj. 9.60008 iterations 2 +Cbc0038I Pass 59: suminf. 0.85810 (2) obj. 9.60008 iterations 0 +Cbc0038I Pass 60: suminf. 0.92428 (3) obj. 9.60008 iterations 7 Cbc0038I No solution found this major pass -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 7.5 to 5.5 (0.06 seconds) -Cbc0038I Round again with cutoff of 3.15 -Cbc0038I Pass 85: suminf. 0.60411 (3) obj. 3.15 iterations 0 -Cbc0038I Pass 86: suminf. 0.61964 (3) obj. 3.15 iterations 2 -Cbc0038I Pass 87: suminf. 0.47723 (1) obj. 3.15 iterations 4 -Cbc0038I Pass 88: suminf. 0.44497 (2) obj. 3.15 iterations 3 -Cbc0038I Pass 89: suminf. 0.47723 (1) obj. 3.15 iterations 3 -Cbc0038I Pass 90: suminf. 0.68082 (3) obj. 3.15 iterations 13 -Cbc0038I Pass 91: suminf. 0.68082 (3) obj. 3.15 iterations 0 -Cbc0038I Pass 92: suminf. 0.90492 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 93: suminf. 0.53170 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 94: suminf. 0.98021 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 95: suminf. 0.36820 (3) obj. 3.15 iterations 5 -Cbc0038I Pass 96: suminf. 0.64939 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 97: suminf. 0.57812 (3) obj. 3.15 iterations 2 -Cbc0038I Pass 98: suminf. 0.53323 (3) obj. 3.15 iterations 4 -Cbc0038I Pass 99: suminf. 0.88946 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 100: suminf. 0.30987 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 101: suminf. 1.00091 (3) obj. 3.15 iterations 5 -Cbc0038I Pass 102: suminf. 0.85687 (3) obj. 3.15 iterations 2 -Cbc0038I Pass 103: suminf. 0.76878 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 104: suminf. 0.76878 (3) obj. 3.15 iterations 0 -Cbc0038I Pass 105: suminf. 0.75664 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 106: suminf. 0.39631 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 107: suminf. 1.08363 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 108: suminf. 0.74364 (3) obj. 3.15 iterations 3 -Cbc0038I Pass 109: suminf. 0.11304 (2) obj. 3.15 iterations 5 -Cbc0038I Pass 110: suminf. 0.07439 (2) obj. 3.15 iterations 2 -Cbc0038I Pass 111: suminf. 0.13583 (3) obj. 3.15 iterations 2 -Cbc0038I Pass 112: suminf. 0.76131 (3) obj. 3.15 iterations 6 -Cbc0038I Pass 113: suminf. 0.62287 (3) obj. 3.15 iterations 2 -Cbc0038I Pass 114: suminf. 0.37114 (3) obj. 3.15 iterations 4 +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 13 to 5 (0.05 seconds) +Cbc0038I Round again with cutoff of 2.80007 +Cbc0038I Pass 60: suminf. 0.29160 (3) obj. 2.80007 iterations 0 +Cbc0038I Pass 61: suminf. 0.87004 (3) obj. 2.80007 iterations 3 +Cbc0038I Pass 62: suminf. 0.76754 (3) obj. 2.80007 iterations 1 +Cbc0038I Pass 63: suminf. 0.56487 (3) obj. 2.80007 iterations 6 +Cbc0038I Pass 64: suminf. 0.50558 (3) obj. 2.80007 iterations 1 +Cbc0038I Pass 65: suminf. 0.83372 (3) obj. 2.80007 iterations 4 +Cbc0038I Pass 66: suminf. 0.65695 (3) obj. 2.80007 iterations 3 +Cbc0038I Pass 67: suminf. 0.92673 (3) obj. 2.80007 iterations 5 +Cbc0038I Pass 68: suminf. 0.60192 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 69: suminf. 0.51039 (3) obj. 2.80007 iterations 4 +Cbc0038I Pass 70: suminf. 0.46812 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 71: suminf. 0.71854 (3) obj. 2.80007 iterations 7 +Cbc0038I Pass 72: suminf. 0.35448 (3) obj. 2.80007 iterations 5 +Cbc0038I Pass 73: suminf. 0.93603 (3) obj. 2.80007 iterations 3 +Cbc0038I Pass 74: suminf. 0.79252 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 75: suminf. 0.89243 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 76: suminf. 0.82588 (2) obj. 2.80007 iterations 2 +Cbc0038I Pass 77: suminf. 0.33559 (2) obj. 2.80007 iterations 3 +Cbc0038I Pass 78: suminf. 0.66352 (3) obj. 2.80007 iterations 4 +Cbc0038I Pass 79: suminf. 0.49789 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 80: suminf. 0.75093 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 81: suminf. 0.65333 (2) obj. 2.80007 iterations 2 +Cbc0038I Pass 82: suminf. 0.73966 (2) obj. 2.80007 iterations 2 +Cbc0038I Pass 83: suminf. 0.79332 (2) obj. 2.80007 iterations 8 +Cbc0038I Pass 84: suminf. 0.72572 (3) obj. 2.80007 iterations 4 +Cbc0038I Pass 85: suminf. 0.61060 (3) obj. 2.80007 iterations 3 +Cbc0038I Pass 86: suminf. 0.52504 (3) obj. 2.80007 iterations 2 +Cbc0038I Pass 87: suminf. 0.82076 (3) obj. 2.80007 iterations 5 +Cbc0038I Pass 88: suminf. 0.35262 (3) obj. 2.80007 iterations 4 +Cbc0038I Pass 89: suminf. 0.70564 (3) obj. 2.80007 iterations 4 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 Before mini branch and bound, 5 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 5.5 - took 0.07 seconds -Cbc0012I Integer solution of 5.5 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0031I 5 added rows had average density of 17.2 -Cbc0013I At root node, 5 cuts changed objective from 0 to 0.5 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 630 row cuts average 25.8 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 394 row cuts average 11.6 elements, 0 column cuts (0 active) in 0.024 seconds - new frequency is 1 +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 5 - took 0.07 seconds +Cbc0012I Integer solution of 5 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0031I 5 added rows had average density of 14 +Cbc0013I At root node, 5 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.005 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 581 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 655 row cuts average 11.1 elements, 0 column cuts (0 active) in 0.057 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) - 578 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 76 row cuts average 9.4 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 -Cbc0014I Cut generator 6 (TwoMirCuts) - 484 row cuts average 18.7 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 5.5 best solution, best possible 0.5 (0.20 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 511 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 122 row cuts average 8.5 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 332 row cuts average 18.4 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 5 best solution, best possible 0 (0.28 seconds) +Cbc0004I Integer solution of 4 found after 1184 iterations and 23 nodes (0.30 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 15 columns +Cbc0016I Integer solution of 2 found by strong branching after 2006 iterations and 166 nodes (0.39 seconds) +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 17 columns -Cbc0012I Integer solution of 4.5 found by DiveCoefficient after 11310 iterations and 236 nodes (0.74 seconds) -Cbc0016I Integer solution of 3.5 found by strong branching after 12363 iterations and 256 nodes (0.79 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 21 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0010I After 1000 nodes, 4 on tree, 2 best solution, best possible 0 (1.01 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0010I After 1000 nodes, 5 on tree, 3.5 best solution, best possible 0.5 (2.45 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 21 columns -Cbc0001I Search completed - best objective 3.5, took 102112 iterations and 5701 nodes (4.23 seconds) -Cbc0032I Strong branching done 13670 times (71738 iterations), fathomed 79 nodes and fixed 423 variables -Cbc0041I Maximum depth 12, 1180 variables fixed on reduced cost (complete fathoming 328 times, 3885 nodes taking 15866 iterations) -Cuts at root node changed objective from 0 to 0.5 -Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -Gomory was tried 5093 times and created 19769 cuts of which 0 were active after adding rounds of cuts (0.371 seconds) -Knapsack was tried 5094 times and created 11992 cuts of which 0 were active after adding rounds of cuts (0.719 seconds) +Cbc0001I Search completed - best objective 2, took 13474 iterations and 3504 nodes (1.33 seconds) +Cbc0032I Strong branching done 6726 times (18524 iterations), fathomed 421 nodes and fixed 361 variables +Cbc0041I Maximum depth 13, 261 variables fixed on reduced cost (complete fathoming 189 times, 2128 nodes taking 4862 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.005 seconds) +Gomory was tried 100 times and created 581 cuts of which 0 were active after adding rounds of cuts (0.014 seconds) +Knapsack was tried 100 times and created 655 cuts of which 0 were active after adding rounds of cuts (0.057 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 5094 times and created 28669 cuts of which 0 were active after adding rounds of cuts (0.523 seconds) -FlowCover was tried 5094 times and created 2694 cuts of which 0 were active after adding rounds of cuts (0.221 seconds) -TwoMirCuts was tried 5093 times and created 15288 cuts of which 0 were active after adding rounds of cuts (0.252 seconds) +MixedIntegerRounding2 was tried 100 times and created 511 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) +FlowCover was tried 100 times and created 122 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +TwoMirCuts was tried 100 times and created 332 cuts of which 0 were active after adding rounds of cuts (0.007 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: 3.50000000 -Enumerated nodes: 5701 -Total iterations: 102112 -Time (CPU seconds): 4.19 -Time (Wallclock seconds): 4.23 +Objective value: 2.00000000 +Enumerated nodes: 3504 +Total iterations: 13474 +Time (CPU seconds): 1.29 +Time (Wallclock seconds): 1.33 Option for printingOptions changed from normal to all -Total time (CPU seconds): 4.19 (Wallclock seconds): 4.23 +Total time (CPU seconds): 1.29 (Wallclock seconds): 1.34 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/606d9996747d4747a38e625391e2578b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/606d9996747d4747a38e625391e2578b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/72fdd964d78645f69bcd9ae45bef3e42-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72fdd964d78645f69bcd9ae45bef3e42-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1617,7 +1616,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/957fbffcdcad4f0ca41e1133b6fa3467-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/957fbffcdcad4f0ca41e1133b6fa3467-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/08827db2c5f743c2bf263f375091741a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08827db2c5f743c2bf263f375091741a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1644,148 +1643,22 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9d66af7fa55840169743bd4b4ccd759a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d66af7fa55840169743bd4b4ccd759a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4475f05293f94604ab9b37280e17371e-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/4475f05293f94604ab9b37280e17371e-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.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 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.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -/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/cd061551eb5d4d889c571dedf279b587-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/cd061551eb5d4d889c571dedf279b587-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 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/16297952f30c4d26b2a7867988f098e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/16297952f30c4d26b2a7867988f098e9-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.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 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 (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/3b33873d39b54423a30dfb9710a5022e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b33873d39b54423a30dfb9710a5022e-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 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 -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 - +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 @@ -1793,23 +1666,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a54e8cdad5944d599c21fbb4fcdad6b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a54e8cdad5944d599c21fbb4fcdad6b4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f42866879b574f1aa38384027c510028-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f42866879b574f1aa38384027c510028-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 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 8630 - 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 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) +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 8630 to 8630 +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) @@ -1821,36 +1695,39 @@ Result - Optimal solution found -Objective value: 8630.00000000 +Objective value: 15005.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 +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/9eb5c68ba17a465381b6c63233eb20eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9eb5c68ba17a465381b6c63233eb20eb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d7a28ecdd6f247a394a19609bb1314a2-pulp.mps mips /tmp/d7a28ecdd6f247a394a19609bb1314a2-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/d7a28ecdd6f247a394a19609bb1314a2-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 +opening mipstart file /tmp/d7a28ecdd6f247a394a19609bb1314a2-pulp.mst. +MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 8660 - 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 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8660, 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 8660 to 8660 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.11 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) @@ -1862,36 +1739,33 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.12 +Time (Wallclock seconds): 0.14 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.15 (Wallclock seconds): 0.17 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b0c8a62041874d3c9073907fbe599328-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0c8a62041874d3c9073907fbe599328-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/05ad8de0cf56441c9d3b4f2c67a727f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05ad8de0cf56441c9d3b4f2c67a727f7-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 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8690, 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 8690 to 8690 +Continuous objective value is 0 - 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 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) @@ -1903,77 +1777,90 @@ Result - Optimal solution found -Objective value: 8690.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +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/d65601eb94cf48db87097c9fe5ef3c0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d65601eb94cf48db87097c9fe5ef3c0b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/658985f71046485183768c143ea5791b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/658985f71046485183768c143ea5791b-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 8720 - 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 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8720, 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 8720 to 8720 -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: 8720.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock 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.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/a3c96d7f027b43168e4ea48f8b61ea52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3c96d7f027b43168e4ea48f8b61ea52-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/47b92540c46849c8a7e5bc35d610f2bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47b92540c46849c8a7e5bc35d610f2bd-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 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 8750 - 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 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) +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.00 seconds) +Cbc0001I Search completed - best objective 251.5000000000001, 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 8750 to 8750 +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) @@ -1985,36 +1872,33 @@ Result - Optimal solution found -Objective value: 8750.00000000 +Objective value: 251.50000000 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 +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/10325f8b5919430f96d245a2f3637040-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10325f8b5919430f96d245a2f3637040-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/363d32f7c98e44f68af4fb17e0b42013-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/363d32f7c98e44f68af4fb17e0b42013-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 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 8780 - 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 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8780, 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 8780 to 8780 +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) @@ -2026,9 +1910,9 @@ Result - Optimal solution found -Objective value: 8780.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -2039,23 +1923,28 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a77c8643fd3046ac80f0c54c28b05a84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a77c8643fd3046ac80f0c54c28b05a84-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/be8c27d1112a4866940c8870a9c43f64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be8c27d1112a4866940c8870a9c43f64-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 8810 - 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 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8810, 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.10 seconds) +Cbc0038I After 0.10 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.11 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.11 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8810 to 8810 +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) @@ -2067,77 +1956,87 @@ Result - Optimal solution found -Objective value: 8810.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.11 +Time (Wallclock seconds): 0.12 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.13 (Wallclock seconds): 0.15 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8d0956ce664d4dabba7b1f2a3125d5f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d0956ce664d4dabba7b1f2a3125d5f8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2d05cfb3164545808e74c62699f530e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d05cfb3164545808e74c62699f530e3-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 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 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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 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) +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 10 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 10 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: 8840.00000000 +Objective value: 228100.00000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 10 Time (CPU seconds): 0.00 -Time (Wallclock 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.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/6813ddc0644a4c6b8287eabf2a58561a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6813ddc0644a4c6b8287eabf2a58561a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1c21730fc44e4ad988ca30694e7a2121-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c21730fc44e4ad988ca30694e7a2121-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 13 COLUMNS +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 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 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 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) +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 8870 to 8870 +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) @@ -2149,7 +2048,7 @@ Result - Optimal solution found -Objective value: 8870.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2162,7 +2061,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d769a7d1521a45edb71ffaa7c362e1a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d769a7d1521a45edb71ffaa7c362e1a0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/26d594d41aa642b38dcefa0673d2f717-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26d594d41aa642b38dcefa0673d2f717-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2172,13 +2071,13 @@ 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 +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 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) +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 8900 to 8900 +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) @@ -2190,7 +2089,7 @@ Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2203,7 +2102,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6d418323100e4162be14a7ff439d8a88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d418323100e4162be14a7ff439d8a88-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f191e27bcc514a11963aaef8dd257cca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f191e27bcc514a11963aaef8dd257cca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2225,7 +2124,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2333d4f4546540759016c1658a4c77f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2333d4f4546540759016c1658a4c77f9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6253317d40414774865d0dac5be579b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6253317d40414774865d0dac5be579b6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -2269,13 +2168,13 @@ Time (Wallclock seconds): 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/ea265c61be5b40ae820a11d0f11e67ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea265c61be5b40ae820a11d0f11e67ef-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e448e6443cc7494e893f92f7e7a7c42b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e448e6443cc7494e893f92f7e7a7c42b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2299,7 +2198,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1ab0231a36a2411c959dd91bbbd90ef4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ab0231a36a2411c959dd91bbbd90ef4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f83ae0979c464a8bb19f0987e512d272-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f83ae0979c464a8bb19f0987e512d272-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -2339,16 +2238,16 @@ Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 -Time (Wallclock 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.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/91a5227b8e824ef5800fe3811af24530-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91a5227b8e824ef5800fe3811af24530-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/95a288404bcc4421adff1d07406b926e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/95a288404bcc4421adff1d07406b926e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2364,7 +2263,7 @@ 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.00 seconds) +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 @@ -2374,7 +2273,7 @@ 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.00 seconds) +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) @@ -2391,9 +2290,56 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock 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.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/adfcc330ba2c4ab994b5570b2a7c93e9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/adfcc330ba2c4ab994b5570b2a7c93e9-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 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 +command line - /usr/bin/cbc /tmp/c962b59f947949b0bf6895eb6ca690f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c962b59f947949b0bf6895eb6ca690f5-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 @@ -2401,55 +2347,466 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/606d42731b044df3917ee97275baa6f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/606d42731b044df3917ee97275baa6f2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f63ac935024146e39415fd7dee1c38ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f63ac935024146e39415fd7dee1c38ff-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.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.00 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.00 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 +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/b457fbf963474dd7b33e322bc691ec55-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b457fbf963474dd7b33e322bc691ec55-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 355 COLUMNS +At line 4757 RHS +At line 5108 BOUNDS +At line 5839 ENDATA +Problem MODEL has 350 rows, 730 columns and 2942 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 7 fixed, 0 tightened bounds, 0 strengthened rows, 20 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions +Cgl0004I processed model has 31 rows, 30 columns (30 integer (30 of which binary)) and 106 elements +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.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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.03 + +Option for printingOptions changed from normal to all +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/48cfebf4171a45d6a5fb6a54833dd326-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48cfebf4171a45d6a5fb6a54833dd326-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 356 COLUMNS +At line 4839 RHS +At line 5191 BOUNDS +At line 5922 ENDATA +Problem MODEL has 351 rows, 730 columns and 3023 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 8 fixed, 0 tightened bounds, 1 strengthened rows, 23 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 31 rows, 28 columns (28 integer (28 of which binary)) and 119 elements +Cbc0038I Initial state - 20 integers unsatisfied sum - 7.5 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/ff153d2a2a4742cea8780c1c6e809925-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff153d2a2a4742cea8780c1c6e809925-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 357 COLUMNS +At line 4921 RHS +At line 5274 BOUNDS +At line 6005 ENDATA +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.00 seconds +Cgl0003I 8 fixed, 0 tightened bounds, 2 strengthened rows, 27 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 32 rows, 28 columns (28 integer (28 of which binary)) and 142 elements +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.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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 + +Option for printingOptions changed from normal to all +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/19a020b504584f50bbb2ae478bfba01f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19a020b504584f50bbb2ae478bfba01f-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 358 COLUMNS +At line 5003 RHS +At line 5357 BOUNDS +At line 6088 ENDATA +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.00 seconds +Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 35 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 32 rows, 26 columns (26 integer (26 of which binary)) and 148 elements +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.07 seconds) +Cbc0038I After 0.07 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.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.07 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/80389512e92147ebbd8d3a8b04920c1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80389512e92147ebbd8d3a8b04920c1d-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 359 COLUMNS +At line 5085 RHS +At line 5440 BOUNDS +At line 6171 ENDATA +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.00 seconds +Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 25 rows, 20 columns (20 integer (20 of which binary)) and 127 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 20 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 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.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/56be39499501476a992675360f6e921f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56be39499501476a992675360f6e921f-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 360 COLUMNS +At line 5167 RHS +At line 5523 BOUNDS +At line 6254 ENDATA +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.00 seconds +Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 22 rows, 17 columns (17 integer (17 of which binary)) and 113 elements +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 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 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.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/2bf658873c2641978ddf656e335ee16c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2bf658873c2641978ddf656e335ee16c-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 361 COLUMNS +At line 5249 RHS +At line 5606 BOUNDS +At line 6337 ENDATA +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.00 seconds +Cgl0003I 10 fixed, 0 tightened bounds, 6 strengthened rows, 31 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 3 strengthened rows, 8 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 8 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 6 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 23 rows, 17 columns (17 integer (17 of which binary)) and 127 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 + +Option for printingOptions changed from normal to all +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/9b1e930e91174be6ac712eaa22fad557-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b1e930e91174be6ac712eaa22fad557-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 362 COLUMNS +At line 5331 RHS +At line 5689 BOUNDS +At line 6420 ENDATA +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.00 seconds +Cgl0003I 13 fixed, 0 tightened bounds, 7 strengthened rows, 60 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 14 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 13 rows, 9 columns (9 integer (9 of which binary)) and 72 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 + Status: Optimal x = 4.0 y = -1.0 @@ -2484,43 +2841,43 @@ 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 = 1.0 -x_1 = 1.0 -x_2 = 1.0 +x_1 = 0.0 +x_2 = 0.0 x_3 = 1.0 -x_4 = 1.0 +x_4 = 0.0 x_5 = 1.0 -x_6 = 0.0 -x_7 = 1.0 -x_8 = 0.0 +x_6 = 1.0 +x_7 = 0.0 +x_8 = 1.0 x_9 = 1.0 Status: Optimal -s_0 = 0.5 -s_1 = 0.0 -s_2 = 3.0 +s_0 = 0.0 +s_1 = 1.0 +s_2 = 0.0 w_0 = 0.0 w_1 = 0.0 -w_2 = 0.0 +w_2 = 1.0 x_0 = 0.0 -x_1 = 0.0 -x_10 = 0.0 +x_1 = 1.0 +x_10 = 1.0 x_11 = 0.0 x_12 = 1.0 -x_13 = 1.0 -x_14 = 0.0 -x_15 = 1.0 -x_16 = 1.0 +x_13 = 0.0 +x_14 = 1.0 +x_15 = 0.0 +x_16 = 0.0 x_17 = 1.0 x_18 = 1.0 x_19 = 0.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 0.0 +x_2 = 0.0 +x_3 = 1.0 +x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 -x_9 = 0.0 -objective= 3.5 +x_9 = 1.0 +objective= 2.0 Status: Optimal x = 4.0 y = -1.0 @@ -2576,11 +2933,147 @@ 8 tests in 1 items. 8 passed and 0 failed. Test passed. +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 Status: Optimal -Patt_A = 225.0 +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 +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 +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 +Status: Optimal +Patt_A = 200.0 Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 +Patt_C = 100.0 +Surp_5 = 50.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 251.5 +Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 +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 +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_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 +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 = [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 @@ -2652,6 +3145,14 @@ steelpurchase = 27.25 Total price = 863.25 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 @@ -2669,266 +3170,91 @@ Route_C_5 = 0.0 Total Cost of Transportation = 8300.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 = 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 -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 = 210.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 = 8630.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 = 220.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 = 8660.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 = 230.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 = 8690.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 = 240.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 = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 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 -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 -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 -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]Welcome to the CBC MILP Solver +Status: OptimalWelcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b05b9279f29b4be9abfa6c03a7336ba3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b05b9279f29b4be9abfa6c03a7336ba3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bd9b41f809b946fc886bdebacb4a7ce7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd9b41f809b946fc886bdebacb4a7ce7-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 363 COLUMNS +At line 5413 RHS +At line 5772 BOUNDS +At line 6503 ENDATA +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 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.00 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.00 seconds) +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 17 fixed, 0 tightened bounds, 8 strengthened rows, 84 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 4 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 11 rows, 9 columns (9 integer (9 of which binary)) and 48 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous +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 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 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) +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: 0.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +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/e29a59d25c15418588a29c3f58625762-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e29a59d25c15418588a29c3f58625762-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6dac9889a8ea450eac47c2e37c40039c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6dac9889a8ea450eac47c2e37c40039c-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 +At line 364 COLUMNS +At line 5495 RHS +At line 5855 BOUNDS +At line 6586 ENDATA +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 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) +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 16 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 1 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 2 columns (2 integer (2 of which binary)) and 6 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 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.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 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 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) 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) @@ -2940,55 +3266,36 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 0.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 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.07 -command line - /usr/bin/cbc /tmp/e91070c697e5406fab6b3eae27efd9ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e91070c697e5406fab6b3eae27efd9ac-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.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f17baff39af943fd90c41bb49b271c67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f17baff39af943fd90c41bb49b271c67-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1312a46b47a044c6acb7e0199c2e4f27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1312a46b47a044c6acb7e0199c2e4f27-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 +At line 365 COLUMNS +At line 5577 RHS +At line 5938 BOUNDS +At line 6669 ENDATA +Problem MODEL has 360 rows, 730 columns and 3752 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 10 strengthened rows, 78 substitutions +Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions 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 +Cuts at root node changed objective from 0 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) @@ -3000,58 +3307,35 @@ Result - Optimal solution found -Objective value: 0.97000000 +Objective value: 0.00000000 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 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 -command line - /usr/bin/cbc /tmp/77a61c5702da4eedbe09ba9c05092073-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77a61c5702da4eedbe09ba9c05092073-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 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 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 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a6235fe65b9d43fd8d551ed053e2e41f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6235fe65b9d43fd8d551ed053e2e41f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e9d26e0954704db8bf23457f16e29d86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9d26e0954704db8bf23457f16e29d86-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 +At line 366 COLUMNS +At line 5659 RHS +At line 6021 BOUNDS +At line 6752 ENDATA +Problem MODEL has 361 rows, 730 columns and 3833 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.6 - 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.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, 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.6 to -1.6 +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 35 fixed, 0 tightened bounds, 11 strengthened rows, 19 substitutions +Cgl0003I 2 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +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 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) @@ -3063,132 +3347,124 @@ Result - Optimal solution found -Objective value: -1.60000000 +Objective value: 0.00000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 1 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/46c1904181f840fa8cd8fcbdc8e50e27-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46c1904181f840fa8cd8fcbdc8e50e27-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9813eb552b2e4049848633ea8dbc3a46-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9813eb552b2e4049848633ea8dbc3a46-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 23 RHS -At line 27 BOUNDS -At line 28 ENDATA -Problem MODEL has 3 rows, 7 columns and 7 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 301.5 -After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 301.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/29738cf294314cdf9ae1f72646467876-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29738cf294314cdf9ae1f72646467876-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 +At line 367 COLUMNS +At line 5741 RHS +At line 6104 BOUNDS +At line 6835 ENDATA +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 -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.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 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 26 substitutions +Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 2 columns (2 integer (2 of which binary)) and 8 elements +Cbc0038I Initial state - 2 integers unsatisfied sum - 0.285714 +Cbc0038I Pass 1: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 2: suminf. 1.00000 (2) obj. 0 iterations 1 +Cbc0038I Pass 3: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 4: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 5: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 6: suminf. 0.28571 (2) obj. 0 iterations 2 +Cbc0038I Pass 7: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 8: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 9: suminf. 0.28571 (2) obj. 0 iterations 1 +Cbc0038I Pass 10: suminf. 1.00000 (2) obj. 0 iterations 1 +Cbc0038I Pass 11: suminf. 0.28571 (2) obj. 0 iterations 2 +Cbc0038I Pass 12: suminf. 0.28571 (2) obj. 0 iterations 1 +Cbc0038I Pass 13: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 14: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 15: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 16: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 17: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 18: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 19: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 20: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 21: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 22: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 23: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 24: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 25: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 26: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 27: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 28: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 29: suminf. 0.28571 (2) obj. 0 iterations 0 +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.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 +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 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 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 -1.25, took 2 iterations and 0 nodes (0.00 seconds) +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.09 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) -Gomory was tried 3 times and created 2 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) +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) +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 +Result - Problem proven infeasible -Objective value: -1.25000000 +No feasible solution found Enumerated nodes: 0 -Total iterations: 2 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +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/0acafd8fce7e459fb25fe67f2c99ff36-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0acafd8fce7e459fb25fe67f2c99ff36-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0416317cfb284c3ca80ec77643da81d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0416317cfb284c3ca80ec77643da81d5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 26 RHS -At line 30 BOUNDS -At line 31 ENDATA -Problem MODEL has 3 rows, 8 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements -0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 276.5 -Optimal - objective value 276.5 -After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 276.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/fca871abb73f4019b7f9ecf968139089-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fca871abb73f4019b7f9ecf968139089-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 +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 -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.00 seconds) -Cbc0001I Search completed - best objective -1.2, 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 -1.22143 to -1.22143 +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) @@ -3200,36 +3476,12 @@ Result - Optimal solution found -Objective value: -1.20000000 +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.01 - -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/3bfd50124c2e40a39a86c27b6a1772cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3bfd50124c2e40a39a86c27b6a1772cd-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 28 RHS -At line 32 BOUNDS -At line 33 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) 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 @@ -3237,45 +3489,37 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5b5b2c17c3b24612907a75f95a1173ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b5b2c17c3b24612907a75f95a1173ea-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9aeb6ab1b2894867a3b2b24bd2f191a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9aeb6ab1b2894867a3b2b24bd2f191a1-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 +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 -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 -1, took 6 iterations and 0 nodes (0.00 seconds) +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 -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) +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: -1.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 -Total iterations: 6 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3286,49 +3530,37 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3719de61c70b4f8bb0dea81247b0ef40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3719de61c70b4f8bb0dea81247b0ef40-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/38829ee871ee4370836417fc619c65fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38829ee871ee4370836417fc619c65fa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 46 RHS -At line 50 BOUNDS -At line 60 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements +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 246.5 - 0.00 seconds -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.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.00 seconds) -Cbc0031I 1 added rows had average density of 4 -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 4.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 4.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.00 seconds) +Continuous objective value is 8630 - 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 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8630, 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 8630 to 8630 +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: 8630.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3339,20 +3571,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3ac5196ac211450cb1938654bef51935-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ac5196ac211450cb1938654bef51935-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/58f4bbfbd0cc407cbfd0a6dcf35c357a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58f4bbfbd0cc407cbfd0a6dcf35c357a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +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 0 - 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 to -1.79769e+308 +Continuous objective value is 8660 - 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 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8660, 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 8660 to 8660 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) @@ -3364,37 +3599,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8660.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.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/f0d9066ae55346f3af0cc8403cff4ac1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f0d9066ae55346f3af0cc8403cff4ac1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7d4225630ca346158ffe836eb3e1ba02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d4225630ca346158ffe836eb3e1ba02-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 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 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.00 seconds) -Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, 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 8690 to 8690 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) @@ -3406,7 +3640,7 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3419,26 +3653,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3001a21d17094d40b988293564046cd1-pulp.mps mips /tmp/3001a21d17094d40b988293564046cd1-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/3001a21d17094d40b988293564046cd1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cbcef1e3d2374cd1ac1c62898877a894-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbcef1e3d2374cd1ac1c62898877a894-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 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 -opening mipstart file /tmp/3001a21d17094d40b988293564046cd1-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 +Continuous objective value is 8720 - 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 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.07 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 +Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8720, 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 8720 to 8720 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) @@ -3450,83 +3681,9 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8720.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 - -Option for printingOptions changed from normal to all -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/82341fa927eb4d00960788d309077db1-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/82341fa927eb4d00960788d309077db1-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/362bce1f3a7f4bb88f3d06bc99a3ea4b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/362bce1f3a7f4bb88f3d06bc99a3ea4b-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 10 iterations and 0 nodes (0.00 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 10 iterations and 0 nodes (0.00 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: 10 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3537,7 +3694,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/58d2aa98042e4f339a7bc6955805aaec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58d2aa98042e4f339a7bc6955805aaec-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1d471e601e334eb0ad54ef2a03ea6b83-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d471e601e334eb0ad54ef2a03ea6b83-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3547,13 +3704,13 @@ 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 +Continuous objective value is 8750 - 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) +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, 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 +Cuts at root node changed objective from 8750 to 8750 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) @@ -3565,7 +3722,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8750.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3578,23 +3735,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ca31cc0954b84e7fa0d3ec9be6c223b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca31cc0954b84e7fa0d3ec9be6c223b2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4622461ed9c84333922ff2a079a597e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4622461ed9c84333922ff2a079a597e3-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 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 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements +Continuous objective value is 8780 - 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) +Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8780, 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 +Cuts at root node changed objective from 8780 to 8780 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) @@ -3606,7 +3763,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8780.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3619,28 +3776,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dddaa0673b8e4f96993189ffc3817c66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dddaa0673b8e4f96993189ffc3817c66-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7865a0aa404f4fdc91c46b1837d1a2aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7865a0aa404f4fdc91c46b1837d1a2aa-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 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 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8810 - 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 -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.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8810, 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 12 to 12 +Cuts at root node changed objective from 8810 to 8810 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) @@ -3652,42 +3804,36 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8810.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.09 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 +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/cd29eff073fe4dd89ba30004183d8031-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd29eff073fe4dd89ba30004183d8031-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6008ba6c606d4bbd9997d95a8df5532a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6008ba6c606d4bbd9997d95a8df5532a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 355 COLUMNS -At line 4757 RHS -At line 5108 BOUNDS -At line 5839 ENDATA -Problem MODEL has 350 rows, 730 columns and 2942 elements +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 0 - 0.00 seconds -Cgl0003I 7 fixed, 0 tightened bounds, 0 strengthened rows, 20 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -Cgl0004I processed model has 31 rows, 30 columns (30 integer (30 of which binary)) and 106 elements -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.02 seconds) -Cbc0038I After 0.02 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.02 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.02 seconds) +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 0 to 0 +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) @@ -3699,51 +3845,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8840.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (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/c588a5d445f24cea8c0e302231be69e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c588a5d445f24cea8c0e302231be69e4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ffbb42ddc62b496a92aa33f4a5c64069-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffbb42ddc62b496a92aa33f4a5c64069-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 356 COLUMNS -At line 4839 RHS -At line 5191 BOUNDS -At line 5922 ENDATA -Problem MODEL has 351 rows, 730 columns and 3023 elements +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 0 - 0.00 seconds -Cgl0003I 8 fixed, 0 tightened bounds, 1 strengthened rows, 23 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 31 rows, 28 columns (28 integer (28 of which binary)) and 119 elements -Cbc0038I Initial state - 20 integers unsatisfied sum - 7.5 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 7 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) +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 0 to 0 +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) @@ -3755,50 +3886,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8870.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/f4e5239a02604166926a2d9d66706fc8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4e5239a02604166926a2d9d66706fc8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/74a60a7763f7447aa3f3bd7a5152253e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74a60a7763f7447aa3f3bd7a5152253e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 357 COLUMNS -At line 4921 RHS -At line 5274 BOUNDS -At line 6005 ENDATA -Problem MODEL has 352 rows, 730 columns and 3104 elements +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 0 - 0.00 seconds -Cgl0003I 8 fixed, 0 tightened bounds, 2 strengthened rows, 27 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 32 rows, 28 columns (28 integer (28 of which binary)) and 142 elements -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.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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 0 to 0 +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) @@ -3810,103 +3927,58 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/9f098a0806c94a1290ca6360fb4a420d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f098a0806c94a1290ca6360fb4a420d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ff28b7bed15242ef8b34978dd9c9ff67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff28b7bed15242ef8b34978dd9c9ff67-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 5003 RHS -At line 5357 BOUNDS -At line 6088 ENDATA -Problem MODEL has 353 rows, 730 columns and 3185 elements +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 -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 35 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 32 rows, 26 columns (26 integer (26 of which binary)) and 148 elements -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.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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.05 - +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/c261d71b2eab4e3d91709b268f562cb9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c261d71b2eab4e3d91709b268f562cb9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e6a061870cc148f79d7c27da8c029be6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6a061870cc148f79d7c27da8c029be6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 359 COLUMNS -At line 5085 RHS -At line 5440 BOUNDS -At line 6171 ENDATA -Problem MODEL has 354 rows, 730 columns and 3266 elements +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 0 - 0.00 seconds -Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 25 rows, 20 columns (20 integer (20 of which binary)) and 127 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 20 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) +Continuous objective value is -1.6 - 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.03996 +Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.6, 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 0 to 0 +Cuts at root node changed objective from -1.6 to -1.6 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) @@ -3918,202 +3990,132 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 +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/8364f64b2d9e4d11a0e48717f178e73d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8364f64b2d9e4d11a0e48717f178e73d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a2500c6e6e4e437199105eb0af485b8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2500c6e6e4e437199105eb0af485b8f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 360 COLUMNS -At line 5167 RHS -At line 5523 BOUNDS -At line 6254 ENDATA -Problem MODEL has 355 rows, 730 columns and 3347 elements +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 22 rows, 17 columns (17 integer (17 of which binary)) and 113 elements -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 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) -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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.05 - +Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 301.5 +After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/401d88781ba4430bb112b9b9cf5148aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/401d88781ba4430bb112b9b9cf5148aa-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d071bbc2b2f44b71937675f94fc4c9ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d071bbc2b2f44b71937675f94fc4c9ca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 361 COLUMNS -At line 5249 RHS -At line 5606 BOUNDS -At line 6337 ENDATA -Problem MODEL has 356 rows, 730 columns and 3428 elements +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 0 - 0.00 seconds -Cgl0003I 10 fixed, 0 tightened bounds, 6 strengthened rows, 31 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 3 strengthened rows, 8 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 8 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 6 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 23 rows, 17 columns (17 integer (17 of which binary)) and 127 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) +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.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 +Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.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) - 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.00 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) -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 -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) +Gomory was tried 3 times and created 2 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: 0.00000000 +Objective value: -1.25000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.06 +Total iterations: 2 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 +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/e94c48b53df84be6adfbc74d17f382f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e94c48b53df84be6adfbc74d17f382f3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2c0a036098954daba9a6cdf3689b458a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c0a036098954daba9a6cdf3689b458a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 362 COLUMNS -At line 5331 RHS -At line 5689 BOUNDS -At line 6420 ENDATA -Problem MODEL has 357 rows, 730 columns and 3509 elements +At line 8 COLUMNS +At line 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 13 fixed, 0 tightened bounds, 7 strengthened rows, 60 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 14 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 13 rows, 9 columns (9 integer (9 of which binary)) and 72 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 - +Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements +0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 276.5 +Optimal - objective value 276.5 +After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +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/39ea08c3996e40f395aa472fd2e1ebee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39ea08c3996e40f395aa472fd2e1ebee-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/624b0fedf284444784c558ebf559c8cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/624b0fedf284444784c558ebf559c8cb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 363 COLUMNS -At line 5413 RHS -At line 5772 BOUNDS -At line 6503 ENDATA -Problem MODEL has 358 rows, 730 columns and 3590 elements +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 0 - 0.00 seconds -Cgl0003I 17 fixed, 0 tightened bounds, 8 strengthened rows, 84 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 4 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 11 rows, 9 columns (9 integer (9 of which binary)) and 48 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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.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 0 to 0 +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) 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) @@ -4125,231 +4127,193 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +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/7c15daa3621f4544b18863dec3b903b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c15daa3621f4544b18863dec3b903b2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/18c2a4b7f7bd4f088331daf52cefe3e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18c2a4b7f7bd4f088331daf52cefe3e4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 364 COLUMNS -At line 5495 RHS -At line 5855 BOUNDS -At line 6586 ENDATA -Problem MODEL has 359 rows, 730 columns and 3671 elements +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 16 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 1 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 2 columns (2 integer (2 of which binary)) and 6 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 2 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) -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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 - +Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) 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.04 (Wallclock seconds): 0.05 +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/3d8fd084954940549919eae31134d123-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d8fd084954940549919eae31134d123-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7ebe5eee6c6244bb81dfa89ad9ab262f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ebe5eee6c6244bb81dfa89ad9ab262f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 365 COLUMNS -At line 5577 RHS -At line 5938 BOUNDS -At line 6669 ENDATA -Problem MODEL has 360 rows, 730 columns and 3752 elements +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 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 10 strengthened rows, 78 substitutions -Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -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 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) +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 -1, 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: 0.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +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.06 (Wallclock seconds): 0.06 +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/24ed3fc39fac409891b954761ad45c5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24ed3fc39fac409891b954761ad45c5c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/52502d916a5e472e887d36908e245ed4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/52502d916a5e472e887d36908e245ed4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 366 COLUMNS -At line 5659 RHS -At line 6021 BOUNDS -At line 6752 ENDATA -Problem MODEL has 361 rows, 730 columns and 3833 elements +At line 8 COLUMNS +At line 46 RHS +At line 50 BOUNDS +At line 60 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 35 fixed, 0 tightened bounds, 11 strengthened rows, 19 substitutions -Cgl0003I 2 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -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 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) +Continuous objective value is 246.5 - 0.00 seconds +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.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.00 seconds) +Cbc0031I 1 added rows had average density of 4 +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 4.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 4.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.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) Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 +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/60dc1510bb7f449ca200431ce18e38a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60dc1510bb7f449ca200431ce18e38a2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a09d20523a9f4ce4aa902232f28c4941-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a09d20523a9f4ce4aa902232f28c4941-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 367 COLUMNS -At line 5741 RHS -At line 6104 BOUNDS -At line 6835 ENDATA -Problem MODEL has 362 rows, 730 columns and 3914 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 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 26 substitutions -Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 4 rows, 2 columns (2 integer (2 of which binary)) and 8 elements -Cbc0038I Initial state - 2 integers unsatisfied sum - 0.285714 -Cbc0038I Pass 1: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 2: suminf. 1.00000 (2) obj. 0 iterations 1 -Cbc0038I Pass 3: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 4: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 5: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 6: suminf. 0.28571 (2) obj. 0 iterations 2 -Cbc0038I Pass 7: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 8: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 9: suminf. 0.28571 (2) obj. 0 iterations 1 -Cbc0038I Pass 10: suminf. 1.00000 (2) obj. 0 iterations 1 -Cbc0038I Pass 11: suminf. 0.28571 (2) obj. 0 iterations 2 -Cbc0038I Pass 12: suminf. 0.28571 (2) obj. 0 iterations 1 -Cbc0038I Pass 13: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 14: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 15: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 16: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 17: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 18: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 19: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 20: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 21: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 22: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 23: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 24: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 25: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 26: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 27: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 28: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 29: suminf. 0.28571 (2) obj. 0 iterations 0 -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.05 seconds) -Cbc0038I After 0.05 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 -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 +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) - 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.05 seconds) +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 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) -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 - Problem proven infeasible +Result - Optimal solution found -No feasible solution found +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.05 +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.05 (Wallclock seconds): 0.06 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -5687,124 +5651,21 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 25.564s +Ran 1005 tests in 31.178s OK (skipped=885) -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 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 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 -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 Status: Optimal -Solution Written to sudokuout.txt +Status: Infeasible +Solutions Written to sudokuout.txt Status: Optimal -Patt_A = 200.0 +Patt_A = 225.0 Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -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') -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.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 +Patt_C = 75.0 +Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -5823,34 +5684,172 @@ 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_1 = 210.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 -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 +Total Cost of Transportation = 8630.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 = 220.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 = 8660.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 = 230.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 = 8690.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 = 240.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 = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 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 +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +P3 = [4, 0, 0] +P4 = [1, 2, 0] +P5 = [0, 0, 2] +Pattern_P0 = 0 +Pattern_P1 = 0 +Pattern_P2 = 0 +Pattern_P3 = 13 +Pattern_P4 = 100 +Pattern_P5 = 150 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +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 -Status: Infeasible -Solutions Written to sudokuout.txt +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 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 @@ -5996,7 +5995,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/64a0d0edb66c43d282a9adea84518955-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64a0d0edb66c43d282a9adea84518955-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b4337171c0a84c5ab4c0ba402ae5327f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4337171c0a84c5ab4c0ba402ae5327f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6019,7 +6018,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1cd300076d704cad91d33621f1bb99e5-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/1cd300076d704cad91d33621f1bb99e5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/536f8690c92946558314bd7e76d9071a-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/536f8690c92946558314bd7e76d9071a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -6050,7 +6049,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.00 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.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.48138 (1) obj. 4.11362e+06 iterations 2 @@ -6069,7 +6068,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 10 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 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.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.43242 (1) obj. 4.18141e+06 iterations 2 @@ -6104,11 +6103,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.03 seconds) -Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.05 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.03 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.06 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 @@ -6117,7 +6116,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 7 iterations and 0 nodes (0.03 seconds) +Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.06 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) @@ -6134,17 +6133,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.06 (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/503c368ebb124c5da2af0707d5b4dea3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/503c368ebb124c5da2af0707d5b4dea3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e6d91e9f6a3849f3a7affa6726d9c6b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e6d91e9f6a3849f3a7affa6726d9c6b7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -6163,7 +6162,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 50 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 36 columns -Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.01 seconds) +Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.02 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 11 @@ -6189,7 +6188,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 31 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 83 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.10 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.16 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 12 @@ -6224,52 +6223,52 @@ 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.17 seconds) -Cbc0038I After 0.17 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.17 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.29 seconds) +Cbc0038I After 0.29 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.27 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.29 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 9 added rows had average density of 59 Cbc0013I At root node, 9 cuts changed objective from 2546.9589 to 2695.6793 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.027 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.045 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 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) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.025 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.46 seconds) +Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.053 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.086 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 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) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.047 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.020 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.89 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 47 rows 56 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 74 rows 77 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.03 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.91 seconds) Cbc0032I Strong branching done 1272 times (10385 iterations), fathomed 26 nodes and fixed 41 variables Cbc0035I Maximum depth 11, 238 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2695.68 -Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.027 seconds) -Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.076 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 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 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.054 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) -TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) +Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.053 seconds) +Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.136 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 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 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.094 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.034 seconds) +TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.058 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 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 110 Total iterations: 4892 -Time (CPU seconds): 1.03 -Time (Wallclock seconds): 1.04 +Time (CPU seconds): 1.87 +Time (Wallclock seconds): 1.92 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.03 (Wallclock seconds): 1.04 +Total time (CPU seconds): 1.87 (Wallclock seconds): 1.92 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b1369fa43d39444fbd5d2e6f56e856db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1369fa43d39444fbd5d2e6f56e856db-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d5914132bbce40e1b3d85750cc1d4a69-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5914132bbce40e1b3d85750cc1d4a69-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS @@ -6279,292 +6278,258 @@ 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 -192.606 - 0.00 seconds +Continuous objective value is -111.628 - 0.00 seconds Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 800 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 25 integers unsatisfied sum - 6.36896 -Cbc0038I Pass 1: suminf. 0.01235 (1) obj. -189.212 iterations 97 -Cbc0038I Solution found of -186.15 -Cbc0038I Before mini branch and bound, 185 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I Round again with cutoff of -186.85 -Cbc0038I Pass 2: suminf. 0.01235 (1) obj. -189.212 iterations 0 -Cbc0038I Pass 3: suminf. 0.22581 (1) obj. -186.85 iterations 13 -Cbc0038I Pass 4: suminf. 0.35726 (3) obj. -186.85 iterations 61 -Cbc0038I Pass 5: suminf. 0.06498 (2) obj. -187.138 iterations 64 -Cbc0038I Pass 6: suminf. 0.15789 (2) obj. -186.85 iterations 12 -Cbc0038I Pass 7: suminf. 0.13291 (3) obj. -186.85 iterations 61 -Cbc0038I Pass 8: suminf. 0.06498 (2) obj. -186.888 iterations 76 -Cbc0038I Pass 9: suminf. 0.07725 (2) obj. -186.85 iterations 18 -Cbc0038I Pass 10: suminf. 1.14458 (3) obj. -186.85 iterations 72 -Cbc0038I Pass 11: suminf. 0.29207 (2) obj. -186.966 iterations 68 -Cbc0038I Pass 12: suminf. 0.32271 (2) obj. -186.85 iterations 7 -Cbc0038I Pass 13: suminf. 0.72269 (4) obj. -186.85 iterations 70 -Cbc0038I Pass 14: suminf. 0.33928 (4) obj. -186.85 iterations 78 -Cbc0038I Pass 15: suminf. 0.53760 (3) obj. -186.85 iterations 55 -Cbc0038I Pass 16: suminf. 0.83581 (4) obj. -186.85 iterations 30 -Cbc0038I Pass 17: suminf. 0.31362 (4) obj. -186.85 iterations 71 -Cbc0038I Pass 18: suminf. 0.44420 (3) obj. -186.85 iterations 53 -Cbc0038I Pass 19: suminf. 0.42922 (3) obj. -186.85 iterations 6 -Cbc0038I Pass 20: suminf. 0.61913 (3) obj. -186.85 iterations 54 -Cbc0038I Pass 21: suminf. 5.80883 (22) obj. -186.85 iterations 39 -Cbc0038I Pass 22: suminf. 0.82578 (4) obj. -186.85 iterations 17 -Cbc0038I Pass 23: suminf. 0.75802 (4) obj. -186.85 iterations 3 -Cbc0038I Pass 24: suminf. 0.25036 (2) obj. -186.85 iterations 82 -Cbc0038I Pass 25: suminf. 0.06498 (2) obj. -187.138 iterations 37 -Cbc0038I Pass 26: suminf. 0.15789 (2) obj. -186.85 iterations 13 -Cbc0038I Pass 27: suminf. 0.29998 (3) obj. -186.85 iterations 60 -Cbc0038I Pass 28: suminf. 0.29998 (3) obj. -186.85 iterations 2 -Cbc0038I Pass 29: suminf. 0.36664 (2) obj. -186.85 iterations 86 -Cbc0038I Pass 30: suminf. 0.06498 (2) obj. -187.388 iterations 39 -Cbc0038I Pass 31: suminf. 0.23854 (2) obj. -186.85 iterations 15 -Cbc0038I Rounding solution of -188.55 is better than previous of -186.15 - -Cbc0038I Before mini branch and bound, 141 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 3 rows 12 columns -Cbc0038I Mini branch and bound improved solution from -188.55 to -189 (0.04 seconds) -Cbc0038I Round again with cutoff of -189.8 -Cbc0038I Reduced cost fixing fixed 5 variables on major pass 3 -Cbc0038I Pass 31: suminf. 0.28596 (2) obj. -189.8 iterations 32 -Cbc0038I Pass 32: suminf. 0.49660 (2) obj. -189.8 iterations 41 -Cbc0038I Pass 33: suminf. 0.06498 (2) obj. -191.138 iterations 12 -Cbc0038I Pass 34: suminf. 0.49660 (2) obj. -189.8 iterations 15 -Cbc0038I Pass 35: suminf. 0.61033 (3) obj. -189.8 iterations 61 -Cbc0038I Pass 36: suminf. 0.45183 (3) obj. -189.8 iterations 5 -Cbc0038I Pass 37: suminf. 0.34338 (2) obj. -189.8 iterations 33 -Cbc0038I Pass 38: suminf. 0.06498 (2) obj. -190.288 iterations 32 -Cbc0038I Pass 39: suminf. 0.22241 (2) obj. -189.8 iterations 9 -Cbc0038I Pass 40: suminf. 6.22821 (25) obj. -189.8 iterations 71 -Cbc0038I Pass 41: suminf. 0.69770 (4) obj. -189.8 iterations 31 -Cbc0038I Pass 42: suminf. 0.35852 (4) obj. -189.8 iterations 70 -Cbc0038I Pass 43: suminf. 0.42649 (3) obj. -189.8 iterations 51 -Cbc0038I Pass 44: suminf. 1.03034 (4) obj. -189.8 iterations 22 -Cbc0038I Pass 45: suminf. 2.47799 (40) obj. -189.8 iterations 8 -Cbc0038I Pass 46: suminf. 1.05329 (4) obj. -189.8 iterations 9 -Cbc0038I Pass 47: suminf. 0.91996 (4) obj. -189.8 iterations 5 -Cbc0038I Pass 48: suminf. 0.10332 (3) obj. -189.8 iterations 30 -Cbc0038I Pass 49: suminf. 0.10332 (3) obj. -189.8 iterations 3 -Cbc0038I Pass 50: suminf. 0.45634 (3) obj. -189.8 iterations 46 -Cbc0038I Pass 51: suminf. 0.35852 (4) obj. -189.8 iterations 39 -Cbc0038I Pass 52: suminf. 0.42649 (3) obj. -189.8 iterations 52 -Cbc0038I Pass 53: suminf. 4.48623 (24) obj. -189.8 iterations 25 -Cbc0038I Pass 54: suminf. 0.63872 (4) obj. -189.8 iterations 8 -Cbc0038I Pass 55: suminf. 0.35210 (4) obj. -189.8 iterations 67 -Cbc0038I Pass 56: suminf. 0.46353 (3) obj. -189.8 iterations 51 -Cbc0038I Pass 57: suminf. 3.99412 (41) obj. -189.8 iterations 25 -Cbc0038I Pass 58: suminf. 0.82961 (4) obj. -189.8 iterations 5 -Cbc0038I Pass 59: suminf. 0.76135 (4) obj. -189.8 iterations 27 -Cbc0038I Pass 60: suminf. 0.70977 (4) obj. -189.8 iterations 11 +Cbc0038I Initial state - 42 integers unsatisfied sum - 15.9024 +Cbc0038I Pass 1: suminf. 0.26942 (2) obj. -110.212 iterations 90 +Cbc0038I Solution found of -104.5 +Cbc0038I Before mini branch and bound, 167 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 30 rows 23 columns +Cbc0038I Mini branch and bound improved solution from -104.5 to -109.25 (0.02 seconds) +Cbc0038I Round again with cutoff of -109.55 +Cbc0038I Reduced cost fixing fixed 16 variables on major pass 2 +Cbc0038I Pass 2: suminf. 0.26942 (2) obj. -110.212 iterations 0 +Cbc0038I Pass 3: suminf. 0.47634 (2) obj. -109.55 iterations 8 +Cbc0038I Pass 4: suminf. 1.28189 (4) obj. -109.55 iterations 75 +Cbc0038I Pass 5: suminf. 1.24914 (4) obj. -109.55 iterations 13 +Cbc0038I Pass 6: suminf. 0.71625 (3) obj. -109.55 iterations 68 +Cbc0038I Pass 7: suminf. 0.26942 (3) obj. -109.55 iterations 9 +Cbc0038I Pass 8: suminf. 0.31549 (2) obj. -109.55 iterations 31 +Cbc0038I Pass 9: suminf. 1.82793 (22) obj. -109.55 iterations 51 +Cbc0038I Pass 10: suminf. 1.79501 (21) obj. -109.55 iterations 8 +Cbc0038I Pass 11: suminf. 0.44444 (1) obj. -109.55 iterations 119 +Cbc0038I Solution found of -109.75 +Cbc0038I Rounding solution of -110.85 is better than previous of -109.75 + +Cbc0038I Before mini branch and bound, 158 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 30 rows 24 columns +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I Round again with cutoff of -111.05 +Cbc0038I Reduced cost fixing fixed 57 variables on major pass 3 +Cbc0038I Pass 12: suminf. 1.02382 (22) obj. -111.05 iterations 33 +Cbc0038I Pass 13: suminf. 2.27027 (21) obj. -111.05 iterations 75 +Cbc0038I Pass 14: suminf. 1.68000 (21) obj. -111.05 iterations 2 +Cbc0038I Pass 15: suminf. 0.51178 (2) obj. -111.05 iterations 75 +Cbc0038I Pass 16: suminf. 0.07937 (1) obj. -111.464 iterations 2 +Cbc0038I Pass 17: suminf. 0.19444 (1) obj. -111.05 iterations 5 +Cbc0038I Pass 18: suminf. 0.20223 (2) obj. -111.05 iterations 55 +Cbc0038I Pass 19: suminf. 0.07937 (1) obj. -111.064 iterations 58 +Cbc0038I Pass 20: suminf. 0.08333 (1) obj. -111.05 iterations 5 +Cbc0038I Pass 21: suminf. 0.27458 (2) obj. -111.05 iterations 62 +Cbc0038I Pass 22: suminf. 0.27458 (2) obj. -111.05 iterations 2 +Cbc0038I Pass 23: suminf. 0.29167 (1) obj. -111.05 iterations 67 +Cbc0038I Pass 24: suminf. 0.07937 (1) obj. -111.464 iterations 17 +Cbc0038I Pass 25: suminf. 0.19444 (1) obj. -111.05 iterations 6 +Cbc0038I Pass 26: suminf. 0.31406 (2) obj. -111.05 iterations 58 +Cbc0038I Pass 27: suminf. 0.07937 (1) obj. -111.214 iterations 57 +Cbc0038I Pass 28: suminf. 0.12500 (1) obj. -111.05 iterations 5 +Cbc0038I Pass 29: suminf. 0.44961 (2) obj. -111.05 iterations 60 +Cbc0038I Pass 30: suminf. 0.41837 (2) obj. -111.05 iterations 2 +Cbc0038I Pass 31: suminf. 0.18750 (1) obj. -111.05 iterations 75 +Cbc0038I Pass 32: suminf. 0.58929 (2) obj. -111.05 iterations 50 +Cbc0038I Pass 33: suminf. 0.58929 (2) obj. -111.05 iterations 3 +Cbc0038I Pass 34: suminf. 0.58929 (2) obj. -111.05 iterations 2 +Cbc0038I Pass 35: suminf. 0.58929 (2) obj. -111.05 iterations 2 +Cbc0038I Pass 36: suminf. 0.41837 (2) obj. -111.05 iterations 7 +Cbc0038I Pass 37: suminf. 0.39184 (2) obj. -111.05 iterations 12 +Cbc0038I Pass 38: suminf. 0.39184 (2) obj. -111.05 iterations 4 +Cbc0038I Pass 39: suminf. 0.25000 (1) obj. -111.05 iterations 67 +Cbc0038I Pass 40: suminf. 0.07937 (1) obj. -111.364 iterations 17 +Cbc0038I Pass 41: suminf. 0.16667 (1) obj. -111.05 iterations 5 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 141 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 3 rows 13 columns -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) -Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -189 - took 0.05 seconds -Cbc0012I Integer solution of -189 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) -Cbc0038I Full problem 220 rows 210 columns, reduced to 2 rows 4 columns -Cbc0031I 16 added rows had average density of 11.75 -Cbc0013I At root node, 48 cuts changed objective from -192.60573 to -189 in 2 passes -Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 4.0 elements, 7 column cuts (7 active) in 0.001 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 5 row cuts average 26.8 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 23 row cuts average 7.6 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1 +Cbc0038I Before mini branch and bound, 156 integers at bound fixed and 0 continuous +Cbc0038I Full problem 220 rows 210 columns, reduced to 30 rows 25 columns +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -110.85 - took 0.06 seconds +Cbc0012I Integer solution of -110.85 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Full problem 220 rows 210 columns, reduced to 30 rows 23 columns +Cbc0031I 1 added rows had average density of 15 +Cbc0013I At root node, 15 cuts changed objective from -111.62757 to -110.86756 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) - 3 row cuts average 15.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 10 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.001 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) - 45 row cuts average 18.4 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 7 (ZeroHalf) - 4 row cuts average 22.5 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -188.9999999999999, took 41 iterations and 0 nodes (0.08 seconds) -Cbc0035I Maximum depth 0, 66 variables fixed on reduced cost -Cuts at root node changed objective from -192.606 to -189 -Probing was tried 2 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Gomory was tried 2 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Knapsack was tried 2 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Clique was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 2 times and created 45 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -ZeroHalf was tried 2 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 18 row cuts average 14.5 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 +Cbc0014I Cut generator 7 (ZeroHalf) - 2 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is 1 +Cbc0001I Search completed - best objective -110.8500000000001, took 10 iterations and 0 nodes (0.10 seconds) +Cbc0035I Maximum depth 0, 65 variables fixed on reduced cost +Cuts at root node changed objective from -111.628 to -110.868 +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 3 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Knapsack was tried 3 times and created 10 cuts of which 0 were active after adding rounds of cuts (0.001 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.001 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 18 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +ZeroHalf was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Result - Optimal solution found -Objective value: -189.00000000 +Objective value: -110.85000000 Enumerated nodes: 0 -Total iterations: 41 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Total iterations: 10 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +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/c653f9eef0d24b79b9dfcae8f1e542c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c653f9eef0d24b79b9dfcae8f1e542c5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7bb4c97f247845d2bf3a757471aaabde-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bb4c97f247845d2bf3a757471aaabde-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 119 RHS -At line 123 BOUNDS -At line 144 ENDATA -Problem MODEL has 3 rows, 26 columns and 64 elements +At line 120 RHS +At line 124 BOUNDS +At line 145 ENDATA +Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors 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 64 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 1.23135 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 86.5 iterations 3 -Cbc0038I Solution found of 86.5 -Cbc0038I Relaxing continuous gives 86.5 +Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.553461 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 96.5 iterations 4 +Cbc0038I Solution found of 96.5 +Cbc0038I Relaxing continuous gives 96.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 improved solution from 86.5 to 78.5 (0.00 seconds) -Cbc0038I Round again with cutoff of 70.65 -Cbc0038I Pass 2: suminf. 0.15396 (2) obj. 70.65 iterations 2 -Cbc0038I Pass 3: suminf. 0.37916 (2) obj. 70.65 iterations 2 -Cbc0038I Pass 4: suminf. 0.38978 (3) obj. 70.65 iterations 5 -Cbc0038I Pass 5: suminf. 0.33914 (2) obj. 70.65 iterations 2 -Cbc0038I Pass 6: suminf. 0.25865 (1) obj. 70.65 iterations 3 -Cbc0038I Pass 7: suminf. 0.15428 (1) obj. 70.65 iterations 2 -Cbc0038I Pass 8: suminf. 0.35068 (1) obj. 70.65 iterations 3 -Cbc0038I Pass 9: suminf. 0.01178 (1) obj. 70.65 iterations 4 -Cbc0038I Pass 10: suminf. 0.40434 (1) obj. 70.65 iterations 3 -Cbc0038I Pass 11: suminf. 0.16528 (1) obj. 70.65 iterations 7 -Cbc0038I Pass 12: suminf. 0.21469 (2) obj. 70.65 iterations 4 -Cbc0038I Pass 13: suminf. 0.16528 (1) obj. 70.65 iterations 3 -Cbc0038I Pass 14: suminf. 0.16528 (1) obj. 70.65 iterations 0 -Cbc0038I Pass 15: suminf. 0.30551 (2) obj. 70.65 iterations 7 -Cbc0038I Pass 16: suminf. 0.18275 (1) obj. 70.65 iterations 2 -Cbc0038I Pass 17: suminf. 0.26306 (2) obj. 70.65 iterations 3 -Cbc0038I Pass 18: suminf. 0.10109 (1) obj. 70.65 iterations 3 -Cbc0038I Pass 19: suminf. 0.00000 (0) obj. 70.65 iterations 2 -Cbc0038I Solution found of 70.65 -Cbc0038I Relaxing continuous gives 51.5 -Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0038I Mini branch and bound improved solution from 51.5 to 14.5 (0.02 seconds) -Cbc0038I Round again with cutoff of 11.6 -Cbc0038I Pass 20: suminf. 0.82585 (3) obj. 11.6 iterations 1 -Cbc0038I Pass 21: suminf. 1.13405 (3) obj. 11.6 iterations 1 -Cbc0038I Pass 22: suminf. 0.44900 (3) obj. 11.6 iterations 9 -Cbc0038I Pass 23: suminf. 0.04601 (2) obj. 11.6 iterations 5 -Cbc0038I Pass 24: suminf. 0.20044 (3) obj. 11.6 iterations 3 -Cbc0038I Pass 25: suminf. 0.78617 (3) obj. 11.6 iterations 7 -Cbc0038I Pass 26: suminf. 0.78617 (3) obj. 11.6 iterations 0 -Cbc0038I Pass 27: suminf. 0.88249 (3) obj. 11.6 iterations 4 -Cbc0038I Pass 28: suminf. 0.55465 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 29: suminf. 0.77087 (3) obj. 11.6 iterations 4 -Cbc0038I Pass 30: suminf. 0.55550 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 31: suminf. 0.59249 (3) obj. 11.6 iterations 4 -Cbc0038I Pass 32: suminf. 0.29111 (2) obj. 11.6 iterations 2 -Cbc0038I Pass 33: suminf. 0.61127 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 34: suminf. 0.43734 (2) obj. 11.6 iterations 5 -Cbc0038I Pass 35: suminf. 0.23915 (2) obj. 11.6 iterations 5 -Cbc0038I Pass 36: suminf. 0.60234 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 37: suminf. 0.60234 (2) obj. 11.6 iterations 0 -Cbc0038I Pass 38: suminf. 0.23915 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 39: suminf. 0.14194 (2) obj. 11.6 iterations 10 -Cbc0038I Pass 40: suminf. 0.09055 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 41: suminf. 1.23621 (3) obj. 11.6 iterations 5 -Cbc0038I Pass 42: suminf. 0.49409 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 43: suminf. 1.10397 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 44: suminf. 0.70112 (3) obj. 11.6 iterations 3 -Cbc0038I Pass 45: suminf. 0.94683 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 46: suminf. 0.24939 (1) obj. 11.6 iterations 5 -Cbc0038I Pass 47: suminf. 0.39187 (3) obj. 11.6 iterations 5 -Cbc0038I Pass 48: suminf. 0.24939 (1) obj. 11.6 iterations 3 -Cbc0038I Pass 49: suminf. 0.46354 (3) obj. 11.6 iterations 8 +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 86.85 +Cbc0038I Pass 2: suminf. 0.04754 (1) obj. 86.85 iterations 1 +Cbc0038I Pass 3: suminf. 0.08811 (2) obj. 86.85 iterations 5 +Cbc0038I Pass 4: suminf. 0.04754 (1) obj. 86.85 iterations 3 +Cbc0038I Pass 5: suminf. 0.00000 (0) obj. 86.85 iterations 8 +Cbc0038I Solution found of 86.85 +Cbc0038I Relaxing continuous gives 8.5 +Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 1 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 11 columns +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Round again with cutoff of 6.79999 +Cbc0038I Pass 6: suminf. 0.44480 (2) obj. 6.79999 iterations 1 +Cbc0038I Pass 7: suminf. 0.78755 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 8: suminf. 0.77643 (3) obj. 6.79999 iterations 7 +Cbc0038I Pass 9: suminf. 0.62950 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 10: suminf. 0.87848 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 11: suminf. 0.38122 (1) obj. 6.79999 iterations 6 +Cbc0038I Pass 12: suminf. 0.33466 (2) obj. 6.79999 iterations 3 +Cbc0038I Pass 13: suminf. 0.52713 (2) obj. 6.79999 iterations 5 +Cbc0038I Pass 14: suminf. 0.52713 (2) obj. 6.79999 iterations 0 +Cbc0038I Pass 15: suminf. 0.33466 (2) obj. 6.79999 iterations 4 +Cbc0038I Pass 16: suminf. 0.75679 (3) obj. 6.79999 iterations 4 +Cbc0038I Pass 17: suminf. 0.80683 (3) obj. 6.79999 iterations 5 +Cbc0038I Pass 18: suminf. 0.38122 (1) obj. 6.79999 iterations 5 +Cbc0038I Pass 19: suminf. 0.33466 (2) obj. 6.79999 iterations 3 +Cbc0038I Pass 20: suminf. 0.52713 (2) obj. 6.79999 iterations 5 +Cbc0038I Pass 21: suminf. 0.52713 (2) obj. 6.79999 iterations 0 +Cbc0038I Pass 22: suminf. 0.33466 (2) obj. 6.79999 iterations 4 +Cbc0038I Pass 23: suminf. 0.64770 (3) obj. 6.79999 iterations 13 +Cbc0038I Pass 24: suminf. 0.29399 (2) obj. 6.79999 iterations 4 +Cbc0038I Pass 25: suminf. 0.81392 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 26: suminf. 0.26622 (2) obj. 6.79999 iterations 8 +Cbc0038I Pass 27: suminf. 0.56557 (2) obj. 6.79999 iterations 3 +Cbc0038I Pass 28: suminf. 0.56557 (2) obj. 6.79999 iterations 0 +Cbc0038I Pass 29: suminf. 0.26622 (2) obj. 6.79999 iterations 4 +Cbc0038I Pass 30: suminf. 0.26622 (2) obj. 6.79999 iterations 0 +Cbc0038I Pass 31: suminf. 0.63530 (3) obj. 6.79999 iterations 6 +Cbc0038I Pass 32: suminf. 0.45995 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 33: suminf. 0.95050 (3) obj. 6.79999 iterations 5 +Cbc0038I Pass 34: suminf. 0.75986 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 35: suminf. 0.94339 (3) obj. 6.79999 iterations 2 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 14.5 to 5.5 (0.03 seconds) -Cbc0038I Round again with cutoff of 3.84999 -Cbc0038I Pass 49: suminf. 0.92881 (3) obj. 3.84999 iterations 0 -Cbc0038I Pass 50: suminf. 1.03110 (3) obj. 3.84999 iterations 1 -Cbc0038I Pass 51: suminf. 0.49428 (3) obj. 3.84999 iterations 11 -Cbc0038I Pass 52: suminf. 0.36131 (3) obj. 3.84999 iterations 3 -Cbc0038I Pass 53: suminf. 1.15277 (3) obj. 3.84999 iterations 3 -Cbc0038I Pass 54: suminf. 0.54177 (3) obj. 3.84999 iterations 3 -Cbc0038I Pass 55: suminf. 0.76031 (3) obj. 3.84999 iterations 10 -Cbc0038I Pass 56: suminf. 0.69064 (2) obj. 3.84999 iterations 1 -Cbc0038I Pass 57: suminf. 0.72949 (2) obj. 3.84999 iterations 2 -Cbc0038I Pass 58: suminf. 0.64822 (3) obj. 3.84999 iterations 4 -Cbc0038I Pass 59: suminf. 0.16096 (3) obj. 3.84999 iterations 4 -Cbc0038I Pass 60: suminf. 1.05948 (3) obj. 3.84999 iterations 5 -Cbc0038I Pass 61: suminf. 0.55590 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 62: suminf. 0.43171 (3) obj. 3.84999 iterations 3 -Cbc0038I Pass 63: suminf. 0.69661 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 64: suminf. 0.54702 (3) obj. 3.84999 iterations 1 -Cbc0038I Pass 65: suminf. 1.08124 (3) obj. 3.84999 iterations 5 -Cbc0038I Pass 66: suminf. 0.91801 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 67: suminf. 1.08124 (3) obj. 3.84999 iterations 1 -Cbc0038I Pass 68: suminf. 0.65846 (3) obj. 3.84999 iterations 6 -Cbc0038I Pass 69: suminf. 0.30209 (3) obj. 3.84999 iterations 5 -Cbc0038I Pass 70: suminf. 0.60432 (3) obj. 3.84999 iterations 5 -Cbc0038I Pass 71: suminf. 0.45122 (2) obj. 3.84999 iterations 4 -Cbc0038I Pass 72: suminf. 0.49262 (2) obj. 3.84999 iterations 2 -Cbc0038I Pass 73: suminf. 0.59995 (3) obj. 3.84999 iterations 5 -Cbc0038I Pass 74: suminf. 0.56740 (2) obj. 3.84999 iterations 3 -Cbc0038I Pass 75: suminf. 0.46568 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 76: suminf. 0.74610 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 77: suminf. 0.71377 (3) obj. 3.84999 iterations 2 -Cbc0038I Pass 78: suminf. 1.11717 (3) obj. 3.84999 iterations 2 +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 8.5 to 3.5 (0.03 seconds) +Cbc0038I Round again with cutoff of 2.44999 +Cbc0038I Pass 35: suminf. 0.46981 (3) obj. 2.44999 iterations 1 +Cbc0038I Pass 36: suminf. 0.28256 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 37: suminf. 0.19994 (3) obj. 2.44999 iterations 1 +Cbc0038I Pass 38: suminf. 0.53662 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 39: suminf. 0.48243 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 40: suminf. 0.89325 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 41: suminf. 0.70083 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 42: suminf. 0.75366 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 43: suminf. 0.69647 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 44: suminf. 0.57011 (3) obj. 2.44999 iterations 5 +Cbc0038I Pass 45: suminf. 0.33992 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 46: suminf. 1.04818 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 47: suminf. 0.41881 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 48: suminf. 0.87744 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 49: suminf. 0.81993 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 50: suminf. 0.69530 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 51: suminf. 0.98277 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 52: suminf. 0.66228 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 53: suminf. 0.69239 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 54: suminf. 0.74997 (3) obj. 2.44999 iterations 9 +Cbc0038I Pass 55: suminf. 0.34490 (3) obj. 2.44999 iterations 3 +Cbc0038I Pass 56: suminf. 0.38739 (2) obj. 2.44999 iterations 2 +Cbc0038I Pass 57: suminf. 0.46007 (3) obj. 2.44999 iterations 6 +Cbc0038I Pass 58: suminf. 0.46007 (3) obj. 2.44999 iterations 0 +Cbc0038I Pass 59: suminf. 0.63313 (3) obj. 2.44999 iterations 2 +Cbc0038I Pass 60: suminf. 0.55491 (3) obj. 2.44999 iterations 1 +Cbc0038I Pass 61: suminf. 0.73891 (3) obj. 2.44999 iterations 9 +Cbc0038I Pass 62: suminf. 0.73891 (3) obj. 2.44999 iterations 0 +Cbc0038I Pass 63: suminf. 0.39108 (3) obj. 2.44999 iterations 4 +Cbc0038I Pass 64: suminf. 0.11780 (3) obj. 2.44999 iterations 5 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns +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.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 5.5 - took 0.05 seconds -Cbc0012I Integer solution of 5.5 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0031I 6 added rows had average density of 19.333333 +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 3.5 - took 0.05 seconds +Cbc0012I Integer solution of 3.5 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0031I 6 added rows had average density of 17.166667 Cbc0013I At root node, 6 cuts changed objective from 0 to 0.5 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 581 row cuts average 25.6 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 525 row cuts average 10.3 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 26.0 elements, 1 column cuts (3 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 611 row cuts average 25.6 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 486 row cuts average 11.1 elements, 0 column cuts (0 active) in 0.042 seconds - new frequency is 1 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) - 585 row cuts average 17.7 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 95 row cuts average 8.1 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 -Cbc0014I Cut generator 6 (TwoMirCuts) - 382 row cuts average 18.1 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 5.5 best solution, best possible 0.5 (0.17 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 19 columns +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 551 row cuts average 18.2 elements, 0 column cuts (0 active) in 0.020 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 82 row cuts average 8.6 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 431 row cuts average 18.2 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3.5 best solution, best possible 0.5 (0.25 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 18 columns -Cbc0004I Integer solution of 3.5 found after 21060 iterations and 463 nodes (1.26 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 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 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0010I After 1000 nodes, 8 on tree, 3.5 best solution, best possible 0.5 (2.42 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0001I Search completed - best objective 3.5, took 79139 iterations and 4733 nodes (4.14 seconds) -Cbc0032I Strong branching done 12498 times (52811 iterations), fathomed 56 nodes and fixed 419 variables -Cbc0041I Maximum depth 12, 1137 variables fixed on reduced cost (complete fathoming 290 times, 2947 nodes taking 10777 iterations) +Cbc0010I After 1000 nodes, 3 on tree, 3.5 best solution, best possible 0.5 (4.65 seconds) +Cbc0001I Search completed - best objective 3.5, took 69998 iterations and 2126 nodes (5.28 seconds) +Cbc0032I Strong branching done 9092 times (48696 iterations), fathomed 64 nodes and fixed 296 variables +Cbc0041I Maximum depth 12, 812 variables fixed on reduced cost (complete fathoming 91 times, 962 nodes taking 3660 iterations) Cuts at root node changed objective from 0 to 0.5 -Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -Gomory was tried 5295 times and created 19068 cuts of which 0 were active after adding rounds of cuts (0.373 seconds) -Knapsack was tried 5300 times and created 18518 cuts of which 0 were active after adding rounds of cuts (0.739 seconds) +Probing was tried 100 times and created 2 cuts of which 2 were active after adding rounds of cuts (0.007 seconds) +Gomory was tried 3781 times and created 14723 cuts of which 0 were active after adding rounds of cuts (0.484 seconds) +Knapsack was tried 3787 times and created 11491 cuts of which 0 were active after adding rounds of cuts (0.916 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 5300 times and created 27660 cuts of which 0 were active after adding rounds of cuts (0.514 seconds) -FlowCover was tried 5300 times and created 4566 cuts of which 0 were active after adding rounds of cuts (0.285 seconds) -TwoMirCuts was tried 5295 times and created 16710 cuts of which 0 were active after adding rounds of cuts (0.247 seconds) +MixedIntegerRounding2 was tried 3787 times and created 17102 cuts of which 0 were active after adding rounds of cuts (0.580 seconds) +FlowCover was tried 100 times and created 82 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +TwoMirCuts was tried 3781 times and created 11158 cuts of which 0 were active after adding rounds of cuts (0.344 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: 3.50000000 -Enumerated nodes: 4733 -Total iterations: 79139 -Time (CPU seconds): 4.08 -Time (Wallclock seconds): 4.14 +Enumerated nodes: 2126 +Total iterations: 69998 +Time (CPU seconds): 5.16 +Time (Wallclock seconds): 5.29 Option for printingOptions changed from normal to all -Total time (CPU seconds): 4.08 (Wallclock seconds): 4.14 +Total time (CPU seconds): 5.16 (Wallclock seconds): 5.29 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ca8549d1f1244b8385f9391d4efd526c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca8549d1f1244b8385f9391d4efd526c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c636964b7e33434ca190b77b26a2420e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c636964b7e33434ca190b77b26a2420e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6587,7 +6552,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1c019d94e5554ef39e780da8addbe267-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c019d94e5554ef39e780da8addbe267-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c553ddf46f5f447ab7127eba9fd4bba8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c553ddf46f5f447ab7127eba9fd4bba8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6614,148 +6579,22 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f701a9535c924bc586e423b0cd0dfbdd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f701a9535c924bc586e423b0cd0dfbdd-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.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 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.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_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/b278477618974c3489d83eb90f442855-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/b278477618974c3489d83eb90f442855-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 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/5076766cb631409e8d07f9c2991ababf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5076766cb631409e8d07f9c2991ababf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/111653ead55748429db187df25ecc4be-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/111653ead55748429db187df25ecc4be-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.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 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 (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/b4cfc71c6f17468fbeaeb55deca0ad79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4cfc71c6f17468fbeaeb55deca0ad79-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 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 -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 - +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 @@ -6763,23 +6602,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ea84ad3778624a5595ffff10cdad27f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea84ad3778624a5595ffff10cdad27f7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b406dc923735471b8d78475e676e8a64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b406dc923735471b8d78475e676e8a64-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 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 8630 - 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 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) +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 8630 to 8630 +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) @@ -6791,36 +6631,39 @@ Result - Optimal solution found -Objective value: 8630.00000000 +Objective value: 15005.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 +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/7820124f1520469e87b1ff7aea49b7da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7820124f1520469e87b1ff7aea49b7da-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0fa963ca45f549e29f56d57eb0bef900-pulp.mps mips /tmp/0fa963ca45f549e29f56d57eb0bef900-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/0fa963ca45f549e29f56d57eb0bef900-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 +opening mipstart file /tmp/0fa963ca45f549e29f56d57eb0bef900-pulp.mst. +MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 8660 - 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 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8660, 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 8660 to 8660 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.09 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) @@ -6832,36 +6675,33 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.10 +Time (Wallclock seconds): 0.12 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.13 (Wallclock seconds): 0.15 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/77b9c21d16ef43edbfee597dd8ba1230-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77b9c21d16ef43edbfee597dd8ba1230-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/456703ebb11d467eb7e79648754fbddd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/456703ebb11d467eb7e79648754fbddd-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 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8690, 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 8690 to 8690 +Continuous objective value is 0 - 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 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) @@ -6873,77 +6713,90 @@ Result - Optimal solution found -Objective value: 8690.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.02 (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/cb2ffcdf8f5f4dd9b92794e45450ff83-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb2ffcdf8f5f4dd9b92794e45450ff83-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1cc2e2dba2fe4bd5aff4299cfbd78632-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cc2e2dba2fe4bd5aff4299cfbd78632-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 8720 - 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 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8720, 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 8720 to 8720 -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: 8720.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock 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.00 +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/654d4685918c460a8fcbd104b8b81959-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/654d4685918c460a8fcbd104b8b81959-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e9c44b7ef8e640cab5c26fa8b7b954c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9c44b7ef8e640cab5c26fa8b7b954c7-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 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 8750 - 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 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) +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.00 seconds) +Cbc0001I Search completed - best objective 251.5000000000001, 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 8750 to 8750 +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) @@ -6955,7 +6808,7 @@ Result - Optimal solution found -Objective value: 8750.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -6968,23 +6821,20 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fca709f7678e465ea5172c00ca38bfac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fca709f7678e465ea5172c00ca38bfac-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f6c3c5fd094840808eba60e011b9ef93-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6c3c5fd094840808eba60e011b9ef93-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 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 8780 - 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 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8780, 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 8780 to 8780 +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) @@ -6996,9 +6846,9 @@ Result - Optimal solution found -Objective value: 8780.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -7009,23 +6859,28 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e2d8bfbb5ddc4001a630a07878e61c5a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2d8bfbb5ddc4001a630a07878e61c5a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d8e1ec02af994acc8ed9e2d03d66ffb7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8e1ec02af994acc8ed9e2d03d66ffb7-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 8810 - 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 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8810, 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.13 seconds) +Cbc0038I After 0.13 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.13 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.13 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8810 to 8810 +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) @@ -7037,77 +6892,87 @@ Result - Optimal solution found -Objective value: 8810.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.13 +Time (Wallclock seconds): 0.14 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.16 (Wallclock seconds): 0.17 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/efc315a476b6445aa94cde3e42347472-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efc315a476b6445aa94cde3e42347472-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/47b44a2608b8403d900234b8b8641afd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47b44a2608b8403d900234b8b8641afd-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 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 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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 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) +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 10 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 10 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: 8840.00000000 +Objective value: 228100.00000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 10 Time (CPU seconds): 0.00 -Time (Wallclock 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.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/062b2fecb34545939bb7a7d526c19ff7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/062b2fecb34545939bb7a7d526c19ff7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/06024224f4664e41bf35972ebc5b6b68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06024224f4664e41bf35972ebc5b6b68-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 13 COLUMNS +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 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 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 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) +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 8870 to 8870 +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) @@ -7119,7 +6984,7 @@ Result - Optimal solution found -Objective value: 8870.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -7132,7 +6997,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/43c2dc55ea53423c8c7c1ccc1dcf1cdc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43c2dc55ea53423c8c7c1ccc1dcf1cdc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/60b7a1f933bd457a8ff951f527d8253d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60b7a1f933bd457a8ff951f527d8253d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7142,13 +7007,13 @@ 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 +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 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) +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 8900 to 8900 +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) @@ -7160,7 +7025,7 @@ Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -7173,7 +7038,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e2fc9b9687634f88a9824204ad3c344f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2fc9b9687634f88a9824204ad3c344f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e04ab36ba3d14b3e84a6c51d3393335b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e04ab36ba3d14b3e84a6c51d3393335b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7187,15 +7052,15 @@ 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 +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 +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/d3a1774e4bd948d796545cbeb7759890-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3a1774e4bd948d796545cbeb7759890-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/200b0172eacb4bd7b64de6dbdde207b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/200b0172eacb4bd7b64de6dbdde207b9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -7209,7 +7074,7 @@ 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) +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 @@ -7218,7 +7083,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.05, took 4 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.05, took 4 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.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) @@ -7235,17 +7100,17 @@ Objective value: -1.05000000 Enumerated nodes: 0 Total iterations: 4 -Time (CPU seconds): 0.00 -Time (Wallclock 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.00 +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/814c916b5e7b43ab8cbb2ef50622233a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/814c916b5e7b43ab8cbb2ef50622233a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7607d9f6e224413db514990170af2647-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7607d9f6e224413db514990170af2647-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7269,7 +7134,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e5e97dac5767403c828044e7eaf6077a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5e97dac5767403c828044e7eaf6077a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/07663d459edb4dedaffe67bb39e78c73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07663d459edb4dedaffe67bb39e78c73-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -7291,7 +7156,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, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1, 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) @@ -7308,17 +7173,17 @@ Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock 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.00 +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/c8f1f99d4613499f81822116c4b8aa1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8f1f99d4613499f81822116c4b8aa1a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eb6b251dc5994d999585e9db315177b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb6b251dc5994d999585e9db315177b9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7328,7 +7193,7 @@ 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 +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 @@ -7362,64 +7227,572 @@ Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock 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 + +/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_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/cca767d80b2e46a88edd5dbf04264d0e-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/cca767d80b2e46a88edd5dbf04264d0e-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 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/90dc9b8a12a541f286d9d119b7bfa227-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90dc9b8a12a541f286d9d119b7bfa227-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/153244f36885450e9f3aae69a7139f94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/153244f36885450e9f3aae69a7139f94-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 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/db14bc1e13084337afbb899d5ec4b30e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db14bc1e13084337afbb899d5ec4b30e-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 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.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.00 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.00 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 +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/f2a64b8b2f8c464bb1035522d951ea8d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f2a64b8b2f8c464bb1035522d951ea8d-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 355 COLUMNS +At line 4757 RHS +At line 5108 BOUNDS +At line 5839 ENDATA +Problem MODEL has 350 rows, 730 columns and 2942 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 7 fixed, 0 tightened bounds, 0 strengthened rows, 20 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions +Cgl0004I processed model has 31 rows, 30 columns (30 integer (30 of which binary)) and 106 elements +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.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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.04 + +Option for printingOptions changed from normal to all +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/e629dfb9efb54d99924f6313426cdb67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e629dfb9efb54d99924f6313426cdb67-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 356 COLUMNS +At line 4839 RHS +At line 5191 BOUNDS +At line 5922 ENDATA +Problem MODEL has 351 rows, 730 columns and 3023 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 8 fixed, 0 tightened bounds, 1 strengthened rows, 23 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 31 rows, 28 columns (28 integer (28 of which binary)) and 119 elements +Cbc0038I Initial state - 20 integers unsatisfied sum - 7.5 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 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.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.09 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/85fca8b7e6db429599c98c276afe69c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85fca8b7e6db429599c98c276afe69c0-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 357 COLUMNS +At line 4921 RHS +At line 5274 BOUNDS +At line 6005 ENDATA +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.00 seconds +Cgl0003I 8 fixed, 0 tightened bounds, 2 strengthened rows, 27 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 32 rows, 28 columns (28 integer (28 of which binary)) and 142 elements +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.07 seconds) +Cbc0038I After 0.07 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/17212fe08f444813a62c66d2372207cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17212fe08f444813a62c66d2372207cc-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 358 COLUMNS +At line 5003 RHS +At line 5357 BOUNDS +At line 6088 ENDATA +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.00 seconds +Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 35 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 32 rows, 26 columns (26 integer (26 of which binary)) and 148 elements +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.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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 + +Option for printingOptions changed from normal to all +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/91f04962e90746e7abe5506e579ffc52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91f04962e90746e7abe5506e579ffc52-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 359 COLUMNS +At line 5085 RHS +At line 5440 BOUNDS +At line 6171 ENDATA +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.00 seconds +Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 25 rows, 20 columns (20 integer (20 of which binary)) and 127 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 20 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/414df7ad3df94a8c9234d0c96376c63c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/414df7ad3df94a8c9234d0c96376c63c-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 360 COLUMNS +At line 5167 RHS +At line 5523 BOUNDS +At line 6254 ENDATA +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.00 seconds +Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 22 rows, 17 columns (17 integer (17 of which binary)) and 113 elements +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 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.08 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/175b697433774c309469435115804a60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/175b697433774c309469435115804a60-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 361 COLUMNS +At line 5249 RHS +At line 5606 BOUNDS +At line 6337 ENDATA +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.00 seconds +Cgl0003I 10 fixed, 0 tightened bounds, 6 strengthened rows, 31 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 3 strengthened rows, 8 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 8 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 6 strengthened rows, 5 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 23 rows, 17 columns (17 integer (17 of which binary)) and 127 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.10 seconds) +Cbc0038I After 0.10 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.10 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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.10 +Time (Wallclock seconds): 0.11 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.11 (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/56c51f20452f40c7a64b09632e2e17cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56c51f20452f40c7a64b09632e2e17cb-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 362 COLUMNS +At line 5331 RHS +At line 5689 BOUNDS +At line 6420 ENDATA +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.00 seconds +Cgl0003I 13 fixed, 0 tightened bounds, 7 strengthened rows, 60 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 14 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 13 rows, 9 columns (9 integer (9 of which binary)) and 72 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.10 +Time (Wallclock seconds): 0.10 + +Option for printingOptions changed from normal to all +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/ed5f02e68e0d4c6dba888817dc7a24cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed5f02e68e0d4c6dba888817dc7a24cd-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 363 COLUMNS +At line 5413 RHS +At line 5772 BOUNDS +At line 6503 ENDATA +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.00 seconds +Cgl0003I 17 fixed, 0 tightened bounds, 8 strengthened rows, 84 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 4 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +Cgl0004I processed model has 11 rows, 9 columns (9 integer (9 of which binary)) and 48 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous +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) +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.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.10 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 + Status: Optimal x = 4.0 y = -1.0 @@ -7457,38 +7830,38 @@ x_1 = 1.0 x_2 = 0.0 x_3 = 0.0 -x_4 = 0.0 +x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 -x_7 = 1.0 -x_8 = 1.0 +x_7 = 0.0 +x_8 = 0.0 x_9 = 1.0 Status: Optimal -s_0 = 0.0 -s_1 = 1.0 -s_2 = 2.0 -w_0 = 0.5 -w_1 = 0.0 +s_0 = 0.5 +s_1 = 0.0 +s_2 = 0.0 +w_0 = 0.0 +w_1 = 3.0 w_2 = 0.0 -x_0 = 0.0 +x_0 = 1.0 x_1 = 1.0 x_10 = 1.0 -x_11 = 1.0 +x_11 = 0.0 x_12 = 0.0 x_13 = 1.0 -x_14 = 0.0 -x_15 = 1.0 +x_14 = 1.0 +x_15 = 0.0 x_16 = 1.0 x_17 = 0.0 x_18 = 0.0 -x_19 = 1.0 -x_2 = 1.0 +x_19 = 0.0 +x_2 = 0.0 x_3 = 0.0 -x_4 = 0.0 +x_4 = 1.0 x_5 = 0.0 x_6 = 0.0 x_7 = 1.0 -x_8 = 0.0 +x_8 = 1.0 x_9 = 1.0 objective= 3.5 Status: Optimal @@ -7546,11 +7919,147 @@ 8 tests in 1 item. 8 passed. Test passed. +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 Status: Optimal -Patt_A = 225.0 +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 +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 +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 +Status: Optimal +Patt_A = 200.0 Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 +Patt_C = 100.0 +Surp_5 = 50.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 251.5 +Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 +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 +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_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 +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 = [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 @@ -7622,6 +8131,14 @@ steelpurchase = 27.25 Total price = 863.25 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 @@ -7639,267 +8156,42 @@ Route_C_5 = 0.0 Total Cost of Transportation = 8300.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 = 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 -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 = 210.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 = 8630.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 = 220.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 = 8660.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 = 230.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 = 8690.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 = 240.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 = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 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 -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 -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 -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]Welcome to the CBC MILP Solver +Status: OptimalWelcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1a024d6ccbd84f3bb9db4032fa0cb981-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a024d6ccbd84f3bb9db4032fa0cb981-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cc9c033562d4477b9779baca46207bd5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc9c033562d4477b9779baca46207bd5-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 -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.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.00 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.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) - -Result - Optimal solution found - -Objective value: 246.50000000 -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/ceb1729d27894b0881facdc8503b296f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ceb1729d27894b0881facdc8503b296f-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 +At line 364 COLUMNS +At line 5495 RHS +At line 5855 BOUNDS +At line 6586 ENDATA +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 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) +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 16 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions +Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 1 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 2 columns (2 integer (2 of which binary)) and 6 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 0 +Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous +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 15005 to 15005 +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) 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) @@ -7911,55 +8203,36 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8f274138edd2461eb59e998a5663f172-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f274138edd2461eb59e998a5663f172-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/49c47b28eb0846108b10ab917ee36099-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49c47b28eb0846108b10ab917ee36099-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/410bc1a2538b433b91a02714306bfc56-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/410bc1a2538b433b91a02714306bfc56-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 +At line 365 COLUMNS +At line 5577 RHS +At line 5938 BOUNDS +At line 6669 ENDATA +Problem MODEL has 360 rows, 730 columns and 3752 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 10 strengthened rows, 78 substitutions +Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions 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 +Cuts at root node changed objective from 0 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) @@ -7971,58 +8244,35 @@ Result - Optimal solution found -Objective value: 0.97000000 +Objective value: 0.00000000 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 +Total iterations: 0 +Time (CPU seconds): 0.09 +Time (Wallclock seconds): 0.10 -command line - /usr/bin/cbc /tmp/e3eea3da78934b97a0374eee5981cad5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3eea3da78934b97a0374eee5981cad5-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 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 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 +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/e4f15e45f01e41d488fc19d88f754465-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4f15e45f01e41d488fc19d88f754465-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/55023db6d73d4e34a6eb9778d683e69a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/55023db6d73d4e34a6eb9778d683e69a-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 +At line 366 COLUMNS +At line 5659 RHS +At line 6021 BOUNDS +At line 6752 ENDATA +Problem MODEL has 361 rows, 730 columns and 3833 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.6 - 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.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, 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.6 to -1.6 +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 35 fixed, 0 tightened bounds, 11 strengthened rows, 19 substitutions +Cgl0003I 2 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions +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 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) @@ -8034,132 +8284,124 @@ Result - Optimal solution found -Objective value: -1.60000000 +Objective value: 0.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 +Total iterations: 1 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.07 -command line - /usr/bin/cbc /tmp/ecdad0b9c57d47d5889ab2afc6212bf7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecdad0b9c57d47d5889ab2afc6212bf7-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 23 RHS -At line 27 BOUNDS -At line 28 ENDATA -Problem MODEL has 3 rows, 7 columns and 7 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 301.5 -After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 301.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 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dafbc815613d445ca61a9f79dcc8ed8d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dafbc815613d445ca61a9f79dcc8ed8d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f799b1cd619f499c9dd403445dafcbc6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f799b1cd619f499c9dd403445dafcbc6-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 +At line 367 COLUMNS +At line 5741 RHS +At line 6104 BOUNDS +At line 6835 ENDATA +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 -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.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 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Continuous objective value is 0 - 0.00 seconds +Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 26 substitutions +Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 2 columns (2 integer (2 of which binary)) and 8 elements +Cbc0038I Initial state - 2 integers unsatisfied sum - 0.285714 +Cbc0038I Pass 1: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 2: suminf. 1.00000 (2) obj. 0 iterations 1 +Cbc0038I Pass 3: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 4: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 5: suminf. 1.00000 (2) obj. 0 iterations 0 +Cbc0038I Pass 6: suminf. 0.28571 (2) obj. 0 iterations 2 +Cbc0038I Pass 7: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 8: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 9: suminf. 0.28571 (2) obj. 0 iterations 1 +Cbc0038I Pass 10: suminf. 1.00000 (2) obj. 0 iterations 1 +Cbc0038I Pass 11: suminf. 0.28571 (2) obj. 0 iterations 2 +Cbc0038I Pass 12: suminf. 0.28571 (2) obj. 0 iterations 1 +Cbc0038I Pass 13: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 14: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 15: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 16: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 17: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 18: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 19: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 20: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 21: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 22: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 23: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 24: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 25: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 26: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 27: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 28: suminf. 0.28571 (2) obj. 0 iterations 0 +Cbc0038I Pass 29: suminf. 0.28571 (2) obj. 0 iterations 0 +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.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 +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 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 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 -1.25, took 2 iterations and 0 nodes (0.00 seconds) +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.09 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) -Gomory was tried 3 times and created 2 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) +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) +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 +Result - Problem proven infeasible -Objective value: -1.25000000 +No feasible solution found Enumerated nodes: 0 -Total iterations: 2 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +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/0283b87e13e84a4387bbcad928c13be9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0283b87e13e84a4387bbcad928c13be9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9bc28a947c744b279777144b58e7bff9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bc28a947c744b279777144b58e7bff9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 26 RHS -At line 30 BOUNDS -At line 31 ENDATA -Problem MODEL has 3 rows, 8 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements -0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 276.5 -Optimal - objective value 276.5 -After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 276.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/339dedc2388245a7a0790e3f327a3f7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/339dedc2388245a7a0790e3f327a3f7f-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 +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 -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.00 seconds) -Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 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 -1.22143 to -1.22143 +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) @@ -8171,7 +8413,7 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8184,146 +8426,105 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1f94bdfb79784f56bc482658f84ea0cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f94bdfb79784f56bc482658f84ea0cf-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 28 RHS -At line 32 BOUNDS -At line 33 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) 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/446c00eed40c4e7f892b3007325c92c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/446c00eed40c4e7f892b3007325c92c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b5cd3817fbeb4df5a02d9e0b4b06e788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5cd3817fbeb4df5a02d9e0b4b06e788-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 +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 -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 -1, took 6 iterations and 0 nodes (0.00 seconds) +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 -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) +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: -1.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 -Total iterations: 6 +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 +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/da8bb543a9fc418b86711dfe3330b7a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da8bb543a9fc418b86711dfe3330b7a8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/466f079fa8624031819d06c3ce26f870-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/466f079fa8624031819d06c3ce26f870-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 46 RHS -At line 50 BOUNDS -At line 60 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements +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 246.5 - 0.00 seconds -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.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.00 seconds) -Cbc0031I 1 added rows had average density of 4 -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 4.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 4.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.00 seconds) +Continuous objective value is 8630 - 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 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8630, 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 8630 to 8630 +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: 8630.00000000 Enumerated nodes: 0 -Total iterations: 1 +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 +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/8471d47757404dd6a62a444b681c9c05-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8471d47757404dd6a62a444b681c9c05-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/21aa8b145e1640b7b311f6f6564054e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21aa8b145e1640b7b311f6f6564054e5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +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 0 - 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 to -1.79769e+308 +Continuous objective value is 8660 - 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 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8660, 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 8660 to 8660 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) @@ -8335,37 +8536,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +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.02 (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/9552e35d506a43b19deac05478ea4f15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9552e35d506a43b19deac05478ea4f15-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6f97c4e779dd41af92770492926bdd9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f97c4e779dd41af92770492926bdd9a-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 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 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.00 seconds) -Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, 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 8690 to 8690 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) @@ -8377,39 +8577,36 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 8690.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 +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/818806c866ab4b5f8a3e4a9f1252931a-pulp.mps mips /tmp/818806c866ab4b5f8a3e4a9f1252931a-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/818806c866ab4b5f8a3e4a9f1252931a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3c60fce359514c7ab5ee529114be0d14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3c60fce359514c7ab5ee529114be0d14-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 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 -opening mipstart file /tmp/818806c866ab4b5f8a3e4a9f1252931a-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 +Continuous objective value is 8720 - 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 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.07 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 +Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8720, 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 8720 to 8720 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) @@ -8421,83 +8618,9 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8720.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 - -Option for printingOptions changed from normal to all -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/8cc940c4fc91434bb812f9bce5a3b387-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/8cc940c4fc91434bb812f9bce5a3b387-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/a7ae71cdef544763911f23df58c6f190-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7ae71cdef544763911f23df58c6f190-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 10 iterations and 0 nodes (0.00 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 10 iterations and 0 nodes (0.00 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: 10 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -8508,7 +8631,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/422a71e544c44756826d8f0216e41077-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/422a71e544c44756826d8f0216e41077-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c495d8cc5e944fbb83d33343013a2d39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c495d8cc5e944fbb83d33343013a2d39-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8518,13 +8641,13 @@ 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 +Continuous objective value is 8750 - 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) +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, 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 +Cuts at root node changed objective from 8750 to 8750 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) @@ -8536,7 +8659,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8750.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8549,23 +8672,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b0f3a7cfc32f4b76a1bbef04b401c84d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0f3a7cfc32f4b76a1bbef04b401c84d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b74a34485c024ecd89d1ffeea60ddb8d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b74a34485c024ecd89d1ffeea60ddb8d-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 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 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements +Continuous objective value is 8780 - 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) +Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8780, 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 +Cuts at root node changed objective from 8780 to 8780 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) @@ -8577,41 +8700,36 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8780.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 +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/7d7a0cc0592f4b89b28b0e17aa743051-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d7a0cc0592f4b89b28b0e17aa743051-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e0cd0fde64654e7eaada6d366c554696-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0cd0fde64654e7eaada6d366c554696-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 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 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8810 - 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 -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.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8810, 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 12 to 12 +Cuts at root node changed objective from 8810 to 8810 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) @@ -8623,42 +8741,36 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8810.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.09 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 +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/37b1431d75d14670bce07a014844a254-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/37b1431d75d14670bce07a014844a254-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/43a71388f88e417eb98964ff92b19c2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43a71388f88e417eb98964ff92b19c2f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 355 COLUMNS -At line 4757 RHS -At line 5108 BOUNDS -At line 5839 ENDATA -Problem MODEL has 350 rows, 730 columns and 2942 elements +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 0 - 0.00 seconds -Cgl0003I 7 fixed, 0 tightened bounds, 0 strengthened rows, 20 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -Cgl0004I processed model has 31 rows, 30 columns (30 integer (30 of which binary)) and 106 elements -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.02 seconds) -Cbc0038I After 0.02 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.02 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.02 seconds) +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 0 to 0 +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) @@ -8670,51 +8782,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8840.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (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/b165510f226d486aa0abe809bbfb4329-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b165510f226d486aa0abe809bbfb4329-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/44f84bf41443464d84036f56fa984807-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44f84bf41443464d84036f56fa984807-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 356 COLUMNS -At line 4839 RHS -At line 5191 BOUNDS -At line 5922 ENDATA -Problem MODEL has 351 rows, 730 columns and 3023 elements +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 0 - 0.00 seconds -Cgl0003I 8 fixed, 0 tightened bounds, 1 strengthened rows, 23 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 31 rows, 28 columns (28 integer (28 of which binary)) and 119 elements -Cbc0038I Initial state - 20 integers unsatisfied sum - 7.5 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 7 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) +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 0 to 0 +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) @@ -8726,50 +8823,36 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8870.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/b6b93192874244c3a774aec4ace3f37e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6b93192874244c3a774aec4ace3f37e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b9859e6851b2439f8300dad7fe673b25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9859e6851b2439f8300dad7fe673b25-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 357 COLUMNS -At line 4921 RHS -At line 5274 BOUNDS -At line 6005 ENDATA -Problem MODEL has 352 rows, 730 columns and 3104 elements +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 0 - 0.00 seconds -Cgl0003I 8 fixed, 0 tightened bounds, 2 strengthened rows, 27 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 32 rows, 28 columns (28 integer (28 of which binary)) and 142 elements -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.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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 0 to 0 +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) @@ -8781,103 +8864,58 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/f4dcbf8cc6e647489185311cb2481d45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4dcbf8cc6e647489185311cb2481d45-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8130f8b4490f4cf99bac5a3de4ba28d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8130f8b4490f4cf99bac5a3de4ba28d9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 5003 RHS -At line 5357 BOUNDS -At line 6088 ENDATA -Problem MODEL has 353 rows, 730 columns and 3185 elements +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 -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 35 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 32 rows, 26 columns (26 integer (26 of which binary)) and 148 elements -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.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 - +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/3932311215104073899177dd318acef4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3932311215104073899177dd318acef4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/969c5d440ae3418caf28023273ab86b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/969c5d440ae3418caf28023273ab86b5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 359 COLUMNS -At line 5085 RHS -At line 5440 BOUNDS -At line 6171 ENDATA -Problem MODEL has 354 rows, 730 columns and 3266 elements +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 0 - 0.00 seconds -Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 25 rows, 20 columns (20 integer (20 of which binary)) and 127 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 20 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) +Continuous objective value is -1.6 - 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.03996 +Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.6, 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 0 to 0 +Cuts at root node changed objective from -1.6 to -1.6 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) @@ -8889,202 +8927,132 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/e71f8f1d4d914eac90e50bfe03bd3a7b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e71f8f1d4d914eac90e50bfe03bd3a7b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a72e5c5f38284a28aec223f435db3e7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a72e5c5f38284a28aec223f435db3e7f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 360 COLUMNS -At line 5167 RHS -At line 5523 BOUNDS -At line 6254 ENDATA -Problem MODEL has 355 rows, 730 columns and 3347 elements +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 22 rows, 17 columns (17 integer (17 of which binary)) and 113 elements -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 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) -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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 - +Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 301.5 +After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/dcece34c79af4386bc932ceebd7fa39f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dcece34c79af4386bc932ceebd7fa39f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f2921438a19d44d3a0ab29b96222eba2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f2921438a19d44d3a0ab29b96222eba2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 361 COLUMNS -At line 5249 RHS -At line 5606 BOUNDS -At line 6337 ENDATA -Problem MODEL has 356 rows, 730 columns and 3428 elements +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 0 - 0.00 seconds -Cgl0003I 10 fixed, 0 tightened bounds, 6 strengthened rows, 31 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 3 strengthened rows, 8 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 8 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 6 strengthened rows, 5 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 23 rows, 17 columns (17 integer (17 of which binary)) and 127 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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.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 +Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.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) - 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.00 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) -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 -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) +Gomory was tried 3 times and created 2 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: 0.00000000 +Objective value: -1.25000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.06 +Total iterations: 2 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 +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/a8d35d33c6614a22aa99fbc812189ffc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8d35d33c6614a22aa99fbc812189ffc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fa16b1fd5902409ca5c3067890f01702-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa16b1fd5902409ca5c3067890f01702-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 362 COLUMNS -At line 5331 RHS -At line 5689 BOUNDS -At line 6420 ENDATA -Problem MODEL has 357 rows, 730 columns and 3509 elements +At line 8 COLUMNS +At line 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 13 fixed, 0 tightened bounds, 7 strengthened rows, 60 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 14 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 13 rows, 9 columns (9 integer (9 of which binary)) and 72 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 - +Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements +0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 276.5 +Optimal - objective value 276.5 +After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +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/686ecf7731c54722a4aa6c7f733faab4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/686ecf7731c54722a4aa6c7f733faab4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c48cf9f1ad4545f88f45cb1f0bd5a105-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c48cf9f1ad4545f88f45cb1f0bd5a105-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 363 COLUMNS -At line 5413 RHS -At line 5772 BOUNDS -At line 6503 ENDATA -Problem MODEL has 358 rows, 730 columns and 3590 elements +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 0 - 0.00 seconds -Cgl0003I 17 fixed, 0 tightened bounds, 8 strengthened rows, 84 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 4 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 11 rows, 9 columns (9 integer (9 of which binary)) and 48 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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.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 0 to 0 +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) 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) @@ -9096,231 +9064,193 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +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/456d586a55344d5fa73f61f225892be3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/456d586a55344d5fa73f61f225892be3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/df7cc99cea5e4c259582838d03632b00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/df7cc99cea5e4c259582838d03632b00-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 364 COLUMNS -At line 5495 RHS -At line 5855 BOUNDS -At line 6586 ENDATA -Problem MODEL has 359 rows, 730 columns and 3671 elements +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 16 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions -Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 1 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 2 columns (2 integer (2 of which binary)) and 6 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 0 -Cbc0038I Before mini branch and bound, 2 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) -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) -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.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 - +Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) 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.05 (Wallclock seconds): 0.05 +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/7baa78671ae5471a97106499ebfaa69d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7baa78671ae5471a97106499ebfaa69d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/43e7ae87196c44b4bb2c54083023ac5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/43e7ae87196c44b4bb2c54083023ac5c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 365 COLUMNS -At line 5577 RHS -At line 5938 BOUNDS -At line 6669 ENDATA -Problem MODEL has 360 rows, 730 columns and 3752 elements +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 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 10 strengthened rows, 78 substitutions -Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions -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 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) +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 -1, 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: 0.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +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.05 (Wallclock seconds): 0.06 +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/cc8af229936f4c8bae3e704c2deb06c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc8af229936f4c8bae3e704c2deb06c6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/91a339cbd6b640f894a2ddadd6c1d4fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91a339cbd6b640f894a2ddadd6c1d4fa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 366 COLUMNS -At line 5659 RHS -At line 6021 BOUNDS -At line 6752 ENDATA -Problem MODEL has 361 rows, 730 columns and 3833 elements +At line 8 COLUMNS +At line 46 RHS +At line 50 BOUNDS +At line 60 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0003I 35 fixed, 0 tightened bounds, 11 strengthened rows, 19 substitutions -Cgl0003I 2 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -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 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) +Continuous objective value is 246.5 - 0.00 seconds +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.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 +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 4.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 4.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: 0.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 +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/cbea16ad38ca4352a17074f41f14ee5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbea16ad38ca4352a17074f41f14ee5f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a8a217957fa241719dfb5974ef1690b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8a217957fa241719dfb5974ef1690b3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 367 COLUMNS -At line 5741 RHS -At line 6104 BOUNDS -At line 6835 ENDATA -Problem MODEL has 362 rows, 730 columns and 3914 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 0 - 0.00 seconds -Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 26 substitutions -Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 4 rows, 2 columns (2 integer (2 of which binary)) and 8 elements -Cbc0038I Initial state - 2 integers unsatisfied sum - 0.285714 -Cbc0038I Pass 1: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 2: suminf. 1.00000 (2) obj. 0 iterations 1 -Cbc0038I Pass 3: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 4: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 5: suminf. 1.00000 (2) obj. 0 iterations 0 -Cbc0038I Pass 6: suminf. 0.28571 (2) obj. 0 iterations 2 -Cbc0038I Pass 7: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 8: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 9: suminf. 0.28571 (2) obj. 0 iterations 1 -Cbc0038I Pass 10: suminf. 1.00000 (2) obj. 0 iterations 1 -Cbc0038I Pass 11: suminf. 0.28571 (2) obj. 0 iterations 2 -Cbc0038I Pass 12: suminf. 0.28571 (2) obj. 0 iterations 1 -Cbc0038I Pass 13: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 14: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 15: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 16: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 17: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 18: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 19: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 20: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 21: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 22: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 23: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 24: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 25: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 26: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 27: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 28: suminf. 0.28571 (2) obj. 0 iterations 0 -Cbc0038I Pass 29: suminf. 0.28571 (2) obj. 0 iterations 0 -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.05 seconds) -Cbc0038I After 0.05 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 -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 +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) - 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.05 seconds) +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 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) -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 - Problem proven infeasible +Result - Optimal solution found -No feasible solution found +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +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.06 (Wallclock seconds): 0.06 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -10658,123 +10588,20 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 25.082s +Ran 1005 tests in 30.060s OK (skipped=885) -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 -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 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 -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 Status: Optimal -Solution Written to sudokuout.txt +Status: Infeasible +Solutions Written to sudokuout.txt Status: Optimal -Patt_A = 200.0 +Patt_A = 225.0 Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -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') -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.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 +Patt_C = 75.0 +Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -10793,34 +10620,172 @@ 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_1 = 210.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 -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 +Total Cost of Transportation = 8630.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 = 220.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 = 8660.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 = 230.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 = 8690.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 = 240.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 = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 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 +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +P3 = [4, 0, 0] +P4 = [1, 2, 0] +P5 = [0, 0, 2] +Pattern_P0 = 0 +Pattern_P1 = 0 +Pattern_P2 = 0 +Pattern_P3 = 13 +Pattern_P4 = 100 +Pattern_P5 = 150 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +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 -Status: Infeasible -Solutions Written to sudokuout.txt +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 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 @@ -11086,90 +11051,90 @@ running install_lib 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/constants.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/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/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/pulp.cfg.win -> /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.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/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__/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__/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__/__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__/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__/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__/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__/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__/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__/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/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/pulp.cfg.win -> /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_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/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/__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/run_tests.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__/__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__/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/__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__/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__/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/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/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/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/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/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/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/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/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/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/__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/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/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/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/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/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/__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/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/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/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/xpress_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__/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__/__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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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__/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/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/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/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/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/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/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/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/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 -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/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/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/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/__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/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc +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/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/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/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/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/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/__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/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/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/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/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/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/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/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/__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/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/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/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/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/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/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/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/__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/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/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/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/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/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/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/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/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/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 +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/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/constants.py to constants.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 @@ -11330,90 +11295,90 @@ running install_lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc /usr/lib/python3.13/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.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.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.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt @@ -11443,12 +11408,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/1502/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/1502/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/103948 and its subdirectories -I: Current time: Fri Feb 20 05:40:48 -12 2026 -I: pbuilder-time-stamp: 1771609248 +I: removing directory /srv/workspace/pbuilder/1502 and its subdirectories +I: Current time: Sun Jan 19 01:20:14 +14 2025 +I: pbuilder-time-stamp: 1737199214