Diff of the two buildlogs: -- --- b1/build.log 2025-03-02 09:03:42.289670702 +0000 +++ b2/build.log 2025-03-02 09:05:54.063711250 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Sat Mar 1 21:02:24 -12 2025 -I: pbuilder-time-stamp: 1740906144 +I: Current time: Sun Apr 5 05:26:45 +14 2026 +I: pbuilder-time-stamp: 1775316405 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -26,51 +26,83 @@ 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/2485781/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/1193193/tmp/hooks/D01_modify_environment starting +debug: Running on infom02-amd64. +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 Apr 4 15:26 /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/1193193/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/1193193/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='amd64' - DEBIAN_FRONTEND='noninteractive' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="37" [3]="1" [4]="release" [5]="x86_64-pc-linux-gnu") + BASH_VERSION='5.2.37(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=amd64 + DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='amd64' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='90d79e0c841d4992aa97d27b2f072ee5' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='2485781' - PS1='# ' - PS2='> ' + INVOCATION_ID=4747547d0e714fcdaa12586c468d88f8 + LANG=C + LANGUAGE=et_EE:et + LC_ALL=C + MACHTYPE=x86_64-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=1193193 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.6heFvdCC/pbuilderrc_TMQr --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.6heFvdCC/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='109' - 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.6heFvdCC/pbuilderrc_pZru --distribution unstable --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.6heFvdCC/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=109 + 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 infom01-amd64 6.1.0-31-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.128-1 (2025-02-07) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.12.9+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.12.9-1~bpo12+1 (2025-01-19) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Nov 22 14:40 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/2485781/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Nov 22 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/1193193/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -183,7 +215,7 @@ Get: 65 http://deb.debian.org/debian unstable/main amd64 dh-python all 6.20250108 [113 kB] Get: 66 http://deb.debian.org/debian unstable/main amd64 python3-all amd64 3.13.2-1 [1048 B] Get: 67 http://deb.debian.org/debian unstable/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 34.8 MB in 0s (112 MB/s) +Fetched 34.8 MB in 0s (77.8 MB/s) Preconfiguring packages ... Selecting previously unselected package libpython3.13-minimal:amd64. (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 ... 19778 files and directories currently installed.) @@ -412,8 +444,8 @@ Setting up tzdata (2025a-2) ... Current default time zone: 'Etc/UTC' -Local time is now: Sun Mar 2 09:03:04 UTC 2025. -Universal Time is now: Sun Mar 2 09:03:04 UTC 2025. +Local time is now: Sat Apr 4 15:27:44 UTC 2026. +Universal Time is now: Sat Apr 4 15:27:44 UTC 2026. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -480,7 +512,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/1193193/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/1193193/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 @@ -516,12 +552,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO @@ -722,7 +758,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c403d51a3afe42d283924e9483a931e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c403d51a3afe42d283924e9483a931e7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e044d959cd1b4961978e625e680533c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e044d959cd1b4961978e625e680533c1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -745,7 +781,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/803596fcdd104a56b866a0177b774a77-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/803596fcdd104a56b866a0177b774a77-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a419be54b0224040b21baf4b4c8d97d6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a419be54b0224040b21baf4b4c8d97d6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -776,7 +812,7 @@ Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.00 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 @@ -795,7 +831,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 @@ -830,11 +866,11 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 14 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I After 0.01 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.01 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.01 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.03 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -843,7 +879,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -860,17 +896,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.21 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c2f2a28f00b9405ea28fb4e880124cf6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2f2a28f00b9405ea28fb4e880124cf6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/091ca6ccce904295ae4382e4b5ba5d2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/091ca6ccce904295ae4382e4b5ba5d2b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -915,7 +951,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.05 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.07 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -950,98 +986,144 @@ 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.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.08 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.08 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 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.017 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.029 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.023 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.040 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 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.013 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.28 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.025 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.40 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 33 rows 47 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (0.56 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (0.78 seconds) Cbc0032I Strong branching done 966 times (8486 iterations), fathomed 27 nodes and fixed 39 variables Cbc0035I Maximum depth 13, 186 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 -Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.044 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.062 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.033 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) -TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) +MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.045 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) +TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 94 Total iterations: 4740 -Time (CPU seconds): 0.55 -Time (Wallclock seconds): 0.57 +Time (CPU seconds): 0.78 +Time (Wallclock seconds): 0.79 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.56 (Wallclock seconds): 0.57 +Total time (CPU seconds): 0.78 (Wallclock seconds): 0.80 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7bf0d9aa20c840228a5e2c517d623ef6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bf0d9aa20c840228a5e2c517d623ef6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bc7ed4439d5245eb9806b9ad020c56f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc7ed4439d5245eb9806b9ad020c56f8-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 -Problem MODEL has 220 rows, 210 columns and 799 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -91.6 - 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 - 0 integers unsatisfied sum - 7.32747e-15 -Cbc0038I Solution found of -91.6 -Cbc0038I Before mini branch and bound, 200 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) -Cbc0038I After 0.00 seconds - Feasibility pump exiting with objective of -91.6 - took 0.00 seconds -Cbc0012I Integer solution of -91.6 found by feasibility pump after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -91.59999999999999, 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 -91.6 to -91.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) -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) +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 -139.97 - 0.00 seconds +Cgl0004I processed model has 165 rows, 160 columns (160 integer (160 of which binary)) and 600 elements +Cbc0038I Initial state - 16 integers unsatisfied sum - 5.67089 +Cbc0038I Pass 1: suminf. 0.37838 (1) obj. -138.611 iterations 66 +Cbc0038I Solution found of -136 +Cbc0038I Before mini branch and bound, 144 integers at bound fixed and 0 continuous +Cbc0038I Full problem 165 rows 160 columns, reduced to 0 rows 0 columns +Cbc0038I Mini branch and bound improved solution from -136 to -139.55 (0.01 seconds) +Cbc0038I Round again with cutoff of -139.592 +Cbc0038I Reduced cost fixing fixed 72 variables on major pass 2 +Cbc0038I Pass 2: suminf. 4.19996 (16) obj. -139.592 iterations 38 +Cbc0038I Pass 3: suminf. 1.03313 (16) obj. -139.592 iterations 17 +Cbc0038I Pass 4: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 5: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 6: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 7: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 8: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 9: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 10: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 11: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 12: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 13: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 14: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 15: suminf. 1.25913 (15) obj. -139.592 iterations 1 +Cbc0038I Pass 16: suminf. 5.17557 (15) obj. -139.592 iterations 3 +Cbc0038I Pass 17: suminf. 4.33437 (15) obj. -139.592 iterations 4 +Cbc0038I Pass 18: suminf. 4.33437 (15) obj. -139.592 iterations 0 +Cbc0038I Pass 19: suminf. 1.03313 (16) obj. -139.592 iterations 24 +Cbc0038I Pass 20: suminf. 1.03313 (16) obj. -139.592 iterations 1 +Cbc0038I Pass 21: suminf. 1.03313 (16) obj. -139.592 iterations 1 +Cbc0038I Pass 22: suminf. 1.25913 (15) obj. -139.592 iterations 2 +Cbc0038I Pass 23: suminf. 1.03313 (16) obj. -139.592 iterations 2 +Cbc0038I Pass 24: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 25: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 26: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 27: suminf. 1.03313 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 28: suminf. 5.45849 (16) obj. -139.592 iterations 3 +Cbc0038I Pass 29: suminf. 4.19996 (16) obj. -139.592 iterations 4 +Cbc0038I Pass 30: suminf. 4.19996 (16) obj. -139.592 iterations 0 +Cbc0038I Pass 31: suminf. 1.03313 (16) obj. -139.592 iterations 19 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 144 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of -139.55 - took 0.01 seconds +Cbc0012I Integer solution of -139.55 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) +Cbc0031I 1 added rows had average density of 3 +Cbc0013I At root node, 7 cuts changed objective from -139.96962 to -139.55 in 1 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) - 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) - 2 row cuts average 3.5 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) - 4 row cuts average 7.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 7 (ZeroHalf) - 1 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -139.55, took 0 iterations and 0 nodes (0.02 seconds) +Cbc0035I Maximum depth 0, 71 variables fixed on reduced cost +Cuts at root node changed objective from -139.97 to -139.55 +Probing was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 1 times and created 2 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 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -91.60000000 +Objective value: -139.55000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +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.01 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bb6e4f1d3a3c446da9811b9457d72188-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bb6e4f1d3a3c446da9811b9457d72188-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1dd9ff8cbf6b4697abb798c9229768ec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1dd9ff8cbf6b4697abb798c9229768ec-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1053,125 +1135,153 @@ Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.773687 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 141.5 iterations 4 -Cbc0038I Solution found of 141.5 -Cbc0038I Relaxing continuous gives 141.5 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.816174 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 66 iterations 3 +Cbc0038I Solution found of 66 +Cbc0038I Relaxing continuous gives 66 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 127.35 -Cbc0038I Pass 2: suminf. 0.05615 (1) obj. 127.35 iterations 1 -Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 127.35 iterations 3 -Cbc0038I Solution found of 127.35 -Cbc0038I Relaxing continuous gives 110.5 -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 110.5 to 67.5 (0.00 seconds) -Cbc0038I Round again with cutoff of 54 -Cbc0038I Pass 4: suminf. 0.34722 (1) obj. 54 iterations 0 -Cbc0038I Pass 5: suminf. 0.22421 (1) obj. 54 iterations 3 -Cbc0038I Pass 6: suminf. 0.03247 (1) obj. 54 iterations 10 -Cbc0038I Pass 7: suminf. 0.00000 (0) obj. 54 iterations 1 -Cbc0038I Solution found of 54 -Cbc0038I Relaxing continuous gives 46.5 -Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0038I Mini branch and bound improved solution from 46.5 to 11.5 (0.00 seconds) -Cbc0038I Round again with cutoff of 8.04999 -Cbc0038I Pass 8: suminf. 0.58494 (3) obj. 8.04999 iterations 2 -Cbc0038I Pass 9: suminf. 0.98664 (3) obj. 8.04999 iterations 4 -Cbc0038I Pass 10: suminf. 0.71171 (2) obj. 8.04999 iterations 2 -Cbc0038I Pass 11: suminf. 0.23929 (2) obj. 8.04999 iterations 3 -Cbc0038I Pass 12: suminf. 0.65505 (3) obj. 8.04999 iterations 3 -Cbc0038I Pass 13: suminf. 0.63544 (3) obj. 8.04999 iterations 7 -Cbc0038I Pass 14: suminf. 0.60636 (2) obj. 8.04999 iterations 1 -Cbc0038I Pass 15: suminf. 0.72607 (3) obj. 8.04999 iterations 3 -Cbc0038I Pass 16: suminf. 0.32114 (3) obj. 8.04999 iterations 3 -Cbc0038I Pass 17: suminf. 1.25365 (3) obj. 8.04999 iterations 4 -Cbc0038I Pass 18: suminf. 0.45588 (3) obj. 8.04999 iterations 3 -Cbc0038I Pass 19: suminf. 0.48381 (3) obj. 8.04999 iterations 5 -Cbc0038I Pass 20: suminf. 0.35485 (2) obj. 8.04999 iterations 3 -Cbc0038I Pass 21: suminf. 0.50436 (2) obj. 8.04999 iterations 3 -Cbc0038I Pass 22: suminf. 0.91490 (3) obj. 8.04999 iterations 5 -Cbc0038I Pass 23: suminf. 0.37556 (2) obj. 8.04999 iterations 5 -Cbc0038I Pass 24: suminf. 0.25374 (3) obj. 8.04999 iterations 5 -Cbc0038I Pass 25: suminf. 0.37556 (2) obj. 8.04999 iterations 4 -Cbc0038I Pass 26: suminf. 0.49602 (2) obj. 8.04999 iterations 9 -Cbc0038I Pass 27: suminf. 0.49602 (2) obj. 8.04999 iterations 0 -Cbc0038I Pass 28: suminf. 0.22831 (2) obj. 8.04999 iterations 5 -Cbc0038I Pass 29: suminf. 0.22831 (2) obj. 8.04999 iterations 0 -Cbc0038I Pass 30: suminf. 0.67433 (3) obj. 8.04999 iterations 4 -Cbc0038I Pass 31: suminf. 0.67433 (3) obj. 8.04999 iterations 0 -Cbc0038I Pass 32: suminf. 0.21100 (3) obj. 8.04999 iterations 5 -Cbc0038I Pass 33: suminf. 0.12321 (2) obj. 8.04999 iterations 3 -Cbc0038I Pass 34: suminf. 1.15375 (3) obj. 8.04999 iterations 4 -Cbc0038I Pass 35: suminf. 0.37310 (3) obj. 8.04999 iterations 4 -Cbc0038I Pass 36: suminf. 0.54229 (3) obj. 8.04999 iterations 1 -Cbc0038I Pass 37: suminf. 0.73869 (3) obj. 8.04999 iterations 5 +Cbc0038I Round again with cutoff of 59.4 +Cbc0038I Pass 2: suminf. 0.02973 (1) obj. 59.4 iterations 1 +Cbc0038I Pass 3: suminf. 0.46933 (1) obj. 59.4 iterations 3 +Cbc0038I Pass 4: suminf. 0.55923 (2) obj. 59.4 iterations 7 +Cbc0038I Pass 5: suminf. 0.16203 (1) obj. 59.4 iterations 3 +Cbc0038I Pass 6: suminf. 0.28636 (1) obj. 59.4 iterations 3 +Cbc0038I Pass 7: suminf. 0.27936 (2) obj. 59.4 iterations 3 +Cbc0038I Pass 8: suminf. 0.08367 (2) obj. 59.4 iterations 7 +Cbc0038I Pass 9: suminf. 0.00000 (0) obj. 59.4 iterations 3 +Cbc0038I Solution found of 59.4 +Cbc0038I Relaxing continuous gives 58 +Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Mini branch and bound improved solution from 58 to 15 (0.01 seconds) +Cbc0038I Round again with cutoff of 12 +Cbc0038I Pass 10: suminf. 0.30445 (3) obj. 12 iterations 2 +Cbc0038I Pass 11: suminf. 0.85459 (3) obj. 12 iterations 6 +Cbc0038I Pass 12: suminf. 0.31770 (2) obj. 12 iterations 4 +Cbc0038I Pass 13: suminf. 0.54160 (2) obj. 12 iterations 2 +Cbc0038I Pass 14: suminf. 0.56980 (3) obj. 12 iterations 8 +Cbc0038I Pass 15: suminf. 0.38835 (3) obj. 12 iterations 2 +Cbc0038I Pass 16: suminf. 0.95370 (3) obj. 12 iterations 1 +Cbc0038I Pass 17: suminf. 1.02965 (3) obj. 12 iterations 3 +Cbc0038I Pass 18: suminf. 0.31574 (2) obj. 12 iterations 6 +Cbc0038I Pass 19: suminf. 0.51048 (3) obj. 12 iterations 4 +Cbc0038I Pass 20: suminf. 0.33205 (2) obj. 12 iterations 3 +Cbc0038I Pass 21: suminf. 0.68940 (3) obj. 12 iterations 3 +Cbc0038I Pass 22: suminf. 1.12872 (3) obj. 12 iterations 10 +Cbc0038I Pass 23: suminf. 1.12872 (3) obj. 12 iterations 0 +Cbc0038I Pass 24: suminf. 0.34723 (3) obj. 12 iterations 3 +Cbc0038I Pass 25: suminf. 0.34723 (3) obj. 12 iterations 0 +Cbc0038I Pass 26: suminf. 0.73814 (3) obj. 12 iterations 5 +Cbc0038I Pass 27: suminf. 0.45985 (2) obj. 12 iterations 4 +Cbc0038I Pass 28: suminf. 0.58155 (2) obj. 12 iterations 2 +Cbc0038I Pass 29: suminf. 0.80870 (3) obj. 12 iterations 10 +Cbc0038I Pass 30: suminf. 0.39861 (3) obj. 12 iterations 3 +Cbc0038I Pass 31: suminf. 0.79562 (3) obj. 12 iterations 1 +Cbc0038I Pass 32: suminf. 0.87899 (3) obj. 12 iterations 6 +Cbc0038I Pass 33: suminf. 0.44518 (3) obj. 12 iterations 3 +Cbc0038I Pass 34: suminf. 1.06880 (3) obj. 12 iterations 2 +Cbc0038I Pass 35: suminf. 0.84840 (3) obj. 12 iterations 2 +Cbc0038I Pass 36: suminf. 0.81364 (3) obj. 12 iterations 3 +Cbc0038I Pass 37: suminf. 0.44518 (3) obj. 12 iterations 3 +Cbc0038I Pass 38: suminf. 0.44518 (3) obj. 12 iterations 0 +Cbc0038I Pass 39: suminf. 1.06880 (3) obj. 12 iterations 2 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of 11.5 - took 0.01 seconds -Cbc0012I Integer solution of 11.5 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 13 columns -Cbc0031I 4 added rows had average density of 18.5 +Cbc0038I Mini branch and bound improved solution from 15 to 5 (0.02 seconds) +Cbc0038I Round again with cutoff of 3.49999 +Cbc0038I Pass 39: suminf. 0.37775 (2) obj. 3.49999 iterations 1 +Cbc0038I Pass 40: suminf. 0.54014 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 41: suminf. 0.54014 (3) obj. 3.49999 iterations 0 +Cbc0038I Pass 42: suminf. 0.50666 (3) obj. 3.49999 iterations 10 +Cbc0038I Pass 43: suminf. 0.50666 (3) obj. 3.49999 iterations 0 +Cbc0038I Pass 44: suminf. 0.87349 (3) obj. 3.49999 iterations 5 +Cbc0038I Pass 45: suminf. 0.81146 (3) obj. 3.49999 iterations 1 +Cbc0038I Pass 46: suminf. 0.99994 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 47: suminf. 0.99994 (3) obj. 3.49999 iterations 0 +Cbc0038I Pass 48: suminf. 0.81146 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 49: suminf. 0.52974 (3) obj. 3.49999 iterations 5 +Cbc0038I Pass 50: suminf. 0.52974 (3) obj. 3.49999 iterations 0 +Cbc0038I Pass 51: suminf. 0.90327 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 52: suminf. 0.66468 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 53: suminf. 0.94264 (3) obj. 3.49999 iterations 4 +Cbc0038I Pass 54: suminf. 0.42161 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 55: suminf. 1.20220 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 56: suminf. 0.91571 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 57: suminf. 0.99089 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 58: suminf. 0.74553 (3) obj. 3.49999 iterations 10 +Cbc0038I Pass 59: suminf. 0.32547 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 60: suminf. 0.53204 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 61: suminf. 0.85261 (3) obj. 3.49999 iterations 9 +Cbc0038I Pass 62: suminf. 0.54210 (3) obj. 3.49999 iterations 1 +Cbc0038I Pass 63: suminf. 0.69617 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 64: suminf. 0.60635 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 65: suminf. 0.38531 (3) obj. 3.49999 iterations 3 +Cbc0038I Pass 66: suminf. 0.26311 (3) obj. 3.49999 iterations 1 +Cbc0038I Pass 67: suminf. 0.45231 (3) obj. 3.49999 iterations 2 +Cbc0038I Pass 68: suminf. 0.42449 (3) obj. 3.49999 iterations 10 +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 5 - took 0.03 seconds +Cbc0012I Integer solution of 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 16 columns +Cbc0031I 4 added rows had average density of 19.5 Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 535 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 414 row cuts average 11.4 elements, 0 column cuts (0 active) in 0.011 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) - 506 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 75 row cuts average 8.9 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 354 row cuts average 19.1 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 11.5 best solution, best possible 0 (0.07 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0016I Integer solution of 7.5 found by strong branching after 1305 iterations and 102 nodes (0.09 seconds) -Cbc0016I Integer solution of 6.5 found by strong branching after 1581 iterations and 164 nodes (0.10 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 590 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 234 row cuts average 10.8 elements, 0 column cuts (0 active) in 0.011 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) - 514 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 34 row cuts average 8.1 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 350 row cuts average 18.6 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 5 best solution, best possible 0 (0.11 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0016I Integer solution of 5.5 found by strong branching after 3254 iterations and 623 nodes (0.15 seconds) -Cbc0012I Integer solution of 3.5 found by rounding after 3403 iterations and 680 nodes (0.16 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0016I Integer solution of 4 found by strong branching after 1332 iterations and 117 nodes (0.14 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0016I Integer solution of 3 found by strong branching after 3579 iterations and 546 nodes (0.24 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0016I Integer solution of 2.5 found by strong branching after 3970 iterations and 830 nodes (0.18 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0010I After 1000 nodes, 12 on tree, 2.5 best solution, best possible 0 (0.21 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0010I After 2000 nodes, 3 on tree, 2.5 best solution, best possible 0 (0.34 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0001I Search completed - best objective 2.5, took 32817 iterations and 15111 nodes (0.41 seconds) -Cbc0032I Strong branching done 9386 times (19411 iterations), fathomed 431 nodes and fixed 593 variables -Cbc0041I Maximum depth 14, 891 variables fixed on reduced cost (complete fathoming 758 times, 12541 nodes taking 24007 iterations) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0016I Integer solution of 2 found by strong branching after 4681 iterations and 859 nodes (0.31 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0010I After 1000 nodes, 5 on tree, 2 best solution, best possible 0 (0.34 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0001I Search completed - best objective 2, took 12688 iterations and 3911 nodes (0.46 seconds) +Cbc0032I Strong branching done 7022 times (17596 iterations), fathomed 445 nodes and fixed 458 variables +Cbc0041I Maximum depth 13, 842 variables fixed on reduced cost (complete fathoming 217 times, 2379 nodes taking 4736 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -Gomory was tried 100 times and created 535 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -Knapsack was tried 100 times and created 414 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 100 times and created 506 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -FlowCover was tried 100 times and created 75 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) -TwoMirCuts was tried 100 times and created 354 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 100 times and created 590 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) +Knapsack was tried 100 times and created 234 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 100 times and created 514 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +FlowCover was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +TwoMirCuts was tried 100 times and created 350 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 2.50000000 -Enumerated nodes: 15111 -Total iterations: 32817 -Time (CPU seconds): 0.40 -Time (Wallclock seconds): 0.41 +Objective value: 2.00000000 +Enumerated nodes: 3911 +Total iterations: 12688 +Time (CPU seconds): 0.47 +Time (Wallclock seconds): 0.47 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.40 (Wallclock seconds): 0.41 +Total time (CPU seconds): 0.47 (Wallclock seconds): 0.53 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d7c47753776e44b58179a90bcc1576d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7c47753776e44b58179a90bcc1576d9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f3639918004e459aad1d422aea1c632e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3639918004e459aad1d422aea1c632e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1188,13 +1298,13 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4e15c186f53749a9b68371a101b654a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e15c186f53749a9b68371a101b654a3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/42f247034a874c33adc11c2a6935dd5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42f247034a874c33adc11c2a6935dd5f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1211,7 +1321,7 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.09 test_doctest (pulp.tests.test_examples.Examples_DocsTests.test_doctest) runs all doctests ... ok @@ -1221,23 +1331,20 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8df6e3a4374f4273b1ebe10ea466763b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8df6e3a4374f4273b1ebe10ea466763b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f13510b94954471890db85dc70263be8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f13510b94954471890db85dc70263be8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 72 RHS -At line 81 BOUNDS -At line 94 ENDATA -Problem MODEL has 8 rows, 12 columns and 24 elements +At line 10 COLUMNS +At line 25 RHS +At line 31 BOUNDS +At line 33 ENDATA +Problem MODEL has 5 rows, 2 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1249,104 +1356,136 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b0a6a79b06f94570838c253c5ddaa71c-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/b0a6a79b06f94570838c253c5ddaa71c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/20594fcfe7c84487b2af536275b11896-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/20594fcfe7c84487b2af536275b11896-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 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 -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 300 - 0.00 seconds +Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 300 to 300 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 300.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b04d6ad39a2e4d818e2a00f1d0a21245-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b04d6ad39a2e4d818e2a00f1d0a21245-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/abfa7a836fa6458ebb71eaa6f37f19d3-pulp.mps mips /tmp/abfa7a836fa6458ebb71eaa6f37f19d3-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/abfa7a836fa6458ebb71eaa6f37f19d3-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 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/abfa7a836fa6458ebb71eaa6f37f19d3-pulp.mst. +MIPStart values read for 3213 variables. 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 +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.04 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0045I Solution of 12 already found by heuristic +Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 12.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.04 +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/c14285c26b1446ddb71b0a8b96717d73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c14285c26b1446ddb71b0a8b96717d73-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dd86a2c21e1541cc9e9e1a4aebafc050-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd86a2c21e1541cc9e9e1a4aebafc050-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 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -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) +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 -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) +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: -1.05000000 +Objective value: 8300.00000000 Enumerated nodes: 0 -Total iterations: 4 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -1357,72 +1496,22 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/92aabea019fa43f7811e470f8107b27e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/92aabea019fa43f7811e470f8107b27e-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/1fc5d66d383b4a4d934fcd52e8aed65a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1fc5d66d383b4a4d934fcd52e8aed65a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0bc0ac8e95dc4d3da2fa58796324bf26-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/0bc0ac8e95dc4d3da2fa58796324bf26-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 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -1430,32 +1519,32 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1a1a6788e5f046e9b63ebece94305283-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a1a6788e5f046e9b63ebece94305283-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5947a1cee233446a8e21645a583a7d0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5947a1cee233446a8e21645a583a7d0b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 38 RHS -At line 42 BOUNDS -At line 50 ENDATA -Problem MODEL has 3 rows, 7 columns and 8 elements +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 3 +Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 @@ -1477,55 +1566,13 @@ 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/10b5157a6f7f44698be6c0e301c91f30-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10b5157a6f7f44698be6c0e301c91f30-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) -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: 15005.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/159e565b25e34e3988d2302146c712bb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/159e565b25e34e3988d2302146c712bb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b16c01349b884aaca94e9b8d982c302f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b16c01349b884aaca94e9b8d982c302f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1566,7 +1613,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/22a6e3543dde49eb887080d0f5f457e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22a6e3543dde49eb887080d0f5f457e9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b77c02820a2149e8853fa601d3c725ee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b77c02820a2149e8853fa601d3c725ee-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1601,13 +1648,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/78264381ed5a48f3be807b44ab0a11ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78264381ed5a48f3be807b44ab0a11ab-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bd9633964f814b94bb0995c8b8e67da3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd9633964f814b94bb0995c8b8e67da3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1648,7 +1695,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/94837746faef4d65bc5f6f4c48b104bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94837746faef4d65bc5f6f4c48b104bc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/59b115f273af48f5b6c93c784fe5ac0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59b115f273af48f5b6c93c784fe5ac0d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1683,13 +1730,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ef8083a2879547ddbc284529bad8900a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef8083a2879547ddbc284529bad8900a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/279021f19e9e4c19b80d754ffd8014d6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/279021f19e9e4c19b80d754ffd8014d6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1730,7 +1777,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b39a716c53bf45ea8aa5ac904d046915-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b39a716c53bf45ea8aa5ac904d046915-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fad4ecd926374db7b22dbcfb8d3b7a9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fad4ecd926374db7b22dbcfb8d3b7a9c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1771,7 +1818,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/614338f16d6949229f217b3530b265d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/614338f16d6949229f217b3530b265d4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/375a732d66b74f9b8808e72b813acf1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/375a732d66b74f9b8808e72b813acf1d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1812,7 +1859,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d3eb9d1a79654a219f4e2e48a1c6a721-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3eb9d1a79654a219f4e2e48a1c6a721-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/77e5f6470db347659efe1bdef35708c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77e5f6470db347659efe1bdef35708c2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1853,7 +1900,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5e69fb9119f54cd2a3efe1318de31b41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e69fb9119f54cd2a3efe1318de31b41-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1a8b856b4bf34e538d35afd0b4f47809-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a8b856b4bf34e538d35afd0b4f47809-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1894,7 +1941,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f83f9f68690e4d569f3d0b8dddc8da9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f83f9f68690e4d569f3d0b8dddc8da9a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8f3eafb6cba643438f4fc26162d18966-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f3eafb6cba643438f4fc26162d18966-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1935,7 +1982,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/306aa886c1c4408cb3a815b412e5a26e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/306aa886c1c4408cb3a815b412e5a26e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/66d36baccaf5406a835f1153e02667e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/66d36baccaf5406a835f1153e02667e1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1970,159 +2017,13 @@ 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/eb42c7dcee1143748795ef2da39f0f64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb42c7dcee1143748795ef2da39f0f64-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 246.50000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/279cfa3e0bcc4a81a567699d6cb61cab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/279cfa3e0bcc4a81a567699d6cb61cab-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 -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 251.50000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/0164e974fbec406e8e50c231e58c4712-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0164e974fbec406e8e50c231e58c4712-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.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 13 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: 13 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7d26e0a657a94f72b626f609f998faf6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d26e0a657a94f72b626f609f998faf6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c54aae79689c404186b602ef7dd5b5c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c54aae79689c404186b602ef7dd5b5c1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2163,20 +2064,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cafdb54423164f3b923032dffe354b4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cafdb54423164f3b923032dffe354b4a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/805cfc9003f24aa5bb461cb83b58d113-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/805cfc9003f24aa5bb461cb83b58d113-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +At line 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 0 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0 to -1.79769e+308 +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2188,37 +2092,37 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/50f0bd13f8dd4450afb0196a2d355433-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50f0bd13f8dd4450afb0196a2d355433-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8d8e743dfc164f6192f3921cdbd1b0ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d8e743dfc164f6192f3921cdbd1b0ab-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 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 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) +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.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 +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) @@ -2230,7 +2134,7 @@ Result - Optimal solution found -Objective value: 300.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2274,44 +2178,44 @@ 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - -x_0 = 0.0 -x_1 = 1.0 -x_2 = 0.0 -x_3 = 1.0 +x_0 = 1.0 +x_1 = 0.0 +x_2 = 1.0 +x_3 = 0.0 x_4 = 1.0 -x_5 = 1.0 -x_6 = 0.0 +x_5 = 0.0 +x_6 = 1.0 x_7 = 1.0 -x_8 = 1.0 -x_9 = 0.0 +x_8 = 0.0 +x_9 = 1.0 Status: Optimal -s_0 = 1.0 -s_1 = 0.0 -s_2 = 0.0 -w_0 = 0.0 -w_1 = 1.5 +s_0 = 0.0 +s_1 = 0.5 +s_2 = 1.0 +w_0 = 0.5 +w_1 = 0.0 w_2 = 0.0 x_0 = 0.0 -x_1 = 0.0 -x_10 = 0.0 -x_11 = 0.0 +x_1 = 1.0 +x_10 = 1.0 +x_11 = 1.0 x_12 = 0.0 -x_13 = 1.0 -x_14 = 1.0 +x_13 = 0.0 +x_14 = 0.0 x_15 = 1.0 x_16 = 1.0 -x_17 = 1.0 +x_17 = 0.0 x_18 = 0.0 -x_19 = 0.0 -x_2 = 1.0 +x_19 = 1.0 +x_2 = 0.0 x_3 = 1.0 x_4 = 0.0 -x_5 = 1.0 +x_5 = 0.0 x_6 = 0.0 -x_7 = 0.0 -x_8 = 1.0 +x_7 = 1.0 +x_8 = 0.0 x_9 = 1.0 -objective= 2.5 +objective= 2.0 Status: Optimal x = 4.0 y = -1.0 @@ -2368,50 +2272,76 @@ 8 passed. Test passed. Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal 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_3 = 1700.0 Route_B_4 = 200.0 Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.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 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 -P0 = [4, 0, 0] -P1 = [0, 2, 0] +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] 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 +P3 = [0, 1, 0] +P4 = [0, 1, 1] +P5 = [0, 2, 0] +P6 = [1, 0, 0] +P7 = [1, 0, 1] +P8 = [1, 1, 0] +P9 = [1, 2, 0] +P10 = [2, 0, 0] +P11 = [2, 0, 1] +P12 = [2, 1, 0] +P13 = [3, 0, 0] +P14 = [4, 0, 0] Status: Optimal -Route_('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 +Patt_P0 = 0.0 +Patt_P1 = 0.0 +Patt_P10 = 0.0 +Patt_P11 = 26.0 +Patt_P12 = 0.0 +Patt_P13 = 0.0 +Patt_P14 = 0.0 +Patt_P2 = 137.0 +Patt_P3 = 0.0 +Patt_P4 = 0.0 +Patt_P5 = 0.0 +Patt_P6 = 0.0 +Patt_P7 = 0.0 +Patt_P8 = 0.0 +Patt_P9 = 100.0 +Surp_5 = 2.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 246.50000000000003 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -2544,72 +2474,6 @@ Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = 0.0 -Patt_P13 = 0.0 -Patt_P14 = 0.0 -Patt_P2 = 137.0 -Patt_P3 = 0.0 -Patt_P4 = 0.0 -Patt_P5 = 0.0 -Patt_P6 = 0.0 -Patt_P7 = 0.0 -Patt_P8 = 0.0 -Patt_P9 = 100.0 -Surp_5 = 2.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 246.50000000000003 -Status: Optimal -Patt_A = 200.0 -Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -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 @@ -2623,12 +2487,27 @@ Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal -Solution 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 Status: Optimal -Patt_A = 225.0 +Patt_A = 200.0 Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 +Patt_C = 100.0 +Surp_5 = 50.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 251.5 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 @@ -2691,7 +2570,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/505ce9f046674d899fe7999b74e30f84-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/505ce9f046674d899fe7999b74e30f84-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bee07678d9bb49459d4b4520ed1e915f-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/bee07678d9bb49459d4b4520ed1e915f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS @@ -2714,59 +2593,47 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ac942565f61344a7af5f3b106ddbe9e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac942565f61344a7af5f3b106ddbe9e7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c68c44eaac614210874df3092fdfb225-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c68c44eaac614210874df3092fdfb225-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/4699fd8edf7d4c109d05db3a40841ec7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4699fd8edf7d4c109d05db3a40841ec7-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 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 -1.6 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.6 to -1.6 -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 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.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 13 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: -1.60000000 +Objective value: 228100.00000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 13 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -2777,68 +2644,49 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/537906524bce4ae8a22a6bb43ef6049d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/537906524bce4ae8a22a6bb43ef6049d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5f9e8bbe551241e7874ecadfdddba106-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f9e8bbe551241e7874ecadfdddba106-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 23 RHS -At line 27 BOUNDS -At line 28 ENDATA -Problem MODEL has 3 rows, 7 columns and 7 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 301.5 -After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/6c3d206e2ce14c55bcb92ce5afff69b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6c3d206e2ce14c55bcb92ce5afff69b7-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 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 -1.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +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 -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 +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) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 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 -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) +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 1 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 1 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: -1.25000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 2 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -2849,47 +2697,20 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/54a4afc9e164406ca4de76a6d0f581fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54a4afc9e164406ca4de76a6d0f581fc-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 26 RHS -At line 30 BOUNDS -At line 31 ENDATA -Problem MODEL has 3 rows, 8 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements -0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 276.5 -Optimal - objective value 276.5 -After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/e8047b2916134f74aadec0dd5376cf1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8047b2916134f74aadec0dd5376cf1e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c3c123e08bdb4579b75229e7db07c7a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c3c123e08bdb4579b75229e7db07c7a9-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 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 -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 -1.22143 to -1.22143 +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) @@ -2901,176 +2722,80 @@ 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.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/3be1117f4ed545c4ac487d788dc90f18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3be1117f4ed545c4ac487d788dc90f18-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 28 RHS -At line 32 BOUNDS -At line 33 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements -0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 246.5 -Optimal - objective value 246.5 -After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/1931c5dad9f742918c2b93af41670320-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1931c5dad9f742918c2b93af41670320-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4aad43e2ee3448ab8439d639e423f312-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4aad43e2ee3448ab8439d639e423f312-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e373e6464b4c4f83b7dd17958236859f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e373e6464b4c4f83b7dd17958236859f-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 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 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 4 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 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 +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.05 seconds) +Cbc0038I After 0.05 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.05 seconds) +Cbc0001I Search completed - best objective 12, 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 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 12 to 12 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 12.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +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.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/384972e2c8494edb83fe315997c561fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/384972e2c8494edb83fe315997c561fe-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d58fedeca946415ca11471f7ff1bebee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d58fedeca946415ca11471f7ff1bebee-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 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 0.966667 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0.97 to -1.79769e+308 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 0.97000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - +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 @@ -3078,7 +2803,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1ced4a0b9b264efebe41c69b38da7bd0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ced4a0b9b264efebe41c69b38da7bd0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a471ff39c1564b6883267661a3fd0b0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a471ff39c1564b6883267661a3fd0b0f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -3119,13 +2844,13 @@ Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/baff3ef45d4b464cb6f37fd221a84f73-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baff3ef45d4b464cb6f37fd221a84f73-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0456c92ca90e4402bd9666d4f2c28e1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0456c92ca90e4402bd9666d4f2c28e1d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -3148,10 +2873,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 28 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3168,17 +2893,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/4f1ee6c832e449f5b9c776cf2a0e9b43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f1ee6c832e449f5b9c776cf2a0e9b43-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7bb16aa8862846a18e814cdde0166b6f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bb16aa8862846a18e814cdde0166b6f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -3203,10 +2928,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 26 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 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.06 seconds) +Cbc0001I Search completed - best objective 0, 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 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) @@ -3223,17 +2948,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0dc974a5515e48b5898f0ad294b39c74-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dc974a5515e48b5898f0ad294b39c74-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0a39a1da14fc4681b44b628ac5703194-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a39a1da14fc4681b44b628ac5703194-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -3258,10 +2983,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 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.06 seconds) +Cbc0001I Search completed - best objective 0, 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 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) @@ -3278,17 +3003,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.14 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b7a53ffb15054837862c620164338668-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7a53ffb15054837862c620164338668-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/734dd72a7f0a495390ce4faeadacb481-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/734dd72a7f0a495390ce4faeadacb481-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -3311,10 +3036,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 1 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3331,17 +3056,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.05 (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/dda408efe9834fdea6fcb433c827929e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dda408efe9834fdea6fcb433c827929e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/06a36731819a4fcbb028884384751266-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/06a36731819a4fcbb028884384751266-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -3364,10 +3089,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3384,17 +3109,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.05 (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/2d8f28c72e8643ae894651db595fcbfe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d8f28c72e8643ae894651db595fcbfe-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6e3d686563994774af9d49e183031316-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e3d686563994774af9d49e183031316-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -3418,10 +3143,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3438,17 +3163,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.19 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b48a435412c740579f5e6835196cad5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b48a435412c740579f5e6835196cad5c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8b70a835a62745dd8f4cc03b8aaa07a5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b70a835a62745dd8f4cc03b8aaa07a5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -3471,10 +3196,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3492,16 +3217,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/6207854bb57d4edc8a3ece2f7e5e267b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6207854bb57d4edc8a3ece2f7e5e267b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c6ac874b25a64c7ba7fca7690bc93c70-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6ac874b25a64c7ba7fca7690bc93c70-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -3521,10 +3246,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3541,17 +3266,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/94c151ff940145aaba35ca3c9243a509-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94c151ff940145aaba35ca3c9243a509-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/928906870d27441f8d156a767f94f121-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/928906870d27441f8d156a767f94f121-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -3570,10 +3295,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) +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) @@ -3590,17 +3315,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 +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/f65446f8520d4a99804f4dc56f77b47a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f65446f8520d4a99804f4dc56f77b47a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/78e69902f2a34c2faf11512dbd232037-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78e69902f2a34c2faf11512dbd232037-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -3629,17 +3354,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/021526075d8f4ff9ba3b9b160adf5c9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/021526075d8f4ff9ba3b9b160adf5c9a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4081c992846c41f881daa4fc3381840a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4081c992846c41f881daa4fc3381840a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -3671,17 +3396,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/91687238e15c46d6b55b132028d9d341-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91687238e15c46d6b55b132028d9d341-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eff9364104bf4973a268d9fb677599ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eff9364104bf4973a268d9fb677599ae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -3730,8 +3455,8 @@ Cbc0038I Pass 30: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) -Cbc0038I After 0.03 seconds - Feasibility pump exiting - took 0.00 seconds +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 @@ -3742,7 +3467,7 @@ Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.03 seconds) +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 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) @@ -3759,31 +3484,51 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/fb1a3167927447258c035dd067c95961-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb1a3167927447258c035dd067c95961-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2ec973e479134f7c89a6c493d8e62215-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ec973e479134f7c89a6c493d8e62215-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 +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 -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 +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) +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: 15005.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -3791,117 +3536,177 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1d7dac51e0ad443786522a87f809c2da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d7dac51e0ad443786522a87f809c2da-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/11628803633843968651c36c7df608ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11628803633843968651c36c7df608ab-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 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 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) +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/ce264e0a1543410fa6b659324bc45071-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce264e0a1543410fa6b659324bc45071-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 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) +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: 8300.00000000 +Objective value: -1.05000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 4 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/de595cfef4b747eebfcc1f1e8aa86c18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de595cfef4b747eebfcc1f1e8aa86c18-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/a9013b86a4064885bb01e1e839740d87-pulp.mps mips /tmp/a9013b86a4064885bb01e1e839740d87-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/a9013b86a4064885bb01e1e839740d87-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9129ad8f52f64c3a8c7e1e15efca4bde-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9129ad8f52f64c3a8c7e1e15efca4bde-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 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 -opening mipstart file /tmp/a9013b86a4064885bb01e1e839740d87-pulp.mst. -MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -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 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.03 seconds) -Cbc0006I The LP relaxation is infeasible or too expensive -Cbc0045I Solution of 12 already found by heuristic -Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 12.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.03 -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.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/09a90f2fe65742248f43eac221f6e37e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09a90f2fe65742248f43eac221f6e37e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9dfe30d8f2e84798a28fc130018fea56-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9dfe30d8f2e84798a28fc130018fea56-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 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, 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 +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 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 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 14 +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 14.0 elements, 0 column cuts (0 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 14.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 @@ -3923,34 +3728,51 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/d4b46cb8237e43008d44af2b67813153-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4b46cb8237e43008d44af2b67813153-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cf8e236fbb3443c0a5d80d98bf7ed9d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf8e236fbb3443c0a5d80d98bf7ed9d5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cc75b16fffb7442ebdc3e9d0b91927cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc75b16fffb7442ebdc3e9d0b91927cb-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 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 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 -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.03 seconds) -Cbc0038I After 0.03 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.03 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.04 seconds) +Continuous objective value is -1.6 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.03996 +Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 12 to 12 +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) @@ -3962,14 +3784,277 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: -1.60000000 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.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/2f0d55df38254fb2b923887ad8377551-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f0d55df38254fb2b923887ad8377551-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 301.5 +After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/57b715b890e64713b1a2211bd7bfb1e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57b715b890e64713b1a2211bd7bfb1e3-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.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 -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: -1.25000000 +Enumerated nodes: 0 +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.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/60669cd8ea02475ab6d17c0d9a4de238-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60669cd8ea02475ab6d17c0d9a4de238-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements +0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 276.5 +Optimal - objective value 276.5 +After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/67460f6c30394e8fb9faae0bea82967c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67460f6c30394e8fb9faae0bea82967c-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.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 -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) +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.20000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/a04a2ec00ec04cfbad1d80c64187c949-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a04a2ec00ec04cfbad1d80c64187c949-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements +0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 246.5 +Optimal - objective value 246.5 +After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/e0677aacdf6541bcbe3d2c3a90ac6d7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0677aacdf6541bcbe3d2c3a90ac6d7c-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.00000000 +Enumerated nodes: 0 +Total iterations: 6 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.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/865ecc310d5a4754b457072f645f7803-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/865ecc310d5a4754b457072f645f7803-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 +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 4 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +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 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -5307,7 +5392,7 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 22.876s +Ran 1005 tests in 26.472s OK (skipped=885) @@ -5322,71 +5407,28 @@ production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -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 -Ingr_BEEF = 60.0 -Ingr_CHICKEN = 0.0 -Ingr_GEL = 40.0 -Ingr_MUTTON = 0.0 -Ingr_RICE = 0.0 -Ingr_WHEAT = 0.0 -Total Cost of Ingredients per can = 0.52 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 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 -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') +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 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -5423,12 +5465,80 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 +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 +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 +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 +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 +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 +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 @@ -5694,90 +5804,90 @@ running install_lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc +/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc -/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt @@ -5807,12 +5917,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/1193193/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/1193193/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/2485781 and its subdirectories -I: Current time: Sat Mar 1 21:03:41 -12 2025 -I: pbuilder-time-stamp: 1740906221 +I: removing directory /srv/workspace/pbuilder/1193193 and its subdirectories +I: Current time: Sun Apr 5 05:28:53 +14 2026 +I: pbuilder-time-stamp: 1775316533