Diff of the two buildlogs: -- --- b1/build.log 2024-10-15 03:55:33.357875838 +0000 +++ b2/build.log 2024-10-15 03:56:41.978948800 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Mon Oct 14 15:54:03 -12 2024 -I: pbuilder-time-stamp: 1728964443 +I: Current time: Tue Nov 18 00:18:35 +14 2025 +I: pbuilder-time-stamp: 1763374715 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration @@ -31,53 +31,85 @@ 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/9865/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/17416/tmp/hooks/D01_modify_environment starting +debug: Running on infom08-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 Nov 17 10: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/17416/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/17416/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=6 ' - DISTRIBUTION='trixie' - 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]="32" [3]="1" [4]="release" [5]="i686-pc-linux-gnu") + BASH_VERSION='5.2.32(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=i386 + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=5 ' + DIRSTACK=() + DISTRIBUTION=trixie + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=i686 + HOST_ARCH=i386 IFS=' ' - INVOCATION_ID='41f8c71a998b442687ca31e2d19c39e1' - 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='9865' - PS1='# ' - PS2='> ' + INVOCATION_ID=49dee6af5cc5408f9f42f270cf2fe967 + 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=17416 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.g6RBzxYP/pbuilderrc_aMCC --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.g6RBzxYP/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='111' - SUDO_UID='104' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' + 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.g6RBzxYP/pbuilderrc_SsbK --distribution trixie --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.g6RBzxYP/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=111 + SUDO_UID=104 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' I: uname -a - Linux infom07-i386 6.1.0-26-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.112-1 (2024-09-30) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.10.11+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.10.11-1~bpo12+1 (2024-10-03) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/9865/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/17416/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -196,7 +228,7 @@ Get: 71 http://deb.debian.org/debian trixie/main i386 dh-python all 6.20240824 [109 kB] Get: 72 http://deb.debian.org/debian trixie/main i386 python3-all i386 3.12.6-1 [1040 B] Get: 73 http://deb.debian.org/debian trixie/main i386 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 34.6 MB in 1s (34.5 MB/s) +Fetched 34.6 MB in 0s (75.2 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-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 ... 19774 files and directories currently installed.) @@ -449,8 +481,8 @@ Setting up tzdata (2024a-4) ... Current default time zone: 'Etc/UTC' -Local time is now: Tue Oct 15 03:54:35 UTC 2024. -Universal Time is now: Tue Oct 15 03:54:35 UTC 2024. +Local time is now: Mon Nov 17 10:18:54 UTC 2025. +Universal Time is now: Mon Nov 17 10:18:54 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -519,7 +551,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/17416/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for trixie +I: user script /srv/workspace/pbuilder/17416/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 @@ -555,12 +591,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/__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/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 running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO @@ -761,7 +797,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/db1428c9d0c84b14949e34403ccc16af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db1428c9d0c84b14949e34403ccc16af-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5b5084e170494b3189c28b28dac284a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b5084e170494b3189c28b28dac284a0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -784,7 +820,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fa041878cd2a4683a00cde57be024149-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/fa041878cd2a4683a00cde57be024149-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fadb023f6ded418bb6357a6a9719bb91-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/fadb023f6ded418bb6357a6a9719bb91-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -870,7 +906,7 @@ 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.02 seconds) -Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.02 seconds +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.01 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.02 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.02 seconds) @@ -899,7 +935,7 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 -Time (CPU seconds): 0.02 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all @@ -909,7 +945,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/258a2c2b88b44e6a8f7b31424be5e205-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/258a2c2b88b44e6a8f7b31424be5e205-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/479f6101fef04eecab18fefaefadd1cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/479f6101fef04eecab18fefaefadd1cb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -989,33 +1025,33 @@ 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.19 seconds) -Cbc0038I After 0.19 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.19 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.13 seconds) +Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.12 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.13 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.025 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.008 seconds - new frequency is -100 +Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.022 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.041 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.007 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.021 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 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.66 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.38 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.25 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (0.82 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.025 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.008 seconds) +Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.022 seconds) +Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.070 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.007 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.044 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) -TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.029 seconds) +MixedIntegerRounding2 was tried 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.041 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) +TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.026 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.003 seconds) @@ -1024,149 +1060,110 @@ Objective value: 3208.95704688 Enumerated nodes: 110 Total iterations: 4892 -Time (CPU seconds): 0.89 -Time (Wallclock seconds): 1.26 +Time (CPU seconds): 0.80 +Time (Wallclock seconds): 0.83 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.89 (Wallclock seconds): 1.26 +Total time (CPU seconds): 0.80 (Wallclock seconds): 0.83 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cf92418fd1cc4d9e9369320ba2d9d46b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf92418fd1cc4d9e9369320ba2d9d46b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5682d964833a4f1dbfe218461851f830-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5682d964833a4f1dbfe218461851f830-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1655 RHS -At line 1876 BOUNDS -At line 2087 ENDATA +At line 1656 RHS +At line 1877 BOUNDS +At line 2088 ENDATA Problem MODEL has 220 rows, 210 columns and 800 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -144.206 - 0.00 seconds -Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 800 elements +Continuous objective value is -162.238 - 0.00 seconds +Cgl0004I processed model has 209 rows, 200 columns (200 integer (200 of which binary)) and 760 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 1 integers unsatisfied sum - 0.176471 -Cbc0038I Pass 1: suminf. 0.11392 (1) obj. -144.146 iterations 95 -Cbc0038I Solution found of -141 -Cbc0038I Before mini branch and bound, 208 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 1 rows 2 columns -Cbc0038I Mini branch and bound improved solution from -141 to -142.6 (0.01 seconds) -Cbc0038I Round again with cutoff of -142.85 -Cbc0038I Reduced cost fixing fixed 41 variables on major pass 2 -Cbc0038I Pass 2: suminf. 0.11392 (1) obj. -144.146 iterations 0 -Cbc0038I Pass 3: suminf. 0.47887 (1) obj. -142.85 iterations 6 -Cbc0038I Pass 4: suminf. 0.55859 (2) obj. -142.85 iterations 63 -Cbc0038I Pass 5: suminf. 0.50000 (2) obj. -142.85 iterations 3 -Cbc0038I Pass 6: suminf. 0.38462 (1) obj. -142.85 iterations 82 -Cbc0038I Pass 7: suminf. 0.11392 (1) obj. -143.196 iterations 33 -Cbc0038I Pass 8: suminf. 0.21127 (1) obj. -142.85 iterations 6 -Cbc0038I Pass 9: suminf. 0.42045 (2) obj. -142.85 iterations 61 -Cbc0038I Pass 10: suminf. 0.11392 (1) obj. -143.046 iterations 66 -Cbc0038I Pass 11: suminf. 0.16901 (1) obj. -142.85 iterations 3 -Cbc0038I Pass 12: suminf. 0.27451 (2) obj. -142.85 iterations 64 -Cbc0038I Pass 13: suminf. 0.27451 (2) obj. -142.85 iterations 4 -Cbc0038I Pass 14: suminf. 0.38462 (1) obj. -142.85 iterations 89 -Cbc0038I Pass 15: suminf. 0.11392 (1) obj. -143.196 iterations 30 -Cbc0038I Pass 16: suminf. 0.21127 (1) obj. -142.85 iterations 7 -Cbc0038I Pass 17: suminf. 0.21519 (2) obj. -142.85 iterations 65 -Cbc0038I Pass 18: suminf. 0.11392 (1) obj. -142.896 iterations 62 -Cbc0038I Pass 19: suminf. 0.12676 (1) obj. -142.85 iterations 5 -Cbc0038I Pass 20: suminf. 0.50505 (2) obj. -142.85 iterations 59 -Cbc0038I Pass 21: suminf. 0.11392 (1) obj. -142.996 iterations 58 -Cbc0038I Pass 22: suminf. 0.15493 (1) obj. -142.85 iterations 4 -Cbc0038I Pass 23: suminf. 0.55080 (2) obj. -142.85 iterations 57 -Cbc0038I Pass 24: suminf. 0.48824 (2) obj. -142.85 iterations 5 -Cbc0038I Pass 25: suminf. 0.11392 (1) obj. -142.946 iterations 63 -Cbc0038I Pass 26: suminf. 0.14085 (1) obj. -142.85 iterations 3 -Cbc0038I Pass 27: suminf. 0.52288 (2) obj. -142.85 iterations 59 -Cbc0038I Pass 28: suminf. 0.51961 (2) obj. -142.85 iterations 10 -Cbc0038I Pass 29: suminf. 0.11392 (1) obj. -142.996 iterations 67 -Cbc0038I Pass 30: suminf. 0.15493 (1) obj. -142.85 iterations 4 -Cbc0038I Pass 31: suminf. 0.43651 (2) obj. -142.85 iterations 59 -Cbc0038I Rounding solution of -143.1 is better than previous of -142.6 - -Cbc0038I Before mini branch and bound, 192 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 1 rows 5 columns -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) -Cbc0038I Round again with cutoff of -143.4 -Cbc0038I Reduced cost fixing fixed 58 variables on major pass 3 -Cbc0038I Pass 31: suminf. 0.11392 (1) obj. -144.146 iterations 0 -Cbc0038I Pass 32: suminf. 0.32394 (1) obj. -143.4 iterations 6 -Cbc0038I Pass 33: suminf. 0.54202 (2) obj. -143.4 iterations 61 -Cbc0038I Pass 34: suminf. 0.11392 (1) obj. -143.596 iterations 63 -Cbc0038I Pass 35: suminf. 0.16901 (1) obj. -143.4 iterations 5 -Cbc0038I Pass 36: suminf. 0.27807 (2) obj. -143.4 iterations 70 -Cbc0038I Pass 37: suminf. 0.11852 (2) obj. -143.4 iterations 55 -Cbc0038I Pass 38: suminf. 0.20513 (1) obj. -143.4 iterations 80 -Cbc0038I Pass 39: suminf. 0.36275 (2) obj. -143.4 iterations 38 -Cbc0038I Pass 40: suminf. 0.11852 (2) obj. -143.4 iterations 113 -Cbc0038I Pass 41: suminf. 0.20513 (1) obj. -143.4 iterations 80 -Cbc0038I Pass 42: suminf. 0.39331 (2) obj. -143.4 iterations 35 -Cbc0038I Pass 43: suminf. 0.11392 (1) obj. -143.596 iterations 57 -Cbc0038I Pass 44: suminf. 0.16901 (1) obj. -143.4 iterations 7 -Cbc0038I Pass 45: suminf. 0.54762 (2) obj. -143.4 iterations 62 -Cbc0038I Pass 46: suminf. 0.17037 (2) obj. -143.4 iterations 17 -Cbc0038I Pass 47: suminf. 0.17949 (1) obj. -143.4 iterations 77 -Cbc0038I Pass 48: suminf. 0.63802 (2) obj. -143.4 iterations 41 -Cbc0038I Pass 49: suminf. 0.11392 (1) obj. -143.546 iterations 67 -Cbc0038I Pass 50: suminf. 0.15493 (1) obj. -143.4 iterations 3 -Cbc0038I Pass 51: suminf. 0.32353 (2) obj. -143.4 iterations 63 -Cbc0038I Pass 52: suminf. 0.32353 (2) obj. -143.4 iterations 1 -Cbc0038I Pass 53: suminf. 0.30769 (1) obj. -143.4 iterations 91 -Cbc0038I Pass 54: suminf. 0.11392 (1) obj. -143.596 iterations 30 -Cbc0038I Pass 55: suminf. 0.16901 (1) obj. -143.4 iterations 4 -Cbc0038I Pass 56: suminf. 0.87603 (2) obj. -143.4 iterations 56 -Cbc0038I Pass 57: suminf. 0.11392 (1) obj. -143.846 iterations 57 -Cbc0038I Pass 58: suminf. 0.23944 (1) obj. -143.4 iterations 4 -Cbc0038I Pass 59: suminf. 0.52941 (2) obj. -143.4 iterations 66 -Cbc0038I Pass 60: suminf. 0.11392 (1) obj. -143.446 iterations 67 +Cbc0038I Initial state - 22 integers unsatisfied sum - 7.13155 +Cbc0038I Solution found of -158.65 +Cbc0038I Before mini branch and bound, 178 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 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 -159.1 +Cbc0038I Reduced cost fixing fixed 3 variables on major pass 2 +Cbc0038I Pass 1: suminf. 0.19149 (1) obj. -159.1 iterations 123 +Cbc0038I Pass 2: suminf. 0.35294 (1) obj. -159.479 iterations 20 +Cbc0038I Pass 3: suminf. 7.90326 (18) obj. -159.1 iterations 89 +Cbc0038I Pass 4: suminf. 5.56348 (21) obj. -159.1 iterations 38 +Cbc0038I Pass 5: suminf. 4.63740 (23) obj. -159.1 iterations 6 +Cbc0038I Pass 6: suminf. 4.63740 (23) obj. -159.1 iterations 5 +Cbc0038I Pass 7: suminf. 3.40843 (16) obj. -159.1 iterations 84 +Cbc0038I Pass 8: suminf. 0.75440 (3) obj. -159.1 iterations 11 +Cbc0038I Pass 9: suminf. 0.61646 (3) obj. -159.1 iterations 15 +Cbc0038I Pass 10: suminf. 0.74048 (2) obj. -159.1 iterations 117 +Cbc0038I Pass 11: suminf. 0.62586 (3) obj. -159.1 iterations 15 +Cbc0038I Pass 12: suminf. 0.48803 (2) obj. -159.1 iterations 108 +Cbc0038I Pass 13: suminf. 0.52727 (2) obj. -159.1 iterations 37 +Cbc0038I Pass 14: suminf. 0.94807 (20) obj. -159.1 iterations 66 +Cbc0038I Pass 15: suminf. 0.77647 (3) obj. -159.1 iterations 7 +Cbc0038I Pass 16: suminf. 5.96354 (18) obj. -159.1 iterations 21 +Cbc0038I Pass 17: suminf. 0.94035 (3) obj. -159.1 iterations 14 +Cbc0038I Pass 18: suminf. 0.42420 (2) obj. -159.1 iterations 91 +Cbc0038I Pass 19: suminf. 0.58182 (2) obj. -159.1 iterations 24 +Cbc0038I Pass 20: suminf. 5.14516 (18) obj. -159.1 iterations 63 +Cbc0038I Pass 21: suminf. 1.05704 (3) obj. -159.1 iterations 12 +Cbc0038I Pass 22: suminf. 0.44548 (2) obj. -159.1 iterations 99 +Cbc0038I Pass 23: suminf. 0.56364 (2) obj. -159.1 iterations 36 +Cbc0038I Pass 24: suminf. 2.14988 (21) obj. -159.1 iterations 78 +Cbc0038I Pass 25: suminf. 1.12919 (3) obj. -159.1 iterations 5 +Cbc0038I Pass 26: suminf. 0.56879 (3) obj. -159.1 iterations 54 +Cbc0038I Pass 27: suminf. 0.85467 (2) obj. -159.1 iterations 118 +Cbc0038I Pass 28: suminf. 1.01292 (20) obj. -159.1 iterations 21 +Cbc0038I Pass 29: suminf. 0.88615 (3) obj. -159.1 iterations 8 +Cbc0038I Pass 30: suminf. 0.61246 (2) obj. -159.1 iterations 121 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 192 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 1 rows 5 columns -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -143.1 - took 0.04 seconds -Cbc0012I Integer solution of -143.1 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0038I Full problem 220 rows 210 columns, reduced to 1 rows 2 columns -Cbc0031I 3 added rows had average density of 11.666667 -Cbc0013I At root node, 52 cuts changed objective from -144.20588 to -143.1 in 2 passes -Cbc0014I Cut generator 0 (Probing) - 41 row cuts average 2.5 elements, 2 column cuts (2 active) in 0.001 seconds - new frequency is 1 +Cbc0038I Before mini branch and bound, 157 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 18 rows 25 columns +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of -158.65 - took 0.02 seconds +Cbc0012I Integer solution of -158.65 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0031I 11 added rows had average density of 11.727273 +Cbc0013I At root node, 30 cuts changed objective from -162.23786 to -158.69375 in 1 passes +Cbc0014I Cut generator 0 (Probing) - 10 row cuts average 15.0 elements, 6 column cuts (6 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 15.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 4 row cuts average 6.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 7 row cuts average 7.4 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) - 8 row cuts average 9.9 elements, 0 column cuts (0 active) in 0.001 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 -143.0999999999999, took 16 iterations and 0 nodes (0.06 seconds) -Cbc0035I Maximum depth 0, 82 variables fixed on reduced cost -Cuts at root node changed objective from -144.206 to -143.1 -Probing was tried 2 times and created 43 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -Gomory was tried 2 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 2 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 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 8 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -ZeroHalf was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 9 row cuts average 17.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 7 (ZeroHalf) - 3 row cuts average 23.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective -158.65, took 0 iterations and 0 nodes (0.04 seconds) +Cbc0035I Maximum depth 0, 3 variables fixed on reduced cost +Cuts at root node changed objective from -162.238 to -158.694 +Probing was tried 1 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 1 times and created 7 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 9 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +ZeroHalf was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -143.10000000 +Objective value: -158.65000000 Enumerated nodes: 0 -Total iterations: 16 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.06 +Total iterations: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 +Total time (CPU seconds): 0.04 (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/cf1f66012d7545f6ba1b68759f40c906-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf1f66012d7545f6ba1b68759f40c906-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0d51349c68534962b207c186feaccc82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d51349c68534962b207c186feaccc82-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1178,132 +1175,149 @@ 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 65 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.994982 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 130 iterations 3 -Cbc0038I Solution found of 130 -Cbc0038I Relaxing continuous gives 130 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.49925 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 72.5 iterations 3 +Cbc0038I Solution found of 72.5 +Cbc0038I Relaxing continuous gives 72.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) -Cbc0038I Round again with cutoff of 117 -Cbc0038I Pass 2: suminf. 0.05579 (1) obj. 117 iterations 1 -Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 117 iterations 3 -Cbc0038I Solution found of 117 -Cbc0038I Relaxing continuous gives 103 -Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns -Cbc0038I Mini branch and bound improved solution from 103 to 70 (0.00 seconds) -Cbc0038I Round again with cutoff of 56 -Cbc0038I Pass 4: suminf. 0.31760 (1) obj. 56 iterations 0 -Cbc0038I Pass 5: suminf. 0.17669 (1) obj. 56 iterations 4 -Cbc0038I Pass 6: suminf. 0.43574 (2) obj. 56 iterations 3 -Cbc0038I Pass 7: suminf. 0.10902 (1) obj. 56 iterations 3 -Cbc0038I Pass 8: suminf. 0.00000 (0) obj. 56 iterations 2 -Cbc0038I Solution found of 56 -Cbc0038I Relaxing continuous gives 43 -Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 12 columns -Cbc0038I Mini branch and bound improved solution from 43 to 43 (0.01 seconds) -Cbc0038I Round again with cutoff of 30.1 -Cbc0038I Pass 9: suminf. 0.42876 (1) obj. 30.1 iterations 0 -Cbc0038I Pass 10: suminf. 0.30884 (2) obj. 30.1 iterations 4 -Cbc0038I Pass 11: suminf. 0.42876 (1) obj. 30.1 iterations 3 -Cbc0038I Pass 12: suminf. 0.18083 (1) obj. 30.1 iterations 5 -Cbc0038I Pass 13: suminf. 0.00000 (0) obj. 30.1 iterations 3 -Cbc0038I Solution found of 30.1 -Cbc0038I Relaxing continuous gives 18 -Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 12 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I Round again with cutoff of 12.6 -Cbc0038I Pass 14: suminf. 0.50499 (2) obj. 12.6 iterations 1 -Cbc0038I Pass 15: suminf. 0.52708 (2) obj. 12.6 iterations 3 -Cbc0038I Pass 16: suminf. 0.22821 (2) obj. 12.6 iterations 2 -Cbc0038I Pass 17: suminf. 0.62526 (3) obj. 12.6 iterations 3 -Cbc0038I Pass 18: suminf. 0.73213 (3) obj. 12.6 iterations 8 -Cbc0038I Pass 19: suminf. 0.41194 (3) obj. 12.6 iterations 5 -Cbc0038I Pass 20: suminf. 0.97932 (3) obj. 12.6 iterations 3 -Cbc0038I Pass 21: suminf. 0.57133 (3) obj. 12.6 iterations 2 -Cbc0038I Pass 22: suminf. 0.89790 (2) obj. 12.6 iterations 5 -Cbc0038I Pass 23: suminf. 0.26619 (2) obj. 12.6 iterations 4 -Cbc0038I Pass 24: suminf. 0.60536 (3) obj. 12.6 iterations 3 -Cbc0038I Pass 25: suminf. 0.09784 (2) obj. 12.6 iterations 9 -Cbc0038I Pass 26: suminf. 0.09784 (2) obj. 12.6 iterations 0 -Cbc0038I Pass 27: suminf. 0.77172 (3) obj. 12.6 iterations 4 -Cbc0038I Pass 28: suminf. 0.27531 (3) obj. 12.6 iterations 2 -Cbc0038I Pass 29: suminf. 0.77337 (2) obj. 12.6 iterations 5 -Cbc0038I Pass 30: suminf. 0.62812 (3) obj. 12.6 iterations 3 -Cbc0038I Pass 31: suminf. 0.63796 (3) obj. 12.6 iterations 9 -Cbc0038I Pass 32: suminf. 0.20223 (3) obj. 12.6 iterations 4 -Cbc0038I Pass 33: suminf. 0.89275 (3) obj. 12.6 iterations 5 -Cbc0038I Pass 34: suminf. 0.25320 (2) obj. 12.6 iterations 6 -Cbc0038I Pass 35: suminf. 0.13308 (1) obj. 12.6 iterations 5 -Cbc0038I Pass 36: suminf. 0.22782 (1) obj. 12.6 iterations 3 -Cbc0038I Pass 37: suminf. 0.49776 (2) obj. 12.6 iterations 6 -Cbc0038I Pass 38: suminf. 0.25814 (2) obj. 12.6 iterations 4 -Cbc0038I Pass 39: suminf. 0.49776 (2) obj. 12.6 iterations 4 -Cbc0038I Pass 40: suminf. 0.08850 (3) obj. 12.6 iterations 4 -Cbc0038I Pass 41: suminf. 0.06061 (2) obj. 12.6 iterations 3 -Cbc0038I Pass 42: suminf. 0.54755 (3) obj. 12.6 iterations 3 -Cbc0038I Pass 43: suminf. 0.58977 (3) obj. 12.6 iterations 11 +Cbc0038I Mini branch and bound improved solution from 72.5 to 72.5 (0.00 seconds) +Cbc0038I Round again with cutoff of 65.25 +Cbc0038I Pass 2: suminf. 0.02746 (1) obj. 65.25 iterations 1 +Cbc0038I Pass 3: suminf. 0.47822 (1) obj. 65.25 iterations 3 +Cbc0038I Pass 4: suminf. 0.61326 (3) obj. 65.25 iterations 7 +Cbc0038I Pass 5: suminf. 0.20843 (2) obj. 65.25 iterations 3 +Cbc0038I Pass 6: suminf. 0.42814 (2) obj. 65.25 iterations 5 +Cbc0038I Pass 7: suminf. 0.00000 (0) obj. 65.25 iterations 3 +Cbc0038I Solution found of 65.25 +Cbc0038I Relaxing continuous gives 51.5 +Cbc0038I Before mini branch and bound, 10 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0038I Mini branch and bound improved solution from 51.5 to 13.5 (0.01 seconds) +Cbc0038I Round again with cutoff of 10.8 +Cbc0038I Pass 8: suminf. 0.39025 (2) obj. 10.8 iterations 1 +Cbc0038I Pass 9: suminf. 0.73297 (3) obj. 10.8 iterations 2 +Cbc0038I Pass 10: suminf. 0.47926 (1) obj. 10.8 iterations 4 +Cbc0038I Pass 11: suminf. 1.19863 (3) obj. 10.8 iterations 10 +Cbc0038I Pass 12: suminf. 0.48331 (3) obj. 10.8 iterations 5 +Cbc0038I Pass 13: suminf. 0.71161 (3) obj. 10.8 iterations 3 +Cbc0038I Pass 14: suminf. 0.71161 (3) obj. 10.8 iterations 0 +Cbc0038I Pass 15: suminf. 1.12625 (3) obj. 10.8 iterations 4 +Cbc0038I Pass 16: suminf. 0.82948 (3) obj. 10.8 iterations 1 +Cbc0038I Pass 17: suminf. 0.57806 (3) obj. 10.8 iterations 1 +Cbc0038I Pass 18: suminf. 0.26882 (1) obj. 10.8 iterations 6 +Cbc0038I Pass 19: suminf. 0.35341 (1) obj. 10.8 iterations 4 +Cbc0038I Pass 20: suminf. 0.28965 (2) obj. 10.8 iterations 4 +Cbc0038I Pass 21: suminf. 0.50241 (3) obj. 10.8 iterations 2 +Cbc0038I Pass 22: suminf. 0.73622 (3) obj. 10.8 iterations 10 +Cbc0038I Pass 23: suminf. 0.64049 (3) obj. 10.8 iterations 1 +Cbc0038I Pass 24: suminf. 0.99730 (3) obj. 10.8 iterations 2 +Cbc0038I Pass 25: suminf. 0.88647 (2) obj. 10.8 iterations 9 +Cbc0038I Pass 26: suminf. 0.86935 (3) obj. 10.8 iterations 2 +Cbc0038I Pass 27: suminf. 0.12291 (2) obj. 10.8 iterations 5 +Cbc0038I Pass 28: suminf. 0.44117 (2) obj. 10.8 iterations 2 +Cbc0038I Pass 29: suminf. 0.44917 (3) obj. 10.8 iterations 9 +Cbc0038I Pass 30: suminf. 0.44917 (3) obj. 10.8 iterations 0 +Cbc0038I Pass 31: suminf. 0.70701 (3) obj. 10.8 iterations 4 +Cbc0038I Pass 32: suminf. 0.50641 (3) obj. 10.8 iterations 1 +Cbc0038I Pass 33: suminf. 0.47393 (2) obj. 10.8 iterations 9 +Cbc0038I Pass 34: suminf. 0.27043 (2) obj. 10.8 iterations 4 +Cbc0038I Pass 35: suminf. 0.46618 (3) obj. 10.8 iterations 2 +Cbc0038I Pass 36: suminf. 0.58643 (3) obj. 10.8 iterations 9 +Cbc0038I Pass 37: suminf. 0.55588 (3) obj. 10.8 iterations 1 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 26 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) -Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 18 - took 0.02 seconds -Cbc0012I Integer solution of 18 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 11 columns -Cbc0031I 3 added rows had average density of 20.333333 -Cbc0013I At root node, 3 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.005 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 558 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 181 row cuts average 11.0 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is 1 +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 improved solution from 13.5 to 6.5 (0.02 seconds) +Cbc0038I Round again with cutoff of 4.54999 +Cbc0038I Pass 37: suminf. 0.44529 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 38: suminf. 0.85553 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 39: suminf. 0.56931 (2) obj. 4.54999 iterations 4 +Cbc0038I Pass 40: suminf. 0.70988 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 41: suminf. 1.05086 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 42: suminf. 0.52168 (3) obj. 4.54999 iterations 6 +Cbc0038I Pass 43: suminf. 0.57348 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 44: suminf. 0.46186 (2) obj. 4.54999 iterations 3 +Cbc0038I Pass 45: suminf. 0.58371 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 46: suminf. 0.65299 (3) obj. 4.54999 iterations 9 +Cbc0038I Pass 47: suminf. 0.46116 (3) obj. 4.54999 iterations 2 +Cbc0038I Pass 48: suminf. 0.78852 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 49: suminf. 0.45393 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 50: suminf. 0.54816 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 51: suminf. 0.55923 (3) obj. 4.54999 iterations 8 +Cbc0038I Pass 52: suminf. 0.36505 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 53: suminf. 0.48423 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 54: suminf. 0.41023 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 55: suminf. 0.47763 (2) obj. 4.54999 iterations 2 +Cbc0038I Pass 56: suminf. 0.32356 (3) obj. 4.54999 iterations 12 +Cbc0038I Pass 57: suminf. 0.27858 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 58: suminf. 0.40728 (3) obj. 4.54999 iterations 1 +Cbc0038I Pass 59: suminf. 0.62676 (3) obj. 4.54999 iterations 8 +Cbc0038I Pass 60: suminf. 0.17812 (2) obj. 4.54999 iterations 8 +Cbc0038I Pass 61: suminf. 0.63688 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 62: suminf. 0.36302 (2) obj. 4.54999 iterations 4 +Cbc0038I Pass 63: suminf. 0.86618 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 64: suminf. 0.59584 (3) obj. 4.54999 iterations 3 +Cbc0038I Pass 65: suminf. 1.15986 (3) obj. 4.54999 iterations 4 +Cbc0038I Pass 66: suminf. 1.15986 (3) obj. 4.54999 iterations 0 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 6.5 - took 0.02 seconds +Cbc0012I Integer solution of 6.5 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 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) - 597 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 417 row cuts average 11.5 elements, 0 column cuts (0 active) in 0.019 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) - 590 row cuts average 17.9 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 34 row cuts average 7.8 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 469 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 18 best solution, best possible 0.5 (0.15 seconds) -Cbc0012I Integer solution of 13 found by DiveCoefficient after 1084 iterations and 3 nodes (0.17 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0004I Integer solution of 7 found after 2739 iterations and 43 nodes (0.30 seconds) -Cbc0016I Integer solution of 5 found by strong branching after 3361 iterations and 60 nodes (0.34 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 562 row cuts average 18.1 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 68 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 460 row cuts average 18.6 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 6.5 best solution, best possible 0.5 (0.13 seconds) +Cbc0016I Integer solution of 4.5 found by strong branching after 1614 iterations and 14 nodes (0.17 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0016I Integer solution of 2 found by strong branching after 6080 iterations and 138 nodes (0.47 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 14 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0004I Integer solution of 3.5 found after 7114 iterations and 159 nodes (0.41 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0010I After 1000 nodes, 4 on tree, 2 best solution, best possible 0.5 (2.99 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0010I After 2000 nodes, 4 on tree, 2 best solution, best possible 0.5 (4.82 seconds) -Cbc0001I Search completed - best objective 2, took 94500 iterations and 9446 nodes (5.21 seconds) -Cbc0032I Strong branching done 14964 times (63022 iterations), fathomed 102 nodes and fixed 424 variables -Cbc0041I Maximum depth 12, 989 variables fixed on reduced cost (complete fathoming 500 times, 7272 nodes taking 24291 iterations) +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 +Cbc0012I Integer solution of 2.5 found by DiveCoefficient after 129594 iterations and 606 nodes (1.49 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 18 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns +Cbc0010I After 1000 nodes, 3 on tree, 2.5 best solution, best possible 0.5 (2.13 seconds) +Cbc0001I Search completed - best objective 2.5, took 286388 iterations and 3897 nodes (3.78 seconds) +Cbc0032I Strong branching done 12116 times (63542 iterations), fathomed 118 nodes and fixed 493 variables +Cbc0041I Maximum depth 12, 860 variables fixed on reduced cost (complete fathoming 250 times, 2291 nodes taking 8750 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.005 seconds) -Gomory was tried 5805 times and created 21847 cuts of which 0 were active after adding rounds of cuts (0.505 seconds) -Knapsack was tried 5807 times and created 7135 cuts of which 0 were active after adding rounds of cuts (0.431 seconds) +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 4627 times and created 17716 cuts of which 0 were active after adding rounds of cuts (0.278 seconds) +Knapsack was tried 4635 times and created 11582 cuts of which 0 were active after adding rounds of cuts (0.505 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 5807 times and created 33001 cuts of which 0 were active after adding rounds of cuts (0.493 seconds) -FlowCover was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -TwoMirCuts was tried 5805 times and created 19437 cuts of which 0 were active after adding rounds of cuts (0.296 seconds) +MixedIntegerRounding2 was tried 4635 times and created 21257 cuts of which 0 were active after adding rounds of cuts (0.324 seconds) +FlowCover was tried 100 times and created 68 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +TwoMirCuts was tried 4627 times and created 14010 cuts of which 0 were active after adding rounds of cuts (0.225 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 2.00000000 -Enumerated nodes: 9446 -Total iterations: 94500 -Time (CPU seconds): 3.67 -Time (Wallclock seconds): 5.22 +Objective value: 2.50000000 +Enumerated nodes: 3897 +Total iterations: 286388 +Time (CPU seconds): 3.71 +Time (Wallclock seconds): 3.78 Option for printingOptions changed from normal to all -Total time (CPU seconds): 3.67 (Wallclock seconds): 5.22 +Total time (CPU seconds): 3.71 (Wallclock seconds): 3.78 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/874fad695d45418d8ebbbb197009c928-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/874fad695d45418d8ebbbb197009c928-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5519a93194784416942423d8a6b50f2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5519a93194784416942423d8a6b50f2c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1326,7 +1340,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/db6d92d3ef554ef6b8dcb2a5b3db8290-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db6d92d3ef554ef6b8dcb2a5b3db8290-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6b017aa3b1f044688be981b8a31c58db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6b017aa3b1f044688be981b8a31c58db-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1353,20 +1367,75 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fd7ba75053af4678b4186c6f952f99dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd7ba75053af4678b4186c6f952f99dd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1a749e61f7814cefaf5a629577ab128c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a749e61f7814cefaf5a629577ab128c-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 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 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 +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 + +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/9b605b9c0b154d739716c485201d7fc9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b605b9c0b154d739716c485201d7fc9-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 14 COLUMNS +At line 85 RHS +At line 95 BOUNDS +At line 113 ENDATA +Problem MODEL has 9 rows, 14 columns and 28 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 15005 - 0.00 seconds +Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.024975 +Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 15005 to 15005 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1378,81 +1447,139 @@ Result - Optimal solution found -Objective value: 0.97000000 +Objective value: 15005.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3d636fc88ef844afa317e1a1039d5745-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/3d636fc88ef844afa317e1a1039d5745-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e710a287bd7e43d5bf1799f1fcc5d9a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e710a287bd7e43d5bf1799f1fcc5d9a7-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 +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 -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 +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.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1455957fd7a946b0a20782bfb5415951-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1455957fd7a946b0a20782bfb5415951-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1ca5ab16efd9412da1c459edb9424de9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ca5ab16efd9412da1c459edb9424de9-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 +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 -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 +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.01 seconds) +Cbc0038I After 0.01 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.01 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 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.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.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/45593f63556c4567831af667510d9d00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/45593f63556c4567831af667510d9d00-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7553093c5a884626888bb002296ca2ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7553093c5a884626888bb002296ca2ea-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 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 -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) +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) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.6 to -1.6 +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) @@ -1464,132 +1591,210 @@ 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 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/07d51db1e8c543318f71b795f0bf067f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07d51db1e8c543318f71b795f0bf067f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/65d4d73029b14ab49a9652c3f128a8aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65d4d73029b14ab49a9652c3f128a8aa-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 +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 -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 +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.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 + Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.04 (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/7c00cd7f33904083ab9d366cb1eacac3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c00cd7f33904083ab9d366cb1eacac3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4402d7742272469c85d8931d0bf180b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4402d7742272469c85d8931d0bf180b5-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 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 -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) +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.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 -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 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.25000000 +Objective value: 0.00000000 Enumerated nodes: 0 -Total iterations: 2 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.04 (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/86d6a10ddd3743eeb5534f8ead3316a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/86d6a10ddd3743eeb5534f8ead3316a6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7ed351f761cb4360ab5c381b0aea827b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7ed351f761cb4360ab5c381b0aea827b-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 +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 -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 +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.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 + 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.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4b44605cf28c470ba43ef55a300ce180-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b44605cf28c470ba43ef55a300ce180-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f281b75619d14731a9d4ae9f2452badf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f281b75619d14731a9d4ae9f2452badf-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 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 -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 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 -1.22143 to -1.22143 +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) @@ -1601,199 +1806,430 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.04 (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/a018dd4c3c9441c3be6d03cb100dd539-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a018dd4c3c9441c3be6d03cb100dd539-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c4e5be16db924e278d91ff67c6e2146b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4e5be16db924e278d91ff67c6e2146b-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 +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 -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 +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) +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 + 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.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0e3b0dd885974ca8af73c86343923d18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e3b0dd885974ca8af73c86343923d18-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/abebc888a0c443ef83e242b5ccdef5d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/abebc888a0c443ef83e242b5ccdef5d8-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 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 -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 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.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 -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 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: -1.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/14de81b7619848fe93c847ac757549d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14de81b7619848fe93c847ac757549d3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/133945601454446b91383ef9cdaeb375-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/133945601454446b91383ef9cdaeb375-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 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, 9 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -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) +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.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 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: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/795315d72490444a8e33b02cbf3e2d88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/795315d72490444a8e33b02cbf3e2d88-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 +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.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.04 (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/bbefdc90effa4f25a2d1413c97ff0109-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bbefdc90effa4f25a2d1413c97ff0109-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 +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) + +Result - Optimal solution found + +Objective value: 0.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/3d7faddaf3984ee1bdf6b9fc4bb04554-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d7faddaf3984ee1bdf6b9fc4bb04554-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 +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) + +Result - Optimal solution found + +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.04 (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/22c779fc85974e259c0886febaea3d2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22c779fc85974e259c0886febaea3d2c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/14dc1390b57e4bb491396306290b2cc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14dc1390b57e4bb491396306290b2cc2-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 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 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 +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.04 seconds) +Cbc0038I After 0.04 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) - 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) +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.04 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 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 - Problem proven infeasible + +No feasible solution found +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/17fd8d361ffd48f791a943c1aa86be49-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17fd8d361ffd48f791a943c1aa86be49-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 +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 +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 +Total iterations: 0 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6bab16f1e3bb43dc89bbccd0a1e1d286-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6bab16f1e3bb43dc89bbccd0a1e1d286-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8d2f41d7f7a24a38a0df176df5527458-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d2f41d7f7a24a38a0df176df5527458-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1807,7 +2243,7 @@ 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.01 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) @@ -1825,10 +2261,33 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 +command line - /usr/bin/cbc /tmp/a687d43f20f94a5783d1de3fb97bda06-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a687d43f20f94a5783d1de3fb97bda06-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.01 +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' """ @@ -1836,7 +2295,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/504aa0076a74429cb42ee7cc0781c295-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/504aa0076a74429cb42ee7cc0781c295-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/866ffdccd249483aa84ee6e99b45ae81-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/866ffdccd249483aa84ee6e99b45ae81-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS @@ -1859,66 +2318,76 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a2ed0ee3f561434a8cdfcad2a5ff443f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2ed0ee3f561434a8cdfcad2a5ff443f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a7a70d8be5c4478ca7b6a23aa4d4ca72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7a70d8be5c4478ca7b6a23aa4d4ca72-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 +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 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.01 seconds) +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 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) +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: 300.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f551838f590740afbfbb02f0340dc2c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f551838f590740afbfbb02f0340dc2c3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/40af9b2f5b924f07aaf6bdaed3b66ce7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40af9b2f5b924f07aaf6bdaed3b66ce7-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.01 seconds) -Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.01 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 251.5 to 251.5 +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) @@ -1930,34 +2399,12 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 8600.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/884d41309ffb4c519638737a34d538a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/884d41309ffb4c519638737a34d538a9-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 @@ -1965,24 +2412,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b902ea3ee1144aa58f87e2b42e60f2c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b902ea3ee1144aa58f87e2b42e60f2c2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f222faf7320540e1b8aeec8efc66b4ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f222faf7320540e1b8aeec8efc66b4ac-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 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 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 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 15005 to 15005 +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) @@ -1994,7 +2440,7 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 8630.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2007,74 +2453,64 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3d9de82d04d44df68740c21c3239d4ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d9de82d04d44df68740c21c3239d4ba-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d5d3555a45e24793a7350d175bb4e9fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5d3555a45e24793a7350d175bb4e9fa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements +At line 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 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Continuous objective value is 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 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 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) +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) +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: 228100.00000000 +Objective value: 8660.00000000 Enumerated nodes: 0 -Total iterations: 10 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ad195777e8424fa9b1d115deba99a2a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad195777e8424fa9b1d115deba99a2a1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b2df348606ba427d9bf1aa27a39a0cd2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2df348606ba427d9bf1aa27a39a0cd2-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 +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 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +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 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.01 seconds) +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 8300 to 8300 +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) @@ -2086,67 +2522,55 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7c7a73aff6024845a1fc428813a0cdec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c7a73aff6024845a1fc428813a0cdec-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8c7449258cfd472fa4918cf114d78c3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c7449258cfd472fa4918cf114d78c3e-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 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, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +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) 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 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) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 8720.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Status: Optimal x = 4.0 @@ -2182,43 +2606,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 = 0.0 -x_2 = 1.0 +x_1 = 1.0 +x_2 = 0.0 x_3 = 1.0 -x_4 = 1.0 +x_4 = 0.0 x_5 = 0.0 -x_6 = 0.0 +x_6 = 1.0 x_7 = 1.0 x_8 = 1.0 x_9 = 1.0 Status: Optimal -s_0 = 1.5 +s_0 = 0.0 s_1 = 0.0 s_2 = 0.0 w_0 = 0.0 -w_1 = 0.5 -w_2 = 0.0 +w_1 = 2.0 +w_2 = 0.5 x_0 = 0.0 -x_1 = 1.0 -x_10 = 1.0 -x_11 = 0.0 -x_12 = 0.0 -x_13 = 0.0 +x_1 = 0.0 +x_10 = 0.0 +x_11 = 1.0 +x_12 = 1.0 +x_13 = 1.0 x_14 = 0.0 -x_15 = 1.0 -x_16 = 0.0 -x_17 = 1.0 +x_15 = 0.0 +x_16 = 1.0 +x_17 = 0.0 x_18 = 0.0 -x_19 = 1.0 +x_19 = 0.0 x_2 = 1.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_9 = 0.0 -objective= 2.0 +objective= 2.5 Status: Optimal x = 4.0 y = -1.0 @@ -2275,64 +2699,76 @@ 8 passed and 0 failed. Test passed. Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.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] +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 -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 +Route_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Infeasible +Solutions Written to sudokuout.txt +Status: Optimal +Solution Written to sudokuout.txt Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -2345,6 +2781,9 @@ Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 @@ -2415,82 +2854,6 @@ production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 -Status: Optimal -Patt_A = 225.0 -Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 -Status: Optimal -Patt_A = 200.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 -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_('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 -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_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1700.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_C_1 = 0.0 -Route_C_2 = 0.0 -Route_C_3 = 100.0 -Route_C_4 = 0.0 -Route_C_5 = 0.0 -Total Cost of Transportation = 8300.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -2526,230 +2889,80 @@ Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 -Production Costs = 246.50000000000003Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/9521c1fcb89143f0adc8d9f8d0d0c058-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9521c1fcb89143f0adc8d9f8d0d0c058-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 251.5 -After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/7113611e691f4fa88ea0b38a257bd738-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7113611e691f4fa88ea0b38a257bd738-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.08571 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) -Cbc0031I 2 added rows had average density of 3.5 -Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.06667 to -1.05 -Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.05000000 -Enumerated nodes: 0 -Total iterations: 4 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/8a544259d4c541f78eaac41d0d575ed3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a544259d4c541f78eaac41d0d575ed3-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 29 ENDATA -Problem MODEL has 3 rows, 7 columns and 8 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements -0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 246.5 -Optimal - objective value 246.5 -After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/598b2a1575234b05b6a98a5cb105defe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/598b2a1575234b05b6a98a5cb105defe-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -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) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/a2105f6d157941cbbc3f7a6b3fb38274-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a2105f6d157941cbbc3f7a6b3fb38274-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 38 RHS -At line 42 BOUNDS -At line 50 ENDATA -Problem MODEL has 3 rows, 7 columns and 8 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 3 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.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 +Production Costs = 246.50000000000003 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 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.0Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/13edb3b8db08405eaab1196978570582-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13edb3b8db08405eaab1196978570582-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/620cf34cff514ee09100280db5ee0410-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/620cf34cff514ee09100280db5ee0410-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 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 -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 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 12 to 12 +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) @@ -2761,36 +2974,36 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8750.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +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/5dc6ed902262421e85458bd5c757b89c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5dc6ed902262421e85458bd5c757b89c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/820a6f6cbe8945bc8ded3e77b607ee59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/820a6f6cbe8945bc8ded3e77b607ee59-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) @@ -2802,7 +3015,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8780.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2815,64 +3028,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/33ead189b7c04d53aa095f5ae057bb9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33ead189b7c04d53aa095f5ae057bb9c-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 -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 -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.01 -Time (Wallclock seconds): 0.02 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/e0624192f15c407d8fb299b54b191b69-pulp.mps mips /tmp/e0624192f15c407d8fb299b54b191b69-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/e0624192f15c407d8fb299b54b191b69-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dc209a6b56ce4d599a18b050d6468c40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc209a6b56ce4d599a18b050d6468c40-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/e0624192f15c407d8fb299b54b191b69-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 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 -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 +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 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) @@ -2884,20 +3056,20 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8810.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.12 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.14 +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/dfe422f7c42e40b0a24dc582f4b24074-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dfe422f7c42e40b0a24dc582f4b24074-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b4300e25d3ef44059731cc277e6ac583-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b4300e25d3ef44059731cc277e6ac583-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2907,13 +3079,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 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 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.01 seconds) +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 8600 to 8600 +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) @@ -2925,20 +3097,20 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8840.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/20ad8fb63bba48a4bb2354f952beffe0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20ad8fb63bba48a4bb2354f952beffe0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3a464eda7b314e29b6a89ac2ed62b7f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a464eda7b314e29b6a89ac2ed62b7f6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2948,13 +3120,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 8630 - 0.00 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 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.01 seconds) +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 8630 to 8630 +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) @@ -2966,20 +3138,20 @@ Result - Optimal solution found -Objective value: 8630.00000000 +Objective value: 8870.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8c158681b411471b9483f670a0c1ef07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c158681b411471b9483f670a0c1ef07-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/957a06cc6812477daaffa999356d7530-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/957a06cc6812477daaffa999356d7530-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2989,13 +3161,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 8660 - 0.00 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 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.01 seconds) +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 8660 to 8660 +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) @@ -3007,36 +3179,37 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5b05b8ac786c436a97736b3ad9cec555-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5b05b8ac786c436a97736b3ad9cec555-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cabf3600c1b3491393f896cc107b95e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cabf3600c1b3491393f896cc107b95e1-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 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 8690 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.01 seconds) +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 8690 to 8690 +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) @@ -3048,36 +3221,33 @@ Result - Optimal solution found -Objective value: 8690.00000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5512715979604f13af0ca0d24dba2db4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5512715979604f13af0ca0d24dba2db4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a756a2721e6544f69f01a73da520f49a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a756a2721e6544f69f01a73da520f49a-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 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.01 seconds) -Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8720 to 8720 +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) @@ -3089,53 +3259,34 @@ Result - Optimal solution found -Objective value: 8720.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f54dcfbafc594fa3b380a1ccd6e66d5d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f54dcfbafc594fa3b380a1ccd6e66d5d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bfaba3767cff4973b22e0e8900261e97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfaba3767cff4973b22e0e8900261e97-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 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 -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) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -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) -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: 8750.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - +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 @@ -3143,23 +3294,28 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0ee7cd7f768b46d2ba312ed4f4492e71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ee7cd7f768b46d2ba312ed4f4492e71-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e9df81f7d5934d10ae010501b237448f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9df81f7d5934d10ae010501b237448f-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 8780 - 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.00 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 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.01 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.06 seconds) +Cbc0038I After 0.06 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.06 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8780 to 8780 +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) @@ -3171,36 +3327,37 @@ Result - Optimal solution found -Objective value: 8780.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/aad5895524a7482e99c2db30a35ef0ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aad5895524a7482e99c2db30a35ef0ee-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c3cfa2d619b44bb1997e84b87ffb37a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3cfa2d619b44bb1997e84b87ffb37a4-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 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 -Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.01 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 8810 to 8810 +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) @@ -3212,50 +3369,62 @@ Result - Optimal solution found -Objective value: 8810.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ad7bf7499e9a4b6392eb8cd42b6f06cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad7bf7499e9a4b6392eb8cd42b6f06cd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/efbe2275d9e2465c95098ed0cf50980f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efbe2275d9e2465c95098ed0cf50980f-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 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) +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 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) +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: 8840.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3266,23 +3435,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8c68980007164cbaa9e46df5ef3df79a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8c68980007164cbaa9e46df5ef3df79a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d460d9ccdb894b09b1c556415e7a78c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d460d9ccdb894b09b1c556415e7a78c0-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.01 seconds) -Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 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) @@ -3294,50 +3463,81 @@ Result - Optimal solution found -Objective value: 8870.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b82e1abca6ec44e6a8be0bbb75d22fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b82e1abca6ec44e6a8be0bbb75d22fae-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2705a23306f248dbaeeb5995a91368c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2705a23306f248dbaeeb5995a91368c1-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 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 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) +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 251.5 +After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/4be0ec430f8b4b6286f8e81b040afdde-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4be0ec430f8b4b6286f8e81b040afdde-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.08571 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) +Cbc0031I 2 added rows had average density of 3.5 +Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8900 to 8900 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from -1.06667 to -1.05 +Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: -1.05000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 4 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3348,195 +3548,152 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3131f8f52ab243d29d69f55e215fe09b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3131f8f52ab243d29d69f55e215fe09b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/debd34356e074bd5878c90b64a734f64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/debd34356e074bd5878c90b64a734f64-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 8 COLUMNS +At line 24 RHS +At line 28 BOUNDS +At line 29 ENDATA +Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -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.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.02 -Time (Wallclock seconds): 0.04 - +Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements +0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 246.5 +Optimal - objective value 246.5 +After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (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/b862e85e58574545b8319f9f8529b460-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b862e85e58574545b8319f9f8529b460-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7eb3a233f7cc402fb4573c6bae480325-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7eb3a233f7cc402fb4573c6bae480325-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 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 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.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) +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 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.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.11 +Total iterations: 6 +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.12 +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/41191a6e9f51425882f17a6fed2d4327-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41191a6e9f51425882f17a6fed2d4327-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f6c119b0810e4047b2064e9bc7547b97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6c119b0810e4047b2064e9bc7547b97-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 8 COLUMNS +At line 38 RHS +At line 42 BOUNDS +At line 50 ENDATA +Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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.11 seconds) -Cbc0038I After 0.11 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.11 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.11 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 +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) +Cbc0031I 1 added rows had average density of 3 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.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 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: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.12 +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.06 (Wallclock seconds): 0.13 +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/72e41d499dac471ea2454b3e9f31e5c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72e41d499dac471ea2454b3e9f31e5c5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/90ab727990d04458bbab1c8ed5bfa8e6-pulp.mps mips /tmp/90ab727990d04458bbab1c8ed5bfa8e6-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/90ab727990d04458bbab1c8ed5bfa8e6-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 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/90ab727990d04458bbab1c8ed5bfa8e6-pulp.mst. +MIPStart values read for 3213 variables. 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 +Continuous objective value is 12 - 0.01 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.05 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) @@ -3548,100 +3705,58 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9d0886ba157846dda8773ae2619f48fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d0886ba157846dda8773ae2619f48fb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cbbb0750507741c7bffcfcf655308411-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cbbb0750507741c7bffcfcf655308411-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 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 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.11 seconds) -Cbc0038I After 0.11 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.11 seconds) -Cbc0001I Search completed - best objective 0, 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 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.11 - +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.06 (Wallclock seconds): 0.12 +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/77c420ac76b34a75a2d6faac67e70d70-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77c420ac76b34a75a2d6faac67e70d70-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/33abfe42519f41d4b902ce5b21c9caa3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/33abfe42519f41d4b902ce5b21c9caa3-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 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 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) +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) @@ -3653,199 +3768,132 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.08 +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.08 +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/9bc6f44efac44bbfb21a969d6754a8e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9bc6f44efac44bbfb21a969d6754a8e0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bfbb80bd59b0462a8267866b04eba333-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfbb80bd59b0462a8267866b04eba333-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 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 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.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 - +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.07 (Wallclock seconds): 0.08 +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/9a89928441a3430783fdbc8a96428142-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a89928441a3430783fdbc8a96428142-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cf4cae6334594cf5aedb98d5daa3bcf0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf4cae6334594cf5aedb98d5daa3bcf0-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 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 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.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) +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.07 +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.05 (Wallclock seconds): 0.08 +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/94ef923fef494bd2884be06814e28cb9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94ef923fef494bd2884be06814e28cb9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e8f4851732f54e599fdbdc0ab8159ae4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8f4851732f54e599fdbdc0ab8159ae4-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 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 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.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 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.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/1280f6fd1a644a3c8436bcb9c5437e43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1280f6fd1a644a3c8436bcb9c5437e43-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a702de6d5db84103bfe0a4b867955d60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a702de6d5db84103bfe0a4b867955d60-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 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, 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) +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) @@ -3857,182 +3905,140 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 +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.04 +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/c74e93eb2c874d499e21e7b3f176e3fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c74e93eb2c874d499e21e7b3f176e3fb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a0059dd7b2a24222804188597b9179b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0059dd7b2a24222804188597b9179b7-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 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, 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) - -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 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/f00e6f62f4c640d3a7266f07a27ea55e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f00e6f62f4c640d3a7266f07a27ea55e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/94776185a93341209ac659287f8101c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94776185a93341209ac659287f8101c4-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 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 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 -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: 1 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.04 +Total iterations: 6 +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.04 +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/8e565baa9a0b48d88484e216e8138863-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e565baa9a0b48d88484e216e8138863-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/51173adf5f5e4f31b249503798215d4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/51173adf5f5e4f31b249503798215d4e-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 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 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 -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) +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 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.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 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -5370,103 +5376,10 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 29.684s +Ran 1005 tests in 26.452s OK (skipped=885) -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 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 -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 -Solution Written to sudokuout.txt -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 -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 @@ -5547,19 +5460,120 @@ Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 Status: Optimal +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 +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 +Patt_A = 200.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 +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 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Infeasible -Solutions Written to sudokuout.txt +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_A_D = 0.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +P0 = [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 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 @@ -5828,90 +5842,90 @@ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12 creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /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__/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__/__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__/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__/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__/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__/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__/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__/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/__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__/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/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/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/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/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/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/__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/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/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 +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__/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__/__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__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/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__ 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/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/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/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__/__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__/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/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/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/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/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/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__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__/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/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/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/__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.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 -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.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 +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.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/mps_lp.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/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/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/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/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__/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__/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__/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/__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/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/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/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/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/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/xpress_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/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/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/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/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/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/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/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/__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/solverdir/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/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/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/__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/utilities.py to utilities.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/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/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/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/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/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/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/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/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/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/__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/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/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/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/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/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/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/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 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 @@ -5941,12 +5955,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/17416/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/17416/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/9865 and its subdirectories -I: Current time: Mon Oct 14 15:55:32 -12 2024 -I: pbuilder-time-stamp: 1728964532 +I: removing directory /srv/workspace/pbuilder/17416 and its subdirectories +I: Current time: Tue Nov 18 00:19:40 +14 2025 +I: pbuilder-time-stamp: 1763374780