Diff of the two buildlogs: -- --- b1/build.log 2024-11-20 23:44:51.952623225 +0000 +++ b2/build.log 2024-11-20 23:46:35.031961530 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Wed Nov 20 11:42:49 -12 2024 -I: pbuilder-time-stamp: 1732146169 +I: Current time: Wed Dec 24 20:07:54 +14 2025 +I: pbuilder-time-stamp: 1766556474 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -31,54 +31,86 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/37868/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/111464/tmp/hooks/D01_modify_environment starting +debug: Running on ionos6-i386. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Dec 24 06:08 /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/111464/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/111464/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='i386' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=11 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='i386' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="32" [3]="1" [4]="release" [5]="i686-pc-linux-gnu") + BASH_VERSION='5.2.32(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=i386 + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=21 ' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=i686 + HOST_ARCH=i386 IFS=' ' - INVOCATION_ID='af3dc6cbdde74cba9fe52e985970026d' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - LD_LIBRARY_PATH='/usr/lib/libeatmydata' - LD_PRELOAD='libeatmydata.so' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='37868' - PS1='# ' - PS2='> ' + INVOCATION_ID=a660e49198cb41a987fa12e74c6a673f + LANG=C + LANGUAGE=de_CH:de + LC_ALL=C + LD_LIBRARY_PATH=/usr/lib/libeatmydata + LD_PRELOAD=libeatmydata.so + MACHTYPE=i686-pc-linux-gnu + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnu + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=111464 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.ix4on9gY/pbuilderrc_Hyw7 --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ix4on9gY/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='112' - SUDO_UID='107' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://46.16.76.132:3128' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.ix4on9gY/pbuilderrc_17Gx --distribution unstable --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.ix4on9gY/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=112 + SUDO_UID=107 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://213.165.73.152:3128 I: uname -a - Linux ionos2-i386 6.1.0-27-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.115-1 (2024-11-01) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.1.0-27-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.115-1 (2024-11-01) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/37868/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/111464/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -202,7 +234,7 @@ Get: 76 http://deb.debian.org/debian unstable/main i386 python3.13 i386 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main i386 python3-all i386 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main i386 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 40.4 MB in 1s (39.4 MB/s) +Fetched 40.4 MB in 1s (54.4 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:i386. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19952 files and directories currently installed.) @@ -470,8 +502,8 @@ Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' -Local time is now: Wed Nov 20 23:43:20 UTC 2024. -Universal Time is now: Wed Nov 20 23:43:20 UTC 2024. +Local time is now: Wed Dec 24 06:08:14 UTC 2025. +Universal Time is now: Wed Dec 24 06:08:14 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:i386 (3.13.0-2) ... @@ -545,7 +577,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/111464/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/111464/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 @@ -592,12 +628,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/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/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/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 running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO @@ -764,12 +800,12 @@ running build running build_py creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt @@ -968,7 +1004,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a29cd9b764294d65a79e3b0de4a02886-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a29cd9b764294d65a79e3b0de4a02886-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/068e2619429b4b0eb9901818ea6e4c21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/068e2619429b4b0eb9901818ea6e4c21-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -983,15 +1019,15 @@ 1 Obj 54 Optimal - objective value 54 After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 +Optimal objective 54 - 1 iterations time 0.002, Presolve -0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): -0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/57150a3417cf4c8db49e6e15c740e2c7-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/57150a3417cf4c8db49e6e15c740e2c7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fb3c51e31bfa4875afd37587883d4a8e-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/fb3c51e31bfa4875afd37587883d4a8e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -1076,11 +1112,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.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.04 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.03 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -1089,7 +1125,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.04 seconds) +Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1106,17 +1142,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 -Time (CPU seconds): 0.04 -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.04 (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/ab8a608a382e45ee847444d755ff0998-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab8a608a382e45ee847444d755ff0998-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b5ec8baeb08d44d7aeb13b5cc9805769-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5ec8baeb08d44d7aeb13b5cc9805769-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -1135,7 +1171,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 50 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 36 columns -Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.02 seconds) +Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (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 11 @@ -1161,7 +1197,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 31 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 83 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.13 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.10 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 12 @@ -1196,98 +1232,145 @@ 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.23 seconds) -Cbc0038I After 0.23 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.23 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.17 seconds) +Cbc0038I After 0.17 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.16 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 9 added rows had average density of 59 Cbc0013I At root node, 9 cuts changed objective from 2546.9589 to 2695.6793 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.041 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.068 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 +Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.027 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.046 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.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) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.038 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.029 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.66 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.026 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.018 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.010 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.47 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 47 rows 56 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 74 rows 77 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.50 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.04 seconds) Cbc0032I Strong branching done 1272 times (10385 iterations), fathomed 26 nodes and fixed 41 variables Cbc0035I Maximum depth 11, 238 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2695.68 -Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.041 seconds) -Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.112 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) +Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.027 seconds) +Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.078 seconds) +Knapsack was tried 100 times and created 0 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 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.029 seconds) -TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.050 seconds) +MixedIntegerRounding2 was tried 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.055 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) +TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 110 Total iterations: 4892 -Time (CPU seconds): 1.50 -Time (Wallclock seconds): 1.51 +Time (CPU seconds): 1.03 +Time (Wallclock seconds): 1.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.50 (Wallclock seconds): 1.51 +Total time (CPU seconds): 1.04 (Wallclock seconds): 1.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/03fc2c43ebd7411abb9493fbac444d0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03fc2c43ebd7411abb9493fbac444d0e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2eafbb6e66024041964fde85a2a80dc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2eafbb6e66024041964fde85a2a80dc2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1656 RHS -At line 1877 BOUNDS -At line 2088 ENDATA -Problem MODEL has 220 rows, 210 columns and 800 elements +At line 1655 RHS +At line 1876 BOUNDS +At line 2087 ENDATA +Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -133.4 - 0.00 seconds -Cgl0004I processed model has 209 rows, 200 columns (200 integer (200 of which binary)) and 760 elements +Continuous objective value is -173.82 - 0.00 seconds +Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 0 integers unsatisfied sum - 6.21725e-15 -Cbc0038I Solution found of -133.4 -Cbc0038I Before mini branch and bound, 200 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) -Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of -133.4 - took 0.00 seconds -Cbc0012I Integer solution of -133.4 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) -Cbc0001I Search completed - best objective -133.4, 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 -133.4 to -133.4 -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) +Cbc0038I Initial state - 23 integers unsatisfied sum - 7.17329 +Cbc0038I Solution found of -172.45 +Cbc0038I Before mini branch and bound, 186 integers at bound fixed and 0 continuous +Cbc0038I Full problem 219 rows 209 columns, reduced to 0 rows 0 columns +Cbc0038I Mini branch and bound improved solution from -172.45 to -172.45 (0.01 seconds) +Cbc0038I Round again with cutoff of -172.65 +Cbc0038I Reduced cost fixing fixed 53 variables on major pass 2 +Cbc0038I Pass 1: suminf. 0.65574 (20) obj. -172.65 iterations 48 +Cbc0038I Pass 2: suminf. 7.90645 (24) obj. -172.65 iterations 89 +Cbc0038I Pass 3: suminf. 7.90645 (24) obj. -172.65 iterations 4 +Cbc0038I Pass 4: suminf. 0.65574 (20) obj. -172.65 iterations 72 +Cbc0038I Pass 5: suminf. 6.60702 (22) obj. -172.65 iterations 13 +Cbc0038I Pass 6: suminf. 1.31148 (20) obj. -172.65 iterations 9 +Cbc0038I Pass 7: suminf. 1.31148 (20) obj. -172.65 iterations 0 +Cbc0038I Pass 8: suminf. 9.01016 (22) obj. -172.65 iterations 35 +Cbc0038I Pass 9: suminf. 10.47892 (24) obj. -172.65 iterations 26 +Cbc0038I Pass 10: suminf. 10.27474 (25) obj. -172.65 iterations 11 +Cbc0038I Pass 11: suminf. 1.96721 (20) obj. -172.65 iterations 65 +Cbc0038I Pass 12: suminf. 1.96721 (20) obj. -172.65 iterations 0 +Cbc0038I Pass 13: suminf. 9.16042 (24) obj. -172.65 iterations 55 +Cbc0038I Pass 14: suminf. 9.13059 (24) obj. -172.65 iterations 16 +Cbc0038I Pass 15: suminf. 1.96721 (20) obj. -172.65 iterations 71 +Cbc0038I Pass 16: suminf. 2.73385 (22) obj. -172.65 iterations 7 +Cbc0038I Pass 17: suminf. 2.54812 (23) obj. -172.65 iterations 22 +Cbc0038I Pass 18: suminf. 1.31148 (20) obj. -172.65 iterations 14 +Cbc0038I Pass 19: suminf. 1.31148 (20) obj. -172.65 iterations 0 +Cbc0038I Pass 20: suminf. 8.53256 (24) obj. -172.65 iterations 94 +Cbc0038I Pass 21: suminf. 8.53256 (24) obj. -172.65 iterations 4 +Cbc0038I Pass 22: suminf. 1.31148 (20) obj. -172.65 iterations 78 +Cbc0038I Pass 23: suminf. 6.39714 (22) obj. -172.65 iterations 17 +Cbc0038I Pass 24: suminf. 1.31148 (20) obj. -172.65 iterations 63 +Cbc0038I Pass 25: suminf. 1.31148 (20) obj. -172.65 iterations 0 +Cbc0038I Pass 26: suminf. 8.53256 (24) obj. -172.65 iterations 92 +Cbc0038I Pass 27: suminf. 8.53256 (24) obj. -172.65 iterations 3 +Cbc0038I Pass 28: suminf. 1.31148 (20) obj. -172.65 iterations 69 +Cbc0038I Pass 29: suminf. 2.38983 (22) obj. -172.65 iterations 13 +Cbc0038I Pass 30: suminf. 2.30474 (21) obj. -172.65 iterations 45 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 170 integers at bound fixed and 0 continuous +Cbc0038I Full problem 219 rows 209 columns, reduced to 16 rows 17 columns +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of -172.45 - took 0.03 seconds +Cbc0012I Integer solution of -172.45 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) +Cbc0031I 6 added rows had average density of 7.5 +Cbc0013I At root node, 24 cuts changed objective from -173.82037 to -172.45 in 1 passes +Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 6.3 elements, 1 column cuts (1 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) - 7 row cuts average 6.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 11 row cuts average 14.4 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 7 (ZeroHalf) - 3 row cuts average 23.3 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective -172.45, took 0 iterations and 0 nodes (0.04 seconds) +Cbc0035I Maximum depth 0, 48 variables fixed on reduced cost +Cuts at root node changed objective from -173.82 to -172.45 +Probing was tried 1 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 1 times and created 7 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 1 times and created 11 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +ZeroHalf was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -133.40000000 +Objective value: -172.45000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 +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/e293fba1180541bb87b0930df7167792-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e293fba1180541bb87b0930df7167792-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/970241ea7fcb4cbfb19bdb30debfa8c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/970241ea7fcb4cbfb19bdb30debfa8c0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1299,200 +1382,129 @@ Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.997781 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 165 iterations 3 -Cbc0038I Solution found of 165 -Cbc0038I Relaxing continuous gives 165 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.587791 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 46.5 iterations 4 +Cbc0038I Solution found of 46.5 +Cbc0038I Relaxing continuous gives 46.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) -Cbc0038I Round again with cutoff of 147.6 -Cbc0038I Pass 2: suminf. 0.06877 (1) obj. 147.6 iterations 1 -Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 147.6 iterations 3 -Cbc0038I Solution found of 147.6 -Cbc0038I Relaxing continuous gives 88 -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 88 to 52 (0.01 seconds) -Cbc0038I Round again with cutoff of 40.8001 -Cbc0038I Pass 4: suminf. 0.49091 (1) obj. 40.8001 iterations 0 -Cbc0038I Pass 5: suminf. 0.18656 (1) obj. 40.8001 iterations 3 -Cbc0038I Pass 6: suminf. 0.95221 (3) obj. 40.8001 iterations 9 -Cbc0038I Pass 7: suminf. 0.48571 (1) obj. 40.8001 iterations 5 -Cbc0038I Pass 8: suminf. 0.04032 (1) obj. 40.8001 iterations 4 -Cbc0038I Pass 9: suminf. 0.36285 (1) obj. 40.8001 iterations 3 -Cbc0038I Pass 10: suminf. 0.44413 (3) obj. 40.8001 iterations 12 -Cbc0038I Pass 11: suminf. 0.29631 (2) obj. 40.8001 iterations 4 -Cbc0038I Pass 12: suminf. 0.77582 (3) obj. 40.8001 iterations 5 -Cbc0038I Pass 13: suminf. 0.81812 (3) obj. 40.8001 iterations 1 -Cbc0038I Pass 14: suminf. 0.14215 (1) obj. 40.8001 iterations 5 -Cbc0038I Pass 15: suminf. 0.41878 (2) obj. 40.8001 iterations 4 -Cbc0038I Pass 16: suminf. 0.10593 (1) obj. 40.8001 iterations 4 -Cbc0038I Pass 17: suminf. 0.00000 (0) obj. 40.8001 iterations 1 -Cbc0038I Solution found of 40.8001 -Cbc0038I Relaxing continuous gives 24 +Cbc0038I Round again with cutoff of 41.85 +Cbc0038I Pass 2: suminf. 0.03100 (1) obj. 41.85 iterations 1 +Cbc0038I Pass 3: suminf. 0.23061 (1) obj. 41.85 iterations 3 +Cbc0038I Pass 4: suminf. 0.96495 (3) obj. 41.85 iterations 6 +Cbc0038I Pass 5: suminf. 0.20988 (2) obj. 41.85 iterations 7 +Cbc0038I Pass 6: suminf. 0.41290 (2) obj. 41.85 iterations 5 +Cbc0038I Pass 7: suminf. 0.29416 (2) obj. 41.85 iterations 2 +Cbc0038I Pass 8: suminf. 0.48104 (3) obj. 41.85 iterations 7 +Cbc0038I Pass 9: suminf. 0.56104 (2) obj. 41.85 iterations 2 +Cbc0038I Pass 10: suminf. 0.38060 (1) obj. 41.85 iterations 3 +Cbc0038I Pass 11: suminf. 0.39928 (1) obj. 41.85 iterations 2 +Cbc0038I Pass 12: suminf. 0.76796 (2) obj. 41.85 iterations 7 +Cbc0038I Pass 13: suminf. 0.10659 (2) obj. 41.85 iterations 5 +Cbc0038I Pass 14: suminf. 0.98584 (3) obj. 41.85 iterations 2 +Cbc0038I Pass 15: suminf. 0.26266 (2) obj. 41.85 iterations 6 +Cbc0038I Pass 16: suminf. 0.36310 (1) obj. 41.85 iterations 4 +Cbc0038I Pass 17: suminf. 0.41005 (1) obj. 41.85 iterations 3 +Cbc0038I Pass 18: suminf. 0.31082 (1) obj. 41.85 iterations 2 +Cbc0038I Pass 19: suminf. 0.70922 (2) obj. 41.85 iterations 10 +Cbc0038I Pass 20: suminf. 0.38106 (2) obj. 41.85 iterations 2 +Cbc0038I Pass 21: suminf. 0.23201 (1) obj. 41.85 iterations 3 +Cbc0038I Pass 22: suminf. 0.23201 (1) obj. 41.85 iterations 0 +Cbc0038I Pass 23: suminf. 0.00000 (0) obj. 41.85 iterations 12 +Cbc0038I Solution found of 41.85 +Cbc0038I Relaxing continuous gives 39.5 +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 39.5 to 12.5 (0.02 seconds) +Cbc0038I Round again with cutoff of 9.99999 +Cbc0038I Pass 24: suminf. 0.33696 (2) obj. 9.99999 iterations 3 +Cbc0038I Pass 25: suminf. 0.55873 (2) obj. 9.99999 iterations 2 +Cbc0038I Pass 26: suminf. 0.91691 (3) obj. 9.99999 iterations 7 +Cbc0038I Pass 27: suminf. 1.27752 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 28: suminf. 1.04498 (3) obj. 9.99999 iterations 1 +Cbc0038I Pass 29: suminf. 0.69128 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 30: suminf. 0.66039 (2) obj. 9.99999 iterations 2 +Cbc0038I Pass 31: suminf. 0.46669 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 32: suminf. 0.83997 (3) obj. 9.99999 iterations 4 +Cbc0038I Pass 33: suminf. 0.61978 (2) obj. 9.99999 iterations 2 +Cbc0038I Pass 34: suminf. 0.52981 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 35: suminf. 0.86525 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 36: suminf. 0.55108 (3) obj. 9.99999 iterations 1 +Cbc0038I Pass 37: suminf. 1.03080 (3) obj. 9.99999 iterations 5 +Cbc0038I Pass 38: suminf. 0.86017 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 39: suminf. 1.22956 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 40: suminf. 0.94225 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 41: suminf. 0.73428 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 42: suminf. 1.08141 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 43: suminf. 0.86017 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 44: suminf. 1.22956 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 45: suminf. 0.94225 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 46: suminf. 0.73428 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 47: suminf. 1.08141 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 48: suminf. 0.86017 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 49: suminf. 1.22956 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 50: suminf. 0.94225 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 51: suminf. 0.73428 (3) obj. 9.99999 iterations 3 +Cbc0038I Pass 52: suminf. 1.08141 (3) obj. 9.99999 iterations 2 +Cbc0038I Pass 53: suminf. 0.86017 (3) obj. 9.99999 iterations 2 +Cbc0038I No solution found this major pass 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 24 to 15 (0.03 seconds) -Cbc0038I Round again with cutoff of 9.80007 -Cbc0038I Pass 18: suminf. 0.56910 (2) obj. 9.80007 iterations 1 -Cbc0038I Pass 19: suminf. 0.32335 (3) obj. 9.80007 iterations 4 -Cbc0038I Pass 20: suminf. 0.50544 (2) obj. 9.80007 iterations 2 -Cbc0038I Pass 21: suminf. 0.56929 (2) obj. 9.80007 iterations 2 -Cbc0038I Pass 22: suminf. 0.81634 (3) obj. 9.80007 iterations 6 -Cbc0038I Pass 23: suminf. 0.50925 (2) obj. 9.80007 iterations 3 -Cbc0038I Pass 24: suminf. 0.62700 (2) obj. 9.80007 iterations 2 -Cbc0038I Pass 25: suminf. 0.53808 (2) obj. 9.80007 iterations 2 -Cbc0038I Pass 26: suminf. 0.92169 (3) obj. 9.80007 iterations 10 -Cbc0038I Pass 27: suminf. 0.73321 (3) obj. 9.80007 iterations 2 -Cbc0038I Pass 28: suminf. 0.38905 (3) obj. 9.80007 iterations 6 -Cbc0038I Pass 29: suminf. 0.09945 (1) obj. 9.80007 iterations 5 -Cbc0038I Pass 30: suminf. 0.30408 (2) obj. 9.80007 iterations 3 -Cbc0038I Pass 31: suminf. 0.63831 (3) obj. 9.80007 iterations 13 -Cbc0038I Pass 32: suminf. 0.63831 (3) obj. 9.80007 iterations 0 -Cbc0038I Pass 33: suminf. 0.33881 (3) obj. 9.80007 iterations 6 -Cbc0038I Pass 34: suminf. 0.11093 (2) obj. 9.80007 iterations 6 -Cbc0038I Pass 35: suminf. 0.33979 (2) obj. 9.80007 iterations 3 -Cbc0038I Pass 36: suminf. 0.42662 (3) obj. 9.80007 iterations 5 -Cbc0038I Pass 37: suminf. 0.26633 (2) obj. 9.80007 iterations 9 -Cbc0038I Pass 38: suminf. 0.18492 (3) obj. 9.80007 iterations 4 -Cbc0038I Pass 39: suminf. 0.39547 (3) obj. 9.80007 iterations 4 -Cbc0038I Pass 40: suminf. 0.39547 (3) obj. 9.80007 iterations 0 -Cbc0038I Pass 41: suminf. 0.84801 (3) obj. 9.80007 iterations 4 -Cbc0038I Pass 42: suminf. 0.59584 (3) obj. 9.80007 iterations 3 -Cbc0038I Pass 43: suminf. 0.73333 (2) obj. 9.80007 iterations 4 -Cbc0038I Pass 44: suminf. 0.45666 (2) obj. 9.80007 iterations 3 -Cbc0038I Pass 45: suminf. 0.89142 (3) obj. 9.80007 iterations 3 -Cbc0038I Pass 46: suminf. 1.04686 (3) obj. 9.80007 iterations 2 -Cbc0038I Pass 47: suminf. 0.87566 (3) obj. 9.80007 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 improved solution from 15 to 8 (0.05 seconds) -Cbc0038I Round again with cutoff of 4.90007 -Cbc0038I Pass 47: suminf. 0.65224 (2) obj. 4.90007 iterations 0 -Cbc0038I Pass 48: suminf. 0.38972 (3) obj. 4.90007 iterations 4 -Cbc0038I Pass 49: suminf. 0.47842 (2) obj. 4.90007 iterations 2 -Cbc0038I Pass 50: suminf. 0.66399 (3) obj. 4.90007 iterations 14 -Cbc0038I Pass 51: suminf. 0.33322 (3) obj. 4.90007 iterations 5 -Cbc0038I Pass 52: suminf. 0.85498 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 53: suminf. 0.73502 (2) obj. 4.90007 iterations 2 -Cbc0038I Pass 54: suminf. 0.86165 (3) obj. 4.90007 iterations 3 -Cbc0038I Pass 55: suminf. 0.87773 (3) obj. 4.90007 iterations 8 -Cbc0038I Pass 56: suminf. 0.67082 (2) obj. 4.90007 iterations 2 -Cbc0038I Pass 57: suminf. 0.72724 (2) obj. 4.90007 iterations 2 -Cbc0038I Pass 58: suminf. 0.75739 (3) obj. 4.90007 iterations 9 -Cbc0038I Pass 59: suminf. 0.75739 (3) obj. 4.90007 iterations 0 -Cbc0038I Pass 60: suminf. 1.23177 (3) obj. 4.90007 iterations 4 -Cbc0038I Pass 61: suminf. 0.86722 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 62: suminf. 0.62310 (2) obj. 4.90007 iterations 3 -Cbc0038I Pass 63: suminf. 0.75327 (3) obj. 4.90007 iterations 3 -Cbc0038I Pass 64: suminf. 0.73997 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 65: suminf. 0.90554 (3) obj. 4.90007 iterations 3 -Cbc0038I Pass 66: suminf. 0.33136 (2) obj. 4.90007 iterations 6 -Cbc0038I Pass 67: suminf. 0.88123 (3) obj. 4.90007 iterations 4 -Cbc0038I Pass 68: suminf. 0.72826 (3) obj. 4.90007 iterations 3 -Cbc0038I Pass 69: suminf. 1.03866 (3) obj. 4.90007 iterations 3 -Cbc0038I Pass 70: suminf. 0.91838 (3) obj. 4.90007 iterations 1 -Cbc0038I Pass 71: suminf. 1.03737 (3) obj. 4.90007 iterations 10 -Cbc0038I Pass 72: suminf. 0.85799 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 73: suminf. 1.04979 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 74: suminf. 0.88776 (3) obj. 4.90007 iterations 4 -Cbc0038I Pass 75: suminf. 0.36535 (3) obj. 4.90007 iterations 2 -Cbc0038I Pass 76: suminf. 0.48563 (3) obj. 4.90007 iterations 2 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 26 columns -Cbc0038I Mini branch and bound improved solution from 8 to 5 (0.07 seconds) -Cbc0038I Round again with cutoff of 2.40006 -Cbc0038I Pass 76: suminf. 0.69775 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 77: suminf. 0.91736 (3) obj. 2.40006 iterations 6 -Cbc0038I Pass 78: suminf. 0.42845 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 79: suminf. 1.01104 (3) obj. 2.40006 iterations 3 -Cbc0038I Pass 80: suminf. 0.83923 (3) obj. 2.40006 iterations 3 -Cbc0038I Pass 81: suminf. 0.82363 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 82: suminf. 0.70670 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 83: suminf. 0.67580 (3) obj. 2.40006 iterations 3 -Cbc0038I Pass 84: suminf. 0.67580 (3) obj. 2.40006 iterations 0 -Cbc0038I Pass 85: suminf. 0.80097 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 86: suminf. 0.78627 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 87: suminf. 0.82660 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 88: suminf. 0.87028 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 89: suminf. 0.83043 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 90: suminf. 0.90110 (3) obj. 2.40006 iterations 3 -Cbc0038I Pass 91: suminf. 0.79210 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 92: suminf. 0.85102 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 93: suminf. 0.53047 (3) obj. 2.40006 iterations 10 -Cbc0038I Pass 94: suminf. 0.53047 (3) obj. 2.40006 iterations 0 -Cbc0038I Pass 95: suminf. 0.86528 (3) obj. 2.40006 iterations 4 -Cbc0038I Pass 96: suminf. 0.83807 (2) obj. 2.40006 iterations 3 -Cbc0038I Pass 97: suminf. 1.03290 (3) obj. 2.40006 iterations 3 -Cbc0038I Pass 98: suminf. 0.85672 (2) obj. 2.40006 iterations 3 -Cbc0038I Pass 99: suminf. 0.83807 (2) obj. 2.40006 iterations 1 -Cbc0038I Pass 100: suminf. 1.09277 (3) obj. 2.40006 iterations 6 -Cbc0038I Pass 101: suminf. 1.03811 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 102: suminf. 1.13206 (3) obj. 2.40006 iterations 1 -Cbc0038I Pass 103: suminf. 0.88447 (3) obj. 2.40006 iterations 7 -Cbc0038I Pass 104: suminf. 0.46780 (3) obj. 2.40006 iterations 2 -Cbc0038I Pass 105: suminf. 0.84603 (3) obj. 2.40006 iterations 5 -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 improved solution from 5 to 3 (0.10 seconds) -Cbc0038I After 0.10 seconds - Feasibility pump exiting with objective of 3 - took 0.10 seconds -Cbc0012I Integer solution of 3 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0031I 6 added rows had average density of 19.5 -Cbc0013I At root node, 6 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 22.5 elements, 1 column cuts (3 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 591 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 606 row cuts average 11.8 elements, 0 column cuts (0 active) in 0.052 seconds - new frequency is -100 +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 12.5 - took 0.03 seconds +Cbc0012I Integer solution of 12.5 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 13 columns +Cbc0031I 4 added rows had average density of 22 +Cbc0013I At root node, 4 cuts changed objective from 0 to 1.5 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 614 row cuts average 25.6 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 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) - 489 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 103 row cuts average 8.9 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 351 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 3 best solution, best possible 0 (0.27 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 773 row cuts average 17.4 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 457 row cuts average 18.0 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 12.5 best solution, best possible 1.5 (0.13 seconds) +Cbc0012I Integer solution of 9.5 found by DiveCoefficient after 1277 iterations and 6 nodes (0.15 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 13 columns +Cbc0012I Integer solution of 5.5 found by rounding after 3250 iterations and 49 nodes (0.24 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0010I After 1000 nodes, 6 on tree, 3 best solution, best possible 0 (0.73 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0016I Integer solution of 3.5 found by strong branching after 9588 iterations and 149 nodes (0.46 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, 5 on tree, 3 best solution, best possible 0 (1.17 seconds) -Cbc0001I Search completed - best objective 3, took 24800 iterations and 8252 nodes (1.29 seconds) -Cbc0032I Strong branching done 10832 times (30246 iterations), fathomed 502 nodes and fixed 621 variables -Cbc0041I Maximum depth 13, 374 variables fixed on reduced cost (complete fathoming 540 times, 5984 nodes taking 14252 iterations) -Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 3 cuts of which 2 were active after adding rounds of cuts (0.005 seconds) -Gomory was tried 100 times and created 591 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) -Knapsack was tried 100 times and created 606 cuts of which 0 were active after adding rounds of cuts (0.052 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 20 columns +Cbc0010I After 1000 nodes, 6 on tree, 3.5 best solution, best possible 1.5 (2.35 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns +Cbc0001I Search completed - best objective 3.5, took 116943 iterations and 3643 nodes (3.34 seconds) +Cbc0032I Strong branching done 11434 times (86612 iterations), fathomed 118 nodes and fixed 399 variables +Cbc0041I Maximum depth 12, 919 variables fixed on reduced cost (complete fathoming 180 times, 2179 nodes taking 11909 iterations) +Cuts at root node changed objective from 0 to 1.5 +Probing was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +Gomory was tried 4353 times and created 15553 cuts of which 0 were active after adding rounds of cuts (0.351 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 100 times and created 489 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) -FlowCover was tried 100 times and created 103 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -TwoMirCuts was tried 100 times and created 351 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 4353 times and created 33126 cuts of which 0 were active after adding rounds of cuts (0.591 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +TwoMirCuts was tried 4353 times and created 12120 cuts of which 0 were active after adding rounds of cuts (0.206 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Result - Optimal solution found -Objective value: 3.00000000 -Enumerated nodes: 8252 -Total iterations: 24800 -Time (CPU seconds): 1.27 -Time (Wallclock seconds): 1.30 +Objective value: 3.50000000 +Enumerated nodes: 3643 +Total iterations: 116943 +Time (CPU seconds): 3.28 +Time (Wallclock seconds): 3.34 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.27 (Wallclock seconds): 1.30 +Total time (CPU seconds): 3.28 (Wallclock seconds): 3.34 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7d826e5017964434aa000bbaf020c784-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d826e5017964434aa000bbaf020c784-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d0c495a427df42c9b4d6b7091efe900a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0c495a427df42c9b4d6b7091efe900a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1515,7 +1527,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c85b605f81ea4248afdcd5134b23f7e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c85b605f81ea4248afdcd5134b23f7e3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6de0baf8538b4a3da38d12f6f8ecadd2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6de0baf8538b4a3da38d12f6f8ecadd2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1542,30 +1554,54 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a081a175dbcf4ba3bc8695bab7da1632-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a081a175dbcf4ba3bc8695bab7da1632-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/36c8e262c9e54aeba3c2103690b5f0db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36c8e262c9e54aeba3c2103690b5f0db-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements +At line 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 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 +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 +/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' + """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d4fd70ee6da5422781acb58f91972936-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d4fd70ee6da5422781acb58f91972936-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/16c7981debeb4092abeabfb4ee6a3a39-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/16c7981debeb4092abeabfb4ee6a3a39-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/1049b661934b47d1a362da22fab15552-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1049b661934b47d1a362da22fab15552-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -1607,51 +1643,30 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b36ade6dcffa4beea0d2043c1d2a2044-pulp.mps mips /tmp/b36ade6dcffa4beea0d2043c1d2a2044-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/b36ade6dcffa4beea0d2043c1d2a2044-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/64c4b0a478df4c33b91e6f32bc3f764f-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/64c4b0a478df4c33b91e6f32bc3f764f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/b36ade6dcffa4beea0d2043c1d2a2044-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.08 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.10 - +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.11 (Wallclock seconds): 0.13 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/44286d3027f64aa393f653afde602f0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44286d3027f64aa393f653afde602f0b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/380541bd929a4144892755b997cebb3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/380541bd929a4144892755b997cebb3b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -1680,7 +1695,7 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.02 @@ -1689,77 +1704,64 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fb3335d008974650956e4b790ce48828-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb3335d008974650956e4b790ce48828-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9e849258086141e6a35d7bd5599898f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e849258086141e6a35d7bd5599898f8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements +At line 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 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 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 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 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: 246.50000000 +Objective value: 8600.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.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/646057f727c5488d886ac85faf974650-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/646057f727c5488d886ac85faf974650-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/184c0170cf3b452d8bfb2219c4e1ea9f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/184c0170cf3b452d8bfb2219c4e1ea9f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 36 RHS -At line 40 BOUNDS -At line 47 ENDATA -Problem MODEL has 3 rows, 6 columns and 9 elements +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 +Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1771,7 +1773,7 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -1784,20 +1786,45 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b2213e9ed95445c591a50a8695a20772-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2213e9ed95445c591a50a8695a20772-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7aac667bebec4a2d8ed974f5a18df38d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7aac667bebec4a2d8ed974f5a18df38d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.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 +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/e9a87ee2465144788981a85c7f5aec0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9a87ee2465144788981a85c7f5aec0a-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) @@ -1809,9 +1836,9 @@ Result - Optimal solution found -Objective value: 0.97000000 +Objective value: -1.60000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -1822,28 +1849,119 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3349a2b98afd43638681b93ac5d12486-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3349a2b98afd43638681b93ac5d12486-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eed4b561815b4b3684b3b50c01d45af5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eed4b561815b4b3684b3b50c01d45af5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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.09 seconds) -Cbc0038I After 0.09 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.10 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.10 seconds) +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/804c545df09c49abb2c06666c3fa18ad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/804c545df09c49abb2c06666c3fa18ad-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 12 to 12 +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/00c4736ac8e845b48cf76c4194b48f6f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00c4736ac8e845b48cf76c4194b48f6f-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/46832518331440ddad83d369f42c5745-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46832518331440ddad83d369f42c5745-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) @@ -1855,101 +1973,135 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.11 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.11 (Wallclock seconds): 0.13 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/59b5c25c1c0b4434b5d40192d9ec7e8e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59b5c25c1c0b4434b5d40192d9ec7e8e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a3f0196c89d6427e80f6a7360f32eea2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3f0196c89d6427e80f6a7360f32eea2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 10 iterations and 0 nodes (0.00 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +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/6a2fdc4e97684ae0aca4bfd53455603f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a2fdc4e97684ae0aca4bfd53455603f-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) - 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 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 10 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0001I Search completed - best objective -1, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 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 3 times and created 4 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: 228100.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 10 +Total iterations: 6 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b2b02be0cef9456a807afd18fc1c09d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2b02be0cef9456a807afd18fc1c09d4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c6bd6ff5610f4c4d97c0e819b059f077-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6bd6ff5610f4c4d97c0e819b059f077-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 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 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) +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 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) +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: 8600.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -1960,23 +2112,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/595d3b006ae142669564c2213fd047c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/595d3b006ae142669564c2213fd047c9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/17a72512308d4eb597d4b9d00f9609aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17a72512308d4eb597d4b9d00f9609aa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 36 RHS +At line 40 BOUNDS +At line 47 ENDATA +Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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) +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +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) @@ -1988,7 +2141,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2001,7 +2154,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b11d614edd554a5fb02b569705933d79-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b11d614edd554a5fb02b569705933d79-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/98eff462f19d4b43b888ddd7f11e7e0e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/98eff462f19d4b43b888ddd7f11e7e0e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2023,7 +2176,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ba6ded10a649440db8f8d1527807f785-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba6ded10a649440db8f8d1527807f785-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/25950c7e72804a35b6dedebef8e0072b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/25950c7e72804a35b6dedebef8e0072b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -2073,7 +2226,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e021b2bacc254bbc968580a06d3b43ab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e021b2bacc254bbc968580a06d3b43ab-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3f75ca69613644c7b1451f1753fa1ea1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f75ca69613644c7b1451f1753fa1ea1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2097,7 +2250,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0c1a2118adcd4abcb95ce73c65073dd4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c1a2118adcd4abcb95ce73c65073dd4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/372c9ca5141d4ede853da14f57ec622e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/372c9ca5141d4ede853da14f57ec622e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -2146,7 +2299,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/da26d24577394b789fc700613b0203b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/da26d24577394b789fc700613b0203b4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e768ddc5cc214287b59bd8aed79120f6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e768ddc5cc214287b59bd8aed79120f6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2193,52 +2346,140 @@ 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 -/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' - """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dbbef56f792241079968e201b260fd88-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/dbbef56f792241079968e201b260fd88-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ded30433968f4371b0b6577c02bc1a33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ded30433968f4371b0b6577c02bc1a33-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 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 -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 +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 10 iterations and 0 nodes (0.00 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 10 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 10 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/24c149b90bfd47daa54b6b41058ba5cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24c149b90bfd47daa54b6b41058ba5cb-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.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds +Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.08 seconds) +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.09 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8f5685944eb94e4587313081897194c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f5685944eb94e4587313081897194c0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/aa417085c8b3499da56099a35125dd81-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa417085c8b3499da56099a35125dd81-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements +At line 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 -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 0.97000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -2246,23 +2487,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a6ccdc0a712a4b93ba76c3603126b1eb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6ccdc0a712a4b93ba76c3603126b1eb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4a053ef92d5c462b9869064aad70ab7d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a053ef92d5c462b9869064aad70ab7d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 84 RHS -At line 93 BOUNDS -At line 109 ENDATA -Problem MODEL has 8 rows, 15 columns and 30 elements +At line 8 COLUMNS +At line 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 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Continuous objective value is 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 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 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 8300 to 8300 +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) @@ -2274,7 +2516,7 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -2287,7 +2529,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e5d6e202ba7f44aeb523d27ed411591d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e5d6e202ba7f44aeb523d27ed411591d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/83f0dc2210b24af7b8a816d264c2fdc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/83f0dc2210b24af7b8a816d264c2fdc5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -2307,7 +2549,7 @@ Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.03 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.02 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) @@ -2324,17 +2566,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 +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/f450ede13d0045b4a1a41156e303cfe8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f450ede13d0045b4a1a41156e303cfe8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/add16d1086ca4348945a5ada743156ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/add16d1086ca4348945a5ada743156ac-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -2360,10 +2602,10 @@ Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -2380,17 +2622,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a18397b5da39477cb5973c9d279bbc6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a18397b5da39477cb5973c9d279bbc6d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0dc6df281f7549ca834578872610cebb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dc6df281f7549ca834578872610cebb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -2415,10 +2657,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.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2435,17 +2677,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +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.08 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8e6ecb5a75714b498da9ac701503e846-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e6ecb5a75714b498da9ac701503e846-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e0bf01ba820f4683b5260789ffd24daa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0bf01ba820f4683b5260789ffd24daa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -2470,10 +2712,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.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.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2490,17 +2732,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/65fa9b2e216a411e8fd29db98b0559ce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65fa9b2e216a411e8fd29db98b0559ce-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7b4cbaf43e214c7496d13522c71b9562-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b4cbaf43e214c7496d13522c71b9562-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -2510,7 +2752,7 @@ Problem MODEL has 354 rows, 730 columns and 3266 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds +Continuous objective value is 0 - -0.00 seconds Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions @@ -2523,10 +2765,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 20 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -2543,17 +2785,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +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/c6c2844b6caa4c0393e4651f5e0b338e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6c2844b6caa4c0393e4651f5e0b338e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cf0d1007db4b4fa1a916987ca25fec35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf0d1007db4b4fa1a916987ca25fec35-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -2575,10 +2817,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 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) @@ -2595,17 +2837,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b201ab6dcb214b8c821026896c0c4e8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b201ab6dcb214b8c821026896c0c4e8f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7bcb9986a14f4398a342089275b8bc6d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7bcb9986a14f4398a342089275b8bc6d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -2628,10 +2870,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2648,17 +2890,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4b9a066166864ee2a5106f1f39556be4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4b9a066166864ee2a5106f1f39556be4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/560f6247244a4bc6aa24d2274299de78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/560f6247244a4bc6aa24d2274299de78-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -2680,10 +2922,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2700,17 +2942,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +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/2f28b6c0b6e644e897a92cbf9cfa21e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f28b6c0b6e644e897a92cbf9cfa21e6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d461e4ce9d054fe9a974e0cfe08d3ddd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d461e4ce9d054fe9a974e0cfe08d3ddd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -2730,10 +2972,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2750,387 +2992,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 - -Status: Optimal -x = 4.0 -y = -1.0 -z = 6.0 -objective= 54.0 -Status: Optimal -x_0 = 1.0 -x_1 = 1.0 -x_10 = 0.0 -x_11 = 0.0 -x_12 = 0.0 -x_13 = 0.0 -x_14 = 0.0 -x_2 = 1.0 -x_3 = 1.0 -x_4 = 1.0 -x_5 = 1.0 -x_6 = 1.0 -x_7 = 0.0 -x_8 = 0.0 -x_9 = 0.0 -objective= 4190215.0 -Minimum total cost: 3208.9570439999998 - D S U T0 T1 T2 T3 T4 - 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + -103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + - 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + -140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + - 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - -148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - - 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 = 1.0 -x_1 = 0.0 -x_2 = 0.0 -x_3 = 1.0 -x_4 = 1.0 -x_5 = 1.0 -x_6 = 1.0 -x_7 = 1.0 -x_8 = 1.0 -x_9 = 0.0 -Status: Optimal -s_0 = 0.0 -s_1 = 0.0 -s_2 = 0.0 -w_0 = 3.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 = 0.0 -x_13 = 0.0 -x_14 = 0.0 -x_15 = 1.0 -x_16 = 0.0 -x_17 = 1.0 -x_18 = 1.0 -x_19 = 1.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 1.0 -x_5 = 0.0 -x_6 = 1.0 -x_7 = 0.0 -x_8 = 0.0 -x_9 = 0.0 -objective= 3.0 -Status: Optimal -x = 4.0 -y = -1.0 -z = 6.0 -objective= 54.0 -Status: Optimal -x = 4.0 Reduced Cost = 0.0 -y = -1.0 Reduced Cost = 12.0 -z = 6.0 Reduced Cost = 0.0 -objective= 54.0 - -Sensitivity Analysis -Constraint Shadow Price Slack -c1 : x + y <= 5 0.0 2.0 -c2 : x + z >= 10 1.0 -0.0 -c3 : -y + z = 7 8.0 -0.0 -Trying: - x = LpVariable("x", 0, 3) -Expecting nothing -ok -Trying: - y = LpVariable("y", 0, 1) -Expecting nothing -ok -Trying: - prob = LpProblem("myProblem", const.LpMinimize) -Expecting nothing -ok -Trying: - prob += x + y <= 2 -Expecting nothing -ok -Trying: - prob += -4 * x + y -Expecting nothing -ok -Trying: - status = prob.solve(PULP_CBC_CMD(msg=0)) -Expecting nothing -ok -Trying: - const.LpStatus[status] -Expecting: - 'Optimal' -ok -Trying: - value(x) -Expecting: - 2.0 -ok -1 item passed all tests: - 8 tests in pulp -8 tests in 1 item. -8 passed. -Test passed. -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.0 -Status: Optimal -Route_('Chicago',_'Gary') = 4000.0 -Route_('Chicago',_'Tempe') = 2000.0 -Route_('Cincinatti',_'Albany') = 2000.0 -Route_('Cincinatti',_'Houston') = 3000.0 -Route_('Kansas_City',_'Houston') = 4000.0 -Route_('Kansas_City',_'Tempe') = 2000.0 -Route_('Pittsburgh',_'Chicago') = 3000.0 -Route_('Pittsburgh',_'Cincinatti') = 2000.0 -Route_('Pittsburgh',_'Gary') = 2000.0 -Route_('Pittsburgh',_'Kansas_City') = 3000.0 -Route_('Youngstown',_'Albany') = 1000.0 -Route_('Youngstown',_'Chicago') = 3000.0 -Route_('Youngstown',_'Cincinatti') = 3000.0 -Route_('Youngstown',_'Kansas_City') = 3000.0 -Total Cost of Transportation = 15005.0 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Solution Written to sudokuout.txt -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = 0.0 -Patt_P13 = 0.0 -Patt_P14 = 0.0 -Patt_P2 = 137.0 -Patt_P3 = 0.0 -Patt_P4 = 0.0 -Patt_P5 = 0.0 -Patt_P6 = 0.0 -Patt_P7 = 0.0 -Patt_P8 = 0.0 -Patt_P9 = 100.0 -Surp_5 = 2.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 246.50000000000003 -Status: Optimal -Patt_A = 200.0 -Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_A_D = 0.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8600.0 -P0 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -The_Gemstone_Tool_Problem: -MAXIMIZE -25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 -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 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 -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 - -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 -Ingr_BEEF = 60.0 -Ingr_CHICKEN = 0.0 -Ingr_GEL = 40.0 -Ingr_MUTTON = 0.0 -Ingr_RICE = 0.0 -Ingr_WHEAT = 0.0 -Total Cost of Ingredients per can = 0.52 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1700.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_C_1 = 0.0 -Route_C_2 = 0.0 -Route_C_3 = 100.0 -Route_C_4 = 0.0 -Route_C_5 = 0.0 -Total Cost of Transportation = 8300.0 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: OptimalWelcome to the CBC MILP Solver +Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/30ea37e100c144759d1f26bd0737b285-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30ea37e100c144759d1f26bd0737b285-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/32a9cf797100411ab51c443d6351cb38-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/32a9cf797100411ab51c443d6351cb38-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -3149,10 +3021,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -3169,17 +3041,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -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.06 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8003bf69a99d480aa23093e07888eafc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8003bf69a99d480aa23093e07888eafc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/39b0d113f12c4425b2b0b84f0f893781-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39b0d113f12c4425b2b0b84f0f893781-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -3210,17 +3082,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f9f72dff45664e018f431eb4ca8e98bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f72dff45664e018f431eb4ca8e98bd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cc9691423e554e1d81436adecb6f9f45-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc9691423e554e1d81436adecb6f9f45-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -3250,17 +3122,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.06 -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.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/28217bd8f9d44ef7ad4da17b993f9517-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28217bd8f9d44ef7ad4da17b993f9517-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9f21a7806a6c41f08bdaef0bfa48eb37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f21a7806a6c41f08bdaef0bfa48eb37-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -3308,8 +3180,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.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting - took 0.00 seconds +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -3320,7 +3192,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.07 seconds) +Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3337,59 +3209,17 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f02432c9f1b149498e20b791323b59c6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f02432c9f1b149498e20b791323b59c6-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 32 ENDATA -Problem MODEL has 3 rows, 3 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 300.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/0a5bf5208893495fb940cc8ba82c46ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0a5bf5208893495fb940cc8ba82c46ea-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5ed35ba99c48484eb60a2a3a12d984d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ed35ba99c48484eb60a2a3a12d984d9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3430,7 +3260,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/be2f11863c1947fc967e1c0b6039ee59-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be2f11863c1947fc967e1c0b6039ee59-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fe6f9bed2c444a19a72ca3060041ce1a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe6f9bed2c444a19a72ca3060041ce1a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3471,7 +3301,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e7c2b96870cd4436a3ea6711d0218d3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e7c2b96870cd4436a3ea6711d0218d3e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b6c834009d8f4bbcb6e60bb0f84b3c10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b6c834009d8f4bbcb6e60bb0f84b3c10-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3508,11 +3338,380 @@ Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 -Welcome to the CBC MILP Solver +Status: Optimal +x = 4.0 +y = -1.0 +z = 6.0 +objective= 54.0 +Status: Optimal +x_0 = 1.0 +x_1 = 1.0 +x_10 = 0.0 +x_11 = 0.0 +x_12 = 0.0 +x_13 = 0.0 +x_14 = 0.0 +x_2 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 1.0 +x_7 = 0.0 +x_8 = 0.0 +x_9 = 0.0 +objective= 4190215.0 +Minimum total cost: 3208.9570439999998 + D S U T0 T1 T2 T3 T4 + 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + +103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + +140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - +148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - + 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 = 1.0 +x_1 = 1.0 +x_2 = 0.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 0.0 +x_6 = 1.0 +x_7 = 0.0 +x_8 = 1.0 +x_9 = 1.0 +Status: Optimal +s_0 = 2.5 +s_1 = 0.0 +s_2 = 0.0 +w_0 = 0.0 +w_1 = 0.5 +w_2 = 0.5 +x_0 = 1.0 +x_1 = 0.0 +x_10 = 1.0 +x_11 = 0.0 +x_12 = 0.0 +x_13 = 1.0 +x_14 = 1.0 +x_15 = 0.0 +x_16 = 0.0 +x_17 = 1.0 +x_18 = 0.0 +x_19 = 1.0 +x_2 = 1.0 +x_3 = 0.0 +x_4 = 0.0 +x_5 = 1.0 +x_6 = 0.0 +x_7 = 1.0 +x_8 = 0.0 +x_9 = 0.0 +objective= 3.5 +Status: Optimal +x = 4.0 +y = -1.0 +z = 6.0 +objective= 54.0 +Status: Optimal +x = 4.0 Reduced Cost = 0.0 +y = -1.0 Reduced Cost = 12.0 +z = 6.0 Reduced Cost = 0.0 +objective= 54.0 + +Sensitivity Analysis +Constraint Shadow Price Slack +c1 : x + y <= 5 0.0 2.0 +c2 : x + z >= 10 1.0 -0.0 +c3 : -y + z = 7 8.0 -0.0 +Trying: + x = LpVariable("x", 0, 3) +Expecting nothing +ok +Trying: + y = LpVariable("y", 0, 1) +Expecting nothing +ok +Trying: + prob = LpProblem("myProblem", const.LpMinimize) +Expecting nothing +ok +Trying: + prob += x + y <= 2 +Expecting nothing +ok +Trying: + prob += -4 * x + y +Expecting nothing +ok +Trying: + status = prob.solve(PULP_CBC_CMD(msg=0)) +Expecting nothing +ok +Trying: + const.LpStatus[status] +Expecting: + 'Optimal' +ok +Trying: + value(x) +Expecting: + 2.0 +ok +1 item passed all tests: + 8 tests in pulp +8 tests in 1 item. +8 passed. +Test passed. +Status: Optimal +Ingr_BEEF = 60.0 +Ingr_CHICKEN = 0.0 +Ingr_GEL = 40.0 +Ingr_MUTTON = 0.0 +Ingr_RICE = 0.0 +Ingr_WHEAT = 0.0 +Total Cost of Ingredients per can = 0.52 +The_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 + +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_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 +Status: Optimal +Solution Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_A_D = 0.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +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 +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 +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Infeasible +Solutions Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 210.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8630.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a585b30d302042d58cf325a8a87492c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a585b30d302042d58cf325a8a87492c3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ca5f821440c24c25aab4d289baec77d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca5f821440c24c25aab4d289baec77d9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3553,7 +3752,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3b2039b191f04808af8b23309673f9cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b2039b191f04808af8b23309673f9cd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ddb7f99733af4225a0931e9333dc7e2a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ddb7f99733af4225a0931e9333dc7e2a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3594,7 +3793,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1d7c319d1c0146b181335847271908ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1d7c319d1c0146b181335847271908ff-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6d433257a51b4b7ba9b21211fd91950e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d433257a51b4b7ba9b21211fd91950e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3635,7 +3834,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4e237c9d00774b6bb809a69b770f0fb5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e237c9d00774b6bb809a69b770f0fb5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/56820b51d62045a887397cb6d48e9fb6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56820b51d62045a887397cb6d48e9fb6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3676,7 +3875,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2ffb1df892f54eb7af93a708acd98630-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2ffb1df892f54eb7af93a708acd98630-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7195294b60064f5d9e750088aacf02a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7195294b60064f5d9e750088aacf02a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3717,7 +3916,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ae28efbbc40b48c2a479c34d871572f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae28efbbc40b48c2a479c34d871572f4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/81bb85b714a24d6b9933e0890d793054-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81bb85b714a24d6b9933e0890d793054-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3758,7 +3957,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fccc4039173c4e30a7382981eecd5f33-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fccc4039173c4e30a7382981eecd5f33-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d416497e71fd4edb9e8f83ea292e4c88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d416497e71fd4edb9e8f83ea292e4c88-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3799,7 +3998,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/742a3b1bb5b1494db4e2b7ede6e75729-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/742a3b1bb5b1494db4e2b7ede6e75729-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a62ed655eb4f4a6facfedda8b4b90c52-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a62ed655eb4f4a6facfedda8b4b90c52-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3840,131 +4039,49 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7946605d94874a51874edac3a38f7505-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7946605d94874a51874edac3a38f7505-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2f226c55bdc14ea6a0f9cd0c0a5f0c9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f226c55bdc14ea6a0f9cd0c0a5f0c9a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/cd953ca92c474d29b072575387fade5f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cd953ca92c474d29b072575387fade5f-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/459b198dbeeb4737bd7636850ed526a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/459b198dbeeb4737bd7636850ed526a2-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/b47f012a829c4dd2acabc9a6fe58e7d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b47f012a829c4dd2acabc9a6fe58e7d0-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) -Cbc0031I 2 added rows had average density of 3 -Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 14 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.33333 to -1.25 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.25000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 2 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3975,47 +4092,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fe803ecebecb4bdb99bbf50c6d85db41-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe803ecebecb4bdb99bbf50c6d85db41-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9da18510cf4c4af8a040c00e887a35af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9da18510cf4c4af8a040c00e887a35af-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/a93d6b8768e44bc49ee8eed7ab5be577-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a93d6b8768e44bc49ee8eed7ab5be577-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.24444 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.22143 to -1.22143 +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) @@ -4027,7 +4120,7 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -4040,133 +4133,51 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/863620ef637342319d63d3d197c95ce9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/863620ef637342319d63d3d197c95ce9-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/b437c7f8a2bd44d9bb89b277ec26140d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b437c7f8a2bd44d9bb89b277ec26140d-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 -1, took 6 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -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.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/9737bf59c3fe4850aa673e546e092667-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9737bf59c3fe4850aa673e546e092667-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bc44012cacde4448aaa236c958b0644e-pulp.mps mips /tmp/bc44012cacde4448aaa236c958b0644e-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/bc44012cacde4448aaa236c958b0644e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 46 RHS -At line 50 BOUNDS -At line 60 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors +opening mipstart file /tmp/bc44012cacde4448aaa236c958b0644e-pulp.mst. +MIPStart values read for 3213 variables. 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) +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.07 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0045I Solution of 12 already found by heuristic +Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 12.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b9b997f66aa742e98ea71bc295e9acce-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9b997f66aa742e98ea71bc295e9acce-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9ef7e4c358f04096afa09f700068fece-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ef7e4c358f04096afa09f700068fece-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4176,7 +4187,7 @@ 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 +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 @@ -4185,24 +4196,24 @@ 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 +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) +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 @@ -4213,7 +4224,7 @@ 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) @@ -5551,47 +5562,10 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 29.289s +Ran 1005 tests in 26.047s OK (skipped=885) -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 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8600.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 210.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8630.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 @@ -5697,22 +5671,60 @@ Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +P2 = [0, 0, 2] +P3 = [0, 1, 0] +P4 = [0, 1, 1] +P5 = [0, 2, 0] +P6 = [1, 0, 0] +P7 = [1, 0, 1] +P8 = [1, 1, 0] +P9 = [1, 2, 0] +P10 = [2, 0, 0] +P11 = [2, 0, 1] +P12 = [2, 1, 0] +P13 = [3, 0, 0] +P14 = [4, 0, 0] +Status: Optimal +Patt_P0 = 0.0 +Patt_P1 = 0.0 +Patt_P10 = 0.0 +Patt_P11 = 26.0 +Patt_P12 = 0.0 +Patt_P13 = 0.0 +Patt_P14 = 0.0 +Patt_P2 = 137.0 +Patt_P3 = 0.0 +Patt_P4 = 0.0 +Patt_P5 = 0.0 +Patt_P6 = 0.0 +Patt_P7 = 0.0 +Patt_P8 = 0.0 +Patt_P9 = 100.0 +Surp_5 = 2.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 246.50000000000003 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +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 +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') Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -5894,7 +5906,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/479245696a6b483db3ef25eea8373472-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/479245696a6b483db3ef25eea8373472-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f81b183be3e448f2bd8f2dd9ded1b6a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f81b183be3e448f2bd8f2dd9ded1b6a1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -5917,7 +5929,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9470565a00c54c09a574b1f93ad1fbcf-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/9470565a00c54c09a574b1f93ad1fbcf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6a200c4bbb8444d5b30aa77fb3fb9e6b-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/6a200c4bbb8444d5b30aa77fb3fb9e6b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -6002,11 +6014,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.04 seconds) -Cbc0038I After 0.04 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.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.04 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 iterations and 0 nodes (0.03 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -6015,7 +6027,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.04 seconds) +Cbc0001I Search completed - best objective 4190215, took 7 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6032,17 +6044,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 -Time (CPU seconds): 0.04 -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.04 (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/dcbdbf83dcda4b7fb23ca6a90ad541da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dcbdbf83dcda4b7fb23ca6a90ad541da-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6d74996d8de74f15802c65f001266643-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d74996d8de74f15802c65f001266643-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -6061,7 +6073,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 50 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 36 columns -Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.02 seconds) +Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (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 11 @@ -6087,7 +6099,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 31 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 83 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.14 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.10 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 12 @@ -6122,146 +6134,98 @@ 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.24 seconds) -Cbc0038I After 0.24 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.24 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.17 seconds) +Cbc0038I After 0.17 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.17 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.17 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 9 added rows had average density of 59 Cbc0013I At root node, 9 cuts changed objective from 2546.9589 to 2695.6793 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.043 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.071 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.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.030 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.68 seconds) +Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.028 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 elements, 0 column cuts (0 active) in 0.047 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.026 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.47 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 47 rows 56 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 74 rows 77 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.52 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4892 iterations and 110 nodes (1.04 seconds) Cbc0032I Strong branching done 1272 times (10385 iterations), fathomed 26 nodes and fixed 41 variables Cbc0035I Maximum depth 11, 238 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2695.68 -Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.043 seconds) -Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.114 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.080 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.030 seconds) -TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.050 seconds) +Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.028 seconds) +Gomory was tried 343 times and created 1877 cuts of which 0 were active after adding rounds of cuts (0.078 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 343 times and created 307 cuts of which 0 were active after adding rounds of cuts (0.055 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) +TwoMirCuts was tried 343 times and created 220 cuts of which 0 were active after adding rounds of cuts (0.032 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +ImplicationCuts was tried 283 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 110 Total iterations: 4892 -Time (CPU seconds): 1.51 -Time (Wallclock seconds): 1.53 +Time (CPU seconds): 1.04 +Time (Wallclock seconds): 1.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.51 (Wallclock seconds): 1.53 +Total time (CPU seconds): 1.04 (Wallclock seconds): 1.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/54217efe9030498fa5ce641f803f3b2c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/54217efe9030498fa5ce641f803f3b2c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/452b8bf3d58b41ee904879221f4d004a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/452b8bf3d58b41ee904879221f4d004a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1655 RHS -At line 1876 BOUNDS -At line 2087 ENDATA -Problem MODEL has 220 rows, 210 columns and 799 elements +At line 1595 RHS +At line 1816 BOUNDS +At line 2027 ENDATA +Problem MODEL has 220 rows, 210 columns and 740 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -162.05 - 0.00 seconds -Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements -Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 23 integers unsatisfied sum - 5.84213 -Cbc0038I Pass 1: suminf. 1.55847 (7) obj. -159.454 iterations 94 -Cbc0038I Solution found of -144.05 -Cbc0038I Before mini branch and bound, 180 integers at bound fixed and 0 continuous -Cbc0038I Full problem 219 rows 209 columns, reduced to 15 rows 17 columns -Cbc0038I Mini branch and bound improved solution from -144.05 to -159.8 (0.02 seconds) -Cbc0038I Round again with cutoff of -160.1 -Cbc0038I Reduced cost fixing fixed 23 variables on major pass 2 -Cbc0038I Pass 2: suminf. 1.87742 (9) obj. -160.1 iterations 16 -Cbc0038I Pass 3: suminf. 2.28521 (26) obj. -160.1 iterations 85 -Cbc0038I Pass 4: suminf. 2.23637 (26) obj. -160.1 iterations 12 -Cbc0038I Pass 5: suminf. 0.93103 (18) obj. -160.1 iterations 103 -Cbc0038I Pass 6: suminf. 0.93103 (18) obj. -160.1 iterations 0 -Cbc0038I Pass 7: suminf. 2.16294 (24) obj. -160.1 iterations 72 -Cbc0038I Pass 8: suminf. 2.17005 (25) obj. -160.1 iterations 5 -Cbc0038I Pass 9: suminf. 3.58662 (20) obj. -160.1 iterations 25 -Cbc0038I Pass 10: suminf. 3.34769 (21) obj. -160.1 iterations 7 -Cbc0038I Pass 11: suminf. 0.93103 (18) obj. -160.1 iterations 70 -Cbc0038I Pass 12: suminf. 0.93103 (18) obj. -160.1 iterations 0 -Cbc0038I Pass 13: suminf. 2.16294 (24) obj. -160.1 iterations 73 -Cbc0038I Pass 14: suminf. 2.17005 (25) obj. -160.1 iterations 5 -Cbc0038I Pass 15: suminf. 4.74194 (19) obj. -160.1 iterations 78 -Cbc0038I Pass 16: suminf. 0.93103 (18) obj. -160.1 iterations 13 -Cbc0038I Pass 17: suminf. 0.93103 (18) obj. -160.1 iterations 0 -Cbc0038I Pass 18: suminf. 2.16294 (24) obj. -160.1 iterations 71 -Cbc0038I Pass 19: suminf. 2.17005 (25) obj. -160.1 iterations 5 -Cbc0038I Pass 20: suminf. 0.93103 (18) obj. -160.1 iterations 81 -Cbc0038I Pass 21: suminf. 1.71032 (19) obj. -160.1 iterations 7 -Cbc0038I Pass 22: suminf. 1.70811 (19) obj. -160.1 iterations 5 -Cbc0038I Pass 23: suminf. 2.40761 (24) obj. -160.1 iterations 55 -Cbc0038I Pass 24: suminf. 2.39762 (24) obj. -160.1 iterations 3 -Cbc0038I Pass 25: suminf. 3.33754 (20) obj. -160.1 iterations 17 -Cbc0038I Pass 26: suminf. 3.06442 (21) obj. -160.1 iterations 6 -Cbc0038I Pass 27: suminf. 1.70811 (19) obj. -160.1 iterations 70 -Cbc0038I Pass 28: suminf. 1.70811 (19) obj. -160.1 iterations 0 -Cbc0038I Pass 29: suminf. 3.35299 (21) obj. -160.1 iterations 50 -Cbc0038I Pass 30: suminf. 1.70811 (19) obj. -160.1 iterations 72 -Cbc0038I Pass 31: suminf. 3.07313 (19) obj. -160.1 iterations 10 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 176 integers at bound fixed and 0 continuous -Cbc0038I Full problem 219 rows 209 columns, reduced to 15 rows 17 columns -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -159.8 - took 0.04 seconds -Cbc0012I Integer solution of -159.8 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0031I 10 added rows had average density of 6.9 -Cbc0013I At root node, 29 cuts changed objective from -162.05043 to -156.23462 in 1 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 10.0 elements, 2 column cuts (2 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) - 8 row cuts average 6.1 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 16 row cuts average 6.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 7 (ZeroHalf) - 4 row cuts average 19.8 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -159.8000000000001, took 8 iterations and 0 nodes (0.07 seconds) -Cbc0035I Maximum depth 0, 17 variables fixed on reduced cost -Cuts at root node changed objective from -162.05 to -156.235 -Probing was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 1 times and created 8 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 16 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Continuous objective value is -167.7 - 0.00 seconds +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0004I processed model has 80 rows, 97 columns (97 integer (97 of which binary)) and 297 elements +Cbc0038I Initial state - 0 integers unsatisfied sum - 9.99201e-16 +Cbc0038I Solution found of -167.7 +Cbc0038I Before mini branch and bound, 97 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound improved solution from -167.7 to -167.7 (0.01 seconds) +Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of -167.7 - took 0.00 seconds +Cbc0012I Integer solution of -167.7 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -167.7, 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 -167.7 to -167.7 +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: -159.80000000 +Objective value: -167.70000000 Enumerated nodes: 0 -Total iterations: 8 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +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.06 (Wallclock seconds): 0.07 +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/027569b3b8054ca2bc9eccb07cad3604-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/027569b3b8054ca2bc9eccb07cad3604-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e986c8df408e4dce9981f7e3c5e79aa8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e986c8df408e4dce9981f7e3c5e79aa8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6273,195 +6237,214 @@ 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.900844 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 124 iterations 4 -Cbc0038I Solution found of 124 -Cbc0038I Relaxing continuous gives 124 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.680426 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 105 iterations 3 +Cbc0038I Solution found of 105 +Cbc0038I Relaxing continuous gives 105 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 111.6 -Cbc0038I Pass 2: suminf. 0.05277 (1) obj. 111.6 iterations 1 -Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 111.6 iterations 3 -Cbc0038I Solution found of 111.6 -Cbc0038I Relaxing continuous gives 111 -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 111 to 75 (0.01 seconds) -Cbc0038I Round again with cutoff of 60 -Cbc0038I Pass 4: suminf. 0.27234 (1) obj. 60 iterations 0 -Cbc0038I Pass 5: suminf. 0.21702 (1) obj. 60 iterations 3 -Cbc0038I Pass 6: suminf. 0.39663 (2) obj. 60 iterations 10 -Cbc0038I Pass 7: suminf. 0.04255 (1) obj. 60 iterations 5 -Cbc0038I Pass 8: suminf. 0.00000 (0) obj. 60 iterations 1 -Cbc0038I Solution found of 60 -Cbc0038I Relaxing continuous gives 50 -Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0038I Mini branch and bound improved solution from 50 to 27 (0.02 seconds) -Cbc0038I Round again with cutoff of 18.9 -Cbc0038I Pass 9: suminf. 0.60366 (2) obj. 18.9 iterations 2 -Cbc0038I Pass 10: suminf. 0.26664 (2) obj. 18.9 iterations 4 -Cbc0038I Pass 11: suminf. 0.26664 (2) obj. 18.9 iterations 0 -Cbc0038I Pass 12: suminf. 0.91224 (3) obj. 18.9 iterations 5 -Cbc0038I Pass 13: suminf. 0.45715 (3) obj. 18.9 iterations 1 -Cbc0038I Pass 14: suminf. 0.97723 (3) obj. 18.9 iterations 2 -Cbc0038I Pass 15: suminf. 0.32063 (2) obj. 18.9 iterations 5 -Cbc0038I Pass 16: suminf. 0.73852 (3) obj. 18.9 iterations 8 -Cbc0038I Pass 17: suminf. 0.85936 (3) obj. 18.9 iterations 7 -Cbc0038I Pass 18: suminf. 0.85936 (3) obj. 18.9 iterations 0 -Cbc0038I Pass 19: suminf. 0.89719 (3) obj. 18.9 iterations 6 -Cbc0038I Pass 20: suminf. 0.74339 (3) obj. 18.9 iterations 2 -Cbc0038I Pass 21: suminf. 0.88441 (3) obj. 18.9 iterations 7 -Cbc0038I Pass 22: suminf. 0.81650 (3) obj. 18.9 iterations 2 -Cbc0038I Pass 23: suminf. 0.97064 (3) obj. 18.9 iterations 6 -Cbc0038I Pass 24: suminf. 0.40294 (3) obj. 18.9 iterations 3 -Cbc0038I Pass 25: suminf. 0.63881 (3) obj. 18.9 iterations 8 -Cbc0038I Pass 26: suminf. 0.63881 (3) obj. 18.9 iterations 0 -Cbc0038I Pass 27: suminf. 0.63788 (3) obj. 18.9 iterations 5 -Cbc0038I Pass 28: suminf. 0.37890 (3) obj. 18.9 iterations 3 -Cbc0038I Pass 29: suminf. 1.02695 (3) obj. 18.9 iterations 6 -Cbc0038I Pass 30: suminf. 1.02695 (3) obj. 18.9 iterations 0 -Cbc0038I Pass 31: suminf. 1.24527 (3) obj. 18.9 iterations 4 -Cbc0038I Pass 32: suminf. 0.37574 (2) obj. 18.9 iterations 4 -Cbc0038I Pass 33: suminf. 1.11052 (3) obj. 18.9 iterations 3 -Cbc0038I Pass 34: suminf. 0.96032 (3) obj. 18.9 iterations 2 -Cbc0038I Pass 35: suminf. 0.78277 (3) obj. 18.9 iterations 2 -Cbc0038I Pass 36: suminf. 0.45005 (2) obj. 18.9 iterations 3 -Cbc0038I Pass 37: suminf. 1.11111 (3) obj. 18.9 iterations 3 -Cbc0038I Pass 38: suminf. 0.81321 (3) obj. 18.9 iterations 9 +Cbc0038I Mini branch and bound improved solution from 105 to 105 (0.00 seconds) +Cbc0038I Round again with cutoff of 94.5 +Cbc0038I Pass 2: suminf. 0.05024 (1) obj. 94.5 iterations 1 +Cbc0038I Pass 3: suminf. 0.03640 (1) obj. 94.5 iterations 4 +Cbc0038I Pass 4: suminf. 0.23946 (1) obj. 94.5 iterations 3 +Cbc0038I Pass 5: suminf. 0.56452 (2) obj. 94.5 iterations 6 +Cbc0038I Pass 6: suminf. 0.00000 (0) obj. 94.5 iterations 6 +Cbc0038I Solution found of 94.5 +Cbc0038I Relaxing continuous gives 88 +Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Mini branch and bound improved solution from 88 to 13 (0.01 seconds) +Cbc0038I Round again with cutoff of 10.4 +Cbc0038I Pass 7: suminf. 0.48094 (2) obj. 10.4 iterations 1 +Cbc0038I Pass 8: suminf. 1.26593 (3) obj. 10.4 iterations 3 +Cbc0038I Pass 9: suminf. 0.55436 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 10: suminf. 0.78736 (3) obj. 10.4 iterations 4 +Cbc0038I Pass 11: suminf. 0.32486 (2) obj. 10.4 iterations 7 +Cbc0038I Pass 12: suminf. 0.72838 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 13: suminf. 0.51753 (3) obj. 10.4 iterations 4 +Cbc0038I Pass 14: suminf. 0.48132 (3) obj. 10.4 iterations 4 +Cbc0038I Pass 15: suminf. 0.26757 (1) obj. 10.4 iterations 5 +Cbc0038I Pass 16: suminf. 0.45916 (2) obj. 10.4 iterations 3 +Cbc0038I Pass 17: suminf. 0.90445 (3) obj. 10.4 iterations 9 +Cbc0038I Pass 18: suminf. 0.59671 (3) obj. 10.4 iterations 3 +Cbc0038I Pass 19: suminf. 0.88847 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 20: suminf. 0.66488 (3) obj. 10.4 iterations 9 +Cbc0038I Pass 21: suminf. 0.44303 (2) obj. 10.4 iterations 6 +Cbc0038I Pass 22: suminf. 0.02727 (1) obj. 10.4 iterations 7 +Cbc0038I Pass 23: suminf. 0.02727 (1) obj. 10.4 iterations 0 +Cbc0038I Pass 24: suminf. 0.06176 (1) obj. 10.4 iterations 2 +Cbc0038I Pass 25: suminf. 0.60193 (3) obj. 10.4 iterations 5 +Cbc0038I Pass 26: suminf. 0.86798 (3) obj. 10.4 iterations 1 +Cbc0038I Pass 27: suminf. 0.60193 (3) obj. 10.4 iterations 1 +Cbc0038I Pass 28: suminf. 1.21561 (3) obj. 10.4 iterations 5 +Cbc0038I Pass 29: suminf. 1.14459 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 30: suminf. 0.69562 (2) obj. 10.4 iterations 3 +Cbc0038I Pass 31: suminf. 0.76065 (2) obj. 10.4 iterations 3 +Cbc0038I Pass 32: suminf. 0.55801 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 33: suminf. 0.79140 (3) obj. 10.4 iterations 2 +Cbc0038I Pass 34: suminf. 0.56797 (3) obj. 10.4 iterations 10 +Cbc0038I Pass 35: suminf. 0.38808 (2) obj. 10.4 iterations 3 +Cbc0038I Pass 36: suminf. 0.41816 (3) obj. 10.4 iterations 3 Cbc0038I No solution found this major pass -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 27 to 10 (0.05 seconds) -Cbc0038I Round again with cutoff of 6.99999 -Cbc0038I Pass 38: suminf. 0.78464 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 39: suminf. 0.55908 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 40: suminf. 0.27760 (2) obj. 6.99999 iterations 7 -Cbc0038I Pass 41: suminf. 0.88117 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 42: suminf. 0.64344 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 43: suminf. 0.93704 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 44: suminf. 0.80827 (2) obj. 6.99999 iterations 5 -Cbc0038I Pass 45: suminf. 0.88204 (2) obj. 6.99999 iterations 3 -Cbc0038I Pass 46: suminf. 0.49057 (3) obj. 6.99999 iterations 7 -Cbc0038I Pass 47: suminf. 0.47872 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 48: suminf. 1.03913 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 49: suminf. 0.80417 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 50: suminf. 0.61334 (3) obj. 6.99999 iterations 4 -Cbc0038I Pass 51: suminf. 0.59218 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 52: suminf. 0.25587 (2) obj. 6.99999 iterations 6 -Cbc0038I Pass 53: suminf. 0.63749 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 54: suminf. 0.32719 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 55: suminf. 0.67560 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 56: suminf. 0.55875 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 57: suminf. 0.76942 (3) obj. 6.99999 iterations 2 -Cbc0038I Pass 58: suminf. 0.87300 (3) obj. 6.99999 iterations 7 -Cbc0038I Pass 59: suminf. 0.43466 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 60: suminf. 0.82541 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 61: suminf. 0.61711 (3) obj. 6.99999 iterations 1 -Cbc0038I Pass 62: suminf. 0.79448 (3) obj. 6.99999 iterations 12 -Cbc0038I Pass 63: suminf. 0.69036 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 64: suminf. 0.81118 (3) obj. 6.99999 iterations 3 -Cbc0038I Pass 65: suminf. 0.71788 (2) obj. 6.99999 iterations 3 -Cbc0038I Pass 66: suminf. 0.74044 (2) obj. 6.99999 iterations 2 -Cbc0038I Pass 67: suminf. 0.37261 (3) obj. 6.99999 iterations 4 +Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns +Cbc0038I Mini branch and bound improved solution from 13 to 8 (0.03 seconds) +Cbc0038I Round again with cutoff of 5.59999 +Cbc0038I Pass 36: suminf. 0.51144 (3) obj. 5.59999 iterations 1 +Cbc0038I Pass 37: suminf. 0.34953 (3) obj. 5.59999 iterations 8 +Cbc0038I Pass 38: suminf. 0.22119 (2) obj. 5.59999 iterations 4 +Cbc0038I Pass 39: suminf. 0.59775 (2) obj. 5.59999 iterations 4 +Cbc0038I Pass 40: suminf. 0.59775 (2) obj. 5.59999 iterations 0 +Cbc0038I Pass 41: suminf. 1.15383 (3) obj. 5.59999 iterations 3 +Cbc0038I Pass 42: suminf. 0.26338 (3) obj. 5.59999 iterations 7 +Cbc0038I Pass 43: suminf. 0.10037 (2) obj. 5.59999 iterations 2 +Cbc0038I Pass 44: suminf. 1.16708 (3) obj. 5.59999 iterations 4 +Cbc0038I Pass 45: suminf. 0.68728 (2) obj. 5.59999 iterations 3 +Cbc0038I Pass 46: suminf. 0.84180 (2) obj. 5.59999 iterations 2 +Cbc0038I Pass 47: suminf. 0.54164 (3) obj. 5.59999 iterations 6 +Cbc0038I Pass 48: suminf. 0.54164 (3) obj. 5.59999 iterations 0 +Cbc0038I Pass 49: suminf. 0.92377 (3) obj. 5.59999 iterations 2 +Cbc0038I Pass 50: suminf. 0.74425 (3) obj. 5.59999 iterations 2 +Cbc0038I Pass 51: suminf. 0.63360 (3) obj. 5.59999 iterations 11 +Cbc0038I Pass 52: suminf. 0.38419 (2) obj. 5.59999 iterations 4 +Cbc0038I Pass 53: suminf. 0.61682 (3) obj. 5.59999 iterations 2 +Cbc0038I Pass 54: suminf. 0.90316 (3) obj. 5.59999 iterations 10 +Cbc0038I Pass 55: suminf. 0.80881 (2) obj. 5.59999 iterations 3 +Cbc0038I Pass 56: suminf. 0.82634 (2) obj. 5.59999 iterations 3 +Cbc0038I Pass 57: suminf. 0.41545 (3) obj. 5.59999 iterations 4 +Cbc0038I Pass 58: suminf. 0.89563 (3) obj. 5.59999 iterations 2 +Cbc0038I Pass 59: suminf. 0.73430 (3) obj. 5.59999 iterations 1 +Cbc0038I Pass 60: suminf. 0.41345 (3) obj. 5.59999 iterations 13 +Cbc0038I Pass 61: suminf. 0.26032 (2) obj. 5.59999 iterations 2 +Cbc0038I Pass 62: suminf. 0.69542 (2) obj. 5.59999 iterations 3 +Cbc0038I Pass 63: suminf. 0.36323 (2) obj. 5.59999 iterations 6 +Cbc0038I Pass 64: suminf. 0.06176 (1) obj. 5.59999 iterations 4 +Cbc0038I Pass 65: suminf. 0.39416 (2) obj. 5.59999 iterations 3 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 1 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.08 seconds) -Cbc0038I Round again with cutoff of 3.59999 -Cbc0038I Pass 67: suminf. 0.84108 (3) obj. 3.59999 iterations 0 -Cbc0038I Pass 68: suminf. 0.51717 (3) obj. 3.59999 iterations 2 -Cbc0038I Pass 69: suminf. 0.30404 (3) obj. 3.59999 iterations 6 -Cbc0038I Pass 70: suminf. 0.50973 (3) obj. 3.59999 iterations 4 -Cbc0038I Pass 71: suminf. 0.47438 (2) obj. 3.59999 iterations 2 -Cbc0038I Pass 72: suminf. 0.57565 (2) obj. 3.59999 iterations 3 -Cbc0038I Pass 73: suminf. 0.43814 (2) obj. 3.59999 iterations 8 -Cbc0038I Pass 74: suminf. 0.37288 (2) obj. 3.59999 iterations 2 -Cbc0038I Pass 75: suminf. 0.51800 (3) obj. 3.59999 iterations 2 -Cbc0038I Pass 76: suminf. 0.57724 (3) obj. 3.59999 iterations 8 -Cbc0038I Pass 77: suminf. 0.26385 (3) obj. 3.59999 iterations 5 -Cbc0038I Pass 78: suminf. 0.26385 (3) obj. 3.59999 iterations 0 -Cbc0038I Pass 79: suminf. 0.56549 (3) obj. 3.59999 iterations 5 -Cbc0038I Pass 80: suminf. 0.28336 (2) obj. 3.59999 iterations 3 -Cbc0038I Pass 81: suminf. 1.17565 (3) obj. 3.59999 iterations 3 -Cbc0038I Pass 82: suminf. 1.12693 (3) obj. 3.59999 iterations 2 -Cbc0038I Pass 83: suminf. 0.69173 (3) obj. 3.59999 iterations 4 -Cbc0038I Pass 84: suminf. 0.69173 (3) obj. 3.59999 iterations 0 -Cbc0038I Pass 85: suminf. 0.77478 (3) obj. 3.59999 iterations 4 -Cbc0038I Pass 86: suminf. 0.66787 (3) obj. 3.59999 iterations 1 -Cbc0038I Pass 87: suminf. 0.54197 (3) obj. 3.59999 iterations 3 -Cbc0038I Pass 88: suminf. 0.77146 (3) obj. 3.59999 iterations 4 -Cbc0038I Pass 89: suminf. 0.66433 (3) obj. 3.59999 iterations 1 -Cbc0038I Pass 90: suminf. 0.98456 (3) obj. 3.59999 iterations 10 -Cbc0038I Pass 91: suminf. 0.37216 (2) obj. 3.59999 iterations 5 -Cbc0038I Pass 92: suminf. 1.17757 (3) obj. 3.59999 iterations 3 -Cbc0038I Pass 93: suminf. 0.91929 (3) obj. 3.59999 iterations 3 -Cbc0038I Pass 94: suminf. 0.31708 (3) obj. 3.59999 iterations 5 -Cbc0038I Pass 95: suminf. 0.20046 (3) obj. 3.59999 iterations 5 -Cbc0038I Pass 96: suminf. 0.11275 (2) obj. 3.59999 iterations 7 +Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns +Cbc0038I Mini branch and bound improved solution from 8 to 7 (0.05 seconds) +Cbc0038I Round again with cutoff of 3.92 +Cbc0038I Pass 65: suminf. 0.52315 (3) obj. 3.92 iterations 0 +Cbc0038I Pass 66: suminf. 0.35997 (3) obj. 3.92 iterations 6 +Cbc0038I Pass 67: suminf. 0.23232 (2) obj. 3.92 iterations 2 +Cbc0038I Pass 68: suminf. 0.60840 (2) obj. 3.92 iterations 4 +Cbc0038I Pass 69: suminf. 0.60840 (2) obj. 3.92 iterations 0 +Cbc0038I Pass 70: suminf. 1.02321 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 71: suminf. 0.67205 (3) obj. 3.92 iterations 6 +Cbc0038I Pass 72: suminf. 0.67205 (3) obj. 3.92 iterations 0 +Cbc0038I Pass 73: suminf. 0.85499 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 74: suminf. 0.64648 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 75: suminf. 0.84242 (3) obj. 3.92 iterations 5 +Cbc0038I Pass 76: suminf. 0.29993 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 77: suminf. 0.46207 (3) obj. 3.92 iterations 6 +Cbc0038I Pass 78: suminf. 0.37591 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 79: suminf. 1.12078 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 80: suminf. 0.71401 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 81: suminf. 0.83967 (3) obj. 3.92 iterations 1 +Cbc0038I Pass 82: suminf. 0.56647 (3) obj. 3.92 iterations 4 +Cbc0038I Pass 83: suminf. 0.30858 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 84: suminf. 0.73057 (3) obj. 3.92 iterations 4 +Cbc0038I Pass 85: suminf. 0.59127 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 86: suminf. 0.67299 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 87: suminf. 0.38247 (2) obj. 3.92 iterations 3 +Cbc0038I Pass 88: suminf. 0.81870 (3) obj. 3.92 iterations 4 +Cbc0038I Pass 89: suminf. 0.58833 (3) obj. 3.92 iterations 3 +Cbc0038I Pass 90: suminf. 0.40834 (3) obj. 3.92 iterations 4 +Cbc0038I Pass 91: suminf. 0.30344 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 92: suminf. 1.10566 (3) obj. 3.92 iterations 5 +Cbc0038I Pass 93: suminf. 0.82923 (3) obj. 3.92 iterations 2 +Cbc0038I Pass 94: suminf. 0.85673 (3) obj. 3.92 iterations 2 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns +Cbc0038I Mini branch and bound improved solution from 7 to 5 (0.07 seconds) +Cbc0038I Round again with cutoff of 2.352 +Cbc0038I Pass 94: suminf. 0.53407 (3) obj. 2.352 iterations 0 +Cbc0038I Pass 95: suminf. 0.36971 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 96: suminf. 0.24624 (3) obj. 2.352 iterations 2 +Cbc0038I Pass 97: suminf. 1.07242 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 98: suminf. 0.61834 (2) obj. 2.352 iterations 4 +Cbc0038I Pass 99: suminf. 0.90131 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 100: suminf. 0.44907 (3) obj. 2.352 iterations 8 +Cbc0038I Pass 101: suminf. 0.29607 (2) obj. 2.352 iterations 2 +Cbc0038I Pass 102: suminf. 0.36097 (2) obj. 2.352 iterations 2 +Cbc0038I Pass 103: suminf. 0.76283 (3) obj. 2.352 iterations 6 +Cbc0038I Pass 104: suminf. 0.72464 (3) obj. 2.352 iterations 2 +Cbc0038I Pass 105: suminf. 0.60063 (3) obj. 2.352 iterations 2 +Cbc0038I Pass 106: suminf. 0.37675 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 107: suminf. 1.17299 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 108: suminf. 0.60568 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 109: suminf. 0.65846 (3) obj. 2.352 iterations 1 +Cbc0038I Pass 110: suminf. 0.76966 (3) obj. 2.352 iterations 4 +Cbc0038I Pass 111: suminf. 0.61432 (3) obj. 2.352 iterations 2 +Cbc0038I Pass 112: suminf. 0.77273 (3) obj. 2.352 iterations 1 +Cbc0038I Pass 113: suminf. 0.49176 (3) obj. 2.352 iterations 5 +Cbc0038I Pass 114: suminf. 0.94416 (2) obj. 2.352 iterations 7 +Cbc0038I Pass 115: suminf. 0.65695 (3) obj. 2.352 iterations 5 +Cbc0038I Pass 116: suminf. 0.65813 (3) obj. 2.352 iterations 4 +Cbc0038I Pass 117: suminf. 0.23186 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 118: suminf. 0.54848 (3) obj. 2.352 iterations 4 +Cbc0038I Pass 119: suminf. 0.54848 (3) obj. 2.352 iterations 0 +Cbc0038I Pass 120: suminf. 1.25287 (3) obj. 2.352 iterations 3 +Cbc0038I Pass 121: suminf. 1.17747 (3) obj. 2.352 iterations 1 +Cbc0038I Pass 122: suminf. 0.54144 (3) obj. 2.352 iterations 6 +Cbc0038I Pass 123: suminf. 0.50496 (3) obj. 2.352 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.12 seconds) -Cbc0038I After 0.12 seconds - Feasibility pump exiting with objective of 6 - took 0.10 seconds -Cbc0012I Integer solution of 6 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0031I 5 added rows had average density of 19 -Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 553 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 232 row cuts average 10.1 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100 +Cbc0038I Mini branch and bound did not improve solution (0.09 seconds) +Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 5 - took 0.08 seconds +Cbc0012I Integer solution of 5 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0031I 4 added rows had average density of 17 +Cbc0013I At root node, 4 cuts changed objective from 0 to 0.5 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.004 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 614 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 227 row cuts average 11.1 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 511 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 46 row cuts average 8.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 355 row cuts average 18.5 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 6 best solution, best possible 0 (0.25 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0016I Integer solution of 3 found by strong branching after 1811 iterations and 224 nodes (0.34 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 584 row cuts average 18.4 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 44 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 499 row cuts average 18.5 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 5 best solution, best possible 0.5 (0.20 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 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 13 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0010I After 1000 nodes, 5 on tree, 3 best solution, best possible 0 (0.65 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0010I After 2000 nodes, 6 on tree, 3 best solution, best possible 0 (1.04 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 3000 nodes, 3 on tree, 3 best solution, best possible 0 (1.44 seconds) -Cbc0001I Search completed - best objective 3, took 41671 iterations and 17811 nodes (1.47 seconds) -Cbc0032I Strong branching done 12868 times (30785 iterations), fathomed 469 nodes and fixed 684 variables -Cbc0041I Maximum depth 13, 671 variables fixed on reduced cost (complete fathoming 981 times, 14741 nodes taking 30894 iterations) -Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -Gomory was tried 100 times and created 553 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) -Knapsack was tried 100 times and created 232 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0010I After 1000 nodes, 7 on tree, 5 best solution, best possible 0.5 (2.23 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0001I Search completed - best objective 5, took 92461 iterations and 5592 nodes (3.66 seconds) +Cbc0032I Strong branching done 12860 times (67166 iterations), fathomed 80 nodes and fixed 419 variables +Cbc0041I Maximum depth 13, 1356 variables fixed on reduced cost (complete fathoming 309 times, 3880 nodes taking 14093 iterations) +Cuts at root node changed objective from 0 to 0.5 +Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +Gomory was tried 5032 times and created 19608 cuts of which 0 were active after adding rounds of cuts (0.372 seconds) +Knapsack was tried 5033 times and created 6649 cuts of which 0 were active after adding rounds of cuts (0.466 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 100 times and created 511 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) -FlowCover was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -TwoMirCuts was tried 100 times and created 355 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +MixedIntegerRounding2 was tried 5033 times and created 24802 cuts of which 0 were active after adding rounds of cuts (0.497 seconds) +FlowCover was tried 100 times and created 44 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) +TwoMirCuts was tried 5032 times and created 15455 cuts of which 0 were active after adding rounds of cuts (0.244 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 3.00000000 -Enumerated nodes: 17811 -Total iterations: 41671 -Time (CPU seconds): 1.43 -Time (Wallclock seconds): 1.47 +Objective value: 5.00000000 +Enumerated nodes: 5592 +Total iterations: 92461 +Time (CPU seconds): 3.62 +Time (Wallclock seconds): 3.67 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.43 (Wallclock seconds): 1.47 +Total time (CPU seconds): 3.62 (Wallclock seconds): 3.67 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/50abbfb8b1d34347b31edfea5f82d3e9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/50abbfb8b1d34347b31edfea5f82d3e9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7714319575fa45359869739eac6a04b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7714319575fa45359869739eac6a04b6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6484,7 +6467,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7663f19e47bd4f47b8a67c0f1091ec14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7663f19e47bd4f47b8a67c0f1091ec14-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0275d0a49fc2478b9f9389656436872c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0275d0a49fc2478b9f9389656436872c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6511,30 +6494,54 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9609c3dccd734b14bf928891c5f7e310-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/9609c3dccd734b14bf928891c5f7e310-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/db7775ef6c724041a4aeccb7975d2f21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db7775ef6c724041a4aeccb7975d2f21-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements +At line 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 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 +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 +/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' + """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6e1fcfc20734416288ab29ad4928790e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e1fcfc20734416288ab29ad4928790e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cce825997cfa4c388968ea38421ce841-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/cce825997cfa4c388968ea38421ce841-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/8b9e6e95884b40df9fe14ae1e57fb682-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b9e6e95884b40df9fe14ae1e57fb682-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -6576,51 +6583,30 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a984bf75544449b5859041898482828e-pulp.mps mips /tmp/a984bf75544449b5859041898482828e-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/a984bf75544449b5859041898482828e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a0fdf809f06e413c8f3c5f47e09f8198-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a0fdf809f06e413c8f3c5f47e09f8198-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/a984bf75544449b5859041898482828e-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.08 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.09 -Time (Wallclock seconds): 0.10 - +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.11 (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/8b59abd2d70e4d5c8e91c94614da31e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b59abd2d70e4d5c8e91c94614da31e1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/19c9591ba5aa41d4a565bc10dc1c6bae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/19c9591ba5aa41d4a565bc10dc1c6bae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -6648,87 +6634,74 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.02 +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.02 +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/6d6f0128498344529ce1d263a6073129-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d6f0128498344529ce1d263a6073129-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c27b4edd42af4238b7c7925f412c230e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c27b4edd42af4238b7c7925f412c230e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements +At line 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 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 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 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 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: 246.50000000 +Objective value: 8600.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d6c9ed378a1b4cca8214f7674bdf2aaf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6c9ed378a1b4cca8214f7674bdf2aaf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/eee11ea06d2a4b08bbe793a250d54f02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eee11ea06d2a4b08bbe793a250d54f02-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 36 RHS -At line 40 BOUNDS -At line 47 ENDATA -Problem MODEL has 3 rows, 6 columns and 9 elements +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 +Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6740,7 +6713,7 @@ Result - Optimal solution found -Objective value: 251.50000000 +Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -6753,20 +6726,45 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/596a8cfda3c64cd5838c7c87f8fbfa3b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/596a8cfda3c64cd5838c7c87f8fbfa3b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9e893caa8ad043b8952163e1acedff70-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9e893caa8ad043b8952163e1acedff70-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.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 +Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements +Empty problem - 0 rows, 0 columns and 0 elements +Optimal - objective value 324 +After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) +Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/a7d7c3a6a79348fea9dcf6c6c17356fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7d7c3a6a79348fea9dcf6c6c17356fa-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) @@ -6778,9 +6776,9 @@ Result - Optimal solution found -Objective value: 0.97000000 +Objective value: -1.60000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -6791,28 +6789,119 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5c045a8e0d1b4411adb7df3b0e29cdc0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c045a8e0d1b4411adb7df3b0e29cdc0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/629d53f307824936a30e46b49d87e3f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/629d53f307824936a30e46b49d87e3f7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 8 COLUMNS +At line 23 RHS +At line 27 BOUNDS +At line 28 ENDATA +Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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.10 seconds) -Cbc0038I After 0.10 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.10 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.10 seconds) +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/0afc737aa96f4f0d809793aa85d4a315-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0afc737aa96f4f0d809793aa85d4a315-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 12 to 12 +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/6e4ac5f4c76d4fe1a358c983c7d806b4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e4ac5f4c76d4fe1a358c983c7d806b4-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/3b9028d124e5408383c79c8092ef3ca2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b9028d124e5408383c79c8092ef3ca2-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) @@ -6824,101 +6913,135 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.11 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.12 (Wallclock seconds): 0.13 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/00cfe0189c3d40b78c175dcd3c497aba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00cfe0189c3d40b78c175dcd3c497aba-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8f74a4ad48f84214946731b0c330541f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8f74a4ad48f84214946731b0c330541f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 110 RHS -At line 119 BOUNDS -At line 140 ENDATA -Problem MODEL has 8 rows, 20 columns and 36 elements +At line 8 COLUMNS +At line 28 RHS +At line 32 BOUNDS +At line 33 ENDATA +Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 10 iterations and 0 nodes (0.00 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +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/2214b1444678455690374c4ef160e069-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2214b1444678455690374c4ef160e069-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) - 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 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 10 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0001I Search completed - best objective -1, took 6 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -1.02143 to -1 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 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 3 times and created 4 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: 228100.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 10 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +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.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/29127142f6654273b63f05de53fc5891-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/29127142f6654273b63f05de53fc5891-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/89c76c34b4bd4ed3912a15cd5629dfb0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/89c76c34b4bd4ed3912a15cd5629dfb0-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 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 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) +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 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) +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: 8600.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -6929,23 +7052,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4749194c4a1a4d818dea877cf128754b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4749194c4a1a4d818dea877cf128754b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1590336eb09e47318fee684ddfca8aae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1590336eb09e47318fee684ddfca8aae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 36 RHS +At line 40 BOUNDS +At line 47 ENDATA +Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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) +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5000000000001, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +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) @@ -6957,7 +7081,7 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -6970,7 +7094,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d1c94d76621e45ebbf649f93dd3343bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1c94d76621e45ebbf649f93dd3343bd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1fad40425bf2498b8f5a3ed468f8f8c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1fad40425bf2498b8f5a3ed468f8f8c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6992,7 +7116,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/aaf5402d0655472ea0b40c1321d3dc62-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaf5402d0655472ea0b40c1321d3dc62-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8e0efb89ca62451987ae1d04e9da5e1f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e0efb89ca62451987ae1d04e9da5e1f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -7009,7 +7133,7 @@ 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 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 @@ -7018,7 +7142,7 @@ 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) +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) @@ -7042,7 +7166,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/67a19757bd6244e1bb4322685bab40e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/67a19757bd6244e1bb4322685bab40e1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d09586123a8c4e46bbec8bd2e7c0fe97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d09586123a8c4e46bbec8bd2e7c0fe97-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7066,7 +7190,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9fa1a9b44cd7435da92ef5205869f3cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9fa1a9b44cd7435da92ef5205869f3cb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/27a54e161ee34a6289a7dda8e43fe15b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27a54e161ee34a6289a7dda8e43fe15b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -7109,13 +7233,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/1b622167a72740d7ba012fe0c4dfbb3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1b622167a72740d7ba012fe0c4dfbb3d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/db91a0e154f34d60897458012666ec3a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db91a0e154f34d60897458012666ec3a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7162,30 +7286,56 @@ 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 -/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' - """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b9e62e87d46542d2bcac7856d8dce91c-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/b9e62e87d46542d2bcac7856d8dce91c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/528b971d1a3345cfa3a285032986b870-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/528b971d1a3345cfa3a285032986b870-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 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 -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 +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 10 iterations and 0 nodes (0.00 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 10 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 10 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -7193,21 +7343,83 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9f5398c7b74c49e49bac6aab5645045e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f5398c7b74c49e49bac6aab5645045e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/575cbe3644ab45b595b2b213c6d8d8e0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/575cbe3644ab45b595b2b213c6d8d8e0-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.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds +Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.09 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.09 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.11 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/f1c0d13979e746fa820f44d278f444e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f1c0d13979e746fa820f44d278f444e7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements +At line 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 -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 0.97000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -7215,23 +7427,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/22351651097e42cdbe9fff166e85b9e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22351651097e42cdbe9fff166e85b9e6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6a1550d10d9a4f1792f6d91a65579157-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6a1550d10d9a4f1792f6d91a65579157-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 84 RHS -At line 93 BOUNDS -At line 109 ENDATA -Problem MODEL has 8 rows, 15 columns and 30 elements +At line 8 COLUMNS +At line 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 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements +Continuous objective value is 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 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 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 8300 to 8300 +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) @@ -7243,7 +7456,7 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -7256,7 +7469,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7800591a1e474be38f59fb83d78fe825-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7800591a1e474be38f59fb83d78fe825-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/123e8e86b8fb46349f125836622ec2b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/123e8e86b8fb46349f125836622ec2b6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -7273,10 +7486,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.03 seconds) -Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.02 seconds) 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) @@ -7293,17 +7506,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.03 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 +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/f9f6267c0f2c4baea392459586f1d90a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f9f6267c0f2c4baea392459586f1d90a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3afc88cd570b486081f5cc3d518cc561-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3afc88cd570b486081f5cc3d518cc561-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -7329,10 +7542,10 @@ Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -7349,17 +7562,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +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.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/65c9d8c0fced43ca9b59db8d8b1accf5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65c9d8c0fced43ca9b59db8d8b1accf5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dea7854edc0648768839553b2593f2f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dea7854edc0648768839553b2593f2f3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -7384,10 +7597,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.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7404,17 +7617,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.09 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/407d80a4ac73424997b6b86ff84a6574-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/407d80a4ac73424997b6b86ff84a6574-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/63923879cded4a95901eb870af379802-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63923879cded4a95901eb870af379802-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -7439,10 +7652,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.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.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7459,17 +7672,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/63e1a27120c04e8fb9714779bcffeab5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63e1a27120c04e8fb9714779bcffeab5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/199605c4e7a14498b69dc110eb85aa5c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/199605c4e7a14498b69dc110eb85aa5c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -7492,10 +7705,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 20 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -7512,17 +7725,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +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/ab3018057b0043b6b6909007941de22e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab3018057b0043b6b6909007941de22e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/775630909b4c4812b403b9b4dc4c7d49-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/775630909b4c4812b403b9b4dc4c7d49-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -7544,10 +7757,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 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) @@ -7564,17 +7777,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +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.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f6c945d0354c47678b440bfdcab579e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6c945d0354c47678b440bfdcab579e8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/769f70c521944a359a3bd05a250e5883-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/769f70c521944a359a3bd05a250e5883-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -7597,10 +7810,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7617,17 +7830,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/1a0fe9e2157b4749b5e9e98c996eb04b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a0fe9e2157b4749b5e9e98c996eb04b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3b8912212f5d4918a5205ad5d5c1fe06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b8912212f5d4918a5205ad5d5c1fe06-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -7649,10 +7862,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7669,386 +7882,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 - -Status: Optimal -x = 4.0 -y = -1.0 -z = 6.0 -objective= 54.0 -Status: Optimal -x_0 = 1.0 -x_1 = 1.0 -x_10 = 0.0 -x_11 = 0.0 -x_12 = 0.0 -x_13 = 0.0 -x_14 = 0.0 -x_2 = 1.0 -x_3 = 1.0 -x_4 = 1.0 -x_5 = 1.0 -x_6 = 1.0 -x_7 = 0.0 -x_8 = 0.0 -x_9 = 0.0 -objective= 4190215.0 -Minimum total cost: 3208.9570439999998 - D S U T0 T1 T2 T3 T4 - 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + -103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + - 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + -140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + - 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - -148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - - 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 = 1.0 -x_1 = 1.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 1.0 -x_5 = 0.0 -x_6 = 1.0 -x_7 = 1.0 -x_8 = 1.0 -x_9 = 0.0 -Status: Optimal -s_0 = 0.0 -s_1 = 0.5 -s_2 = 2.0 -w_0 = 0.5 -w_1 = 0.0 -w_2 = 0.0 -x_0 = 1.0 -x_1 = 0.0 -x_10 = 0.0 -x_11 = 1.0 -x_12 = 0.0 -x_13 = 0.0 -x_14 = 0.0 -x_15 = 0.0 -x_16 = 1.0 -x_17 = 1.0 -x_18 = 1.0 -x_19 = 1.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 0.0 -x_5 = 0.0 -x_6 = 1.0 -x_7 = 1.0 -x_8 = 1.0 -x_9 = 0.0 -objective= 3.0 -Status: Optimal -x = 4.0 -y = -1.0 -z = 6.0 -objective= 54.0 -Status: Optimal -x = 4.0 Reduced Cost = 0.0 -y = -1.0 Reduced Cost = 12.0 -z = 6.0 Reduced Cost = 0.0 -objective= 54.0 - -Sensitivity Analysis -Constraint Shadow Price Slack -c1 : x + y <= 5 0.0 2.0 -c2 : x + z >= 10 1.0 -0.0 -c3 : -y + z = 7 8.0 -0.0 -Trying: - x = LpVariable("x", 0, 3) -Expecting nothing -ok -Trying: - y = LpVariable("y", 0, 1) -Expecting nothing -ok -Trying: - prob = LpProblem("myProblem", const.LpMinimize) -Expecting nothing -ok -Trying: - prob += x + y <= 2 -Expecting nothing -ok -Trying: - prob += -4 * x + y -Expecting nothing -ok -Trying: - status = prob.solve(PULP_CBC_CMD(msg=0)) -Expecting nothing -ok -Trying: - const.LpStatus[status] -Expecting: - 'Optimal' -ok -Trying: - value(x) -Expecting: - 2.0 -ok -1 items passed all tests: - 8 tests in pulp -8 tests in 1 items. -8 passed and 0 failed. -Test passed. -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.0 -Status: Optimal -Route_('Chicago',_'Gary') = 4000.0 -Route_('Chicago',_'Tempe') = 2000.0 -Route_('Cincinatti',_'Albany') = 2000.0 -Route_('Cincinatti',_'Houston') = 3000.0 -Route_('Kansas_City',_'Houston') = 4000.0 -Route_('Kansas_City',_'Tempe') = 2000.0 -Route_('Pittsburgh',_'Chicago') = 3000.0 -Route_('Pittsburgh',_'Cincinatti') = 2000.0 -Route_('Pittsburgh',_'Gary') = 2000.0 -Route_('Pittsburgh',_'Kansas_City') = 3000.0 -Route_('Youngstown',_'Albany') = 1000.0 -Route_('Youngstown',_'Chicago') = 3000.0 -Route_('Youngstown',_'Cincinatti') = 3000.0 -Route_('Youngstown',_'Kansas_City') = 3000.0 -Total Cost of Transportation = 15005.0 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Solution Written to sudokuout.txt -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = 0.0 -Patt_P13 = 0.0 -Patt_P14 = 0.0 -Patt_P2 = 137.0 -Patt_P3 = 0.0 -Patt_P4 = 0.0 -Patt_P5 = 0.0 -Patt_P6 = 0.0 -Patt_P7 = 0.0 -Patt_P8 = 0.0 -Patt_P9 = 100.0 -Surp_5 = 2.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 246.50000000000003 -Status: Optimal -Patt_A = 200.0 -Patt_B = 0.0 -Patt_C = 100.0 -Surp_5 = 50.0 -Surp_7 = 0.0 -Surp_9 = 0.0 -Production Costs = 251.5 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_A_D = 0.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_B_D = 900.0 -Total Cost of Transportation = 8600.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8600.0 -P0 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -The_Gemstone_Tool_Problem: -MAXIMIZE -25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 -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 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 -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 - -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 -Ingr_BEEF = 60.0 -Ingr_CHICKEN = 0.0 -Ingr_GEL = 40.0 -Ingr_MUTTON = 0.0 -Ingr_RICE = 0.0 -Ingr_WHEAT = 0.0 -Total Cost of Ingredients per can = 0.52 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1700.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Route_C_1 = 0.0 -Route_C_2 = 0.0 -Route_C_3 = 100.0 -Route_C_4 = 0.0 -Route_C_5 = 0.0 -Total Cost of Transportation = 8300.0 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: OptimalWelcome to the CBC MILP Solver +Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c91a135090c8460ba0c3244ec76bdbda-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c91a135090c8460ba0c3244ec76bdbda-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/65289f1f8af84467881a23c266b26ed9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65289f1f8af84467881a23c266b26ed9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -8068,10 +7912,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8088,17 +7932,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/08c0fe2ffc3347c5b64af9f1fd2fd14f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08c0fe2ffc3347c5b64af9f1fd2fd14f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1a3630509af2436a9f1d895f50c4217e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1a3630509af2436a9f1d895f50c4217e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -8117,10 +7961,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8137,17 +7981,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.06 +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.07 +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/62e526030ba640b3af1416d597eeb84e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/62e526030ba640b3af1416d597eeb84e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c5ee174f87ec4caa8be534324802eee1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5ee174f87ec4caa8be534324802eee1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -8178,17 +8022,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0348fffb5c9744d49594b6f36d3eee53-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0348fffb5c9744d49594b6f36d3eee53-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4847001dd61844c185d59aff2cf85574-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4847001dd61844c185d59aff2cf85574-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -8218,17 +8062,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.06 -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.06 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b939963675df4a018a74e0227f2077cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b939963675df4a018a74e0227f2077cd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3ebf68b401d14b92bb0daa3f2df9c181-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3ebf68b401d14b92bb0daa3f2df9c181-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -8276,8 +8120,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.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting - took 0.00 seconds +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -8288,7 +8132,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.07 seconds) +Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8305,59 +8149,17 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/6fb6f54d90f64d3887e827b1645e71d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fb6f54d90f64d3887e827b1645e71d9-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 24 RHS -At line 28 BOUNDS -At line 32 ENDATA -Problem MODEL has 3 rows, 3 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 300 - 0.00 seconds -Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 300 to 300 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 300.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.05 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a8e25508fde04a02b628aeb24a182d0b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a8e25508fde04a02b628aeb24a182d0b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ab314ab38655444bb2c99b66e6d747ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab314ab38655444bb2c99b66e6d747ea-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8398,7 +8200,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/db0e89383cc04d4b80d5e7ac41e2280e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/db0e89383cc04d4b80d5e7ac41e2280e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/346311b440c74794b3b97e6871268c26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/346311b440c74794b3b97e6871268c26-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8439,7 +8241,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/968a39e3a72e4eec81b21caed14a0171-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/968a39e3a72e4eec81b21caed14a0171-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ca2db8fb9e964aed85eca3076109c3a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca2db8fb9e964aed85eca3076109c3a1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8476,11 +8278,380 @@ Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Status: Optimal +x = 4.0 +y = -1.0 +z = 6.0 +objective= 54.0 +Status: Optimal +x_0 = 1.0 +x_1 = 1.0 +x_10 = 0.0 +x_11 = 0.0 +x_12 = 0.0 +x_13 = 0.0 +x_14 = 0.0 +x_2 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 1.0 +x_7 = 0.0 +x_8 = 0.0 +x_9 = 0.0 +objective= 4190215.0 +Minimum total cost: 3208.9570439999998 + D S U T0 T1 T2 T3 T4 + 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + +103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + +140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - +148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - + 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - +125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - + 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - +x_0 = 0.0 +x_1 = 1.0 +x_2 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 0.0 +x_7 = 0.0 +x_8 = 1.0 +x_9 = 1.0 +Status: Optimal +s_0 = 0.0 +s_1 = 1.5 +s_2 = 3.5 +w_0 = 0.0 +w_1 = 0.0 +w_2 = 0.0 +x_0 = 0.0 +x_1 = 0.0 +x_10 = 1.0 +x_11 = 0.0 +x_12 = 0.0 +x_13 = 1.0 +x_14 = 1.0 +x_15 = 1.0 +x_16 = 1.0 +x_17 = 1.0 +x_18 = 1.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_8 = 1.0 +x_9 = 0.0 +objective= 5.0 +Status: Optimal +x = 4.0 +y = -1.0 +z = 6.0 +objective= 54.0 +Status: Optimal +x = 4.0 Reduced Cost = 0.0 +y = -1.0 Reduced Cost = 12.0 +z = 6.0 Reduced Cost = 0.0 +objective= 54.0 + +Sensitivity Analysis +Constraint Shadow Price Slack +c1 : x + y <= 5 0.0 2.0 +c2 : x + z >= 10 1.0 -0.0 +c3 : -y + z = 7 8.0 -0.0 +Trying: + x = LpVariable("x", 0, 3) +Expecting nothing +ok +Trying: + y = LpVariable("y", 0, 1) +Expecting nothing +ok +Trying: + prob = LpProblem("myProblem", const.LpMinimize) +Expecting nothing +ok +Trying: + prob += x + y <= 2 +Expecting nothing +ok +Trying: + prob += -4 * x + y +Expecting nothing +ok +Trying: + status = prob.solve(PULP_CBC_CMD(msg=0)) +Expecting nothing +ok +Trying: + const.LpStatus[status] +Expecting: + 'Optimal' +ok +Trying: + value(x) +Expecting: + 2.0 +ok +1 items passed all tests: + 8 tests in pulp +8 tests in 1 items. +8 passed and 0 failed. +Test passed. +Status: Optimal +Ingr_BEEF = 60.0 +Ingr_CHICKEN = 0.0 +Ingr_GEL = 40.0 +Ingr_MUTTON = 0.0 +Ingr_RICE = 0.0 +Ingr_WHEAT = 0.0 +Total Cost of Ingredients per can = 0.52 +The_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 + +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_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 +Status: Optimal +Solution Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_A_D = 0.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +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 +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 +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Infeasible +Solutions Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 210.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8630.0 +Status: Optimal +Route_A_1 = 300.0 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/57e2a0fba5a948db99fa95cc5fb2ac8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57e2a0fba5a948db99fa95cc5fb2ac8a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2e8a462788de4a55af00387714c57aa9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e8a462788de4a55af00387714c57aa9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8521,7 +8692,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6191e3cce5b04c7db3f9362e30bfdb48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6191e3cce5b04c7db3f9362e30bfdb48-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1c813a07afbb4c3cb13b5420024bf72e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1c813a07afbb4c3cb13b5420024bf72e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8562,7 +8733,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e95526e2950843b390f3553f7c8ea47f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e95526e2950843b390f3553f7c8ea47f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2278017a5b7e4840986e49d2b7b5d176-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2278017a5b7e4840986e49d2b7b5d176-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8603,7 +8774,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/244c3b11961147999e1fa58cd1b959a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/244c3b11961147999e1fa58cd1b959a8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b87e42845e994460ae8f3135bbe0c82a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b87e42845e994460ae8f3135bbe0c82a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8613,7 +8784,7 @@ Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8780 - 0.00 seconds +Continuous objective value is 8780 - -0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) @@ -8638,13 +8809,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): -0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/24a315c0f95942db8e097652a623136a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24a315c0f95942db8e097652a623136a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b34b04f6987a4db8af1f7583fb425fc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b34b04f6987a4db8af1f7583fb425fc4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8685,7 +8856,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6fb0c60e4cdb42c59861b5faaeb1e622-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6fb0c60e4cdb42c59861b5faaeb1e622-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6f3fdbd780814864a989f83a167f6266-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f3fdbd780814864a989f83a167f6266-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8726,7 +8897,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0611ce92e8f345f78f63dc747080331f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0611ce92e8f345f78f63dc747080331f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d5caa025f51d4360a0f477ea27ae58db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5caa025f51d4360a0f477ea27ae58db-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8767,7 +8938,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/58e0a55391a44ca4b4dbce840baef752-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58e0a55391a44ca4b4dbce840baef752-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/053bffb2d873490d89a152fcdef81c31-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/053bffb2d873490d89a152fcdef81c31-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8808,131 +8979,49 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2bb6c4c990d44cfe836fb0b9cd77b3dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2bb6c4c990d44cfe836fb0b9cd77b3dc-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 21 RHS -At line 25 BOUNDS -At line 26 ENDATA -Problem MODEL has 3 rows, 6 columns and 6 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 324 -After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/96f9b4900d7f47b1a49204c57939c7e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96f9b4900d7f47b1a49204c57939c7e1-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/0cacbae4269e43b5bf912d78ce5a61b3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cacbae4269e43b5bf912d78ce5a61b3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2c78f02011724d4692fe6272506411ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c78f02011724d4692fe6272506411ea-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/af02e5f2fe744e0286e230071246b44e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af02e5f2fe744e0286e230071246b44e-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) -Cbc0031I 2 added rows had average density of 3 -Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 14 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.33333 to -1.25 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 246.5 to 246.5 +Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.25000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 2 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -8943,47 +9032,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5cdb12f343e34aaebee12402c0392247-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5cdb12f343e34aaebee12402c0392247-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/25c9727e4e0d408295ad26314fa28ebd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/25c9727e4e0d408295ad26314fa28ebd-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/aa0a51567c81464aa8c0c09289e677d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aa0a51567c81464aa8c0c09289e677d7-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.24444 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8600 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.22143 to -1.22143 +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) @@ -8995,7 +9060,7 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -9008,133 +9073,51 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5e45090be1c943bc97a3ff797253934a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e45090be1c943bc97a3ff797253934a-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/73b0396dab464ea496005afc7dd84dbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73b0396dab464ea496005afc7dd84dbb-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 -1, took 6 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: -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/b388db97a3844d12b89737edd81d5076-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b388db97a3844d12b89737edd81d5076-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/538e86904ed340048d69a2d67657f4f1-pulp.mps mips /tmp/538e86904ed340048d69a2d67657f4f1-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/538e86904ed340048d69a2d67657f4f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 46 RHS -At line 50 BOUNDS -At line 60 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors +opening mipstart file /tmp/538e86904ed340048d69a2d67657f4f1-pulp.mst. +MIPStart values read for 3213 variables. 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) +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.08 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: 246.50000000 +Objective value: 12.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Total iterations: 0 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.10 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.10 (Wallclock seconds): 0.11 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/984e4bb9a3a042a6982a45bfb14f2733-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/984e4bb9a3a042a6982a45bfb14f2733-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e0651a36945546f682629a8c55246665-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0651a36945546f682629a8c55246665-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -9181,7 +9164,7 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -10519,47 +10502,9 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 28.141s +Ran 1005 tests in 26.848s OK (skipped=885) - -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 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 200.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8600.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 210.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8630.0 -Status: Optimal -Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 @@ -10666,22 +10611,60 @@ Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 -P0 = [1, 0, 0] -P1 = [0, 1, 0] -P2 = [0, 0, 1] -P3 = [4, 0, 0] -P4 = [1, 2, 0] -P5 = [0, 0, 2] -Pattern_P0 = 0 -Pattern_P1 = 0 -Pattern_P2 = 0 -Pattern_P3 = 13 -Pattern_P4 = 100 -Pattern_P5 = 150 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +P2 = [0, 0, 2] +P3 = [0, 1, 0] +P4 = [0, 1, 1] +P5 = [0, 2, 0] +P6 = [1, 0, 0] +P7 = [1, 0, 1] +P8 = [1, 1, 0] +P9 = [1, 2, 0] +P10 = [2, 0, 0] +P11 = [2, 0, 1] +P12 = [2, 1, 0] +P13 = [3, 0, 0] +P14 = [4, 0, 0] +Status: Optimal +Patt_P0 = 0.0 +Patt_P1 = 0.0 +Patt_P10 = 0.0 +Patt_P11 = 26.0 +Patt_P12 = 0.0 +Patt_P13 = 0.0 +Patt_P14 = 0.0 +Patt_P2 = 137.0 +Patt_P3 = 0.0 +Patt_P4 = 0.0 +Patt_P5 = 0.0 +Patt_P6 = 0.0 +Patt_P7 = 0.0 +Patt_P8 = 0.0 +Patt_P9 = 100.0 +Surp_5 = 2.0 +Surp_7 = 0.0 +Surp_9 = 0.0 +Production Costs = 246.50000000000003 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +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 +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') Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -10983,90 +10966,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 +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/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_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__/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__/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__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__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__/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__/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__/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/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/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__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/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 copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__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__/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__/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/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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/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.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/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/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests 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__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__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/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc -/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/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/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/cplex_api.py to cplex_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc +/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/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/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/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/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/tests/run_tests.py to run_tests.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__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/mps_lp.py to mps_lp.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 @@ -11227,90 +11210,90 @@ running install_lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/choco_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/core.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/coin_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/run_tests.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/core.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/coin_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/choco_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/sparse.py to sparse.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc -/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/core.py to core.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/core.py to core.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc +/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/constants.py to constants.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/sparse.py to sparse.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt @@ -11340,12 +11323,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/111464/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/111464/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/37868 and its subdirectories -I: Current time: Wed Nov 20 11:44:51 -12 2024 -I: pbuilder-time-stamp: 1732146291 +I: removing directory /srv/workspace/pbuilder/111464 and its subdirectories +I: Current time: Wed Dec 24 20:09:34 +14 2025 +I: pbuilder-time-stamp: 1766556574