Diff of the two buildlogs: -- --- b1/build.log 2025-08-27 12:46:18.996892433 +0000 +++ b2/build.log 2025-08-27 12:48:19.813042831 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Tue Sep 29 07:05:22 -12 2026 -I: pbuilder-time-stamp: 1790708722 +I: Current time: Thu Aug 28 02:46:21 +14 2025 +I: pbuilder-time-stamp: 1756298781 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/forky-reproducible-base.tgz] I: copying local configuration @@ -26,53 +26,85 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/2065290/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/2257752/tmp/hooks/D01_modify_environment starting +debug: Running on ionos11-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 Aug 27 12:46 /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/2257752/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/2257752/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=42 ' - DISTRIBUTION='forky' - 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=40 ' + DIRSTACK=() + DISTRIBUTION=forky + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='6ed93c9f1f1b4331b49747b4847618f8' - 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='2065290' - PS1='# ' - PS2='> ' + INVOCATION_ID=cd98debad6d748c5839a51f142887161 + 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=2257752 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.g0pGv938/pbuilderrc_UNGQ --distribution forky --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/forky-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.g0pGv938/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='111' - SUDO_HOME='/var/lib/jenkins' - SUDO_UID='106' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://213.165.73.152:3128' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.g0pGv938/pbuilderrc_PcEx --distribution forky --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/forky-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.g0pGv938/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=111 + SUDO_HOME=/var/lib/jenkins + SUDO_UID=106 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://46.16.76.132:3128 I: uname -a - Linux ionos15-amd64 6.12.41+deb13-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.12.41-1 (2025-08-12) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.12.41+deb13-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.12.41-1 (2025-08-12) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Aug 10 2025 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/2065290/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Aug 10 12:30 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/2257752/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: 64 http://deb.debian.org/debian forky/main amd64 python3-setuptools all 78.1.1-0.1 [738 kB] Get: 65 http://deb.debian.org/debian forky/main amd64 python3-jaraco.context all 6.0.1-1 [8276 B] Get: 66 http://deb.debian.org/debian forky/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 25.5 MB in 14s (1888 kB/s) +Fetched 25.5 MB in 0s (79.6 MB/s) Preconfiguring packages ... Selecting previously unselected package libexpat1: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 ... 19855 files and directories currently installed.) @@ -410,8 +442,8 @@ Setting up tzdata (2025b-5) ... Current default time zone: 'Etc/UTC' -Local time is now: Tue Sep 29 19:06:44 UTC 2026. -Universal Time is now: Tue Sep 29 19:06:44 UTC 2026. +Local time is now: Wed Aug 27 12:47:38 UTC 2025. +Universal Time is now: Wed Aug 27 12:47:38 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20240727.1) ... @@ -477,7 +509,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/2257752/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for forky +I: user script /srv/workspace/pbuilder/2257752/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 @@ -552,12 +588,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +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 writing PuLP.egg-info/PKG-INFO @@ -758,7 +794,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d8ad8a7a48694eb9a814bf6169a8e7a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8ad8a7a48694eb9a814bf6169a8e7a4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8152c9254c3e4bab9223ad614b108f58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8152c9254c3e4bab9223ad614b108f58-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -775,13 +811,13 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.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/27cb78014cd04bf7ae89fbb4b74e2d01-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/27cb78014cd04bf7ae89fbb4b74e2d01-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/918139f2ca7643eca29f15548518f28f-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/918139f2ca7643eca29f15548518f28f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -799,7 +835,7 @@ Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 @@ -812,7 +848,7 @@ Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.02 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.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 @@ -831,7 +867,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.05 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 @@ -866,11 +902,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.09 seconds) -Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.09 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.09 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.02 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 @@ -879,7 +915,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.09 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.02 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) @@ -896,17 +932,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.10 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.10 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/58d0a43456fb40b4b9d87ea23bac7d56-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58d0a43456fb40b4b9d87ea23bac7d56-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/681e2099224f44e9a9c8f51b1d053aa7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/681e2099224f44e9a9c8f51b1d053aa7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -925,7 +961,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 48 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 38 columns -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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 @@ -951,7 +987,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.25 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.08 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 @@ -986,52 +1022,52 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 15 integers at bound fixed and 30 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 96 rows 81 columns -Cbc0038I Mini branch and bound did not improve solution (0.50 seconds) -Cbc0038I After 0.50 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.22 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.50 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) +Cbc0038I After 0.14 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.14 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.041 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.073 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.039 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.027 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (2.11 seconds) +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.022 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.040 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.024 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.70 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 (8.12 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (1.10 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.041 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.117 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.076 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.027 seconds) -TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.047 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.022 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.061 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.044 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) +TwoMirCuts was tried 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.006 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.73 -Time (Wallclock seconds): 8.17 +Time (CPU seconds): 1.08 +Time (Wallclock seconds): 1.11 Option for printingOptions changed from normal to all -Total time (CPU seconds): 2.74 (Wallclock seconds): 8.19 +Total time (CPU seconds): 1.08 (Wallclock seconds): 1.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2e6e8bb587784e939bbf0a0edf14d271-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e6e8bb587784e939bbf0a0edf14d271-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/aab4942df3c1482ba38f42efc9093c8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aab4942df3c1482ba38f42efc9093c8b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS @@ -1041,19 +1077,64 @@ Problem MODEL has 220 rows, 210 columns and 800 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -128.95 - 0.00 seconds -Cgl0004I processed model has 187 rows, 180 columns (180 integer (180 of which binary)) and 680 elements +Continuous objective value is -139.497 - 0.00 seconds +Cgl0004I processed model has 209 rows, 200 columns (200 integer (200 of which binary)) and 760 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 0 integers unsatisfied sum - 5.55112e-16 -Cbc0038I Solution found of -128.95 -Cbc0038I Before mini branch and bound, 180 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) -Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of -128.95 - took 0.00 seconds -Cbc0012I Integer solution of -128.95 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) -Cbc0001I Search completed - best objective -128.95, 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 -128.95 to -128.95 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0038I Initial state - 21 integers unsatisfied sum - 2.36779 +Cbc0038I Solution found of -139.2 +Cbc0038I Before mini branch and bound, 179 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 0 rows 0 columns +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Round again with cutoff of -139.3 +Cbc0038I Reduced cost fixing fixed 85 variables on major pass 2 +Cbc0038I Pass 1: suminf. 0.50000 (20) obj. -139.3 iterations 73 +Cbc0038I Pass 2: suminf. 8.96689 (23) obj. -139.3 iterations 15 +Cbc0038I Pass 3: suminf. 0.50000 (20) obj. -139.3 iterations 40 +Cbc0038I Pass 4: suminf. 1.31884 (21) obj. -139.3 iterations 9 +Cbc0038I Pass 5: suminf. 1.25000 (20) obj. -139.3 iterations 10 +Cbc0038I Pass 6: suminf. 8.96689 (23) obj. -139.3 iterations 11 +Cbc0038I Pass 7: suminf. 8.18328 (22) obj. -139.3 iterations 1 +Cbc0038I Pass 8: suminf. 7.29280 (23) obj. -139.3 iterations 9 +Cbc0038I Pass 9: suminf. 0.50000 (20) obj. -139.3 iterations 65 +Cbc0038I Pass 10: suminf. 6.99814 (22) obj. -139.3 iterations 29 +Cbc0038I Pass 11: suminf. 8.96689 (23) obj. -139.3 iterations 10 +Cbc0038I Pass 12: suminf. 0.50000 (20) obj. -139.3 iterations 23 +Cbc0038I Pass 13: suminf. 0.50000 (20) obj. -139.3 iterations 4 +Cbc0038I Pass 14: suminf. 1.25000 (20) obj. -139.3 iterations 8 +Cbc0038I Pass 15: suminf. 1.25000 (20) obj. -139.3 iterations 2 +Cbc0038I Pass 16: suminf. 7.44888 (23) obj. -139.3 iterations 8 +Cbc0038I Pass 17: suminf. 7.22480 (22) obj. -139.3 iterations 16 +Cbc0038I Pass 18: suminf. 8.18328 (22) obj. -139.3 iterations 10 +Cbc0038I Pass 19: suminf. 1.51884 (21) obj. -139.3 iterations 18 +Cbc0038I Pass 20: suminf. 0.50000 (20) obj. -139.3 iterations 14 +Cbc0038I Pass 21: suminf. 8.96689 (23) obj. -139.3 iterations 13 +Cbc0038I Pass 22: suminf. 0.50000 (20) obj. -139.3 iterations 28 +Cbc0038I Pass 23: suminf. 1.51884 (21) obj. -139.3 iterations 6 +Cbc0038I Pass 24: suminf. 1.25000 (20) obj. -139.3 iterations 6 +Cbc0038I Pass 25: suminf. 1.25000 (20) obj. -139.3 iterations 1 +Cbc0038I Pass 26: suminf. 7.22480 (22) obj. -139.3 iterations 18 +Cbc0038I Pass 27: suminf. 2.63058 (22) obj. -139.3 iterations 16 +Cbc0038I Pass 28: suminf. 0.50000 (20) obj. -139.3 iterations 13 +Cbc0038I Pass 29: suminf. 8.96689 (23) obj. -139.3 iterations 10 +Cbc0038I Pass 30: suminf. 0.50000 (20) obj. -139.3 iterations 23 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 173 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of -139.2 - took 0.02 seconds +Cbc0012I Integer solution of -139.2 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0013I At root node, 0 cuts changed objective from -139.49709 to -125.64203 in 1 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 17 column cuts (17 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +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 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 -139.2, took 0 iterations and 0 nodes (0.03 seconds) +Cbc0035I Maximum depth 0, 84 variables fixed on reduced cost +Cuts at root node changed objective from -139.497 to -125.642 +Probing was tried 1 times and created 17 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) @@ -1064,203 +1145,184 @@ Result - Optimal solution found -Objective value: -128.95000000 +Objective value: -139.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.04 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.04 +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/1a21142900024c58a427dab1b54ed26a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a21142900024c58a427dab1b54ed26a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2150f8d1f2104b7fb7b8bc5f60d4bc9f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2150f8d1f2104b7fb7b8bc5f60d4bc9f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 121 RHS -At line 125 BOUNDS -At line 146 ENDATA -Problem MODEL has 3 rows, 26 columns and 66 elements +At line 120 RHS +At line 124 BOUNDS +At line 145 ENDATA +Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.980351 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 114 iterations 3 -Cbc0038I Solution found of 114 -Cbc0038I Relaxing continuous gives 114 +Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.934223 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 173 iterations 3 +Cbc0038I Solution found of 173 +Cbc0038I Relaxing continuous gives 173 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) -Cbc0038I Round again with cutoff of 102.6 -Cbc0038I Pass 2: suminf. 0.06590 (1) obj. 102.6 iterations 1 -Cbc0038I Pass 3: suminf. 0.07586 (1) obj. 102.6 iterations 4 -Cbc0038I Pass 4: suminf. 0.00000 (0) obj. 102.6 iterations 5 -Cbc0038I Solution found of 102.6 -Cbc0038I Relaxing continuous gives 85 -Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns -Cbc0038I Mini branch and bound improved solution from 85 to 57 (0.01 seconds) -Cbc0038I Round again with cutoff of 45.6 -Cbc0038I Pass 5: suminf. 0.41849 (2) obj. 45.6 iterations 1 -Cbc0038I Pass 6: suminf. 0.79312 (3) obj. 45.6 iterations 4 -Cbc0038I Pass 7: suminf. 0.38650 (2) obj. 45.6 iterations 4 -Cbc0038I Pass 8: suminf. 0.48550 (1) obj. 45.6 iterations 4 -Cbc0038I Pass 9: suminf. 0.14647 (1) obj. 45.6 iterations 3 -Cbc0038I Pass 10: suminf. 0.52138 (2) obj. 45.6 iterations 6 -Cbc0038I Pass 11: suminf. 0.34745 (2) obj. 45.6 iterations 2 -Cbc0038I Pass 12: suminf. 0.02936 (1) obj. 45.6 iterations 5 -Cbc0038I Pass 13: suminf. 0.02936 (1) obj. 45.6 iterations 0 -Cbc0038I Pass 14: suminf. 0.47804 (2) obj. 45.6 iterations 5 -Cbc0038I Pass 15: suminf. 0.66919 (2) obj. 45.6 iterations 2 -Cbc0038I Pass 16: suminf. 0.38629 (2) obj. 45.6 iterations 3 -Cbc0038I Pass 17: suminf. 0.47779 (3) obj. 45.6 iterations 4 -Cbc0038I Pass 18: suminf. 0.31031 (2) obj. 45.6 iterations 3 -Cbc0038I Pass 19: suminf. 0.31031 (2) obj. 45.6 iterations 0 -Cbc0038I Pass 20: suminf. 0.73002 (2) obj. 45.6 iterations 3 -Cbc0038I Pass 21: suminf. 0.87667 (2) obj. 45.6 iterations 5 -Cbc0038I Pass 22: suminf. 0.02017 (1) obj. 45.6 iterations 3 -Cbc0038I Pass 23: suminf. 0.12369 (2) obj. 45.6 iterations 3 -Cbc0038I Pass 24: suminf. 0.21418 (2) obj. 45.6 iterations 3 -Cbc0038I Pass 25: suminf. 0.21418 (2) obj. 45.6 iterations 0 -Cbc0038I Pass 26: suminf. 0.37005 (2) obj. 45.6 iterations 6 -Cbc0038I Pass 27: suminf. 0.37005 (2) obj. 45.6 iterations 0 -Cbc0038I Pass 28: suminf. 0.22900 (1) obj. 45.6 iterations 5 -Cbc0038I Pass 29: suminf. 0.00000 (0) obj. 45.6 iterations 3 -Cbc0038I Solution found of 45.6 -Cbc0038I Relaxing continuous gives 16 -Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 22 columns -Cbc0038I Mini branch and bound improved solution from 16 to 10 (0.06 seconds) -Cbc0038I Round again with cutoff of 6.99999 -Cbc0038I Pass 30: suminf. 0.88940 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 31: suminf. 1.07130 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 32: suminf. 1.01376 (3) obj. 6.99999 iterations 9 -Cbc0038I Pass 33: suminf. 0.32397 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 34: suminf. 0.81000 (3) obj. 6.99999 iterations 5 -Cbc0038I Pass 35: suminf. 0.51346 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 36: suminf. 0.87999 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 37: suminf. 0.56440 (2) obj. 6.99999 iterations 3 -Cbc0038I Pass 38: suminf. 0.49013 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 39: suminf. 0.29518 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 40: suminf. 0.63663 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 41: suminf. 0.38192 (3) obj. 6.99999 iterations 5 -Cbc0038I Pass 42: suminf. 0.83922 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 43: suminf. 0.81685 (3) obj. 6.99999 iterations 5 -Cbc0038I Pass 44: suminf. 0.32397 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 45: suminf. 0.81000 (3) obj. 6.99999 iterations 5 -Cbc0038I Pass 46: suminf. 0.51346 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 47: suminf. 0.87999 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 48: suminf. 0.56440 (2) obj. 6.99999 iterations 3 -Cbc0038I Pass 49: suminf. 0.49013 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 50: suminf. 0.29518 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 51: suminf. 0.63663 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 52: suminf. 0.38192 (3) obj. 6.99999 iterations 5 -Cbc0038I Pass 53: suminf. 0.83922 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 54: suminf. 1.17648 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 55: suminf. 0.68831 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 56: suminf. 0.95873 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 57: suminf. 0.73315 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 58: suminf. 0.46658 (3) obj. 6.99999 iterations 9 -Cbc0038I Pass 59: suminf. 0.28767 (3) obj. 6.99999 iterations 4 +Cbc0038I Round again with cutoff of 155.7 +Cbc0038I Pass 2: suminf. 0.07864 (1) obj. 155.7 iterations 1 +Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 155.7 iterations 4 +Cbc0038I Solution found of 155.7 +Cbc0038I Relaxing continuous gives 47 +Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 9 columns +Cbc0038I Mini branch and bound improved solution from 47 to 47 (0.00 seconds) +Cbc0038I Round again with cutoff of 37.6 +Cbc0038I Pass 4: suminf. 0.38455 (1) obj. 37.6 iterations 0 +Cbc0038I Pass 5: suminf. 0.06087 (1) obj. 37.6 iterations 4 +Cbc0038I Pass 6: suminf. 0.73621 (2) obj. 37.6 iterations 14 +Cbc0038I Pass 7: suminf. 0.38424 (2) obj. 37.6 iterations 2 +Cbc0038I Pass 8: suminf. 0.47224 (2) obj. 37.6 iterations 5 +Cbc0038I Pass 9: suminf. 0.58054 (2) obj. 37.6 iterations 3 +Cbc0038I Pass 10: suminf. 0.69130 (3) obj. 37.6 iterations 9 +Cbc0038I Pass 11: suminf. 0.53190 (3) obj. 37.6 iterations 1 +Cbc0038I Pass 12: suminf. 0.98506 (3) obj. 37.6 iterations 1 +Cbc0038I Pass 13: suminf. 0.57400 (2) obj. 37.6 iterations 4 +Cbc0038I Pass 14: suminf. 0.58680 (2) obj. 37.6 iterations 5 +Cbc0038I Pass 15: suminf. 0.00000 (0) obj. 37.6 iterations 4 +Cbc0038I Solution found of 37.6 +Cbc0038I Relaxing continuous gives 36 +Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0038I Mini branch and bound improved solution from 36 to 15 (0.02 seconds) +Cbc0038I Round again with cutoff of 10.5 +Cbc0038I Pass 16: suminf. 0.44332 (2) obj. 10.5 iterations 1 +Cbc0038I Pass 17: suminf. 0.32689 (3) obj. 10.5 iterations 3 +Cbc0038I Pass 18: suminf. 0.67724 (3) obj. 10.5 iterations 2 +Cbc0038I Pass 19: suminf. 0.31188 (2) obj. 10.5 iterations 2 +Cbc0038I Pass 20: suminf. 0.95212 (3) obj. 10.5 iterations 3 +Cbc0038I Pass 21: suminf. 0.83624 (3) obj. 10.5 iterations 1 +Cbc0038I Pass 22: suminf. 0.53375 (3) obj. 10.5 iterations 2 +Cbc0038I Pass 23: suminf. 1.24819 (3) obj. 10.5 iterations 3 +Cbc0038I Pass 24: suminf. 0.63734 (2) obj. 10.5 iterations 3 +Cbc0038I Pass 25: suminf. 0.51270 (3) obj. 10.5 iterations 6 +Cbc0038I Pass 26: suminf. 0.51270 (3) obj. 10.5 iterations 0 +Cbc0038I Pass 27: suminf. 0.48295 (3) obj. 10.5 iterations 6 +Cbc0038I Pass 28: suminf. 0.48295 (3) obj. 10.5 iterations 0 +Cbc0038I Pass 29: suminf. 0.89718 (3) obj. 10.5 iterations 2 +Cbc0038I Pass 30: suminf. 0.57843 (2) obj. 10.5 iterations 2 +Cbc0038I Pass 31: suminf. 0.20444 (3) obj. 10.5 iterations 4 +Cbc0038I Pass 32: suminf. 1.07558 (3) obj. 10.5 iterations 4 +Cbc0038I Pass 33: suminf. 0.69600 (2) obj. 10.5 iterations 2 +Cbc0038I Pass 34: suminf. 0.45323 (3) obj. 10.5 iterations 3 +Cbc0038I Pass 35: suminf. 0.73234 (2) obj. 10.5 iterations 4 +Cbc0038I Pass 36: suminf. 0.59652 (2) obj. 10.5 iterations 4 +Cbc0038I Pass 37: suminf. 0.12580 (2) obj. 10.5 iterations 5 +Cbc0038I Pass 38: suminf. 0.00000 (0) obj. 10.5 iterations 4 +Cbc0038I Solution found of 10.5 +Cbc0038I Relaxing continuous gives 10 +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 10 to 6 (0.03 seconds) +Cbc0038I Round again with cutoff of 4.19999 +Cbc0038I Pass 39: suminf. 0.53409 (2) obj. 4.19999 iterations 0 +Cbc0038I Pass 40: suminf. 0.43805 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 41: suminf. 0.56390 (3) obj. 4.19999 iterations 2 +Cbc0038I Pass 42: suminf. 0.41425 (2) obj. 4.19999 iterations 2 +Cbc0038I Pass 43: suminf. 0.78383 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 44: suminf. 0.87457 (3) obj. 4.19999 iterations 6 +Cbc0038I Pass 45: suminf. 0.87457 (3) obj. 4.19999 iterations 0 +Cbc0038I Pass 46: suminf. 1.00139 (3) obj. 4.19999 iterations 2 +Cbc0038I Pass 47: suminf. 0.90282 (3) obj. 4.19999 iterations 2 +Cbc0038I Pass 48: suminf. 0.51996 (3) obj. 4.19999 iterations 4 +Cbc0038I Pass 49: suminf. 0.39392 (3) obj. 4.19999 iterations 1 +Cbc0038I Pass 50: suminf. 0.31912 (3) obj. 4.19999 iterations 5 +Cbc0038I Pass 51: suminf. 0.23727 (2) obj. 4.19999 iterations 4 +Cbc0038I Pass 52: suminf. 0.81923 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 53: suminf. 0.54762 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 54: suminf. 0.83619 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 55: suminf. 0.51174 (3) obj. 4.19999 iterations 1 +Cbc0038I Pass 56: suminf. 0.66211 (3) obj. 4.19999 iterations 1 +Cbc0038I Pass 57: suminf. 0.92995 (3) obj. 4.19999 iterations 8 +Cbc0038I Pass 58: suminf. 0.68990 (3) obj. 4.19999 iterations 4 +Cbc0038I Pass 59: suminf. 0.82189 (3) obj. 4.19999 iterations 1 +Cbc0038I Pass 60: suminf. 0.22392 (2) obj. 4.19999 iterations 10 +Cbc0038I Pass 61: suminf. 0.03973 (1) obj. 4.19999 iterations 6 +Cbc0038I Pass 62: suminf. 0.16210 (2) obj. 4.19999 iterations 4 +Cbc0038I Pass 63: suminf. 0.44258 (3) obj. 4.19999 iterations 6 +Cbc0038I Pass 64: suminf. 1.28086 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 65: suminf. 1.00913 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 66: suminf. 0.83747 (3) obj. 4.19999 iterations 3 +Cbc0038I Pass 67: suminf. 0.52853 (3) obj. 4.19999 iterations 1 +Cbc0038I Pass 68: suminf. 0.98550 (3) obj. 4.19999 iterations 2 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 10 to 8 (0.12 seconds) -Cbc0038I Round again with cutoff of 4.9 -Cbc0038I Pass 59: suminf. 0.91669 (3) obj. 4.9 iterations 0 -Cbc0038I Pass 60: suminf. 1.04401 (3) obj. 4.9 iterations 1 -Cbc0038I Pass 61: suminf. 0.92461 (3) obj. 4.9 iterations 4 -Cbc0038I Pass 62: suminf. 0.41664 (3) obj. 4.9 iterations 6 -Cbc0038I Pass 63: suminf. 0.57455 (3) obj. 4.9 iterations 1 -Cbc0038I Pass 64: suminf. 0.50216 (3) obj. 4.9 iterations 7 -Cbc0038I Pass 65: suminf. 0.48903 (2) obj. 4.9 iterations 4 -Cbc0038I Pass 66: suminf. 0.69347 (3) obj. 4.9 iterations 2 -Cbc0038I Pass 67: suminf. 0.74708 (3) obj. 4.9 iterations 9 -Cbc0038I Pass 68: suminf. 0.47124 (2) obj. 4.9 iterations 5 -Cbc0038I Pass 69: suminf. 0.63672 (3) obj. 4.9 iterations 3 -Cbc0038I Pass 70: suminf. 0.49241 (3) obj. 4.9 iterations 3 -Cbc0038I Pass 71: suminf. 0.54142 (3) obj. 4.9 iterations 2 -Cbc0038I Pass 72: suminf. 0.14579 (3) obj. 4.9 iterations 5 -Cbc0038I Pass 73: suminf. 0.93673 (3) obj. 4.9 iterations 3 -Cbc0038I Pass 74: suminf. 0.61009 (3) obj. 4.9 iterations 2 -Cbc0038I Pass 75: suminf. 0.77983 (3) obj. 4.9 iterations 2 -Cbc0038I Pass 76: suminf. 0.80902 (3) obj. 4.9 iterations 8 -Cbc0038I Pass 77: suminf. 0.24586 (3) obj. 4.9 iterations 3 -Cbc0038I Pass 78: suminf. 0.35267 (3) obj. 4.9 iterations 1 -Cbc0038I Pass 79: suminf. 0.23671 (3) obj. 4.9 iterations 10 -Cbc0038I Pass 80: suminf. 0.19432 (1) obj. 4.9 iterations 5 -Cbc0038I Pass 81: suminf. 0.51880 (3) obj. 4.9 iterations 4 -Cbc0038I Pass 82: suminf. 0.72141 (3) obj. 4.9 iterations 2 -Cbc0038I Pass 83: suminf. 0.60575 (3) obj. 4.9 iterations 1 -Cbc0038I Pass 84: suminf. 0.45547 (3) obj. 4.9 iterations 6 -Cbc0038I Pass 85: suminf. 0.25454 (3) obj. 4.9 iterations 5 -Cbc0038I Pass 86: suminf. 0.78898 (3) obj. 4.9 iterations 5 -Cbc0038I Pass 87: suminf. 0.74968 (3) obj. 4.9 iterations 1 -Cbc0038I Pass 88: suminf. 0.88072 (3) obj. 4.9 iterations 2 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns -Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) -Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 8 - took 0.08 seconds -Cbc0012I Integer solution of 8 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0031I 6 added rows had average density of 14.333333 -Cbc0013I At root node, 6 cuts changed objective from 0 to 0.5 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 628 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 178 row cuts average 10.0 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is 1 +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 6 - took 0.04 seconds +Cbc0012I Integer solution of 6 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0031I 5 added rows had average density of 18 +Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 4 row cuts average 23.5 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 547 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 255 row cuts average 11.0 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 607 row cuts average 17.8 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 31 row cuts average 7.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 502 row cuts average 18.0 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 8 best solution, best possible 0.5 (0.34 seconds) -Cbc0012I Integer solution of 3 found by DiveCoefficient after 2153 iterations and 34 nodes (0.52 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 501 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 42 row cuts average 8.1 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 344 row cuts average 18.5 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 6 best solution, best possible 0 (0.12 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0004I Integer solution of 5 found after 3673 iterations and 587 nodes (0.27 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0016I Integer solution of 4 found by strong branching after 4129 iterations and 744 nodes (0.30 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -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 +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0010I After 1000 nodes, 6 on tree, 4 best solution, best possible 0 (0.36 seconds) +Cbc0016I Integer solution of 3 found by strong branching after 5064 iterations and 1074 nodes (0.37 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0016I Integer solution of 1 found by strong branching after 38440 iterations and 890 nodes (8.64 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0010I After 1000 nodes, 2 on tree, 1 best solution, best possible 0.5 (9.45 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0010I After 2000 nodes, 1 on tree, 1 best solution, best possible 0.5 (18.32 seconds) -Cbc0001I Search completed - best objective 1, took 121580 iterations and 9627 nodes (18.78 seconds) -Cbc0032I Strong branching done 16120 times (81200 iterations), fathomed 128 nodes and fixed 412 variables -Cbc0041I Maximum depth 13, 745 variables fixed on reduced cost (complete fathoming 450 times, 7519 nodes taking 28463 iterations) -Cuts at root node changed objective from 0 to 0.5 -Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -Gomory was tried 5603 times and created 24200 cuts of which 0 were active after adding rounds of cuts (1.590 seconds) -Knapsack was tried 5605 times and created 5950 cuts of which 0 were active after adding rounds of cuts (0.631 seconds) +Cbc0010I After 2000 nodes, 6 on tree, 3 best solution, best possible 0 (0.58 seconds) +Cbc0001I Search completed - best objective 3, took 29571 iterations and 12912 nodes (0.66 seconds) +Cbc0032I Strong branching done 10328 times (24735 iterations), fathomed 447 nodes and fixed 582 variables +Cbc0041I Maximum depth 13, 729 variables fixed on reduced cost (complete fathoming 670 times, 10512 nodes taking 20229 iterations) +Cuts at root node changed objective from 0 to 0 +Probing was tried 100 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 100 times and created 547 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) +Knapsack was tried 100 times and created 255 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 5605 times and created 34566 cuts of which 0 were active after adding rounds of cuts (2.118 seconds) -FlowCover was tried 100 times and created 31 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -TwoMirCuts was tried 5603 times and created 17556 cuts of which 0 were active after adding rounds of cuts (0.405 seconds) +MixedIntegerRounding2 was tried 100 times and created 501 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) +FlowCover was tried 100 times and created 42 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +TwoMirCuts was tried 100 times and created 344 cuts of which 0 were active after adding rounds of cuts (0.004 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: 9627 -Total iterations: 121580 -Time (CPU seconds): 8.70 -Time (Wallclock seconds): 18.79 +Objective value: 3.00000000 +Enumerated nodes: 12912 +Total iterations: 29571 +Time (CPU seconds): 0.66 +Time (Wallclock seconds): 0.67 Option for printingOptions changed from normal to all -Total time (CPU seconds): 8.70 (Wallclock seconds): 18.81 +Total time (CPU seconds): 0.66 (Wallclock seconds): 0.67 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ffb5362263e844ddadee51cf149f63ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffb5362263e844ddadee51cf149f63ff-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/58ea63232e264d9f821b5b9e8b4fd154-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58ea63232e264d9f821b5b9e8b4fd154-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1277,13 +1339,13 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.12 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3fcc4e1e24104419a8c94538a4a847b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fcc4e1e24104419a8c94538a4a847b3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/aaf80d09b94744eba00e01d757f13cc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaf80d09b94744eba00e01d757f13cc3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1300,7 +1362,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 @@ -1310,7 +1372,500 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d9d1d1ff4b75457fbdfbaa3f48bf2ba4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d9d1d1ff4b75457fbdfbaa3f48bf2ba4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f7fc6c0e4a834299a66fad42e898e061-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f7fc6c0e4a834299a66fad42e898e061-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 0.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + +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/23585d51ae8c4d3db4c5159afdc1065d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23585d51ae8c4d3db4c5159afdc1065d-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 10 COLUMNS +At line 42 RHS +At line 48 BOUNDS +At line 49 ENDATA +Problem MODEL has 5 rows, 6 columns and 25 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements +0 Obj 0 Primal inf 405.05674 (3) +2 Obj 0.52 +Optimal - objective value 0.52 +Optimal objective 0.52 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/7d985ebe81574f21b4470ef047a0cafb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d985ebe81574f21b4470ef047a0cafb-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 110 RHS +At line 119 BOUNDS +At line 140 ENDATA +Problem MODEL has 8 rows, 20 columns and 36 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.00 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 13 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/55401ec9e7174439b1dd668d282f4daa-pulp.mps mips /tmp/55401ec9e7174439b1dd668d282f4daa-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/55401ec9e7174439b1dd668d282f4daa-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/55401ec9e7174439b1dd668d282f4daa-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.04 +Time (Wallclock seconds): 0.05 + +Option for printingOptions changed from normal to all +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/e5d31eb095ce4e2db54006abf06c182f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5d31eb095ce4e2db54006abf06c182f-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/1697e3d28423403eae159e8cddb16f89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1697e3d28423403eae159e8cddb16f89-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/b3ceee2561e740d2ab1011e544eaefbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3ceee2561e740d2ab1011e544eaefbb-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/ed116de3c9bc46df8a07058299049244-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed116de3c9bc46df8a07058299049244-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.00000000 +Enumerated nodes: 0 +Total iterations: 6 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/2588ce50a628471a88c5656994c0a04b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2588ce50a628471a88c5656994c0a04b-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/dbc68a184d384ea197d954e4831ad80f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dbc68a184d384ea197d954e4831ad80f-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 12 +Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 12 - took 0.01 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 12 to 12 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 12.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.14 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/4e412ab243da40b3b768ba471a348ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e412ab243da40b3b768ba471a348ed5-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 +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8600 to 8600 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8600.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/04fc4a4526474b36a067939cd6c21c21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04fc4a4526474b36a067939cd6c21c21-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/1098c4b077004707b9c6cc6b8c364d9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1098c4b077004707b9c6cc6b8c364d9d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -1327,10 +1882,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.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) +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) @@ -1347,17 +1902,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.06 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b54aae8e1d7646afa42d29ee5ccf7ec1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b54aae8e1d7646afa42d29ee5ccf7ec1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/be75b4d601174d6cb8ef15132b17e12f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be75b4d601174d6cb8ef15132b17e12f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -1380,10 +1935,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.12 seconds) -Cbc0038I After 0.12 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.12 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.12 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) @@ -1400,17 +1955,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.14 +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.15 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d6a34ed99cda4f4b9c9075197654d54c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6a34ed99cda4f4b9c9075197654d54c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3dc00bd8c6fc4e598dede1399f97aa35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3dc00bd8c6fc4e598dede1399f97aa35-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -1435,10 +1990,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.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1455,17 +2010,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.15 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.16 +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/5d5fde0fbae64f28af4f2a2836e12d11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5d5fde0fbae64f28af4f2a2836e12d11-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0486f648fc4c44e4b86eea744d2bfc72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0486f648fc4c44e4b86eea744d2bfc72-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -1490,10 +2045,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.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1510,17 +2065,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.14 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.29 +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/5926a97071fc4eef8a2a7da82b505614-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5926a97071fc4eef8a2a7da82b505614-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/40246e0824384fb3ae74fa6ff9b5ee98-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40246e0824384fb3ae74fa6ff9b5ee98-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -1543,10 +2098,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.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1563,17 +2118,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.13 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.14 +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/a473600966e64c65958eefede4403f02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a473600966e64c65958eefede4403f02-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dc26c2fffd7f46d3861d9252130bd513-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc26c2fffd7f46d3861d9252130bd513-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -1596,10 +2151,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.14 seconds) -Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.14 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1616,17 +2171,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.14 +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): 2.61 +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/3b3a77c719d4448aabb8f9d0525d4a94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b3a77c719d4448aabb8f9d0525d4a94-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dfdc6f47d576459f945d62fc4db51e28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dfdc6f47d576459f945d62fc4db51e28-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -1650,10 +2205,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) -Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.16 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1670,17 +2225,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.18 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.19 +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/d25439a02e1f453b87eb7980f2c5b8da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d25439a02e1f453b87eb7980f2c5b8da-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eaad47736b824157abdc8a7ae0cd7418-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eaad47736b824157abdc8a7ae0cd7418-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -1703,10 +2258,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.11 seconds) -Cbc0038I After 0.11 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.12 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) @@ -1723,17 +2278,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.12 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.13 +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/48382db080ba483d862c08c2bd7ed753-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/48382db080ba483d862c08c2bd7ed753-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fad6191aa5584eccb1229bbadb61736b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fad6191aa5584eccb1229bbadb61736b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -1753,10 +2308,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.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.13 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -1773,17 +2328,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.13 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.15 +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/1cdec7df37f245a3b2a76261ed49ab84-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1cdec7df37f245a3b2a76261ed49ab84-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ca52a8aa04b3446d830c2b34609589ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca52a8aa04b3446d830c2b34609589ef-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -1802,10 +2357,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.06 seconds) -Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) +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) @@ -1822,17 +2377,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.06 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/850a47a258154d4290b0112e380d0c32-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/850a47a258154d4290b0112e380d0c32-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e782a80f7ab24420b239d58d580d430e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e782a80f7ab24420b239d58d580d430e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -1861,17 +2416,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.09 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.10 +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/b71541ff9d204a66aa3bb501c3d9f8df-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b71541ff9d204a66aa3bb501c3d9f8df-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/38519eef43dc4b9c8a1a6faeb85c3fca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38519eef43dc4b9c8a1a6faeb85c3fca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -1903,17 +2458,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.13 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.14 +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/d67fd0081517419fb083adc843649906-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d67fd0081517419fb083adc843649906-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bef48af361704ff79830eea6a16fab95-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bef48af361704ff79830eea6a16fab95-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -1962,8 +2517,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.10 seconds) -Cbc0038I After 0.10 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 @@ -1974,7 +2529,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.10 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) @@ -1991,34 +2546,34 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.10 +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.11 +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/110a45a8625c49f98693362761a753ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/110a45a8625c49f98693362761a753ff-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fdc72ec7e0ec40da855a3cdcfa49a976-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fdc72ec7e0ec40da855a3cdcfa49a976-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 32 ENDATA -Problem MODEL has 3 rows, 3 columns and 6 elements +At line 36 RHS +At line 40 BOUNDS +At line 47 ENDATA +Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 +Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2030,286 +2585,20 @@ Result - Optimal solution found -Objective value: 300.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/210236306b8347698741f67b782431c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/210236306b8347698741f67b782431c5-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.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/17c80d4bbae54761a92d131ed1281835-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17c80d4bbae54761a92d131ed1281835-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.08571 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.01 seconds) -Cbc0031I 2 added rows had average density of 3.5 -Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.06667 to -1.05 -Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -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.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/f947ac6406ac4d719a056a3435dfb241-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f947ac6406ac4d719a056a3435dfb241-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/9588a35a24374d258ea4edda53a913c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9588a35a24374d258ea4edda53a913c7-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/bf3547b5d4bf46458b223b8d608fc0b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf3547b5d4bf46458b223b8d608fc0b8-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.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.01 seconds) -Cbc0031I 1 added rows had average density of 3 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 246.50000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.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/be60f3051bb64c379fb98dce79153b4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be60f3051bb64c379fb98dce79153b4e-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements -Cutoff increment increased from 1e-05 to 0.9999 -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.22 seconds) -Cbc0038I After 0.22 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.22 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.22 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 12 to 12 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 12.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.25 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.29 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/12b3405811304383b89e26ab5ffa9add-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12b3405811304383b89e26ab5ffa9add-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/b2c247dab2bb406e90d70407c0040007-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2c247dab2bb406e90d70407c0040007-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a0daed7a03494e3e88517f41f0958065-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0daed7a03494e3e88517f41f0958065-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2322,8 +2611,8 @@ 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.01 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 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) @@ -2341,201 +2630,16 @@ 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/4e71744b078b453f89979f67e87093c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e71744b078b453f89979f67e87093c5-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.01 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) -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.01 -Time (Wallclock seconds): 0.01 - -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/c8bde28b11164fc7a4c4a0847128481e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8bde28b11164fc7a4c4a0847128481e-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.01 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) -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.01 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/ccb3c0c588bb4cdc8879fe43c3dde77d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ccb3c0c588bb4cdc8879fe43c3dde77d-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/2c7a29e0532f4d2db98245a918acc32f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c7a29e0532f4d2db98245a918acc32f-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8600.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.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/2919bfb935444277bd5ac50c79383e1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2919bfb935444277bd5ac50c79383e1b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0c7b90902962481c9e236a71181009ae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c7b90902962481c9e236a71181009ae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2576,7 +2680,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c26c3647bfa1460b9315702d1de74d4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c26c3647bfa1460b9315702d1de74d4d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9c5e97ba85544635851a850345139be0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9c5e97ba85544635851a850345139be0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2589,8 +2693,8 @@ 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) +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) @@ -2608,16 +2712,16 @@ 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.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/bfb8ae17d7b043b0ab38a32b3c230055-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfb8ae17d7b043b0ab38a32b3c230055-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8545afc51cac46558cb5b35445c5652d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8545afc51cac46558cb5b35445c5652d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2630,8 +2734,8 @@ 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.01 seconds) -Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 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) @@ -2649,16 +2753,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4e3af6edceb24253a20707ebf2f0e4cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e3af6edceb24253a20707ebf2f0e4cb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/17696799225f42f5a1356050dc64eba5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17696799225f42f5a1356050dc64eba5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2671,8 +2775,8 @@ Continuous objective value is 8720 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.01 seconds) +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) @@ -2690,16 +2794,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/598868ecd2e54585a6d3b84fe006a6b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/598868ecd2e54585a6d3b84fe006a6b9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6ff37c348e1d452bb417a70bcc20b63a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ff37c348e1d452bb417a70bcc20b63a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2712,8 +2816,8 @@ 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) +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8750 to 8750 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2731,16 +2835,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/cab538b73d194ed8bc40620c970013f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cab538b73d194ed8bc40620c970013f4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/133451c5886c41f395cd236635576c66-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/133451c5886c41f395cd236635576c66-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2775,13 +2879,13 @@ 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/e5626fea3ca743549c9128220fbd6159-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5626fea3ca743549c9128220fbd6159-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/81a52afff8a742bc951a6b99343c7877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81a52afff8a742bc951a6b99343c7877-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2813,16 +2917,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/58945d6b95ce400281ee1433c145c4b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58945d6b95ce400281ee1433c145c4b7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/87187f2af8d043e880b155787a477795-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87187f2af8d043e880b155787a477795-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2854,16 +2958,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/f41fca4c91214123a3f1a0811506a564-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f41fca4c91214123a3f1a0811506a564-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4f58cd272d9b43aa9b813fc1ba62c1a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f58cd272d9b43aa9b813fc1ba62c1a1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2904,7 +3008,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1a12e42d4ffa462698f759a3db0ae8fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a12e42d4ffa462698f759a3db0ae8fa-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1324930b4a404cde89d72c28e4711924-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1324930b4a404cde89d72c28e4711924-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2939,274 +3043,26 @@ 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/4578d96cc0344382ab2b6adec66b7791-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4578d96cc0344382ab2b6adec66b7791-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.01 seconds) -Cbc0001I Search completed - best objective 251.5, 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 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 - -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/09b71ee1766c49f1817301c9e41c89c0-pulp.mps mips /tmp/09b71ee1766c49f1817301c9e41c89c0-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/09b71ee1766c49f1817301c9e41c89c0-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/09b71ee1766c49f1817301c9e41c89c0-pulp.mst. -MIPStart values read for 3213 variables. -Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.01 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.15 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.08 -Time (Wallclock seconds): 0.22 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.11 (Wallclock seconds): 0.27 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/07408da2b9df423e8cb016dedcb049ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07408da2b9df423e8cb016dedcb049ea-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/476950bbc40a4d668a37f9ef0c7ac5a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/476950bbc40a4d668a37f9ef0c7ac5a3-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.6 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.6 to -1.6 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.60000000 -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/3609fde47fa54c0c9416f5e68796ca78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3609fde47fa54c0c9416f5e68796ca78-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 23 RHS -At line 27 BOUNDS -At line 28 ENDATA -Problem MODEL has 3 rows, 7 columns and 7 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 301.5 -After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4bcf21bfa38f4bb88819ed9bcf199232-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bcf21bfa38f4bb88819ed9bcf199232-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a0ee692184714d4faef3bd51d7f4d51c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a0ee692184714d4faef3bd51d7f4d51c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) -Cbc0031I 2 added rows had average density of 3 -Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.33333 to -1.25 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.25000000 -Enumerated nodes: 0 -Total iterations: 2 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.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/e74825a04c954529b5ff4389b88c8253-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e74825a04c954529b5ff4389b88c8253-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 26 RHS -At line 30 BOUNDS -At line 31 ENDATA -Problem MODEL has 3 rows, 8 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements -0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 276.5 -Optimal - objective value 276.5 -After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/38bd5f448fcc4b5bbb6d5f635f1f15b9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/38bd5f448fcc4b5bbb6d5f635f1f15b9-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 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 -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) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.22143 to -1.22143 +Continuous objective value is 0.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) @@ -3218,36 +3074,12 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/255fa3bf768e40fcbf99f0df7c66bacc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/255fa3bf768e40fcbf99f0df7c66bacc-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 28 RHS -At line 32 BOUNDS -At line 33 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements -0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 246.5 -Optimal - objective value 246.5 -After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -3255,125 +3087,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8134883913224d88b3f36b90618a7859-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8134883913224d88b3f36b90618a7859-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.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -1.00000000 -Enumerated nodes: 0 -Total iterations: 6 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.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/85fad09f9bd14b37a5aaaa4f579838bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85fad09f9bd14b37a5aaaa4f579838bc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4bfe15869b9c440eb19cb996e41ada6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bfe15869b9c440eb19cb996e41ada6d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 46 RHS -At line 50 BOUNDS -At line 60 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) -Cbc0031I 1 added rows had average density of 4 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) -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.01 -Time (Wallclock seconds): 0.02 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/303709114bac4f57a60a554e8a232e82-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/303709114bac4f57a60a554e8a232e82-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 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 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 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 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 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 8600 to 8600 +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) @@ -3385,104 +3116,17 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/d0549ce027ef4ea28161caf0edc4713f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0549ce027ef4ea28161caf0edc4713f-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0 to -1.79769e+308 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 0.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.03 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (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/a520261a97ef4a1f8357ab8b9caeea58-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a520261a97ef4a1f8357ab8b9caeea58-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.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) - -Result - Optimal solution found - -Objective value: 228100.00000000 -Enumerated nodes: 0 -Total iterations: 13 -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 +/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:12: SyntaxWarning: invalid escape sequence '\i' + - **Scenarios:** $s \in S = (1, 2, 3, 4)$ Status: Optimal x = 4.0 y = -1.0 @@ -3516,44 +3160,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_2 = 0.0 -x_3 = 0.0 -x_4 = 0.0 -x_5 = 1.0 +x_0 = 1.0 +x_1 = 1.0 +x_2 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 0.0 x_6 = 1.0 -x_7 = 1.0 -x_8 = 0.0 +x_7 = 0.0 +x_8 = 1.0 x_9 = 1.0 Status: Optimal s_0 = 0.0 -s_1 = 0.0 -s_2 = 0.0 +s_1 = 0.5 +s_2 = 2.5 w_0 = 0.0 -w_1 = 0.5 -w_2 = 0.5 -x_0 = 0.0 -x_1 = 0.0 +w_1 = 0.0 +w_2 = 0.0 +x_0 = 1.0 +x_1 = 1.0 x_10 = 0.0 x_11 = 1.0 x_12 = 1.0 -x_13 = 0.0 +x_13 = 1.0 x_14 = 0.0 -x_15 = 0.0 +x_15 = 1.0 x_16 = 1.0 -x_17 = 1.0 +x_17 = 0.0 x_18 = 0.0 -x_19 = 1.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 1.0 -x_5 = 0.0 +x_19 = 0.0 +x_2 = 0.0 +x_3 = 1.0 +x_4 = 0.0 +x_5 = 1.0 x_6 = 0.0 -x_7 = 1.0 +x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 -objective= 1.0 +objective= 3.0 Status: Optimal x = 4.0 y = -1.0 @@ -3610,24 +3254,43 @@ 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 -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 = 225.0 -Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +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] @@ -3647,24 +3310,18 @@ ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal -Ingr_BEEF = 60.0 -Ingr_CHICKEN = 0.0 -Ingr_GEL = 40.0 -Ingr_MUTTON = 0.0 -Ingr_RICE = 0.0 -Ingr_WHEAT = 0.0 -Total Cost of Ingredients per can = 0.52 -Status: Optimal 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] @@ -3702,46 +3359,28 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -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 +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 = 246.50000000000003 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 +Production Costs = 251.5 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -3875,68 +3514,141 @@ Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal -Patt_A = 200.0 -Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_A_D = 0.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.0 -Status: Optimal -Solution Written to sudokuout.txt +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 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_TucsonWelcome to the CBC MILP Solver +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +The_Gemstone_Tool_Problem: +MAXIMIZE +25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 +SUBJECT TO +Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches + - steelpurchase <= 0 + +molding_capacity0: production_0_pliers + production_0_wrenches <= 21 + +assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 + +capacity_wrenches0: production_0_wrenches <= 15 + +capacity_pliers0: production_0_pliers <= 16 + +Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches + - steelpurchase <= 0 + +molding_capacity1: production_1_pliers + production_1_wrenches <= 21 + +assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 + +capacity_wrenches1: production_1_wrenches <= 15 + +capacity_pliers1: production_1_pliers <= 16 + +Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches + - steelpurchase <= 0 + +molding_capacity2: production_2_pliers + production_2_wrenches <= 21 + +assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 + +capacity_wrenches2: production_2_wrenches <= 15 + +capacity_pliers2: production_2_pliers <= 16 + +Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches + - steelpurchase <= 0 + +molding_capacity3: production_3_pliers + production_3_wrenches <= 21 + +assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 + +capacity_wrenches3: production_3_wrenches <= 15 + +capacity_pliers3: production_3_pliers <= 16 + +VARIABLES +production_0_pliers Continuous +production_0_wrenches Continuous +production_1_pliers Continuous +production_1_wrenches Continuous +production_2_pliers Continuous +production_2_wrenches Continuous +production_3_pliers Continuous +production_3_wrenches Continuous +steelpurchase Continuous +Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3e6b25018793454886a5c798dbb2927c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3e6b25018793454886a5c798dbb2927c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/51a08d16c4474ee5a585963be9563518-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/51a08d16c4474ee5a585963be9563518-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 25 COLUMNS +At line 71 RHS +At line 92 BOUNDS +At line 93 ENDATA +Problem MODEL has 20 rows, 9 columns and 36 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements +0 Obj -0 Dual inf 224.99999 (8) +10 Obj 863.25 +Optimal - objective value 863.25 +After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/5ab4fd1a963a464f90da51aef165309a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ab4fd1a963a464f90da51aef165309a-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8600 to 8600 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8600.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/2c834e3381414198813a03222540dc9b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c834e3381414198813a03222540dc9b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -3949,8 +3661,8 @@ Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.01 seconds) +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) @@ -3968,16 +3680,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/675fb27ecbea45e990c3661e96b1cbd6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/675fb27ecbea45e990c3661e96b1cbd6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/93af45ac71ea4cf3b063c8e477ea3c75-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/93af45ac71ea4cf3b063c8e477ea3c75-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS @@ -3996,36 +3708,390 @@ Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 -/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:12: SyntaxWarning: invalid escape sequence '\i' - - **Scenarios:** $s \in S = (1, 2, 3, 4)$ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/683c03944ca346fb9a449ac2d6d0a82a-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/683c03944ca346fb9a449ac2d6d0a82a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/347f84386b49474aa71e0cdf973ab711-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/347f84386b49474aa71e0cdf973ab711-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 25 COLUMNS -At line 71 RHS -At line 92 BOUNDS -At line 93 ENDATA -Problem MODEL has 20 rows, 9 columns and 36 elements +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 12 (-8) rows, 9 (0) columns and 28 (-8) elements -0 Obj -0 Dual inf 224.99999 (8) -10 Obj 863.25 -Optimal - objective value 863.25 -After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.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/4db75574011e4b22905ab94cbe276433-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4db75574011e4b22905ab94cbe276433-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.6 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.03996 +Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.6 to -1.6 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.60000000 +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/c8ca043964834dafac749744a5afe0aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8ca043964834dafac749744a5afe0aa-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 301.5 +After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/a91c53d81a9244a28ba277f547082ac0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a91c53d81a9244a28ba277f547082ac0-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.37143 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) +Cbc0031I 2 added rows had average density of 3 +Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.33333 to -1.25 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.25000000 +Enumerated nodes: 0 +Total iterations: 2 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/845ec1971a174f72bce9224e6c64e9f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/845ec1971a174f72bce9224e6c64e9f8-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements +0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 276.5 +Optimal - objective value 276.5 +After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1175a0e733c849428518fb4314fe1e11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1175a0e733c849428518fb4314fe1e11-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/022a91dfb0e24bf1a0ba6f7839fcd0d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/022a91dfb0e24bf1a0ba6f7839fcd0d0-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.24444 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.22143 to -1.22143 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.20000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/0606e568e3c34aca9cd601df1e2735bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0606e568e3c34aca9cd601df1e2735bd-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements +0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) +0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) +2 Obj 246.5 +Optimal - objective value 246.5 +After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/b9208644b779439f9db75e79c92bbba8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9208644b779439f9db75e79c92bbba8-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: -1.00000000 +Enumerated nodes: 0 +Total iterations: 6 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/5671daee86b94b97876ecb40204eb835-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5671daee86b94b97876ecb40204eb835-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 8 COLUMNS +At line 46 RHS +At line 50 BOUNDS +At line 60 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 4 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 246.50000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/000b68a1426d4e9e8f4a97a7ae52d6e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/000b68a1426d4e9e8f4a97a7ae52d6e5-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/270679d2686a443e805275ebaacf87cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/270679d2686a443e805275ebaacf87cb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -4039,8 +4105,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) @@ -4058,10 +4124,10 @@ 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 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -5399,19 +5465,33 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 53.278s +Ran 1005 tests in 25.255s OK (skipped=885) - = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 + +Status: Optimal +production_0_pliers = 4.75 +production_0_wrenches = 15.0 +production_1_pliers = 4.75 +production_1_wrenches = 15.0 +production_2_pliers = 8.5 +production_2_wrenches = 12.5 +production_3_pliers = 16.0 +production_3_wrenches = 5.0 +steelpurchase = 27.25 +Total price = 863.25 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 @@ -5432,76 +5512,58 @@ Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 -The_Gemstone_Tool_Problem: -MAXIMIZE -25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 -SUBJECT TO -Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - - steelpurchase <= 0 - -molding_capacity0: production_0_pliers + production_0_wrenches <= 21 - -assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 - -capacity_wrenches0: production_0_wrenches <= 15 - -capacity_pliers0: production_0_pliers <= 16 - -Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - - steelpurchase <= 0 - -molding_capacity1: production_1_pliers + production_1_wrenches <= 21 - -assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 - -capacity_wrenches1: production_1_wrenches <= 15 - -capacity_pliers1: production_1_pliers <= 16 - -Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - - steelpurchase <= 0 - -molding_capacity2: production_2_pliers + production_2_wrenches <= 21 - -assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 - -capacity_wrenches2: production_2_wrenches <= 15 - -capacity_pliers2: production_2_pliers <= 16 - -Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - - steelpurchase <= 0 - -molding_capacity3: production_3_pliers + production_3_wrenches <= 21 - -assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 - -capacity_wrenches3: production_3_wrenches <= 15 - -capacity_pliers3: production_3_pliers <= 16 - -VARIABLES -production_0_pliers Continuous -production_0_wrenches Continuous -production_1_pliers Continuous -production_1_wrenches Continuous -production_2_pliers Continuous -production_2_wrenches Continuous -production_3_pliers Continuous -production_3_wrenches Continuous -steelpurchase Continuous - +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +P3 = [4, 0, 0] +P4 = [1, 2, 0] +P5 = [0, 0, 2] +Pattern_P0 = 0 +Pattern_P1 = 0 +Pattern_P2 = 0 +Pattern_P3 = 13 +Pattern_P4 = 100 +Pattern_P5 = 150 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +P2 = [0, 0, 2] +P3 = [0, 1, 0] +P4 = [0, 1, 1] +P5 = [0, 2, 0] +P6 = [1, 0, 0] +P7 = [1, 0, 1] +P8 = [1, 1, 0] +P9 = [1, 2, 0] +P10 = [2, 0, 0] +P11 = [2, 0, 1] +P12 = [2, 1, 0] +P13 = [3, 0, 0] +P14 = [4, 0, 0] Status: Optimal -production_0_pliers = 4.75 -production_0_wrenches = 15.0 -production_1_pliers = 4.75 -production_1_wrenches = 15.0 -production_2_pliers = 8.5 -production_2_wrenches = 12.5 -production_3_pliers = 16.0 -production_3_wrenches = 5.0 -steelpurchase = 27.25 -Total price = 863.25 +Patt_P0 = 0.0 +Patt_P1 = 0.0 +Patt_P10 = 0.0 +Patt_P11 = 26.0 +Patt_P12 = 0.0 +Patt_P13 = 0.0 +Patt_P14 = 0.0 +Patt_P2 = 137.0 +Patt_P3 = 0.0 +Patt_P4 = 0.0 +Patt_P5 = 0.0 +Patt_P6 = 0.0 +Patt_P7 = 0.0 +Patt_P8 = 0.0 +Patt_P9 = 100.0 +Surp_5 = 2.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 246.50000000000003 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 @@ -5796,90 +5858,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/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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/__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 creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests 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__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/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__/__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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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/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__/__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__/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__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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/__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/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/scip_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__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/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__/__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/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/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/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/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/__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/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/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/__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 -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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 -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc +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/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 +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_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/utilities.py to utilities.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/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/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/gurobi_api.py to gurobi_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/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:325: 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/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/__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/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/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/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/__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/mps_lp.py to mps_lp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/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 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 @@ -5910,12 +5972,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/2257752/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/2257752/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/2065290 and its subdirectories -I: Current time: Tue Sep 29 07:09:18 -12 2026 -I: pbuilder-time-stamp: 1790708958 +I: removing directory /srv/workspace/pbuilder/2257752 and its subdirectories +I: Current time: Thu Aug 28 02:48:19 +14 2025 +I: pbuilder-time-stamp: 1756298899