Diff of the two buildlogs: -- --- b1/build.log 2025-03-03 06:24:36.431530902 +0000 +++ b2/build.log 2025-03-03 06:26:06.315453123 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Sun Mar 2 18:19:59 -12 2025 -I: pbuilder-time-stamp: 1740982799 +I: Current time: Mon Apr 6 02:47:37 +14 2026 +I: pbuilder-time-stamp: 1775393257 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration @@ -26,52 +26,84 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/1874257/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/1352493/tmp/hooks/D01_modify_environment starting +debug: Running on ionos5-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 5 12:47 /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/1352493/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/1352493/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' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=20 ' - DISTRIBUTION='trixie' - HOME='/root' - HOST_ARCH='amd64' + 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=42 ' + DIRSTACK=() + DISTRIBUTION=trixie + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='f9baa63ca7de4427bf4e5ed9932ff69d' - 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='1874257' - PS1='# ' - PS2='> ' + INVOCATION_ID=bc751641095d47a7bca5a71b5bb85641 + 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=1352493 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.cU66QNGr/pbuilderrc_0k2Y --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.cU66QNGr/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='111' - SUDO_UID='106' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://46.16.76.132:3128' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.cU66QNGr/pbuilderrc_D8KX --distribution trixie --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.cU66QNGr/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=110 + SUDO_UID=105 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://213.165.73.152:3128 I: uname -a - Linux ionos11-amd64 6.1.0-31-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/1874257/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Nov 22 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/1352493/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -184,7 +216,7 @@ Get: 65 http://deb.debian.org/debian trixie/main amd64 dh-python all 6.20250108 [113 kB] Get: 66 http://deb.debian.org/debian trixie/main amd64 python3-all amd64 3.13.2-1 [1048 B] Get: 67 http://deb.debian.org/debian trixie/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 34.8 MB in 3s (11.9 MB/s) +Fetched 34.8 MB in 0s (124 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 ... 19802 files and directories currently installed.) @@ -413,8 +445,8 @@ Setting up tzdata (2025a-2) ... Current default time zone: 'Etc/UTC' -Local time is now: Mon Mar 3 06:21:55 UTC 2025. -Universal Time is now: Mon Mar 3 06:21:55 UTC 2025. +Local time is now: Sun Apr 5 12:48:21 UTC 2026. +Universal Time is now: Sun Apr 5 12:48:21 UTC 2026. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... @@ -481,7 +513,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/1352493/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for trixie +I: user script /srv/workspace/pbuilder/1352493/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 @@ -517,11 +553,11 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/sparse.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/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/sparse.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 running egg_info creating PuLP.egg-info @@ -723,7 +759,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9306d567d2264c3582a50eea28b34bfa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9306d567d2264c3582a50eea28b34bfa-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bca554c258be48c4bb2e075c803c7988-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bca554c258be48c4bb2e075c803c7988-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -746,7 +782,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a805f649e7f0489da6570197901bf10a-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a805f649e7f0489da6570197901bf10a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f62bc4aa3a8c45d8b6c82e2603a4ced9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/f62bc4aa3a8c45d8b6c82e2603a4ced9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -777,7 +813,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.01 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.00 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 @@ -796,7 +832,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 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 @@ -831,11 +867,11 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 14 columns -Cbc0038I Mini branch and bound did not improve solution (0.10 seconds) -Cbc0038I After 0.10 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.05 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.02 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.11 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.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 @@ -844,7 +880,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.11 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.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) @@ -861,17 +897,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.11 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.11 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e1d559d1e45f4ffead57a89bf4283e68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1d559d1e45f4ffead57a89bf4283e68-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/18978272f84b41d3b3b42a5bdfc67934-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18978272f84b41d3b3b42a5bdfc67934-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -890,7 +926,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 48 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 38 columns -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 @@ -916,7 +952,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.33 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 @@ -951,98 +987,193 @@ 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.54 seconds) -Cbc0038I After 0.54 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.32 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.54 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.13 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.070 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.111 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.073 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.053 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (2.50 seconds) +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.021 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.039 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.023 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 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.39 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 (6.26 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (0.80 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.070 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.165 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.127 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.053 seconds) -TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.073 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.021 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.060 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.043 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) +TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.023 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.007 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): 2.26 -Time (Wallclock seconds): 6.32 +Time (CPU seconds): 0.79 +Time (Wallclock seconds): 0.81 Option for printingOptions changed from normal to all -Total time (CPU seconds): 2.26 (Wallclock seconds): 6.32 +Total time (CPU seconds): 0.79 (Wallclock seconds): 0.82 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/722f879b00e542e1903f272048910163-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/722f879b00e542e1903f272048910163-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/83c47769e9824231bd4359b88b319c61-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83c47769e9824231bd4359b88b319c61-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1636 RHS -At line 1857 BOUNDS -At line 2068 ENDATA -Problem MODEL has 220 rows, 210 columns and 780 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -102.2 - 0.00 seconds -Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions -Cgl0004I processed model has 143 rows, 140 columns (140 integer (140 of which binary)) and 509 elements -Cbc0038I Initial state - 0 integers unsatisfied sum - 2.55351e-15 -Cbc0038I Solution found of -102.2 -Cbc0038I Before mini branch and bound, 140 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 -102.2 - took 0.00 seconds -Cbc0012I Integer solution of -102.2 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) -Cbc0001I Search completed - best objective -102.2, took 0 iterations and 0 nodes (0.03 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -102.2 to -102.2 -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 1655 RHS +At line 1876 BOUNDS +At line 2087 ENDATA +Problem MODEL has 220 rows, 210 columns and 800 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -221.252 - 0.00 seconds +Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements +Cutoff increment increased from 1e-05 to 0.04995 +Cbc0038I Initial state - 29 integers unsatisfied sum - 6.32509 +Cbc0038I Pass 1: suminf. 3.59193 (13) obj. -216.634 iterations 77 +Cbc0038I Pass 2: suminf. 3.20387 (12) obj. -215.644 iterations 9 +Cbc0038I Solution found of -188.8 +Cbc0038I Rounding solution of -192.2 is better than previous of -188.8 + +Cbc0038I Before mini branch and bound, 170 integers at bound fixed and 0 continuous +Cbc0038I Full problem 219 rows 209 columns, reduced to 28 rows 33 columns +Cbc0038I Mini branch and bound improved solution from -192.2 to -205.1 (0.02 seconds) +Cbc0038I Round again with cutoff of -206.8 +Cbc0038I Reduced cost fixing fixed 1 variables on major pass 2 +Cbc0038I Pass 3: suminf. 3.59193 (13) obj. -216.634 iterations 0 +Cbc0038I Pass 4: suminf. 3.20387 (12) obj. -215.644 iterations 7 +Cbc0038I Pass 5: suminf. 1.90017 (7) obj. -206.8 iterations 45 +Cbc0038I Pass 6: suminf. 1.81715 (7) obj. -207.045 iterations 12 +Cbc0038I Pass 7: suminf. 3.03002 (12) obj. -206.8 iterations 77 +Cbc0038I Pass 8: suminf. 2.58122 (10) obj. -206.8 iterations 33 +Cbc0038I Pass 9: suminf. 2.54984 (8) obj. -206.8 iterations 24 +Cbc0038I Pass 10: suminf. 2.08673 (8) obj. -206.8 iterations 26 +Cbc0038I Pass 11: suminf. 2.54984 (8) obj. -206.8 iterations 14 +Cbc0038I Pass 12: suminf. 2.13651 (10) obj. -206.8 iterations 53 +Cbc0038I Pass 13: suminf. 1.60728 (8) obj. -206.8 iterations 35 +Cbc0038I Pass 14: suminf. 2.32337 (8) obj. -206.8 iterations 20 +Cbc0038I Pass 15: suminf. 2.32337 (8) obj. -206.8 iterations 6 +Cbc0038I Pass 16: suminf. 1.90651 (8) obj. -206.8 iterations 11 +Cbc0038I Pass 17: suminf. 1.90651 (8) obj. -206.8 iterations 7 +Cbc0038I Pass 18: suminf. 2.32337 (8) obj. -206.8 iterations 25 +Cbc0038I Pass 19: suminf. 2.67075 (11) obj. -206.8 iterations 46 +Cbc0038I Pass 20: suminf. 2.21564 (10) obj. -206.8 iterations 29 +Cbc0038I Pass 21: suminf. 2.51734 (9) obj. -206.8 iterations 36 +Cbc0038I Pass 22: suminf. 2.51734 (9) obj. -206.8 iterations 10 +Cbc0038I Pass 23: suminf. 2.47438 (10) obj. -206.8 iterations 23 +Cbc0038I Pass 24: suminf. 2.47438 (10) obj. -206.8 iterations 11 +Cbc0038I Pass 25: suminf. 2.04325 (9) obj. -206.8 iterations 40 +Cbc0038I Pass 26: suminf. 1.75785 (8) obj. -206.8 iterations 42 +Cbc0038I Pass 27: suminf. 1.93651 (7) obj. -206.8 iterations 33 +Cbc0038I Pass 28: suminf. 1.56596 (7) obj. -206.8 iterations 22 +Cbc0038I Pass 29: suminf. 1.88371 (7) obj. -206.8 iterations 16 +Cbc0038I Pass 30: suminf. 1.88371 (7) obj. -206.8 iterations 9 +Cbc0038I Pass 31: suminf. 1.93651 (7) obj. -206.8 iterations 12 +Cbc0038I Pass 32: suminf. 2.94494 (11) obj. -206.8 iterations 56 +Cbc0038I Rounding solution of -209.05 is better than previous of -205.1 + +Cbc0038I Before mini branch and bound, 119 integers at bound fixed and 0 continuous +Cbc0038I Full problem 219 rows 209 columns, reduced to 28 rows 72 columns +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I Round again with cutoff of -211.55 +Cbc0038I Reduced cost fixing fixed 1 variables on major pass 3 +Cbc0038I Pass 32: suminf. 3.59193 (13) obj. -216.634 iterations 0 +Cbc0038I Pass 33: suminf. 3.20387 (12) obj. -215.644 iterations 7 +Cbc0038I Pass 34: suminf. 2.85855 (10) obj. -211.55 iterations 42 +Cbc0038I Pass 35: suminf. 2.61418 (10) obj. -211.55 iterations 20 +Cbc0038I Pass 36: suminf. 3.04822 (10) obj. -211.55 iterations 37 +Cbc0038I Pass 37: suminf. 3.04822 (10) obj. -211.55 iterations 12 +Cbc0038I Pass 38: suminf. 2.89282 (10) obj. -211.55 iterations 20 +Cbc0038I Pass 39: suminf. 2.90260 (9) obj. -211.55 iterations 11 +Cbc0038I Pass 40: suminf. 2.98737 (10) obj. -211.55 iterations 29 +Cbc0038I Pass 41: suminf. 2.98737 (10) obj. -211.55 iterations 13 +Cbc0038I Pass 42: suminf. 3.92573 (13) obj. -211.55 iterations 44 +Cbc0038I Pass 43: suminf. 3.29899 (28) obj. -211.55 iterations 39 +Cbc0038I Pass 44: suminf. 3.93475 (13) obj. -211.55 iterations 53 +Cbc0038I Pass 45: suminf. 3.50669 (24) obj. -211.55 iterations 48 +Cbc0038I Pass 46: suminf. 6.24489 (20) obj. -211.55 iterations 56 +Cbc0038I Pass 47: suminf. 3.82879 (24) obj. -211.55 iterations 51 +Cbc0038I Pass 48: suminf. 6.28456 (20) obj. -211.55 iterations 61 +Cbc0038I Pass 49: suminf. 5.40706 (22) obj. -211.55 iterations 29 +Cbc0038I Pass 50: suminf. 4.48442 (23) obj. -211.55 iterations 34 +Cbc0038I Pass 51: suminf. 4.07688 (23) obj. -211.55 iterations 30 +Cbc0038I Pass 52: suminf. 3.76158 (12) obj. -211.55 iterations 31 +Cbc0038I Pass 53: suminf. 3.82959 (11) obj. -211.55 iterations 33 +Cbc0038I Pass 54: suminf. 3.75973 (11) obj. -211.55 iterations 27 +Cbc0038I Pass 55: suminf. 3.82959 (11) obj. -211.55 iterations 30 +Cbc0038I Pass 56: suminf. 3.72438 (12) obj. -211.55 iterations 40 +Cbc0038I Pass 57: suminf. 2.37395 (10) obj. -211.55 iterations 38 +Cbc0038I Pass 58: suminf. 2.37395 (10) obj. -211.55 iterations 0 +Cbc0038I Pass 59: suminf. 2.50664 (10) obj. -211.55 iterations 18 +Cbc0038I Pass 60: suminf. 2.50664 (10) obj. -211.55 iterations 13 +Cbc0038I Pass 61: suminf. 2.70886 (11) obj. -211.55 iterations 22 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 132 integers at bound fixed and 0 continuous +Cbc0038I Full problem 219 rows 209 columns, reduced to 42 rows 58 columns +Cbc0038I Mini branch and bound did not improve solution (0.11 seconds) +Cbc0038I After 0.11 seconds - Feasibility pump exiting with objective of -209.05 - took 0.10 seconds +Cbc0012I Integer solution of -209.05 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) +Cbc0038I Full problem 219 rows 209 columns, reduced to 28 rows 36 columns +Cbc0031I 26 added rows had average density of 78.384615 +Cbc0013I At root node, 26 cuts changed objective from -221.25235 to -217.24754 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 16.0 elements, 1 column cuts (1 active) in 0.051 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1761 row cuts average 140.4 elements, 0 column cuts (0 active) in 0.219 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 92 row cuts average 14.5 elements, 0 column cuts (0 active) in 0.038 seconds - new frequency is 1 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 4 row cuts average 38.2 elements, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 493 row cuts average 33.3 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 +Cbc0014I Cut generator 7 (ZeroHalf) - 143 row cuts average 20.4 elements, 0 column cuts (0 active) in 0.085 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, -209.05 best solution, best possible -217.24754 (1.07 seconds) +Cbc0012I Integer solution of -209.5 found by DiveCoefficient after 3492 iterations and 2 nodes (1.23 seconds) +Cbc0012I Integer solution of -210 found by DiveCoefficient after 3587 iterations and 3 nodes (1.27 seconds) +Cbc0012I Integer solution of -211.85 found by DiveCoefficient after 3605 iterations and 4 nodes (1.27 seconds) +Cbc0004I Integer solution of -213.3 found after 3625 iterations and 4 nodes (1.27 seconds) +Cbc0001I Search completed - best objective -213.3, took 4451 iterations and 10 nodes (1.42 seconds) +Cbc0032I Strong branching done 348 times (10478 iterations), fathomed 2 nodes and fixed 2 variables +Cbc0035I Maximum depth 3, 86 variables fixed on reduced cost +Cuts at root node changed objective from -221.252 to -217.248 +Probing was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.051 seconds) +Gomory was tried 159 times and created 1870 cuts of which 0 were active after adding rounds of cuts (0.251 seconds) +Knapsack was tried 159 times and created 287 cuts of which 0 were active after adding rounds of cuts (0.067 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +MixedIntegerRounding2 was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +TwoMirCuts was tried 159 times and created 1071 cuts of which 0 were active after adding rounds of cuts (0.112 seconds) +ZeroHalf was tried 159 times and created 281 cuts of which 0 were active after adding rounds of cuts (0.124 seconds) Result - Optimal solution found -Objective value: -102.20000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.03 +Objective value: -213.30000000 +Enumerated nodes: 10 +Total iterations: 4451 +Time (CPU seconds): 1.39 +Time (Wallclock seconds): 1.44 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.04 +Total time (CPU seconds): 1.39 (Wallclock seconds): 1.44 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b950e48d98d14198b4f32b9927849acf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b950e48d98d14198b4f32b9927849acf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/374dfcefad1d4684985bf966759f9a76-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/374dfcefad1d4684985bf966759f9a76-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1054,160 +1185,152 @@ 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.75951 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 60 iterations 3 -Cbc0038I Solution found of 60 -Cbc0038I Relaxing continuous gives 60 +Cbc0038I Initial state - 3 integers unsatisfied sum - 1.24115 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 62.5 iterations 3 +Cbc0038I Solution found of 62.5 +Cbc0038I Relaxing continuous gives 62.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) -Cbc0038I Round again with cutoff of 54 -Cbc0038I Pass 2: suminf. 0.03089 (2) obj. 54 iterations 2 -Cbc0038I Pass 3: suminf. 0.42888 (2) obj. 54 iterations 6 -Cbc0038I Pass 4: suminf. 0.89842 (2) obj. 54 iterations 3 -Cbc0038I Pass 5: suminf. 0.00000 (0) obj. 54 iterations 3 -Cbc0038I Solution found of 54 -Cbc0038I Relaxing continuous gives 53 -Cbc0038I Before mini branch and bound, 15 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 11 columns -Cbc0038I Mini branch and bound improved solution from 53 to 51 (0.04 seconds) -Cbc0038I Round again with cutoff of 40.8 -Cbc0038I Pass 6: suminf. 0.09918 (2) obj. 40.8 iterations 1 -Cbc0038I Pass 7: suminf. 0.44216 (1) obj. 40.8 iterations 5 -Cbc0038I Pass 8: suminf. 0.44216 (1) obj. 40.8 iterations 0 -Cbc0038I Pass 9: suminf. 0.16263 (1) obj. 40.8 iterations 5 -Cbc0038I Pass 10: suminf. 0.42525 (1) obj. 40.8 iterations 3 -Cbc0038I Pass 11: suminf. 0.17803 (2) obj. 40.8 iterations 11 -Cbc0038I Pass 12: suminf. 0.00000 (0) obj. 40.8 iterations 3 -Cbc0038I Solution found of 40.8 -Cbc0038I Relaxing continuous gives 34 -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 34 to 12 (0.05 seconds) -Cbc0038I Round again with cutoff of 8.39999 -Cbc0038I Pass 13: suminf. 0.37232 (3) obj. 8.39999 iterations 1 -Cbc0038I Pass 14: suminf. 0.54531 (3) obj. 8.39999 iterations 5 -Cbc0038I Pass 15: suminf. 0.37420 (3) obj. 8.39999 iterations 1 -Cbc0038I Pass 16: suminf. 1.29320 (3) obj. 8.39999 iterations 7 -Cbc0038I Pass 17: suminf. 1.07820 (3) obj. 8.39999 iterations 2 -Cbc0038I Pass 18: suminf. 0.64788 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 19: suminf. 0.81933 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 20: suminf. 0.47450 (3) obj. 8.39999 iterations 4 -Cbc0038I Pass 21: suminf. 0.37645 (3) obj. 8.39999 iterations 4 -Cbc0038I Pass 22: suminf. 0.26182 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 23: suminf. 0.70443 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 24: suminf. 0.92410 (3) obj. 8.39999 iterations 4 -Cbc0038I Pass 25: suminf. 0.50852 (2) obj. 8.39999 iterations 3 -Cbc0038I Pass 26: suminf. 0.58704 (2) obj. 8.39999 iterations 4 -Cbc0038I Pass 27: suminf. 0.76591 (2) obj. 8.39999 iterations 3 -Cbc0038I Pass 28: suminf. 0.71462 (3) obj. 8.39999 iterations 9 -Cbc0038I Pass 29: suminf. 0.41807 (3) obj. 8.39999 iterations 2 -Cbc0038I Pass 30: suminf. 1.21431 (3) obj. 8.39999 iterations 2 -Cbc0038I Pass 31: suminf. 0.48012 (2) obj. 8.39999 iterations 5 -Cbc0038I Pass 32: suminf. 0.34158 (2) obj. 8.39999 iterations 4 -Cbc0038I Pass 33: suminf. 0.47039 (2) obj. 8.39999 iterations 7 -Cbc0038I Pass 34: suminf. 0.38219 (2) obj. 8.39999 iterations 3 -Cbc0038I Pass 35: suminf. 0.40688 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 36: suminf. 0.18312 (3) obj. 8.39999 iterations 2 -Cbc0038I Pass 37: suminf. 0.91964 (3) obj. 8.39999 iterations 5 -Cbc0038I Pass 38: suminf. 0.68836 (3) obj. 8.39999 iterations 2 -Cbc0038I Pass 39: suminf. 0.98172 (3) obj. 8.39999 iterations 3 -Cbc0038I Pass 40: suminf. 0.79986 (3) obj. 8.39999 iterations 1 -Cbc0038I Pass 41: suminf. 1.01364 (3) obj. 8.39999 iterations 1 -Cbc0038I Pass 42: suminf. 0.53008 (2) obj. 8.39999 iterations 6 +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 56.25 +Cbc0038I Pass 2: suminf. 0.06995 (2) obj. 56.25 iterations 2 +Cbc0038I Pass 3: suminf. 0.54879 (2) obj. 56.25 iterations 2 +Cbc0038I Pass 4: suminf. 0.99293 (3) obj. 56.25 iterations 8 +Cbc0038I Pass 5: suminf. 0.08488 (1) obj. 56.25 iterations 7 +Cbc0038I Pass 6: suminf. 0.39186 (1) obj. 56.25 iterations 5 +Cbc0038I Pass 7: suminf. 0.00000 (0) obj. 56.25 iterations 4 +Cbc0038I Solution found of 56.25 +Cbc0038I Relaxing continuous gives 30.5 +Cbc0038I Before mini branch and bound, 8 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0038I Mini branch and bound improved solution from 30.5 to 9.5 (0.01 seconds) +Cbc0038I Round again with cutoff of 7.59999 +Cbc0038I Pass 8: suminf. 0.84453 (3) obj. 7.59999 iterations 2 +Cbc0038I Pass 9: suminf. 0.83684 (3) obj. 7.59999 iterations 2 +Cbc0038I Pass 10: suminf. 0.43043 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 11: suminf. 0.69538 (3) obj. 7.59999 iterations 4 +Cbc0038I Pass 12: suminf. 0.69538 (3) obj. 7.59999 iterations 0 +Cbc0038I Pass 13: suminf. 1.02418 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 14: suminf. 0.88006 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 15: suminf. 0.71468 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 16: suminf. 0.40607 (2) obj. 7.59999 iterations 3 +Cbc0038I Pass 17: suminf. 1.08106 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 18: suminf. 0.48312 (2) obj. 7.59999 iterations 3 +Cbc0038I Pass 19: suminf. 0.91002 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 20: suminf. 0.37602 (2) obj. 7.59999 iterations 6 +Cbc0038I Pass 21: suminf. 0.52985 (2) obj. 7.59999 iterations 4 +Cbc0038I Pass 22: suminf. 0.39347 (2) obj. 7.59999 iterations 2 +Cbc0038I Pass 23: suminf. 0.98250 (3) obj. 7.59999 iterations 4 +Cbc0038I Pass 24: suminf. 0.79515 (2) obj. 7.59999 iterations 3 +Cbc0038I Pass 25: suminf. 0.80971 (3) obj. 7.59999 iterations 4 +Cbc0038I Pass 26: suminf. 0.70006 (2) obj. 7.59999 iterations 3 +Cbc0038I Pass 27: suminf. 0.88569 (2) obj. 7.59999 iterations 2 +Cbc0038I Pass 28: suminf. 0.58313 (3) obj. 7.59999 iterations 9 +Cbc0038I Pass 29: suminf. 0.13383 (2) obj. 7.59999 iterations 5 +Cbc0038I Pass 30: suminf. 0.84065 (3) obj. 7.59999 iterations 3 +Cbc0038I Pass 31: suminf. 0.37272 (2) obj. 7.59999 iterations 4 +Cbc0038I Pass 32: suminf. 0.63596 (3) obj. 7.59999 iterations 9 +Cbc0038I Pass 33: suminf. 0.63596 (3) obj. 7.59999 iterations 0 +Cbc0038I Pass 34: suminf. 0.83573 (3) obj. 7.59999 iterations 2 +Cbc0038I Pass 35: suminf. 0.80991 (3) obj. 7.59999 iterations 1 +Cbc0038I Pass 36: suminf. 1.23915 (3) obj. 7.59999 iterations 2 +Cbc0038I Pass 37: suminf. 0.45605 (3) obj. 7.59999 iterations 1 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns -Cbc0038I Mini branch and bound improved solution from 12 to 2 (0.18 seconds) -Cbc0038I Round again with cutoff of 1.39999 -Cbc0038I Pass 42: suminf. 0.44396 (2) obj. 1.39999 iterations 1 -Cbc0038I Pass 43: suminf. 0.95940 (3) obj. 1.39999 iterations 4 -Cbc0038I Pass 44: suminf. 0.44549 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 45: suminf. 0.47401 (3) obj. 1.39999 iterations 1 -Cbc0038I Pass 46: suminf. 0.58485 (2) obj. 1.39999 iterations 9 -Cbc0038I Pass 47: suminf. 0.54310 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 48: suminf. 1.01105 (3) obj. 1.39999 iterations 4 -Cbc0038I Pass 49: suminf. 0.80584 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 50: suminf. 0.62949 (3) obj. 1.39999 iterations 2 -Cbc0038I Pass 51: suminf. 0.72201 (3) obj. 1.39999 iterations 2 -Cbc0038I Pass 52: suminf. 0.66094 (3) obj. 1.39999 iterations 1 -Cbc0038I Pass 53: suminf. 0.82388 (3) obj. 1.39999 iterations 5 -Cbc0038I Pass 54: suminf. 0.61691 (3) obj. 1.39999 iterations 5 -Cbc0038I Pass 55: suminf. 0.75296 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 56: suminf. 0.69424 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 57: suminf. 0.71854 (3) obj. 1.39999 iterations 6 -Cbc0038I Pass 58: suminf. 0.38730 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 59: suminf. 0.55632 (3) obj. 1.39999 iterations 2 -Cbc0038I Pass 60: suminf. 0.47532 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 61: suminf. 0.82398 (3) obj. 1.39999 iterations 4 -Cbc0038I Pass 62: suminf. 0.59680 (3) obj. 1.39999 iterations 4 -Cbc0038I Pass 63: suminf. 1.05726 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 64: suminf. 0.65590 (3) obj. 1.39999 iterations 4 -Cbc0038I Pass 65: suminf. 0.83895 (3) obj. 1.39999 iterations 3 -Cbc0038I Pass 66: suminf. 0.78443 (3) obj. 1.39999 iterations 2 -Cbc0038I Pass 67: suminf. 1.11495 (3) obj. 1.39999 iterations 10 -Cbc0038I Pass 68: suminf. 0.49726 (2) obj. 1.39999 iterations 4 -Cbc0038I Pass 69: suminf. 0.52417 (2) obj. 1.39999 iterations 2 -Cbc0038I Pass 70: suminf. 0.60773 (3) obj. 1.39999 iterations 11 -Cbc0038I Pass 71: suminf. 0.20876 (2) obj. 1.39999 iterations 6 +Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0038I Mini branch and bound improved solution from 9.5 to 8.5 (0.02 seconds) +Cbc0038I Round again with cutoff of 5.31999 +Cbc0038I Pass 37: suminf. 0.88275 (3) obj. 5.31999 iterations 0 +Cbc0038I Pass 38: suminf. 0.81819 (3) obj. 5.31999 iterations 2 +Cbc0038I Pass 39: suminf. 0.48119 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 40: suminf. 0.74589 (3) obj. 5.31999 iterations 4 +Cbc0038I Pass 41: suminf. 0.74589 (3) obj. 5.31999 iterations 0 +Cbc0038I Pass 42: suminf. 1.01228 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 43: suminf. 0.89425 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 44: suminf. 0.65231 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 45: suminf. 0.43915 (2) obj. 5.31999 iterations 3 +Cbc0038I Pass 46: suminf. 1.09023 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 47: suminf. 0.49514 (2) obj. 5.31999 iterations 3 +Cbc0038I Pass 48: suminf. 0.31260 (3) obj. 5.31999 iterations 6 +Cbc0038I Pass 49: suminf. 0.23806 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 50: suminf. 0.57198 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 51: suminf. 0.49386 (1) obj. 5.31999 iterations 6 +Cbc0038I Pass 52: suminf. 0.48050 (1) obj. 5.31999 iterations 2 +Cbc0038I Pass 53: suminf. 0.64221 (3) obj. 5.31999 iterations 9 +Cbc0038I Pass 54: suminf. 0.28496 (3) obj. 5.31999 iterations 5 +Cbc0038I Pass 55: suminf. 0.34245 (2) obj. 5.31999 iterations 6 +Cbc0038I Pass 56: suminf. 0.34245 (2) obj. 5.31999 iterations 0 +Cbc0038I Pass 57: suminf. 0.50552 (3) obj. 5.31999 iterations 4 +Cbc0038I Pass 58: suminf. 0.50552 (3) obj. 5.31999 iterations 0 +Cbc0038I Pass 59: suminf. 0.20675 (3) obj. 5.31999 iterations 5 +Cbc0038I Pass 60: suminf. 0.13840 (2) obj. 5.31999 iterations 3 +Cbc0038I Pass 61: suminf. 0.56989 (3) obj. 5.31999 iterations 4 +Cbc0038I Pass 62: suminf. 0.55990 (3) obj. 5.31999 iterations 1 +Cbc0038I Pass 63: suminf. 0.57132 (3) obj. 5.31999 iterations 3 +Cbc0038I Pass 64: suminf. 0.50552 (3) obj. 5.31999 iterations 1 +Cbc0038I Pass 65: suminf. 0.20675 (3) obj. 5.31999 iterations 5 +Cbc0038I Pass 66: suminf. 0.13840 (2) obj. 5.31999 iterations 3 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 26 columns -Cbc0038I Mini branch and bound did not improve solution (0.30 seconds) -Cbc0038I After 0.30 seconds - Feasibility pump exiting with objective of 2 - took 0.09 seconds -Cbc0012I Integer solution of 2 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0031I 5 added rows had average density of 18.4 -Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.008 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 537 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.024 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 310 row cuts average 11.5 elements, 0 column cuts (0 active) in 0.028 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 535 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 58 row cuts average 8.8 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 338 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 2 best solution, best possible 0 (1.04 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 8.5 - took 0.03 seconds +Cbc0012I Integer solution of 8.5 found by feasibility pump after 0 iterations and 0 nodes (0.04 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 21 columns -Cbc0010I After 1000 nodes, 8 on tree, 2 best solution, best possible 0 (3.76 seconds) +Cbc0031I 4 added rows had average density of 15.5 +Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 100 passes +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) - 583 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 370 row cuts average 10.5 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 522 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 82 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 348 row cuts average 18.1 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 8.5 best solution, best possible 0 (0.13 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0012I Integer solution of 6.5 found by DiveCoefficient after 1214 iterations and 60 nodes (0.15 seconds) +Cbc0016I Integer solution of 4.5 found by strong branching after 1246 iterations and 64 nodes (0.15 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 13 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0010I After 2000 nodes, 5 on tree, 2 best solution, best possible 0 (5.37 seconds) -Cbc0001I Search completed - best objective 1.999999999999943, took 36311 iterations and 16760 nodes (6.94 seconds) -Cbc0032I Strong branching done 10734 times (23090 iterations), fathomed 477 nodes and fixed 645 variables -Cbc0041I Maximum depth 13, 570 variables fixed on reduced cost (complete fathoming 823 times, 14046 nodes taking 26636 iterations) +Cbc0010I After 1000 nodes, 6 on tree, 4.5 best solution, best possible 0 (0.37 seconds) +Cbc0016I Integer solution of 3.5 found by strong branching after 5342 iterations and 1084 nodes (0.39 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 11 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0010I After 2000 nodes, 6 on tree, 3.5 best solution, best possible 0 (0.60 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0001I Search completed - best objective 3.499999999999943, took 34570 iterations and 14288 nodes (0.81 seconds) +Cbc0032I Strong branching done 12980 times (33395 iterations), fathomed 496 nodes and fixed 802 variables +Cbc0041I Maximum depth 13, 730 variables fixed on reduced cost (complete fathoming 862 times, 11368 nodes taking 23115 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) -Gomory was tried 100 times and created 537 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) -Knapsack was tried 100 times and created 310 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 100 times and created 535 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) -FlowCover was tried 100 times and created 58 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) -TwoMirCuts was tried 100 times and created 338 cuts of which 0 were active after adding rounds of cuts (0.010 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 583 cuts of which 0 were active after adding rounds of cuts (0.010 seconds) +Knapsack was tried 100 times and created 370 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 100 times and created 522 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) +FlowCover was tried 100 times and created 82 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +TwoMirCuts was tried 100 times and created 348 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 2.00000000 -Enumerated nodes: 16760 -Total iterations: 36311 -Time (CPU seconds): 2.35 -Time (Wallclock seconds): 6.95 +Objective value: 3.50000000 +Enumerated nodes: 14288 +Total iterations: 34570 +Time (CPU seconds): 0.81 +Time (Wallclock seconds): 0.81 Option for printingOptions changed from normal to all -Total time (CPU seconds): 2.35 (Wallclock seconds): 6.95 +Total time (CPU seconds): 0.81 (Wallclock seconds): 0.81 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1b872ab5a3d34f8783f2044b53c7dba9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b872ab5a3d34f8783f2044b53c7dba9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/623cf91a1ecd468aba4d93f914d492e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/623cf91a1ecd468aba4d93f914d492e1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1230,7 +1353,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8493a47cedd14deb98539eea5e60a8b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8493a47cedd14deb98539eea5e60a8b8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8a844bf46af24945b9cff9f19e1d330e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8a844bf46af24945b9cff9f19e1d330e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1247,7 +1370,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.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 test_doctest (pulp.tests.test_examples.Examples_DocsTests.test_doctest) runs all doctests ... ok @@ -1257,20 +1380,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7812ba4a0b0c496ab1779c30492f4d2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7812ba4a0b0c496ab1779c30492f4d2c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f51cde4fa0744788b6105853bc83d8c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f51cde4fa0744788b6105853bc83d8c6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0 to -1.79769e+308 +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1282,34 +1408,53 @@ 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.06 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.09 +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/10825c337b3d44c7bfcc47dcf673baed-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10825c337b3d44c7bfcc47dcf673baed-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/00827ba2fc2d41b1bb73f69a8dafd4ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00827ba2fc2d41b1bb73f69a8dafd4ea-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 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -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 8630 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8630 to 8630 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8630.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 @@ -1317,77 +1462,64 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0b38d543d49a47e4abee01acf64febd8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b38d543d49a47e4abee01acf64febd8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0cdd5c4635f44123b4ad689a767017ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cdd5c4635f44123b4ad689a767017ff-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Continuous objective value is 8660 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.01 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8660 to 8660 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 228100.00000000 +Objective value: 8660.00000000 Enumerated nodes: 0 -Total iterations: 13 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.02 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 +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/466332fae7bc4efdacffc4f10cad6f6a-pulp.mps mips /tmp/466332fae7bc4efdacffc4f10cad6f6a-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/466332fae7bc4efdacffc4f10cad6f6a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f9720598bd024a95bf49c2bb527a54c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9720598bd024a95bf49c2bb527a54c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/466332fae7bc4efdacffc4f10cad6f6a-pulp.mst. -MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8690 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.17 seconds) -Cbc0006I The LP relaxation is infeasible or too expensive -Cbc0045I Solution of 12 already found by heuristic -Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 +Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8690 to 8690 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) @@ -1399,34 +1531,53 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.10 -Time (Wallclock seconds): 0.21 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.14 (Wallclock seconds): 0.28 +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/eedc3e657c4c408a9b4468ed36bbb32e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eedc3e657c4c408a9b4468ed36bbb32e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ae1c56c60838443a94bd7e4791a81113-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae1c56c60838443a94bd7e4791a81113-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 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -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 8720 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8720 to 8720 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8720.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 @@ -1434,73 +1585,81 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9830bc39e5334c74b3568430d250a373-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9830bc39e5334c74b3568430d250a373-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/060f827040e74ef9b6209f40eac26583-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/060f827040e74ef9b6209f40eac26583-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.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.01 seconds) -Cbc0031I 2 added rows had average density of 3.5 -Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 8750 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -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 8750 to 8750 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.05000000 +Objective value: 8750.00000000 Enumerated nodes: 0 -Total iterations: 4 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e1c5603b2ead4804a9d11836ce9a11b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1c5603b2ead4804a9d11836ce9a11b9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b9dde25972ab49d388b51abecfaf3dde-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9dde25972ab49d388b51abecfaf3dde-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 +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -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 +Continuous objective value is 8780 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8780 to 8780 +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: 8780.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -1508,130 +1667,105 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/47511a3fcfc543129924cdd5a493b97f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/47511a3fcfc543129924cdd5a493b97f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ade58766fc6a4704ab63e8c049ee267d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ade58766fc6a4704ab63e8c049ee267d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 8810 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8810 to 8810 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.00000000 +Objective value: 8810.00000000 Enumerated nodes: 0 -Total iterations: 6 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1f3cae83e089408e9cb1eaa58c0d1872-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f3cae83e089408e9cb1eaa58c0d1872-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/271dad6a3bb54fe29b1785e53cc5ca0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/271dad6a3bb54fe29b1785e53cc5ca0d-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 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 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.02 seconds) -Cbc0031I 1 added rows had average density of 3 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.02 seconds) +Continuous objective value is 8840 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 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 8840 to 8840 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 8840.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d4cf85d5ee0d4ab89d85206d666c7672-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4cf85d5ee0d4ab89d85206d666c7672-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/11acab41f92b4a83a438b79ad3dad281-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11acab41f92b4a83a438b79ad3dad281-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8870 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -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.33 seconds) -Cbc0038I After 0.33 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.33 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.33 seconds) +Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 12 to 12 +Cuts at root node changed objective from 8870 to 8870 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1643,36 +1777,36 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8870.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.11 -Time (Wallclock seconds): 0.42 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.14 (Wallclock seconds): 0.48 +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/aeaa79d714084d2ab0310af3a673e522-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aeaa79d714084d2ab0310af3a673e522-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/74038e34c45e440583d3b9409a3d2ea3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74038e34c45e440583d3b9409a3d2ea3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 72 RHS -At line 81 BOUNDS -At line 94 ENDATA -Problem MODEL has 8 rows, 12 columns and 24 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements +Continuous objective value is 8900 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Cuts at root node changed objective from 8900 to 8900 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1684,73 +1818,106 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.02 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.03 +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/a586d9f3ec334b2f8cc2fd5a518d23cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a586d9f3ec334b2f8cc2fd5a518d23cc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/177930b20bf04d5c944cad68079bf5d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/177930b20bf04d5c944cad68079bf5d4-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 24 RHS +At line 28 BOUNDS +At line 32 ENDATA +Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 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 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.001 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 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: 246.50000000 +Objective value: 300.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/7458d8586eed4eb6a6c5c6af26d262a5-pulp.mps mips /tmp/7458d8586eed4eb6a6c5c6af26d262a5-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/7458d8586eed4eb6a6c5c6af26d262a5-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements +Coin0008I MODEL read with 0 errors +opening mipstart file /tmp/7458d8586eed4eb6a6c5c6af26d262a5-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.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.03 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +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/9d419c24d58d44269dac75738fffa1ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d419c24d58d44269dac75738fffa1ea-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/39ff0eca0ba449a9999cb8e1aea39e68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39ff0eca0ba449a9999cb8e1aea39e68-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -1767,10 +1934,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 30 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1787,17 +1954,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.06 +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/50e47c053e154131963d566331098ff3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50e47c053e154131963d566331098ff3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9339b1e0e6eb4c0a8510907c1c4f70d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9339b1e0e6eb4c0a8510907c1c4f70d7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -1820,10 +1987,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.21 seconds) -Cbc0038I After 0.21 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.21 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.21 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1840,17 +2007,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.23 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.25 +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/af0aa738ecf84e2d82f169e270796fbe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af0aa738ecf84e2d82f169e270796fbe-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/74af9270ee304a89ad09feb1b39af1d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74af9270ee304a89ad09feb1b39af1d8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -1875,10 +2042,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.34 seconds) -Cbc0038I After 0.34 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.34 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.34 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) @@ -1895,17 +2062,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.35 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.44 +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/7cbd2d3097f942b98ac3722fbb66ecdd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7cbd2d3097f942b98ac3722fbb66ecdd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f9f2523af9e9405485f31224c25ec66e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f2523af9e9405485f31224c25ec66e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -1930,10 +2097,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.23 seconds) -Cbc0038I After 0.23 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.23 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.23 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) @@ -1950,17 +2117,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.10 -Time (Wallclock seconds): 0.25 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.27 +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/dabd57334f9346e9bad6b4e7c872447b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dabd57334f9346e9bad6b4e7c872447b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5ef82f01cca84643bca39991fc90eea2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ef82f01cca84643bca39991fc90eea2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -1983,10 +2150,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.20 seconds) -Cbc0038I After 0.20 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.20 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.20 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) @@ -2003,17 +2170,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.21 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.22 +Total time (CPU seconds): 0.03 (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/d6e5b7ec3cef47c086e93a01cba42a43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6e5b7ec3cef47c086e93a01cba42a43-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/04f2791f85364270a3c9541c18eba3a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04f2791f85364270a3c9541c18eba3a9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -2036,10 +2203,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.27 seconds) -Cbc0038I After 0.27 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.28 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.28 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) @@ -2056,17 +2223,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.29 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.30 +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/28dc1d78fef64d2591f6439186cf9758-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28dc1d78fef64d2591f6439186cf9758-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/367698ebe6fa4283ac58f81ad8110365-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/367698ebe6fa4283ac58f81ad8110365-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -2090,10 +2257,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.31 seconds) -Cbc0038I After 0.31 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.31 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.32 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) @@ -2110,17 +2277,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.34 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.36 +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/84e1aa02ef28474386dab1535da6e230-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84e1aa02ef28474386dab1535da6e230-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/54134317297f46bab5b1de47c88b14b5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54134317297f46bab5b1de47c88b14b5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -2143,10 +2310,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.27 seconds) -Cbc0038I After 0.27 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.27 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.27 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) @@ -2163,17 +2330,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.10 -Time (Wallclock seconds): 0.28 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.31 +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/f9f4e6581da24d5eb2a129da2ac11604-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f4e6581da24d5eb2a129da2ac11604-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/074d429b44934877b58a53ea145c580a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/074d429b44934877b58a53ea145c580a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -2193,10 +2360,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.29 seconds) -Cbc0038I After 0.29 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.29 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.29 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) @@ -2213,17 +2380,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.30 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.33 +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/3d374e6354854ba19a18e5b2e0e67e21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3d374e6354854ba19a18e5b2e0e67e21-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e221be41dd0d4a3b806de51d7ca013c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e221be41dd0d4a3b806de51d7ca013c2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -2233,7 +2400,7 @@ Problem MODEL has 359 rows, 730 columns and 3671 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 84 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions @@ -2242,10 +2409,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.28 seconds) -Cbc0038I After 0.28 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.28 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.28 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) @@ -2262,17 +2429,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.31 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.32 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8d87ff52f54740bf85db263ddd475f88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d87ff52f54740bf85db263ddd475f88-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bec73c43e5a8432d87881c1938766e63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bec73c43e5a8432d87881c1938766e63-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -2301,17 +2468,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.26 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.29 +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/85146bb31ecd4a85be70cc25e4666fea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85146bb31ecd4a85be70cc25e4666fea-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5aeda327ab7844c890971a0f90ba54d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5aeda327ab7844c890971a0f90ba54d0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -2343,17 +2510,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.10 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.11 +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/773ca0dd05c34cbb9ec1cfb5ade7dbf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/773ca0dd05c34cbb9ec1cfb5ade7dbf2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/89c5f10a330f45a1864df654b5c73a91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c5f10a330f45a1864df654b5c73a91-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -2402,8 +2569,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.11 seconds) -Cbc0038I After 0.11 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 @@ -2414,7 +2581,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.11 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) @@ -2431,70 +2598,28 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.11 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.12 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/0345a724a2e947429692b284af9ac49e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0345a724a2e947429692b284af9ac49e-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.01 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +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/cdc62d422ac247ec9d1e09ceb6e9f094-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdc62d422ac247ec9d1e09ceb6e9f094-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b0c83709aa1747178e20e35c3ab9a677-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0c83709aa1747178e20e35c3ab9a677-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 13 COLUMNS +At line 72 RHS +At line 81 BOUNDS +At line 94 ENDATA +Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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) @@ -2518,70 +2643,48 @@ 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/3923f5b43d1748a8aebc2c32cb349fab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3923f5b43d1748a8aebc2c32cb349fab-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b1adae5b93754523b4a608673406963d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1adae5b93754523b4a608673406963d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 10 COLUMNS +At line 42 RHS +At line 48 BOUNDS +At line 49 ENDATA +Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8630 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8630 to 8630 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8630.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - +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.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/afacff1749c94e27a8676d5e58060032-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/afacff1749c94e27a8676d5e58060032-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a421c8133ecf4857888937ee621d26c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a421c8133ecf4857888937ee621d26c7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8660 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8660 to 8660 +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) @@ -2593,92 +2696,10 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.03 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (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/378fe5bf919a42a2a8f066404618724b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/378fe5bf919a42a2a8f066404618724b-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8690 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8690 to 8690 -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: 8690.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.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/adcc60f9428f47929a7ef4571e7d8d21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/adcc60f9428f47929a7ef4571e7d8d21-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8720 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8720 to 8720 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8720.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all @@ -2688,327 +2709,52 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bc31654c95904904a937cff69298b19c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bc31654c95904904a937cff69298b19c-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8750 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8750 to 8750 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8750.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/8126488e748f4e799c9f0262ae2acc14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8126488e748f4e799c9f0262ae2acc14-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8780 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8780 to 8780 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -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: 8780.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/7b178b4e3c3545be96ea66cab0a1df55-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b178b4e3c3545be96ea66cab0a1df55-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8810 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8810 to 8810 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -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: 8810.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.03 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/1e5c5514c35b42d6a1666d1f434ff343-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e5c5514c35b42d6a1666d1f434ff343-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/49b6f362065c4aeb9683b987644d3fbc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/49b6f362065c4aeb9683b987644d3fbc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8840 to 8840 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8840.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -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/ef94f2dc19e94107ba34db0af1456370-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef94f2dc19e94107ba34db0af1456370-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8870 to 8870 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8870.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/8fd3501d00d04ac7bea9ff1cbad28c1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8fd3501d00d04ac7bea9ff1cbad28c1b-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 13 COLUMNS +At line 110 RHS +At line 119 BOUNDS +At line 140 ENDATA +Problem MODEL has 8 rows, 20 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8900 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Continuous objective value is 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 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8900 to 8900 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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: 8900.00000000 +Objective value: 228100.00000000 Enumerated nodes: 0 -Total iterations: 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.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/4219f71efec640c49609c20801aaf310-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4219f71efec640c49609c20801aaf310-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0.97 to -1.79769e+308 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 0.97000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/6c138f30f53e44ce98413390d1318fc1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6c138f30f53e44ce98413390d1318fc1-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 32 ENDATA -Problem MODEL has 3 rows, 3 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 300.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ @@ -3045,44 +2791,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 = 0.0 +x_0 = 1.0 +x_1 = 1.0 x_2 = 1.0 -x_3 = 1.0 +x_3 = 0.0 x_4 = 1.0 -x_5 = 0.0 +x_5 = 1.0 x_6 = 0.0 -x_7 = 0.0 +x_7 = 1.0 x_8 = 1.0 x_9 = 1.0 Status: Optimal s_0 = 0.0 -s_1 = 0.0 +s_1 = 3.0 s_2 = 0.5 -w_0 = 1.0 -w_1 = 0.5 +w_0 = 0.0 +w_1 = 0.0 w_2 = 0.0 x_0 = 0.0 -x_1 = 0.0 +x_1 = 1.0 x_10 = 1.0 x_11 = 0.0 -x_12 = 1.0 -x_13 = 1.0 -x_14 = 1.0 +x_12 = 0.0 +x_13 = 0.0 +x_14 = 0.0 x_15 = 0.0 x_16 = 1.0 x_17 = 1.0 -x_18 = 0.0 +x_18 = 1.0 x_19 = 1.0 -x_2 = 1.0 +x_2 = 0.0 x_3 = 1.0 -x_4 = 0.0 -x_5 = 0.0 +x_4 = 1.0 +x_5 = 1.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.0 +objective= 3.5 Status: Optimal x = 4.0 y = -1.0 @@ -3139,134 +2885,6 @@ 8 passed. Test passed. Status: Optimal -Solution 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 -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -P0 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_A_D = 0.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.0 -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = 0.0 -Patt_P13 = 0.0 -Patt_P14 = 0.0 -Patt_P2 = 137.0 -Patt_P3 = 0.0 -Patt_P4 = 0.0 -Patt_P5 = 0.0 -Patt_P6 = 0.0 -Patt_P7 = 0.0 -Patt_P8 = 0.0 -Patt_P9 = 100.0 -Surp_5 = 2.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 246.50000000000003 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Infeasible -Solutions Written to sudokuout.txt -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 Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 @@ -3399,14 +3017,76 @@ Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 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 +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_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 +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 +Solution Written to sudokuout.txt +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 @@ -3469,7 +3149,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/679813657f4d414c85aa184dadc63eed-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/679813657f4d414c85aa184dadc63eed-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e2b813cd9f134e18928fd4ed2980f68d-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/e2b813cd9f134e18928fd4ed2980f68d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS @@ -3492,23 +3172,28 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f8de80f363574856aedde08023e904a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f8de80f363574856aedde08023e904a0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7f0e1a3a6a5a4b4893a75b1133b9252e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f0e1a3a6a5a4b4893a75b1133b9252e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 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) +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 8600 to 8600 +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) @@ -3520,36 +3205,36 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dbe136c0faf2478daeb19cd2cdc0f934-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbe136c0faf2478daeb19cd2cdc0f934-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/56637a3f39034a44b7a507ab29e60b2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56637a3f39034a44b7a507ab29e60b2c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 84 RHS -At line 93 BOUNDS -At line 109 ENDATA -Problem MODEL has 8 rows, 15 columns and 30 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 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) +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 8300 to 8300 +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) @@ -3561,43 +3246,20 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/3ebd408e6a4c450f83f07140b6041621-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/3ebd408e6a4c450f83f07140b6041621-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 -Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fb8a953af4ac4f5982245fef9bbc3393-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb8a953af4ac4f5982245fef9bbc3393-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/64520a6bb3de4931a23bfb2912cad16a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/64520a6bb3de4931a23bfb2912cad16a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3613,13 +3275,13 @@ 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.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/9a843e58566d4ac689d2a09be44cbb68-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a843e58566d4ac689d2a09be44cbb68-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e7ce95ec8328460f8c4bba3fa73c82c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e7ce95ec8328460f8c4bba3fa73c82c1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3660,7 +3322,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bf620b1197e946b89896fd6f3f9c80b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf620b1197e946b89896fd6f3f9c80b0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f3ef61b7575740b7b2be00892bd861de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f3ef61b7575740b7b2be00892bd861de-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3676,13 +3338,13 @@ 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.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/b0c85bdbf13749b98a2a6c73dd49218a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b0c85bdbf13749b98a2a6c73dd49218a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c0cb5e1dc7de4e55982b7d6811ceafb4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0cb5e1dc7de4e55982b7d6811ceafb4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3695,8 +3357,8 @@ Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -3705,7 +3367,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3723,16 +3385,16 @@ Enumerated nodes: 0 Total iterations: 2 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6a9203fbb7fe4890ab3203f3e3ef8866-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a9203fbb7fe4890ab3203f3e3ef8866-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/46ecd88c39d0401eb5393bebe4f0e4fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46ecd88c39d0401eb5393bebe4f0e4fd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3756,7 +3418,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ab5d97c3cc5a4067be3dea48cdc31386-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab5d97c3cc5a4067be3dea48cdc31386-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e5ca467eca524dec996eb278fd1aa12c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5ca467eca524dec996eb278fd1aa12c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3769,8 +3431,8 @@ Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3788,16 +3450,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a4b017d8807849b887ff972c972759c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4b017d8807849b887ff972c972759c9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/03b3734fe3e942c9a2fa5a836c982e30-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03b3734fe3e942c9a2fa5a836c982e30-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3815,13 +3477,13 @@ After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/aadc66dbba0e4413a48e6896384aecdc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aadc66dbba0e4413a48e6896384aecdc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2cf8ec5775d14baa97b63138cdd72a6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2cf8ec5775d14baa97b63138cdd72a6d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3843,7 +3505,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3861,16 +3523,16 @@ Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/acddefc3f6ce4e85aa94abe338060720-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/acddefc3f6ce4e85aa94abe338060720-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/259f7e50c77840129f5abc3ace774150-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/259f7e50c77840129f5abc3ace774150-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3884,9 +3546,9 @@ Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.04 seconds) +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 @@ -3896,7 +3558,7 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 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.04 seconds) +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) @@ -3913,17 +3575,58 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.01 -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.01 (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/e7d6781c62ee46089020b36d5730af59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e7d6781c62ee46089020b36d5730af59-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0f10eafa85f44a90b214f4a23732d757-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f10eafa85f44a90b214f4a23732d757-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8300 to 8300 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8300.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/6fa6783af36345a08310328e5e7911aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fa6783af36345a08310328e5e7911aa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3939,7 +3642,7 @@ Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) +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 @@ -3949,7 +3652,7 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +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) @@ -3967,16 +3670,81 @@ Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/696bc4f793ac41f9a668677550f5dabb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/696bc4f793ac41f9a668677550f5dabb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/93a552bf07764319bb2b11dccb4f0f87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93a552bf07764319bb2b11dccb4f0f87-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/565ebcdeeb4d49d7a164457205d0c7d3-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/565ebcdeeb4d49d7a164457205d0c7d3-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/55744cdbbc71436fa41ce73bc19639f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/55744cdbbc71436fa41ce73bc19639f5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -3990,8 +3758,8 @@ Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements Cutoff increment increased from 1e-05 to 0.024975 -Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 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) @@ -4009,10 +3777,299 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/75b10d9e77c141a3bbb311076063443b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75b10d9e77c141a3bbb311076063443b-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 251.5 +After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/c2d0566b482e4470883dedb723255847-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2d0566b482e4470883dedb723255847-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.08571 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) +Cbc0031I 2 added rows had average density of 3.5 +Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.06667 to -1.05 +Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.05000000 +Enumerated nodes: 0 +Total iterations: 4 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/2a167c1b573341d8aef9f03f8aeb38ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a167c1b573341d8aef9f03f8aeb38ca-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/48139df591414e1faa6f24eac88987f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48139df591414e1faa6f24eac88987f2-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.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/d93349bce4c84fb0a4df1d42b2f418db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d93349bce4c84fb0a4df1d42b2f418db-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 38 RHS +At line 42 BOUNDS +At line 50 ENDATA +Problem MODEL has 3 rows, 7 columns and 8 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 3 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 246.50000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/1240ade9e6c541aea64679a36b9973e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1240ade9e6c541aea64679a36b9973e6-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/6d39c8c49b4e4a11bd7c5ef406a42c40-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d39c8c49b4e4a11bd7c5ef406a42c40-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 10 COLUMNS +At line 25 RHS +At line 31 BOUNDS +At line 33 ENDATA +Problem MODEL has 5 rows, 2 columns and 10 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 0.97000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -5350,7 +5407,7 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 60.428s +Ran 1005 tests in 24.883s OK (skipped=885) @@ -5365,6 +5422,12 @@ production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 +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 @@ -5377,6 +5440,22 @@ Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +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 Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -5394,25 +5473,6 @@ 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 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -5450,6 +5510,17 @@ 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 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 +Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 @@ -5465,6 +5536,58 @@ 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 +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 +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 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 @@ -5730,90 +5853,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/__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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -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/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.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/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 copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/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 creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/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_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/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/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.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 -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__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/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__/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__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/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/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/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/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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/__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/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/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/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/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/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/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__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__/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__/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/__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.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__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/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/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/tests/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc +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/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/constants.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__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__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__/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/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 +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/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/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/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/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_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/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/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/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/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/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/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/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/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/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/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/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/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/mipcl_api.py to mipcl_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/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/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/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/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/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/__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/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/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/constants.py to constants.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.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 @@ -5843,12 +5966,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/1352493/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/1352493/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/1874257 and its subdirectories -I: Current time: Sun Mar 2 18:24:35 -12 2025 -I: pbuilder-time-stamp: 1740983075 +I: removing directory /srv/workspace/pbuilder/1352493 and its subdirectories +I: Current time: Mon Apr 6 02:49:04 +14 2026 +I: pbuilder-time-stamp: 1775393344