Diff of the two buildlogs: -- --- b1/build.log 2024-11-21 19:44:25.132309030 +0000 +++ b2/build.log 2024-11-21 19:47:08.036943552 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Thu Nov 21 07:41:14 -12 2024 -I: pbuilder-time-stamp: 1732218074 +I: Current time: Thu Dec 25 16:07:27 +14 2025 +I: pbuilder-time-stamp: 1766628447 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -30,52 +30,84 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/449879/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/449985/tmp/hooks/D01_modify_environment starting +debug: Running on ionos5-amd64. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Dec 25 02:07 /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/449985/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/449985/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='amd64' - DEBIAN_FRONTEND='noninteractive' - DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=20 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='amd64' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="32" [3]="1" [4]="release" [5]="x86_64-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=amd64 + DEBIAN_FRONTEND=noninteractive + DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=42 ' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='4ce6eb6a43c047758dd8611135ac7ec9' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='449879' - PS1='# ' - PS2='> ' + INVOCATION_ID=2196a0d782624f1fab92cf960ac72ce3 + LANG=C + LANGUAGE=et_EE:et + LC_ALL=C + MACHTYPE=x86_64-pc-linux-gnu + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnu + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=449985 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.r5wdt0jf/pbuilderrc_lm4k --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.r5wdt0jf/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='110' - SUDO_UID='105' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+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.r5wdt0jf/pbuilderrc_RMAv --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.r5wdt0jf/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=110 + SUDO_UID=105 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://213.165.73.152:3128 I: uname -a - Linux ionos1-amd64 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.11.5+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.11.5-1~bpo12+1 (2024-11-11) 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/449879/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/449985/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -199,7 +231,7 @@ Get: 76 http://deb.debian.org/debian unstable/main amd64 python3.13 amd64 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main amd64 python3-all amd64 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main amd64 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 40.2 MB in 2s (23.8 MB/s) +Fetched 40.2 MB in 16s (2482 kB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19966 files and directories currently installed.) @@ -467,8 +499,8 @@ Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' -Local time is now: Thu Nov 21 19:42:23 UTC 2024. -Universal Time is now: Thu Nov 21 19:42:23 UTC 2024. +Local time is now: Thu Dec 25 02:08:33 UTC 2025. +Universal Time is now: Thu Dec 25 02:08:33 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:amd64 (3.13.0-2) ... @@ -542,7 +574,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/449985/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/449985/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 @@ -589,12 +625,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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp +copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp -copying pulp/__init__.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/mps_lp.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 @@ -761,12 +797,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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp +copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp -copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt @@ -965,7 +1001,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0df8aeeef7b148f3906f567ff6815612-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0df8aeeef7b148f3906f567ff6815612-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7b03e663bd97438ea59d8005fac82b0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b03e663bd97438ea59d8005fac82b0a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -988,7 +1024,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a868a558f9054ae795e41ca58a33d20c-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a868a558f9054ae795e41ca58a33d20c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7ad7236f33bd4ae4ba35214d2a0fba6d-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7ad7236f33bd4ae4ba35214d2a0fba6d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -1019,7 +1055,7 @@ Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.01 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.00 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 @@ -1038,7 +1074,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 @@ -1073,11 +1109,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.05 seconds) -Cbc0038I After 0.05 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.05 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.02 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.02 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -1086,7 +1122,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1103,17 +1139,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +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/75ef5c1bbff4421f9b0d8854caa9c619-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75ef5c1bbff4421f9b0d8854caa9c619-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1ca9ca9917d541d0b947464c6ef35042-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ca9ca9917d541d0b947464c6ef35042-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -1132,7 +1168,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 48 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 38 columns -Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 @@ -1158,7 +1194,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.12 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.07 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -1193,185 +1229,99 @@ 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.21 seconds) -Cbc0038I After 0.21 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.19 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.21 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.13 seconds) +Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.13 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.039 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.067 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.044 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.68 seconds) +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.021 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.038 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.39 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 33 rows 47 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (1.33 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (0.86 seconds) Cbc0032I Strong branching done 966 times (8486 iterations), fathomed 27 nodes and fixed 39 variables Cbc0035I Maximum depth 13, 186 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 -Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.039 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.099 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.014 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.075 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 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.039 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.021 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.062 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.046 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) +TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.026 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 94 Total iterations: 4740 -Time (CPU seconds): 1.32 -Time (Wallclock seconds): 1.34 +Time (CPU seconds): 0.86 +Time (Wallclock seconds): 0.86 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.32 (Wallclock seconds): 1.36 +Total time (CPU seconds): 0.86 (Wallclock seconds): 0.86 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c5814c3ac0d14b44a58e06edee2415d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5814c3ac0d14b44a58e06edee2415d2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2d0d3598afcd4d4f9a2c38959225c864-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d0d3598afcd4d4f9a2c38959225c864-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1654 RHS -At line 1875 BOUNDS -At line 2086 ENDATA -Problem MODEL has 220 rows, 210 columns and 799 elements +At line 1635 RHS +At line 1856 BOUNDS +At line 2067 ENDATA +Problem MODEL has 220 rows, 210 columns and 779 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -150.625 - 0.00 seconds -Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements +Continuous objective value is -105.1 - 0.00 seconds +Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions +Cgl0004I processed model has 208 rows, 199 columns (199 integer (199 of which binary)) and 741 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 24 integers unsatisfied sum - 10.4841 -Cbc0038I Pass 1: suminf. 2.96722 (11) obj. -142.302 iterations 125 -Cbc0038I Pass 2: suminf. 1.79724 (7) obj. -138.295 iterations 17 -Cbc0038I Solution found of -120.65 -Cbc0038I Before mini branch and bound, 175 integers at bound fixed and 0 continuous -Cbc0038I Full problem 219 rows 209 columns, reduced to 22 rows 25 columns -Cbc0038I Mini branch and bound improved solution from -120.65 to -144.05 (0.02 seconds) -Cbc0038I Round again with cutoff of -144.8 -Cbc0038I Reduced cost fixing fixed 3 variables on major pass 2 -Cbc0038I Pass 3: suminf. 3.62198 (31) obj. -144.8 iterations 40 -Cbc0038I Pass 4: suminf. 3.33120 (32) obj. -144.8 iterations 36 -Cbc0038I Pass 5: suminf. 2.90955 (12) obj. -144.8 iterations 12 -Cbc0038I Pass 6: suminf. 2.26060 (11) obj. -144.8 iterations 120 -Cbc0038I Pass 7: suminf. 2.57483 (11) obj. -144.8 iterations 80 -Cbc0038I Pass 8: suminf. 4.51080 (27) obj. -144.8 iterations 84 -Cbc0038I Pass 9: suminf. 3.83752 (28) obj. -144.8 iterations 30 -Cbc0038I Pass 10: suminf. 8.29791 (18) obj. -144.8 iterations 91 -Cbc0038I Pass 11: suminf. 5.99393 (24) obj. -144.8 iterations 83 -Cbc0038I Pass 12: suminf. 3.52525 (28) obj. -144.8 iterations 21 -Cbc0038I Pass 13: suminf. 2.56350 (29) obj. -144.8 iterations 23 -Cbc0038I Pass 14: suminf. 2.56350 (29) obj. -144.8 iterations 9 -Cbc0038I Pass 15: suminf. 1.23915 (21) obj. -144.8 iterations 135 -Cbc0038I Pass 16: suminf. 0.76692 (2) obj. -144.8 iterations 8 -Cbc0038I Pass 17: suminf. 0.38158 (1) obj. -145.07 iterations 77 -Cbc0038I Pass 18: suminf. 0.48148 (1) obj. -144.8 iterations 23 -Cbc0038I Pass 19: suminf. 2.08063 (20) obj. -144.8 iterations 74 -Cbc0038I Pass 20: suminf. 0.56250 (2) obj. -144.8 iterations 8 -Cbc0038I Pass 21: suminf. 0.38158 (1) obj. -145.22 iterations 85 -Cbc0038I Pass 22: suminf. 0.46296 (1) obj. -144.8 iterations 23 -Cbc0038I Pass 23: suminf. 0.44190 (21) obj. -144.8 iterations 67 -Cbc0038I Pass 24: suminf. 0.44070 (21) obj. -144.8 iterations 7 -Cbc0038I Pass 25: suminf. 6.24503 (18) obj. -144.8 iterations 51 -Cbc0038I Pass 26: suminf. 5.77969 (20) obj. -144.8 iterations 18 -Cbc0038I Pass 27: suminf. 5.31569 (21) obj. -144.8 iterations 5 -Cbc0038I Pass 28: suminf. 5.24461 (22) obj. -144.8 iterations 9 -Cbc0038I Pass 29: suminf. 0.84052 (21) obj. -144.8 iterations 92 -Cbc0038I Pass 30: suminf. 0.83145 (21) obj. -144.8 iterations 10 -Cbc0038I Pass 31: suminf. 2.84759 (31) obj. -144.8 iterations 103 -Cbc0038I Pass 32: suminf. 2.56010 (30) obj. -144.8 iterations 19 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 143 integers at bound fixed and 0 continuous -Cbc0038I Full problem 219 rows 209 columns, reduced to 33 rows 45 columns -Cbc0038I Mini branch and bound improved solution from -144.05 to -144.2 (0.07 seconds) -Cbc0038I Round again with cutoff of -146 -Cbc0038I Reduced cost fixing fixed 3 variables on major pass 3 -Cbc0038I Pass 32: suminf. 4.49838 (30) obj. -146 iterations 8 -Cbc0038I Pass 33: suminf. 3.42747 (32) obj. -146 iterations 29 -Cbc0038I Pass 34: suminf. 2.98642 (32) obj. -146 iterations 9 -Cbc0038I Pass 35: suminf. 5.04379 (25) obj. -146 iterations 73 -Cbc0038I Pass 36: suminf. 4.55372 (26) obj. -146 iterations 21 -Cbc0038I Pass 37: suminf. 3.21833 (28) obj. -146 iterations 16 -Cbc0038I Pass 38: suminf. 3.19485 (29) obj. -146 iterations 16 -Cbc0038I Pass 39: suminf. 1.33881 (21) obj. -146 iterations 107 -Cbc0038I Pass 40: suminf. 1.31987 (21) obj. -146 iterations 5 -Cbc0038I Pass 41: suminf. 4.66145 (22) obj. -146 iterations 50 -Cbc0038I Pass 42: suminf. 4.57923 (23) obj. -146 iterations 34 -Cbc0038I Pass 43: suminf. 1.33881 (21) obj. -146 iterations 103 -Cbc0038I Pass 44: suminf. 4.65832 (22) obj. -146 iterations 18 -Cbc0038I Pass 45: suminf. 4.64032 (22) obj. -146 iterations 10 -Cbc0038I Pass 46: suminf. 4.76943 (29) obj. -146 iterations 91 -Cbc0038I Pass 47: suminf. 4.34241 (29) obj. -146 iterations 23 -Cbc0038I Pass 48: suminf. 3.01727 (29) obj. -146 iterations 11 -Cbc0038I Pass 49: suminf. 2.95730 (29) obj. -146 iterations 31 -Cbc0038I Pass 50: suminf. 7.37281 (21) obj. -146 iterations 102 -Cbc0038I Pass 51: suminf. 3.09241 (22) obj. -146 iterations 27 -Cbc0038I Pass 52: suminf. 3.09241 (22) obj. -146 iterations 1 -Cbc0038I Pass 53: suminf. 7.78056 (19) obj. -146 iterations 53 -Cbc0038I Pass 54: suminf. 6.05668 (23) obj. -146 iterations 33 -Cbc0038I Pass 55: suminf. 5.91622 (24) obj. -146 iterations 7 -Cbc0038I Pass 56: suminf. 4.76422 (25) obj. -146 iterations 15 -Cbc0038I Pass 57: suminf. 4.76422 (25) obj. -146 iterations 10 -Cbc0038I Pass 58: suminf. 3.09745 (21) obj. -146 iterations 116 -Cbc0038I Pass 59: suminf. 3.09241 (22) obj. -146 iterations 4 -Cbc0038I Pass 60: suminf. 3.92765 (29) obj. -146 iterations 130 -Cbc0038I Pass 61: suminf. 3.86429 (29) obj. -146 iterations 26 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 168 integers at bound fixed and 0 continuous -Cbc0038I Full problem 219 rows 209 columns, reduced to 22 rows 30 columns -Cbc0038I Mini branch and bound did not improve solution (0.11 seconds) -Cbc0038I After 0.11 seconds - Feasibility pump exiting with objective of -144.2 - took 0.10 seconds -Cbc0012I Integer solution of -144.2 found by feasibility pump after 0 iterations and 0 nodes (0.11 seconds) -Cbc0038I Full problem 219 rows 209 columns, reduced to 22 rows 17 columns -Cbc0031I 18 added rows had average density of 22.5 -Cbc0013I At root node, 18 cuts changed objective from -150.6249 to -144.25389 in 52 passes -Cbc0014I Cut generator 0 (Probing) - 111 row cuts average 9.6 elements, 4 column cuts (4 active) in 0.018 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 318 row cuts average 59.7 elements, 0 column cuts (0 active) in 0.050 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 51 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -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) - 18 row cuts average 32.6 elements, 0 column cuts (0 active) in 0.011 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 139 row cuts average 28.8 elements, 0 column cuts (0 active) in 0.022 seconds - new frequency is 1 -Cbc0014I Cut generator 7 (ZeroHalf) - 48 row cuts average 20.8 elements, 0 column cuts (0 active) in 0.043 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -144.2, took 678 iterations and 0 nodes (0.35 seconds) -Cbc0032I Strong branching done 4 times (29 iterations), fathomed 1 nodes and fixed 0 variables -Cbc0035I Maximum depth 0, 23 variables fixed on reduced cost -Cuts at root node changed objective from -150.625 to -144.217 -Probing was tried 52 times and created 115 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) -Gomory was tried 52 times and created 318 cuts of which 0 were active after adding rounds of cuts (0.050 seconds) -Knapsack was tried 52 times and created 51 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) -Clique was tried 52 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -MixedIntegerRounding2 was tried 52 times and created 18 cuts of which 0 were active after adding rounds of cuts (0.011 seconds) -FlowCover was tried 52 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -TwoMirCuts was tried 52 times and created 139 cuts of which 0 were active after adding rounds of cuts (0.022 seconds) -ZeroHalf was tried 52 times and created 48 cuts of which 0 were active after adding rounds of cuts (0.043 seconds) +Cbc0038I Initial state - 0 integers unsatisfied sum - 7.88258e-15 +Cbc0038I Solution found of -105.1 +Cbc0038I Before mini branch and bound, 199 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 -105.1 - took 0.00 seconds +Cbc0012I Integer solution of -105.1 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -105.1, 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 -105.1 to -105.1 +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: -144.20000000 -Enumerated nodes: 0 -Total iterations: 678 -Time (CPU seconds): 0.34 -Time (Wallclock seconds): 0.35 +Objective value: -105.10000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.34 (Wallclock seconds): 0.58 +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/ede5b8d8171b487ea8f5099872ba4172-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ede5b8d8171b487ea8f5099872ba4172-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2fcaa27538e44d60a81460230558f9d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2fcaa27538e44d60a81460230558f9d1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1384,224 +1334,152 @@ 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 Cutoff increment increased from 1e-05 to 0.9999 -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.54776 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 55 iterations 3 -Cbc0038I Solution found of 55 -Cbc0038I Relaxing continuous gives 55 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.600375 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 44 iterations 4 +Cbc0038I Solution found of 44 +Cbc0038I Relaxing continuous gives 44 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 48.6001 -Cbc0038I Pass 2: suminf. 0.03575 (1) obj. 48.6001 iterations 1 -Cbc0038I Pass 3: suminf. 0.60858 (2) obj. 48.6001 iterations 4 -Cbc0038I Pass 4: suminf. 0.76866 (2) obj. 48.6001 iterations 4 -Cbc0038I Pass 5: suminf. 0.46795 (2) obj. 48.6001 iterations 3 -Cbc0038I Pass 6: suminf. 0.56230 (2) obj. 48.6001 iterations 9 -Cbc0038I Pass 7: suminf. 0.72548 (2) obj. 48.6001 iterations 3 -Cbc0038I Pass 8: suminf. 0.19776 (1) obj. 48.6001 iterations 1 -Cbc0038I Pass 9: suminf. 0.56230 (2) obj. 48.6001 iterations 3 -Cbc0038I Pass 10: suminf. 0.82366 (2) obj. 48.6001 iterations 6 -Cbc0038I Pass 11: suminf. 0.39668 (1) obj. 48.6001 iterations 3 -Cbc0038I Pass 12: suminf. 0.00000 (0) obj. 48.6001 iterations 3 -Cbc0038I Solution found of 48.6001 -Cbc0038I Relaxing continuous gives 47 -Cbc0038I Before mini branch and bound, 8 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Mini branch and bound improved solution from 47 to 16 (0.02 seconds) -Cbc0038I Round again with cutoff of 12.0001 -Cbc0038I Pass 13: suminf. 0.29841 (2) obj. 12.0001 iterations 1 -Cbc0038I Pass 14: suminf. 0.61642 (2) obj. 12.0001 iterations 2 -Cbc0038I Pass 15: suminf. 0.25890 (2) obj. 12.0001 iterations 3 -Cbc0038I Pass 16: suminf. 0.14253 (2) obj. 12.0001 iterations 4 -Cbc0038I Pass 17: suminf. 0.39545 (2) obj. 12.0001 iterations 3 -Cbc0038I Pass 18: suminf. 0.26544 (2) obj. 12.0001 iterations 2 -Cbc0038I Pass 19: suminf. 0.80859 (3) obj. 12.0001 iterations 8 -Cbc0038I Pass 20: suminf. 0.67062 (3) obj. 12.0001 iterations 1 -Cbc0038I Pass 21: suminf. 1.09660 (3) obj. 12.0001 iterations 1 -Cbc0038I Pass 22: suminf. 0.89934 (3) obj. 12.0001 iterations 12 -Cbc0038I Pass 23: suminf. 0.84280 (3) obj. 12.0001 iterations 1 -Cbc0038I Pass 24: suminf. 0.74657 (3) obj. 12.0001 iterations 6 -Cbc0038I Pass 25: suminf. 0.74657 (3) obj. 12.0001 iterations 0 -Cbc0038I Pass 26: suminf. 0.97748 (3) obj. 12.0001 iterations 3 -Cbc0038I Pass 27: suminf. 0.83296 (3) obj. 12.0001 iterations 1 -Cbc0038I Pass 28: suminf. 0.73239 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 29: suminf. 0.47826 (1) obj. 12.0001 iterations 4 -Cbc0038I Pass 30: suminf. 0.34669 (2) obj. 12.0001 iterations 4 -Cbc0038I Pass 31: suminf. 0.47826 (1) obj. 12.0001 iterations 3 -Cbc0038I Pass 32: suminf. 0.62794 (3) obj. 12.0001 iterations 4 -Cbc0038I Pass 33: suminf. 0.21803 (2) obj. 12.0001 iterations 3 -Cbc0038I Pass 34: suminf. 0.75198 (3) obj. 12.0001 iterations 3 -Cbc0038I Pass 35: suminf. 1.07124 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 36: suminf. 0.72218 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 37: suminf. 0.58719 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 38: suminf. 0.21803 (2) obj. 12.0001 iterations 3 -Cbc0038I Pass 39: suminf. 0.75198 (3) obj. 12.0001 iterations 3 -Cbc0038I Pass 40: suminf. 1.07124 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 41: suminf. 0.72218 (3) obj. 12.0001 iterations 2 -Cbc0038I Pass 42: suminf. 0.58719 (3) obj. 12.0001 iterations 2 -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 16 to 13 (0.03 seconds) -Cbc0038I Round again with cutoff of 8.40006 -Cbc0038I Pass 42: suminf. 0.34612 (2) obj. 8.40006 iterations 0 -Cbc0038I Pass 43: suminf. 0.56872 (2) obj. 8.40006 iterations 2 -Cbc0038I Pass 44: suminf. 0.73380 (3) obj. 8.40006 iterations 3 -Cbc0038I Pass 45: suminf. 0.68230 (2) obj. 8.40006 iterations 1 -Cbc0038I Pass 46: suminf. 0.79095 (2) obj. 8.40006 iterations 3 -Cbc0038I Pass 47: suminf. 0.93710 (2) obj. 8.40006 iterations 3 -Cbc0038I Pass 48: suminf. 0.65406 (2) obj. 8.40006 iterations 3 -Cbc0038I Pass 49: suminf. 0.55881 (2) obj. 8.40006 iterations 1 -Cbc0038I Pass 50: suminf. 0.88200 (3) obj. 8.40006 iterations 10 -Cbc0038I Pass 51: suminf. 0.88200 (3) obj. 8.40006 iterations 0 -Cbc0038I Pass 52: suminf. 0.28711 (2) obj. 8.40006 iterations 3 -Cbc0038I Pass 53: suminf. 0.19610 (2) obj. 8.40006 iterations 2 -Cbc0038I Pass 54: suminf. 0.59593 (3) obj. 8.40006 iterations 6 -Cbc0038I Pass 55: suminf. 0.55111 (3) obj. 8.40006 iterations 2 -Cbc0038I Pass 56: suminf. 0.84383 (3) obj. 8.40006 iterations 4 -Cbc0038I Pass 57: suminf. 0.84383 (3) obj. 8.40006 iterations 0 -Cbc0038I Pass 58: suminf. 0.99866 (3) obj. 8.40006 iterations 2 -Cbc0038I Pass 59: suminf. 0.89208 (3) obj. 8.40006 iterations 4 -Cbc0038I Pass 60: suminf. 0.64919 (3) obj. 8.40006 iterations 3 -Cbc0038I Pass 61: suminf. 0.55111 (3) obj. 8.40006 iterations 1 -Cbc0038I Pass 62: suminf. 0.84383 (3) obj. 8.40006 iterations 4 -Cbc0038I Pass 63: suminf. 0.84383 (3) obj. 8.40006 iterations 0 -Cbc0038I Pass 64: suminf. 0.99866 (3) obj. 8.40006 iterations 2 -Cbc0038I Pass 65: suminf. 0.89208 (3) obj. 8.40006 iterations 4 -Cbc0038I Pass 66: suminf. 0.64919 (3) obj. 8.40006 iterations 3 -Cbc0038I Pass 67: suminf. 0.55111 (3) obj. 8.40006 iterations 1 -Cbc0038I Pass 68: suminf. 0.84383 (3) obj. 8.40006 iterations 4 -Cbc0038I Pass 69: suminf. 0.84383 (3) obj. 8.40006 iterations 0 -Cbc0038I Pass 70: suminf. 0.99866 (3) obj. 8.40006 iterations 2 -Cbc0038I Pass 71: suminf. 0.89208 (3) obj. 8.40006 iterations 4 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0038I Mini branch and bound improved solution from 13 to 9 (0.05 seconds) -Cbc0038I Round again with cutoff of 5.60007 -Cbc0038I Pass 71: suminf. 0.38322 (2) obj. 5.60007 iterations 0 -Cbc0038I Pass 72: suminf. 0.53162 (2) obj. 5.60007 iterations 2 -Cbc0038I Pass 73: suminf. 0.56309 (3) obj. 5.60007 iterations 12 -Cbc0038I Pass 74: suminf. 0.38460 (3) obj. 5.60007 iterations 2 -Cbc0038I Pass 75: suminf. 0.60542 (3) obj. 5.60007 iterations 1 -Cbc0038I Pass 76: suminf. 1.07739 (3) obj. 5.60007 iterations 8 -Cbc0038I Pass 77: suminf. 0.58504 (3) obj. 5.60007 iterations 3 -Cbc0038I Pass 78: suminf. 0.78900 (3) obj. 5.60007 iterations 2 -Cbc0038I Pass 79: suminf. 0.66814 (3) obj. 5.60007 iterations 3 -Cbc0038I Pass 80: suminf. 0.44699 (3) obj. 5.60007 iterations 3 -Cbc0038I Pass 81: suminf. 0.34590 (3) obj. 5.60007 iterations 2 -Cbc0038I Pass 82: suminf. 0.56672 (3) obj. 5.60007 iterations 1 -Cbc0038I Pass 83: suminf. 0.68010 (3) obj. 5.60007 iterations 7 -Cbc0038I Pass 84: suminf. 0.45016 (3) obj. 5.60007 iterations 4 -Cbc0038I Pass 85: suminf. 0.62609 (3) obj. 5.60007 iterations 1 -Cbc0038I Pass 86: suminf. 0.55119 (2) obj. 5.60007 iterations 10 -Cbc0038I Pass 87: suminf. 0.34976 (1) obj. 5.60007 iterations 1 -Cbc0038I Pass 88: suminf. 0.60310 (2) obj. 5.60007 iterations 5 -Cbc0038I Pass 89: suminf. 0.66976 (2) obj. 5.60007 iterations 2 -Cbc0038I Pass 90: suminf. 0.39096 (2) obj. 5.60007 iterations 6 -Cbc0038I Pass 91: suminf. 0.39096 (2) obj. 5.60007 iterations 0 -Cbc0038I Pass 92: suminf. 0.52647 (3) obj. 5.60007 iterations 2 -Cbc0038I Pass 93: suminf. 0.72025 (3) obj. 5.60007 iterations 7 -Cbc0038I Pass 94: suminf. 0.59589 (3) obj. 5.60007 iterations 2 -Cbc0038I Pass 95: suminf. 1.18306 (3) obj. 5.60007 iterations 4 -Cbc0038I Pass 96: suminf. 0.82729 (2) obj. 5.60007 iterations 3 -Cbc0038I Pass 97: suminf. 0.79036 (2) obj. 5.60007 iterations 2 -Cbc0038I Pass 98: suminf. 0.60347 (2) obj. 5.60007 iterations 5 -Cbc0038I Pass 99: suminf. 0.66414 (2) obj. 5.60007 iterations 2 -Cbc0038I Pass 100: suminf. 0.59677 (3) obj. 5.60007 iterations 5 +Cbc0038I Round again with cutoff of 38.7001 +Cbc0038I Pass 2: suminf. 0.03985 (1) obj. 38.7001 iterations 1 +Cbc0038I Pass 3: suminf. 0.47214 (1) obj. 38.7001 iterations 5 +Cbc0038I Pass 4: suminf. 0.21904 (2) obj. 38.7001 iterations 4 +Cbc0038I Pass 5: suminf. 0.35013 (2) obj. 38.7001 iterations 2 +Cbc0038I Pass 6: suminf. 0.34727 (1) obj. 38.7001 iterations 2 +Cbc0038I Pass 7: suminf. 0.56752 (3) obj. 38.7001 iterations 8 +Cbc0038I Pass 8: suminf. 0.16917 (2) obj. 38.7001 iterations 5 +Cbc0038I Pass 9: suminf. 0.43266 (2) obj. 38.7001 iterations 5 +Cbc0038I Pass 10: suminf. 0.00000 (0) obj. 38.7001 iterations 5 +Cbc0038I Solution found of 38.7001 +Cbc0038I Relaxing continuous gives 12 +Cbc0038I Before mini branch and bound, 10 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I Round again with cutoff of 8.80008 +Cbc0038I Pass 11: suminf. 0.37892 (3) obj. 8.80008 iterations 3 +Cbc0038I Pass 12: suminf. 0.64491 (2) obj. 8.80008 iterations 2 +Cbc0038I Pass 13: suminf. 0.63244 (3) obj. 8.80008 iterations 10 +Cbc0038I Pass 14: suminf. 1.01022 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 15: suminf. 0.71266 (3) obj. 8.80008 iterations 3 +Cbc0038I Pass 16: suminf. 0.97595 (2) obj. 8.80008 iterations 2 +Cbc0038I Pass 17: suminf. 0.66768 (3) obj. 8.80008 iterations 3 +Cbc0038I Pass 18: suminf. 0.31361 (2) obj. 8.80008 iterations 4 +Cbc0038I Pass 19: suminf. 0.50579 (2) obj. 8.80008 iterations 3 +Cbc0038I Pass 20: suminf. 0.73388 (2) obj. 8.80008 iterations 5 +Cbc0038I Pass 21: suminf. 0.72726 (3) obj. 8.80008 iterations 5 +Cbc0038I Pass 22: suminf. 0.73760 (3) obj. 8.80008 iterations 5 +Cbc0038I Pass 23: suminf. 0.49864 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 24: suminf. 0.95965 (3) obj. 8.80008 iterations 3 +Cbc0038I Pass 25: suminf. 0.23196 (1) obj. 8.80008 iterations 4 +Cbc0038I Pass 26: suminf. 0.13124 (2) obj. 8.80008 iterations 3 +Cbc0038I Pass 27: suminf. 0.23196 (1) obj. 8.80008 iterations 4 +Cbc0038I Pass 28: suminf. 0.60486 (3) obj. 8.80008 iterations 12 +Cbc0038I Pass 29: suminf. 0.60486 (3) obj. 8.80008 iterations 0 +Cbc0038I Pass 30: suminf. 0.73694 (2) obj. 8.80008 iterations 3 +Cbc0038I Pass 31: suminf. 0.76939 (3) obj. 8.80008 iterations 6 +Cbc0038I Pass 32: suminf. 0.43750 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 33: suminf. 1.20338 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 34: suminf. 1.20338 (3) obj. 8.80008 iterations 0 +Cbc0038I Pass 35: suminf. 0.43750 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 36: suminf. 0.45381 (3) obj. 8.80008 iterations 5 +Cbc0038I Pass 37: suminf. 0.32258 (2) obj. 8.80008 iterations 3 +Cbc0038I Pass 38: suminf. 0.45381 (3) obj. 8.80008 iterations 2 +Cbc0038I Pass 39: suminf. 0.61463 (2) obj. 8.80008 iterations 8 +Cbc0038I Pass 40: suminf. 0.49028 (3) obj. 8.80008 iterations 2 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns -Cbc0038I Mini branch and bound improved solution from 9 to 3 (0.08 seconds) -Cbc0038I Round again with cutoff of 1.20006 -Cbc0038I Pass 100: suminf. 0.44152 (2) obj. 1.20006 iterations 0 -Cbc0038I Pass 101: suminf. 0.47568 (3) obj. 1.20006 iterations 4 -Cbc0038I Pass 102: suminf. 0.77432 (3) obj. 1.20006 iterations 9 -Cbc0038I Pass 103: suminf. 0.81692 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 104: suminf. 0.77432 (3) obj. 1.20006 iterations 1 -Cbc0038I Pass 105: suminf. 0.65661 (3) obj. 1.20006 iterations 9 -Cbc0038I Pass 106: suminf. 0.65661 (3) obj. 1.20006 iterations 0 -Cbc0038I Pass 107: suminf. 1.04795 (3) obj. 1.20006 iterations 6 -Cbc0038I Pass 108: suminf. 1.02599 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 109: suminf. 1.07692 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 110: suminf. 0.85876 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 111: suminf. 0.47537 (3) obj. 1.20006 iterations 4 -Cbc0038I Pass 112: suminf. 0.81056 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 113: suminf. 0.76796 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 114: suminf. 0.75343 (3) obj. 1.20006 iterations 4 -Cbc0038I Pass 115: suminf. 0.54762 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 116: suminf. 0.68353 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 117: suminf. 0.65138 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 118: suminf. 0.64747 (3) obj. 1.20006 iterations 6 -Cbc0038I Pass 119: suminf. 0.64747 (3) obj. 1.20006 iterations 0 -Cbc0038I Pass 120: suminf. 0.87169 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 121: suminf. 0.86929 (3) obj. 1.20006 iterations 1 -Cbc0038I Pass 122: suminf. 0.84341 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 123: suminf. 0.79575 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 124: suminf. 1.13784 (3) obj. 1.20006 iterations 3 -Cbc0038I Pass 125: suminf. 1.13109 (3) obj. 1.20006 iterations 1 -Cbc0038I Pass 126: suminf. 1.15209 (3) obj. 1.20006 iterations 2 -Cbc0038I Pass 127: suminf. 0.48058 (3) obj. 1.20006 iterations 5 -Cbc0038I Pass 128: suminf. 0.46759 (3) obj. 1.20006 iterations 1 -Cbc0038I Pass 129: suminf. 0.79466 (3) obj. 1.20006 iterations 2 +Cbc0038I Mini branch and bound improved solution from 12 to 7 (0.02 seconds) +Cbc0038I Round again with cutoff of 4.20007 +Cbc0038I Pass 40: suminf. 0.45708 (3) obj. 4.20007 iterations 0 +Cbc0038I Pass 41: suminf. 0.60715 (3) obj. 4.20007 iterations 4 +Cbc0038I Pass 42: suminf. 0.50544 (3) obj. 4.20007 iterations 7 +Cbc0038I Pass 43: suminf. 0.36054 (2) obj. 4.20007 iterations 3 +Cbc0038I Pass 44: suminf. 0.58394 (3) obj. 4.20007 iterations 3 +Cbc0038I Pass 45: suminf. 0.39961 (2) obj. 4.20007 iterations 6 +Cbc0038I Pass 46: suminf. 0.25741 (3) obj. 4.20007 iterations 3 +Cbc0038I Pass 47: suminf. 0.39961 (2) obj. 4.20007 iterations 3 +Cbc0038I Pass 48: suminf. 0.56309 (3) obj. 4.20007 iterations 9 +Cbc0038I Pass 49: suminf. 0.22005 (2) obj. 4.20007 iterations 4 +Cbc0038I Pass 50: suminf. 0.56309 (3) obj. 4.20007 iterations 2 +Cbc0038I Pass 51: suminf. 0.59044 (3) obj. 4.20007 iterations 13 +Cbc0038I Pass 52: suminf. 0.59044 (3) obj. 4.20007 iterations 0 +Cbc0038I Pass 53: suminf. 1.01751 (3) obj. 4.20007 iterations 2 +Cbc0038I Pass 54: suminf. 0.87317 (3) obj. 4.20007 iterations 1 +Cbc0038I Pass 55: suminf. 0.73042 (3) obj. 4.20007 iterations 9 +Cbc0038I Pass 56: suminf. 0.45807 (3) obj. 4.20007 iterations 3 +Cbc0038I Pass 57: suminf. 0.39028 (2) obj. 4.20007 iterations 8 +Cbc0038I Pass 58: suminf. 0.77269 (3) obj. 4.20007 iterations 3 +Cbc0038I Pass 59: suminf. 1.18408 (3) obj. 4.20007 iterations 5 +Cbc0038I Pass 60: suminf. 0.69423 (3) obj. 4.20007 iterations 3 +Cbc0038I Pass 61: suminf. 1.02654 (3) obj. 4.20007 iterations 2 +Cbc0038I Pass 62: suminf. 0.88220 (3) obj. 4.20007 iterations 1 +Cbc0038I Pass 63: suminf. 0.29378 (3) obj. 4.20007 iterations 7 +Cbc0038I Pass 64: suminf. 0.28451 (2) obj. 4.20007 iterations 4 +Cbc0038I Pass 65: suminf. 0.35953 (2) obj. 4.20007 iterations 2 +Cbc0038I Pass 66: suminf. 0.68584 (3) obj. 4.20007 iterations 4 +Cbc0038I Pass 67: suminf. 0.68584 (3) obj. 4.20007 iterations 0 +Cbc0038I Pass 68: suminf. 1.01421 (3) obj. 4.20007 iterations 4 +Cbc0038I Pass 69: suminf. 0.74339 (3) obj. 4.20007 iterations 3 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns -Cbc0038I Mini branch and bound did not improve solution (0.10 seconds) -Cbc0038I After 0.10 seconds - Feasibility pump exiting with objective of 3 - took 0.09 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 16 columns -Cbc0031I 4 added rows had average density of 15 +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 7 - took 0.03 seconds +Cbc0012I Integer solution of 7 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0031I 4 added rows had average density of 15.75 Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 566 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.012 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 701 row cuts average 12.0 elements, 0 column cuts (0 active) in 0.045 seconds - new frequency is -100 +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 21.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 574 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 613 row cuts average 11.7 elements, 0 column cuts (0 active) in 0.025 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 514 row cuts average 19.4 elements, 0 column cuts (0 active) in 0.014 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 124 row cuts average 8.6 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 338 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 3 best solution, best possible 0 (0.28 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 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0016I Integer solution of 1 found by strong branching after 3869 iterations and 636 nodes (0.56 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 502 row cuts average 19.5 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 109 row cuts average 9.8 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 326 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 7 best solution, best possible 0 (0.13 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0010I After 1000 nodes, 4 on tree, 1 best solution, best possible 0 (0.73 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 17 columns +Cbc0004I Integer solution of 6 found after 1358 iterations and 101 nodes (0.16 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0016I Integer solution of 5 found by strong branching after 2144 iterations and 287 nodes (0.19 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 13 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0016I Integer solution of 2 found by strong branching after 3847 iterations and 655 nodes (0.28 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0001I Search completed - best objective 1, took 16478 iterations and 5056 nodes (1.05 seconds) -Cbc0032I Strong branching done 8002 times (20149 iterations), fathomed 460 nodes and fixed 460 variables -Cbc0041I Maximum depth 12, 239 variables fixed on reduced cost (complete fathoming 296 times, 3344 nodes taking 7708 iterations) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0010I After 1000 nodes, 9 on tree, 2 best solution, best possible 0 (0.37 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0001I Search completed - best objective 2.000000000000057, took 15313 iterations and 5265 nodes (0.53 seconds) +Cbc0032I Strong branching done 6972 times (16795 iterations), fathomed 452 nodes and fixed 396 variables +Cbc0041I Maximum depth 14, 553 variables fixed on reduced cost (complete fathoming 277 times, 3649 nodes taking 7492 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -Gomory was tried 100 times and created 566 cuts of which 0 were active after adding rounds of cuts (0.012 seconds) -Knapsack was tried 100 times and created 701 cuts of which 0 were active after adding rounds of cuts (0.045 seconds) +Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 100 times and created 574 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Knapsack was tried 100 times and created 613 cuts of which 0 were active after adding rounds of cuts (0.025 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 100 times and created 514 cuts of which 0 were active after adding rounds of cuts (0.014 seconds) -FlowCover was tried 100 times and created 124 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -TwoMirCuts was tried 100 times and created 338 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +MixedIntegerRounding2 was tried 100 times and created 502 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) +FlowCover was tried 100 times and created 109 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +TwoMirCuts was tried 100 times and created 326 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 1.00000000 -Enumerated nodes: 5056 -Total iterations: 16478 -Time (CPU seconds): 1.02 -Time (Wallclock seconds): 1.06 +Objective value: 2.00000000 +Enumerated nodes: 5265 +Total iterations: 15313 +Time (CPU seconds): 0.50 +Time (Wallclock seconds): 0.53 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.02 (Wallclock seconds): 1.07 +Total time (CPU seconds): 0.51 (Wallclock seconds): 0.53 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e45f3d87a5ca4019a272377f6fbd3f3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e45f3d87a5ca4019a272377f6fbd3f3f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1263956c1a974403afc4bdc04e85b8c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1263956c1a974403afc4bdc04e85b8c1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1618,13 +1496,13 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.15 +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/263248d41d1040e487a4bd9bfb3b99cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/263248d41d1040e487a4bd9bfb3b99cf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/73be765210d24dc994b6ae0e341b41aa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73be765210d24dc994b6ae0e341b41aa-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1641,7 +1519,7 @@ After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.14 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 test_doctest (pulp.tests.test_examples.Examples_DocsTests.test_doctest) runs all doctests ... ok @@ -1651,24 +1529,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8d33bb0927d843ea9e9df1461d63fdcf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d33bb0927d843ea9e9df1461d63fdcf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/16e4aa936ca545ccabac1504f954b2c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/16e4aa936ca545ccabac1504f954b2c7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 14 COLUMNS -At line 85 RHS -At line 95 BOUNDS -At line 113 ENDATA -Problem MODEL has 9 rows, 14 columns and 28 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 15005 - 0.00 seconds -Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.024975 -Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 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 15005 to 15005 +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) @@ -1680,33 +1557,36 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/72a2430041a04d06a819f8a5fe1ab189-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/72a2430041a04d06a819f8a5fe1ab189-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1941856d7dbb4e9bb947a815c2b893f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1941856d7dbb4e9bb947a815c2b893f7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0 to -1.79769e+308 +Continuous objective value is 8630 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8630 to 8630 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1718,20 +1598,20 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8630.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.02 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c9192125749940bb9787844c43cdfd65-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9192125749940bb9787844c43cdfd65-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/82afa648fd7b4cecba80d85ecad90dc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82afa648fd7b4cecba80d85ecad90dc3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -1741,13 +1621,13 @@ Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds +Continuous objective value is 8660 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Cuts at root node changed objective from 8660 to 8660 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1759,56 +1639,53 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8660.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/03b0cc8d202c461581b5375d09c32d3f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03b0cc8d202c461581b5375d09c32d3f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/36e6d0cdf24841c08732178569f4d9cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36e6d0cdf24841c08732178569f4d9cd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Continuous objective value is 8690 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8690 to 8690 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Result - Optimal solution found + +Objective value: 8690.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/c5a7235d8e7f40ef8002ca11535687da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c5a7235d8e7f40ef8002ca11535687da-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 @@ -1816,23 +1693,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9b11599e5b7c4521979b7c3823710118-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9b11599e5b7c4521979b7c3823710118-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/667f740440c04e38b75f50aef21c02da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/667f740440c04e38b75f50aef21c02da-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.6 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8720 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.6 to -1.6 +Cuts at root node changed objective from 8720 to 8720 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1844,81 +1721,50 @@ Result - Optimal solution found -Objective value: -1.60000000 +Objective value: 8720.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/4eb514cd8a6a43c2aae6eb96cd8952df-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4eb514cd8a6a43c2aae6eb96cd8952df-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.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/69b5fb6845214671b8ae0a84ed18f703-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69b5fb6845214671b8ae0a84ed18f703-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/258ddaba5a954afaa9a0c71915661dbd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/258ddaba5a954afaa9a0c71915661dbd-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.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) -Cbc0031I 2 added rows had average density of 3 -Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8750 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.33333 to -1.25 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8750 to 8750 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.25000000 +Objective value: 8750.00000000 Enumerated nodes: 0 -Total iterations: 2 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -1929,47 +1775,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/05171bb31a9144fc83a701c85f649f7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/05171bb31a9144fc83a701c85f649f7a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2235f09240ac4dd09cde3d8261cfbea7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2235f09240ac4dd09cde3d8261cfbea7-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/5659c3882b7e484c80ccc008ba549b4f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5659c3882b7e484c80ccc008ba549b4f-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 8780 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.22143 to -1.22143 +Cuts at root node changed objective from 8780 to 8780 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -1981,7 +1803,7 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 8780.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -1994,23 +1816,40 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/46049952746c407eb4e45a291a0af495-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46049952746c407eb4e45a291a0af495-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/635d8b1764da4c88944588da4bd2bd43-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/635d8b1764da4c88944588da4bd2bd43-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 28 RHS -At line 32 BOUNDS -At line 33 ENDATA -Problem MODEL has 3 rows, 9 columns and 10 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements -0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) -0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) -2 Obj 246.5 -Optimal - objective value 246.5 -After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 +Continuous objective value is 8810 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8810 to 8810 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8810.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -2018,45 +1857,37 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/57beebd345254083bf69ee761091e90c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57beebd345254083bf69ee761091e90c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0182159e7f04405db661d05cd8f51d2e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0182159e7f04405db661d05cd8f51d2e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8840 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8840 to 8840 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.00000000 +Objective value: 8840.00000000 Enumerated nodes: 0 -Total iterations: 6 +Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -2067,79 +1898,64 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/77133679a34e4660b3063cfb0df92274-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77133679a34e4660b3063cfb0df92274-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cc81245ff1f34536a683aea9a07b726b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cc81245ff1f34536a683aea9a07b726b-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 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 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.01 seconds) -Cbc0031I 1 added rows had average density of 4 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 8870 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 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 8870 to 8870 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 8870.00000000 Enumerated nodes: 0 -Total iterations: 1 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/48c8bee135dc45e390241adba5a23e92-pulp.mps mips /tmp/48c8bee135dc45e390241adba5a23e92-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/48c8bee135dc45e390241adba5a23e92-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/21bd156494a0419b825453c14733fcc6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21bd156494a0419b825453c14733fcc6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/48c8bee135dc45e390241adba5a23e92-pulp.mst. -MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.00 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8900 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -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 +Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8900 to 8900 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2151,20 +1967,20 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.11 +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/3b61f8d8ef4f480285af6d5e0d5a1567-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b61f8d8ef4f480285af6d5e0d5a1567-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e031bc424a6540849546e7091821be16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e031bc424a6540849546e7091821be16-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2206,71 +2022,26 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/10aa2277c58648238759f1604577a1cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10aa2277c58648238759f1604577a1cf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a56b8bdc53d84fe89a8d2e60c2badfc2-pulp.mps mips /tmp/a56b8bdc53d84fe89a8d2e60c2badfc2-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/a56b8bdc53d84fe89a8d2e60c2badfc2-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 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/a56b8bdc53d84fe89a8d2e60c2badfc2-pulp.mst. +MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.00 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 228100.00000000 -Enumerated nodes: 0 -Total iterations: 13 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.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/2e1edcaae0c742cb8bdbabb6ff236cae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e1edcaae0c742cb8bdbabb6ff236cae-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0.97 to -1.79769e+308 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.04 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0045I Solution of 12 already found by heuristic +Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2282,20 +2053,20 @@ Result - Optimal solution found -Objective value: 0.97000000 +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.03 +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.04 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9228220aad634de4816cd5f27d780db9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9228220aad634de4816cd5f27d780db9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9392c31f5c324d6785838b4d9fa2de4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9392c31f5c324d6785838b4d9fa2de4d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -2312,10 +2083,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.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) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2333,16 +2104,16 @@ 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.02 (Wallclock seconds): 0.03 +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/e4488710fb934b14b683223f537cd39c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4488710fb934b14b683223f537cd39c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/de5d40abcf3148968464805582ae0c8f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de5d40abcf3148968464805582ae0c8f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -2365,10 +2136,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.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) @@ -2385,17 +2156,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7378a7d1abe146dabc5f88ecd7dccd63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7378a7d1abe146dabc5f88ecd7dccd63-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4d36d307f370442493525c4f10e9ce28-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4d36d307f370442493525c4f10e9ce28-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -2420,10 +2191,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.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.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) @@ -2440,17 +2211,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +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/d3d41eb16adf46e9b79c5a1f8f3ac402-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3d41eb16adf46e9b79c5a1f8f3ac402-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3f2a174b294947c08451948d08b3fff4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f2a174b294947c08451948d08b3fff4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -2475,10 +2246,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2495,17 +2266,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.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +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/d72ec58e223e46ecb82905bdea642021-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d72ec58e223e46ecb82905bdea642021-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b2a417110cb946ebb321b4239f6342e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b2a417110cb946ebb321b4239f6342e4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -2528,10 +2299,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 1 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2548,17 +2319,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.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 +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/c8ec6d9d31674f0c85cd0017d8873807-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8ec6d9d31674f0c85cd0017d8873807-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/41671bcc77eb49e4a1c6e07a92751a02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41671bcc77eb49e4a1c6e07a92751a02-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -2581,10 +2352,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2601,17 +2372,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.09 +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/7731198715e74655af99011f4d566d49-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7731198715e74655af99011f4d566d49-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c82a5e4f4eee4b8ba26c50a6c15fc165-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c82a5e4f4eee4b8ba26c50a6c15fc165-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -2635,10 +2406,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2655,17 +2426,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.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 +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/1f239b82091a4812b1fbb939a10d3e7f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f239b82091a4812b1fbb939a10d3e7f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/78081c7509914553929044d4ba3ce2c2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78081c7509914553929044d4ba3ce2c2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -2688,10 +2459,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2708,17 +2479,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +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/8437ae39f2344c86bdd7a475e83da16e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8437ae39f2344c86bdd7a475e83da16e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e0d645dfcd91418d917ad057f077d8d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0d645dfcd91418d917ad057f077d8d0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -2738,10 +2509,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -2758,17 +2529,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.04 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.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e123c379a1344a90a5d0deebeec9132f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e123c379a1344a90a5d0deebeec9132f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cb7e64b8b8b146ef9e235e583380c4ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb7e64b8b8b146ef9e235e583380c4ca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -2787,10 +2558,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -2807,17 +2578,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.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a090ec1fcc814f19a1e18167ab08abee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a090ec1fcc814f19a1e18167ab08abee-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8e8dc27b7dde4f82ad5385bd15ac9a1e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8e8dc27b7dde4f82ad5385bd15ac9a1e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -2846,17 +2617,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7d17a55e054343ffb74311cc735df1d4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7d17a55e054343ffb74311cc735df1d4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/15e199f46b8f457b8529db12a2edc0cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/15e199f46b8f457b8529db12a2edc0cb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -2888,17 +2659,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.22 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ebd979f9983e42fe96e044d2618a6c11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ebd979f9983e42fe96e044d2618a6c11-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/529e34a84820452ea5c4d6e4c5c5a727-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/529e34a84820452ea5c4d6e4c5c5a727-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -2947,8 +2718,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.06 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting - took 0.00 seconds +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -2959,7 +2730,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.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -2976,51 +2747,28 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.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/fda5c2bb4de04980bd5f66c552361052-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/fda5c2bb4de04980bd5f66c552361052-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1ab130aef6264c8392fe7aef7be3a016-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1ab130aef6264c8392fe7aef7be3a016-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/cb0cd8f22d4d45ecb798917884e6cc2f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb0cd8f22d4d45ecb798917884e6cc2f-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 13 COLUMNS +At line 72 RHS +At line 81 BOUNDS +At line 94 ENDATA +Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) @@ -3050,23 +2798,42 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0e18ca931d51455ebe08611cbfe2cef1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e18ca931d51455ebe08611cbfe2cef1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f06b217f0e9f4c3caac13ef77e4187a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f06b217f0e9f4c3caac13ef77e4187a7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 10 COLUMNS +At line 42 RHS +At line 48 BOUNDS +At line 49 ENDATA +Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8630 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8630 to 8630 +Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements +0 Obj 0 Primal inf 405.05674 (3) +2 Obj 0.52 +Optimal - objective value 0.52 +Optimal objective 0.52 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/b37ee913dc6a4fa3b5bdbc017ac99799-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b37ee913dc6a4fa3b5bdbc017ac99799-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3078,36 +2845,504 @@ Result - Optimal solution found -Objective value: 8630.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/66c39c8ce5854d66ac577f638471a367-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/66c39c8ce5854d66ac577f638471a367-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 110 RHS +At line 119 BOUNDS +At line 140 ENDATA +Problem MODEL has 8 rows, 20 columns and 36 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.00 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 13 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.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' + """ +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 = 1.0 +x_4 = 1.0 +x_5 = 0.0 +x_6 = 1.0 +x_7 = 0.0 +x_8 = 0.0 +x_9 = 1.0 +Status: Optimal +s_0 = 0.0 +s_1 = 0.0 +s_2 = 0.0 +w_0 = 0.0 +w_1 = 1.0 +w_2 = 1.0 +x_0 = 0.0 +x_1 = 1.0 +x_10 = 0.0 +x_11 = 1.0 +x_12 = 0.0 +x_13 = 0.0 +x_14 = 1.0 +x_15 = 0.0 +x_16 = 1.0 +x_17 = 0.0 +x_18 = 0.0 +x_19 = 0.0 +x_2 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 1.0 +x_7 = 1.0 +x_8 = 0.0 +x_9 = 0.0 +objective= 2.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. +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 210.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8630.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 220.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8660.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 230.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8690.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 240.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 270.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 = 8810.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 = 280.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 = 8840.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 = 290.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 = 8870.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 = 300.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 = 8900.0 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Infeasible +Solutions Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_A_D = 0.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Ingr_BEEF = 60.0 +Ingr_CHICKEN = 0.0 +Ingr_GEL = 40.0 +Ingr_MUTTON = 0.0 +Ingr_RICE = 0.0 +Ingr_WHEAT = 0.0 +Total Cost of Ingredients per can = 0.52 +Status: Optimal +Solution Written to sudokuout.txt +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +The_Gemstone_Tool_Problem: +MAXIMIZE +25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 +SUBJECT TO +Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches + - steelpurchase <= 0 + +molding_capacity0: production_0_pliers + production_0_wrenches <= 21 + +assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 + +capacity_wrenches0: production_0_wrenches <= 15 + +capacity_pliers0: production_0_pliers <= 16 + +Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches + - steelpurchase <= 0 + +molding_capacity1: production_1_pliers + production_1_wrenches <= 21 + +assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 + +capacity_wrenches1: production_1_wrenches <= 15 + +capacity_pliers1: production_1_pliers <= 16 + +Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches + - steelpurchase <= 0 + +molding_capacity2: production_2_pliers + production_2_wrenches <= 21 + +assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 + +capacity_wrenches2: production_2_wrenches <= 15 + +capacity_pliers2: production_2_pliers <= 16 + +Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches + - steelpurchase <= 0 + +molding_capacity3: production_3_pliers + production_3_wrenches <= 21 + +assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 + +capacity_wrenches3: production_3_wrenches <= 15 + +capacity_pliers3: production_3_pliers <= 16 + +VARIABLES +production_0_pliers Continuous +production_0_wrenches Continuous +production_1_pliers Continuous +production_1_wrenches Continuous +production_2_pliers Continuous +production_2_wrenches Continuous +production_3_pliers Continuous +production_3_wrenches Continuous +steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/02e4b80e13c3483e9cd9c4133fa944bc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/02e4b80e13c3483e9cd9c4133fa944bc-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/549a11fba39d46a59c1668bdfe3a86eb-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/549a11fba39d46a59c1668bdfe3a86eb-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 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 -Continuous objective value is 8660 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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/6efbc8fb27a34085a068402d9a5447c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6efbc8fb27a34085a068402d9a5447c1-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 12 +Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 12 - took 0.00 seconds +Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8660 to 8660 +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) @@ -3119,20 +3354,20 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8b7befdbf1224989ad81c4ed10985c62-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8b7befdbf1224989ad81c4ed10985c62-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/60df70b5a4044c399e4664d1a7257d3c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/60df70b5a4044c399e4664d1a7257d3c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3142,13 +3377,13 @@ Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) +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 8690 to 8690 +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) @@ -3160,7 +3395,7 @@ Result - Optimal solution found -Objective value: 8690.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3173,23 +3408,45 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/370892f2bd944104b53b542733ccb10c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/370892f2bd944104b53b542733ccb10c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/106cdeabb72c44ae99bb4f22c619d8b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/106cdeabb72c44ae99bb4f22c619d8b0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8720 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) +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/7b74c221fecc40c992259fd6f9a68477-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7b74c221fecc40c992259fd6f9a68477-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 8720 to 8720 +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) @@ -3201,50 +3458,81 @@ Result - Optimal solution found -Objective value: 8720.00000000 +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.08 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/5cc823c2cc404a96bf58b08623785635-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5cc823c2cc404a96bf58b08623785635-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/459c73059b7d43cfb95e6bde9fe53fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/459c73059b7d43cfb95e6bde9fe53fae-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/90ef032f08a44b70b49aa8accb0a4998-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90ef032f08a44b70b49aa8accb0a4998-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 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 8750 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) +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 8750 to 8750 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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.001 seconds) Result - Optimal solution found -Objective value: 8750.00000000 +Objective value: -1.25000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 2 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3255,23 +3543,47 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/603c405a18664f759b703798dbcf26c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/603c405a18664f759b703798dbcf26c4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f324915aee7e4911900f378cce0eae89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f324915aee7e4911900f378cce0eae89-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 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8780 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) +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/8df1c3fdf2b348e987c7f9e4e7b4a404-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8df1c3fdf2b348e987c7f9e4e7b4a404-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 8780 to 8780 +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) @@ -3283,7 +3595,7 @@ Result - Optimal solution found -Objective value: 8780.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3296,37 +3608,69 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c4869a2c8392469aa9feda528b22915d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4869a2c8392469aa9feda528b22915d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/84c0ca56f7ea434c9a934fca9ce8f837-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84c0ca56f7ea434c9a934fca9ce8f837-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 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 8810 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) +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/42e7331e4a5a4958960e7cc7aeed7614-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42e7331e4a5a4958960e7cc7aeed7614-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8810 to 8810 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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.001 seconds) Result - Optimal solution found -Objective value: 8810.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3337,23 +3681,76 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7125a3d062c844b5a0885901837f1a47-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7125a3d062c844b5a0885901837f1a47-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/70eefc22247b4bc7a67090de8f5e10cc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70eefc22247b4bc7a67090de8f5e10cc-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 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 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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.001 seconds) + +Result - Optimal solution found + +Objective value: 246.50000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/2d635efc7be046b8bf2910b84dcfd1d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2d635efc7be046b8bf2910b84dcfd1d9-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) +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 8840 to 8840 +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) @@ -3365,7 +3762,7 @@ Result - Optimal solution found -Objective value: 8840.00000000 +Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3378,37 +3775,49 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/99d815ccb33949c18a0f4b47f021e990-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/99d815ccb33949c18a0f4b47f021e990-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bcbb6e66a7e24bf799c290757c91f14c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcbb6e66a7e24bf799c290757c91f14c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 14 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8870 to 8870 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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.001 seconds) Result - Optimal solution found -Objective value: 8870.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -3419,23 +3828,24 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/488a5bc437a249258d004010e25108bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/488a5bc437a249258d004010e25108bf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b58ecfa666d642df8d61e5ab6b158fd2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b58ecfa666d642df8d61e5ab6b158fd2-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 8900 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8900 to 8900 +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) @@ -3447,7 +3857,7 @@ Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3460,23 +3870,47 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c56a0226463342938a2d9e98af32faa0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c56a0226463342938a2d9e98af32faa0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/61e93ad9da0240efaf43b84e21eb8cad-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/61e93ad9da0240efaf43b84e21eb8cad-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 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/483b486d044d419fb5a3d884785356de-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/483b486d044d419fb5a3d884785356de-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 14 COLUMNS +At line 85 RHS +At line 95 BOUNDS +At line 113 ENDATA +Problem MODEL has 9 rows, 14 columns and 28 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 15005 - 0.00 seconds +Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.024975 +Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8300 to 8300 +Cuts at root node changed objective from 15005 to 15005 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -3488,7 +3922,7 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 15005.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -3501,7 +3935,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d63a390ccb2f473d905112be4f9a8ae3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d63a390ccb2f473d905112be4f9a8ae3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/04ed232bb9c84d68bbed418f49f55edc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04ed232bb9c84d68bbed418f49f55edc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3523,7 +3957,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/28b64f6c8b294b41a653e7e7173ceb5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28b64f6c8b294b41a653e7e7173ceb5b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f6d6adb0c10945299216e82ce0eb3292-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f6d6adb0c10945299216e82ce0eb3292-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3556,7 +3990,7 @@ MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -3573,7 +4007,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0f2d78a7b70c449a9d9d322f9e4089a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0f2d78a7b70c449a9d9d322f9e4089a0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8175b711d8a743fe9a33cb85f98fb9fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8175b711d8a743fe9a33cb85f98fb9fc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3597,7 +4031,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d7321060588d466c9269df22a5073cd0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7321060588d466c9269df22a5073cd0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9f1161862dbf48a090836dbc40ddafa0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9f1161862dbf48a090836dbc40ddafa0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3629,7 +4063,7 @@ 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) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -3640,13 +4074,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/65a693ad8c314483b126fce25b9d1635-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65a693ad8c314483b126fce25b9d1635-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1e938343a357421bbb39d964cad44c9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e938343a357421bbb39d964cad44c9d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3662,7 +4096,7 @@ Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 @@ -3672,59 +4106,6 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 246.50000000 -Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/c6dd089fea334a32a841740088a40b0d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6dd089fea334a32a841740088a40b0d-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 @@ -3735,7 +4116,7 @@ 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) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -3743,464 +4124,6 @@ Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -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 = 0.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 = 1.0 -w_0 = 0.0 -w_1 = 0.0 -w_2 = 0.0 -x_0 = 1.0 -x_1 = 0.0 -x_10 = 0.0 -x_11 = 0.0 -x_12 = 0.0 -x_13 = 1.0 -x_14 = 0.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 = 1.0 -x_5 = 1.0 -x_6 = 0.0 -x_7 = 0.0 -x_8 = 1.0 -x_9 = 0.0 -objective= 1.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. -Status: Optimal -Route_('Chicago',_'Gary') = 4000.0 -Route_('Chicago',_'Tempe') = 2000.0 -Route_('Cincinatti',_'Albany') = 2000.0 -Route_('Cincinatti',_'Houston') = 3000.0 -Route_('Kansas_City',_'Houston') = 4000.0 -Route_('Kansas_City',_'Tempe') = 2000.0 -Route_('Pittsburgh',_'Chicago') = 3000.0 -Route_('Pittsburgh',_'Cincinatti') = 2000.0 -Route_('Pittsburgh',_'Gary') = 2000.0 -Route_('Pittsburgh',_'Kansas_City') = 3000.0 -Route_('Youngstown',_'Albany') = 1000.0 -Route_('Youngstown',_'Chicago') = 3000.0 -Route_('Youngstown',_'Cincinatti') = 3000.0 -Route_('Youngstown',_'Kansas_City') = 3000.0 -Total Cost of Transportation = 15005.0 -Status: Optimal -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_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 -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 -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 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Patt_A = 225.0 -Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 -Status: Optimal -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Infeasible -Solutions Written to sudokuout.txt -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.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 -Route_B_1 = 220.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8660.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 230.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8690.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 240.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 270.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 = 8810.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 = 280.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 = 8840.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 = 290.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 = 8870.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 = 300.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 = 8900.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 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0 -Patt_P12 = Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/73e10c39a8074000b3838730879e3c92-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73e10c39a8074000b3838730879e3c92-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 36 RHS -At line 40 BOUNDS -At line 47 ENDATA -Problem MODEL has 3 rows, 6 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 251.50000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all @@ -4210,48 +4133,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bed05616d8b948b0b053c249f021671f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bed05616d8b948b0b053c249f021671f-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 13 COLUMNS -At line 72 RHS -At line 81 BOUNDS -At line 94 ENDATA -Problem MODEL has 8 rows, 12 columns and 24 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 8600.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/fbffe0bb5e284f32a058874bbe6e678a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbffe0bb5e284f32a058874bbe6e678a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e8b7cf34039140cb9154b5a2b45d660e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e8b7cf34039140cb9154b5a2b45d660e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4298,34 +4180,26 @@ 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/b58fc32afd9a4f8aa0aa5e7cf8e7dec1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b58fc32afd9a4f8aa0aa5e7cf8e7dec1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a187ff31540a409fb2db75c98d05697a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a187ff31540a409fb2db75c98d05697a-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 10 COLUMNS +At line 25 RHS +At line 31 BOUNDS +At line 33 ENDATA +Problem MODEL has 5 rows, 2 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 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.00 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.09 seconds) -Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.10 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 12 to 12 +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) @@ -4337,38 +4211,13 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 0.97000000 Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.09 -Time (Wallclock seconds): 0.11 +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.11 (Wallclock seconds): 0.14 - -/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/6d1eb9ce49a74d448e02a2ebcbef4ddc-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/6d1eb9ce49a74d448e02a2ebcbef4ddc-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 ok @@ -5707,10 +5556,94 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 31.952s +Ran 1005 tests in 26.470s OK (skipped=885) -0.0 + +Status: Optimal +production_0_pliers = 4.75 +production_0_wrenches = 15.0 +production_1_pliers = 4.75 +production_1_wrenches = 15.0 +production_2_pliers = 8.5 +production_2_wrenches = 12.5 +production_3_pliers = 16.0 +production_3_wrenches = 5.0 +steelpurchase = 27.25 +Total price = 863.25 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +P3 = [4, 0, 0] +P4 = [1, 2, 0] +P5 = [0, 0, 2] +Pattern_P0 = 0 +Pattern_P1 = 0 +Pattern_P2 = 0 +Pattern_P3 = 13 +Pattern_P4 = 100 +Pattern_P5 = 150 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +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 @@ -5733,20 +5666,37 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 Status: Optimal -Route_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 +Route_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -5783,82 +5733,10 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 -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') -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 +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 Test that logic put in place for deprecation handling of indexs works Testing 'indexs' param continues to work for LpVariable.dicts Testing 'indexs' param continues to work for LpVariable.matrix @@ -6004,7 +5882,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bdc6c2ce0e2044c99af415ee690db571-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bdc6c2ce0e2044c99af415ee690db571-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/448901cdc20e43069b4515c0b93e5d48-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/448901cdc20e43069b4515c0b93e5d48-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6027,7 +5905,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6bb880d0523a48859b0bfe6df8963ba7-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/6bb880d0523a48859b0bfe6df8963ba7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c6900dc3578e4662b537eb81d557323d-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/c6900dc3578e4662b537eb81d557323d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -6058,7 +5936,7 @@ Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns -Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.01 seconds) +Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.00 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 @@ -6077,7 +5955,7 @@ Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 @@ -6112,11 +5990,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.07 seconds) -Cbc0038I After 0.07 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.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) +Cbc0038I After 0.02 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.02 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.02 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.08 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.03 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -6125,7 +6003,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.03 seconds) Cbc0035I Maximum depth 0, 5 variables fixed on reduced cost Cuts at root node changed objective from 4.1943e+06 to 4.19022e+06 Probing was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6142,17 +6020,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.02 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.04 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c0f839e4812040de98334447ddb571c0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0f839e4812040de98334447ddb571c0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/68ad8a211f7546ab8b6fed22abe896cb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/68ad8a211f7546ab8b6fed22abe896cb-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -6171,7 +6049,7 @@ Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 48 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 38 columns -Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 @@ -6197,7 +6075,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.18 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.08 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -6232,350 +6110,347 @@ 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.30 seconds) -Cbc0038I After 0.30 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.25 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.30 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.14 seconds) +Cbc0038I After 0.14 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.13 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.14 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.050 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.083 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.053 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.036 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.94 seconds) +Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.022 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.040 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.023 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 33 rows 47 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (1.84 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 4740 iterations and 94 nodes (0.83 seconds) Cbc0032I Strong branching done 966 times (8486 iterations), fathomed 27 nodes and fixed 39 variables Cbc0035I Maximum depth 13, 186 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 -Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.050 seconds) -Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.130 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.019 seconds) -Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) -MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.096 seconds) -FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) -TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.053 seconds) +Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.022 seconds) +Gomory was tried 302 times and created 1624 cuts of which 0 were active after adding rounds of cuts (0.062 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +MixedIntegerRounding2 was tried 302 times and created 263 cuts of which 0 were active after adding rounds of cuts (0.043 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) +TwoMirCuts was tried 302 times and created 209 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) +ImplicationCuts was tried 229 times and created 24 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 94 Total iterations: 4740 -Time (CPU seconds): 1.79 -Time (Wallclock seconds): 1.86 +Time (CPU seconds): 0.82 +Time (Wallclock seconds): 0.83 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.79 (Wallclock seconds): 1.87 +Total time (CPU seconds): 0.82 (Wallclock seconds): 0.88 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a34a1db7b93449cf913963f122f22f9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a34a1db7b93449cf913963f122f22f9a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7c7b87689fae4516ad17944fc6987bec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c7b87689fae4516ad17944fc6987bec-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 1636 RHS +At line 1857 BOUNDS +At line 2068 ENDATA +Problem MODEL has 220 rows, 210 columns and 780 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -220.004 - 0.00 seconds -Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 800 elements +Continuous objective value is -161.6 - 0.00 seconds +Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions +Cgl0004I processed model has 209 rows, 200 columns (200 integer (200 of which binary)) and 745 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 26 integers unsatisfied sum - 7.76338 -Cbc0038I Pass 1: suminf. 1.75087 (8) obj. -217.291 iterations 94 -Cbc0038I Pass 2: suminf. 0.83224 (6) obj. -215.08 iterations 11 -Cbc0038I Solution found of -199.4 -Cbc0038I Rounding solution of -203.55 is better than previous of -199.4 - -Cbc0038I Before mini branch and bound, 177 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 18 rows 22 columns -Cbc0038I Mini branch and bound improved solution from -203.55 to -215.7 (0.02 seconds) -Cbc0038I Round again with cutoff of -216.2 -Cbc0038I Reduced cost fixing fixed 2 variables on major pass 2 -Cbc0038I Pass 3: suminf. 1.75087 (8) obj. -217.291 iterations 0 -Cbc0038I Pass 4: suminf. 1.17098 (7) obj. -216.2 iterations 44 -Cbc0038I Pass 5: suminf. 1.90041 (8) obj. -216.2 iterations 66 -Cbc0038I Pass 6: suminf. 1.90211 (8) obj. -216.2 iterations 24 -Cbc0038I Pass 7: suminf. 1.68927 (8) obj. -216.2 iterations 70 -Cbc0038I Pass 8: suminf. 1.68927 (8) obj. -216.2 iterations 14 -Cbc0038I Pass 9: suminf. 2.14988 (8) obj. -216.2 iterations 65 -Cbc0038I Pass 10: suminf. 3.14632 (28) obj. -216.2 iterations 61 -Cbc0038I Pass 11: suminf. 2.00691 (10) obj. -216.2 iterations 20 -Cbc0038I Pass 12: suminf. 2.00691 (10) obj. -216.2 iterations 7 -Cbc0038I Pass 13: suminf. 2.40283 (9) obj. -216.2 iterations 71 -Cbc0038I Pass 14: suminf. 1.89132 (9) obj. -216.2 iterations 30 -Cbc0038I Pass 15: suminf. 2.40283 (9) obj. -216.2 iterations 56 -Cbc0038I Pass 16: suminf. 2.87491 (10) obj. -216.2 iterations 31 -Cbc0038I Pass 17: suminf. 2.40404 (10) obj. -216.2 iterations 16 -Cbc0038I Pass 18: suminf. 1.98601 (9) obj. -216.2 iterations 104 -Cbc0038I Pass 19: suminf. 1.56738 (9) obj. -216.2 iterations 33 -Cbc0038I Pass 20: suminf. 1.98601 (9) obj. -216.2 iterations 58 -Cbc0038I Pass 21: suminf. 2.07908 (28) obj. -216.2 iterations 40 -Cbc0038I Pass 22: suminf. 1.84640 (10) obj. -216.2 iterations 38 -Cbc0038I Pass 23: suminf. 2.33055 (10) obj. -216.2 iterations 26 -Cbc0038I Pass 24: suminf. 2.33055 (10) obj. -216.2 iterations 13 -Cbc0038I Pass 25: suminf. 2.21474 (9) obj. -216.2 iterations 72 -Cbc0038I Pass 26: suminf. 1.47237 (9) obj. -216.2 iterations 43 -Cbc0038I Pass 27: suminf. 2.16534 (9) obj. -216.2 iterations 55 -Cbc0038I Pass 28: suminf. 2.42843 (27) obj. -216.2 iterations 50 -Cbc0038I Pass 29: suminf. 2.03165 (27) obj. -216.2 iterations 9 -Cbc0038I Pass 30: suminf. 1.93258 (10) obj. -216.2 iterations 8 -Cbc0038I Pass 31: suminf. 1.88061 (9) obj. -216.2 iterations 83 -Cbc0038I Pass 32: suminf. 1.87142 (9) obj. -216.2 iterations 10 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 154 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 18 rows 38 columns -Cbc0038I Mini branch and bound improved solution from -215.7 to -216.15 (0.08 seconds) -Cbc0038I Round again with cutoff of -217 -Cbc0038I Reduced cost fixing fixed 6 variables on major pass 3 -Cbc0038I Pass 32: suminf. 1.75087 (8) obj. -217.291 iterations 0 -Cbc0038I Pass 33: suminf. 1.46250 (8) obj. -217 iterations 52 -Cbc0038I Pass 34: suminf. 1.72488 (8) obj. -217 iterations 40 -Cbc0038I Pass 35: suminf. 1.96332 (28) obj. -217 iterations 76 -Cbc0038I Pass 36: suminf. 1.54447 (9) obj. -217 iterations 75 -Cbc0038I Pass 37: suminf. 1.83055 (9) obj. -217 iterations 36 -Cbc0038I Pass 38: suminf. 1.24609 (9) obj. -217 iterations 49 -Cbc0038I Pass 39: suminf. 1.90221 (9) obj. -217 iterations 62 -Cbc0038I Pass 40: suminf. 2.46426 (29) obj. -217 iterations 60 -Cbc0038I Pass 41: suminf. 2.14344 (29) obj. -217 iterations 13 -Cbc0038I Pass 42: suminf. 2.55071 (22) obj. -217 iterations 70 -Cbc0038I Pass 43: suminf. 2.54790 (22) obj. -217 iterations 3 -Cbc0038I Pass 44: suminf. 8.20335 (20) obj. -217 iterations 33 -Cbc0038I Pass 45: suminf. 2.39356 (24) obj. -217 iterations 35 -Cbc0038I Pass 46: suminf. 2.29383 (26) obj. -217 iterations 14 -Cbc0038I Pass 47: suminf. 2.11535 (10) obj. -217 iterations 36 -Cbc0038I Pass 48: suminf. 1.80844 (10) obj. -217 iterations 13 -Cbc0038I Pass 49: suminf. 1.75687 (9) obj. -217 iterations 101 -Cbc0038I Pass 50: suminf. 1.32078 (9) obj. -217 iterations 35 -Cbc0038I Pass 51: suminf. 1.66802 (9) obj. -217 iterations 50 -Cbc0038I Pass 52: suminf. 2.22745 (27) obj. -217 iterations 34 -Cbc0038I Pass 53: suminf. 1.88530 (10) obj. -217 iterations 20 -Cbc0038I Pass 54: suminf. 1.67903 (9) obj. -217 iterations 84 -Cbc0038I Pass 55: suminf. 1.67903 (9) obj. -217 iterations 9 -Cbc0038I Pass 56: suminf. 1.87864 (10) obj. -217 iterations 44 -Cbc0038I Pass 57: suminf. 1.87864 (10) obj. -217 iterations 12 -Cbc0038I Pass 58: suminf. 2.29499 (10) obj. -217 iterations 27 -Cbc0038I Pass 59: suminf. 1.64471 (9) obj. -217 iterations 63 -Cbc0038I Pass 60: suminf. 2.06804 (9) obj. -217 iterations 68 -Cbc0038I Pass 61: suminf. 2.80852 (26) obj. -217 iterations 45 +Cbc0038I Initial state - 42 integers unsatisfied sum - 5.24554 +Cbc0038I Pass 1: suminf. 0.89145 (6) obj. -160.034 iterations 92 +Cbc0038I Solution found of -142.55 +Cbc0038I Rounding solution of -145.05 is better than previous of -142.55 + +Cbc0038I Before mini branch and bound, 153 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 20 rows 23 columns +Cbc0038I Mini branch and bound improved solution from -145.05 to -156 (0.01 seconds) +Cbc0038I Round again with cutoff of -156.65 +Cbc0038I Reduced cost fixing fixed 1 variables on major pass 2 +Cbc0038I Pass 2: suminf. 0.89145 (6) obj. -160.034 iterations 0 +Cbc0038I Pass 3: suminf. 1.12027 (5) obj. -156.65 iterations 13 +Cbc0038I Pass 4: suminf. 0.86479 (5) obj. -157.455 iterations 2 +Cbc0038I Pass 5: suminf. 1.28238 (7) obj. -156.65 iterations 95 +Cbc0038I Pass 6: suminf. 0.94645 (5) obj. -156.65 iterations 53 +Cbc0038I Pass 7: suminf. 1.17931 (4) obj. -156.65 iterations 26 +Cbc0038I Pass 8: suminf. 0.91417 (4) obj. -156.65 iterations 11 +Cbc0038I Pass 9: suminf. 1.28103 (4) obj. -156.65 iterations 33 +Cbc0038I Pass 10: suminf. 2.03260 (8) obj. -156.65 iterations 70 +Cbc0038I Pass 11: suminf. 2.03260 (8) obj. -156.65 iterations 6 +Cbc0038I Pass 12: suminf. 1.95912 (6) obj. -156.65 iterations 57 +Cbc0038I Pass 13: suminf. 1.57053 (6) obj. -156.65 iterations 32 +Cbc0038I Pass 14: suminf. 1.90122 (6) obj. -156.65 iterations 38 +Cbc0038I Pass 15: suminf. 4.88241 (23) obj. -156.65 iterations 39 +Cbc0038I Pass 16: suminf. 1.91243 (8) obj. -156.65 iterations 18 +Cbc0038I Pass 17: suminf. 1.91243 (8) obj. -156.65 iterations 4 +Cbc0038I Pass 18: suminf. 1.46996 (7) obj. -156.65 iterations 64 +Cbc0038I Pass 19: suminf. 1.32123 (5) obj. -156.65 iterations 51 +Cbc0038I Pass 20: suminf. 1.34271 (5) obj. -156.65 iterations 43 +Cbc0038I Pass 21: suminf. 1.17238 (7) obj. -156.65 iterations 36 +Cbc0038I Pass 22: suminf. 0.93467 (5) obj. -156.65 iterations 59 +Cbc0038I Pass 23: suminf. 1.02415 (5) obj. -156.65 iterations 34 +Cbc0038I Pass 24: suminf. 1.34601 (7) obj. -156.65 iterations 48 +Cbc0038I Pass 25: suminf. 1.16705 (7) obj. -156.65 iterations 7 +Cbc0038I Pass 26: suminf. 1.43172 (6) obj. -156.65 iterations 49 +Cbc0038I Pass 27: suminf. 1.39363 (6) obj. -156.65 iterations 4 +Cbc0038I Pass 28: suminf. 1.60608 (7) obj. -156.65 iterations 15 +Cbc0038I Pass 29: suminf. 1.35169 (6) obj. -156.65 iterations 4 +Cbc0038I Pass 30: suminf. 0.68404 (4) obj. -156.65 iterations 23 +Cbc0038I Pass 31: suminf. 0.84601 (4) obj. -156.65 iterations 10 +Cbc0038I Rounding solution of -156.55 is better than previous of -156 + +Cbc0038I Before mini branch and bound, 129 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 21 rows 35 columns +Cbc0038I Mini branch and bound improved solution from -156.55 to -158.25 (0.05 seconds) +Cbc0038I Round again with cutoff of -159 +Cbc0038I Reduced cost fixing fixed 8 variables on major pass 3 +Cbc0038I Pass 31: suminf. 0.89145 (6) obj. -160.034 iterations 0 +Cbc0038I Pass 32: suminf. 1.28168 (6) obj. -159 iterations 7 +Cbc0038I Pass 33: suminf. 1.48413 (7) obj. -159 iterations 65 +Cbc0038I Pass 34: suminf. 0.91398 (5) obj. -159 iterations 82 +Cbc0038I Pass 35: suminf. 0.92482 (5) obj. -159 iterations 73 +Cbc0038I Pass 36: suminf. 0.89309 (6) obj. -159 iterations 31 +Cbc0038I Pass 37: suminf. 0.92482 (5) obj. -159 iterations 34 +Cbc0038I Pass 38: suminf. 1.60686 (7) obj. -159 iterations 53 +Cbc0038I Pass 39: suminf. 0.89048 (5) obj. -159 iterations 60 +Cbc0038I Pass 40: suminf. 1.31983 (5) obj. -159 iterations 30 +Cbc0038I Pass 41: suminf. 1.08245 (5) obj. -159 iterations 24 +Cbc0038I Pass 42: suminf. 1.37605 (7) obj. -159 iterations 81 +Cbc0038I Pass 43: suminf. 0.90503 (5) obj. -159 iterations 45 +Cbc0038I Pass 44: suminf. 1.28290 (5) obj. -159 iterations 25 +Cbc0038I Pass 45: suminf. 1.28290 (5) obj. -159 iterations 5 +Cbc0038I Pass 46: suminf. 1.08157 (5) obj. -159 iterations 36 +Cbc0038I Pass 47: suminf. 1.08157 (5) obj. -159 iterations 2 +Cbc0038I Pass 48: suminf. 1.28290 (5) obj. -159 iterations 37 +Cbc0038I Pass 49: suminf. 2.00776 (8) obj. -159 iterations 36 +Cbc0038I Pass 50: suminf. 1.54525 (6) obj. -159 iterations 51 +Cbc0038I Pass 51: suminf. 1.58944 (6) obj. -159 iterations 41 +Cbc0038I Pass 52: suminf. 2.12137 (8) obj. -159 iterations 30 +Cbc0038I Pass 53: suminf. 1.50177 (6) obj. -159 iterations 62 +Cbc0038I Pass 54: suminf. 1.66636 (6) obj. -159 iterations 32 +Cbc0038I Pass 55: suminf. 1.80688 (25) obj. -159 iterations 47 +Cbc0038I Pass 56: suminf. 1.73936 (8) obj. -159 iterations 12 +Cbc0038I Pass 57: suminf. 1.45409 (7) obj. -159 iterations 85 +Cbc0038I Pass 58: suminf. 1.39441 (7) obj. -159 iterations 12 +Cbc0038I Pass 59: suminf. 1.17839 (7) obj. -159 iterations 58 +Cbc0038I Pass 60: suminf. 1.17741 (6) obj. -159 iterations 12 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 154 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 18 rows 41 columns -Cbc0038I Mini branch and bound did not improve solution (0.13 seconds) -Cbc0038I After 0.13 seconds - Feasibility pump exiting with objective of -216.15 - took 0.11 seconds -Cbc0012I Integer solution of -216.15 found by feasibility pump after 0 iterations and 0 nodes (0.13 seconds) -Cbc0038I Full problem 220 rows 210 columns, reduced to 16 rows 14 columns -Cbc0031I 19 added rows had average density of 14.526316 -Cbc0013I At root node, 19 cuts changed objective from -220.00399 to -216.60394 in 10 passes -Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 2.0 elements, 6 column cuts (6 active) in 0.004 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 40 row cuts average 35.3 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 45 row cuts average 9.3 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 +Cbc0038I Before mini branch and bound, 119 integers at bound fixed and 0 continuous +Cbc0038I Full problem 209 rows 200 columns, reduced to 28 rows 37 columns +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -158.25 - took 0.06 seconds +Cbc0012I Integer solution of -158.25 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Full problem 209 rows 200 columns, reduced to 21 rows 22 columns +Cbc0031I 18 added rows had average density of 33.833333 +Cbc0013I At root node, 18 cuts changed objective from -161.59967 to -158.6443 in 9 passes +Cbc0014I Cut generator 0 (Probing) - 48 row cuts average 14.6 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 43 row cuts average 53.5 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 26 row cuts average 10.3 elements, 0 column cuts (0 active) in 0.003 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) - 5 row cuts average 21.4 elements, 0 column cuts (0 active) in 0.002 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 28.0 elements, 0 column cuts (0 active) in 0.001 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) - 185 row cuts average 29.1 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -Cbc0014I Cut generator 7 (ZeroHalf) - 48 row cuts average 21.2 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -216.1499999999999, took 201 iterations and 0 nodes (0.20 seconds) -Cbc0032I Strong branching done 18 times (136 iterations), fathomed 1 nodes and fixed 0 variables -Cbc0035I Maximum depth 0, 81 variables fixed on reduced cost -Cuts at root node changed objective from -220.004 to -214.409 -Probing was tried 10 times and created 8 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -Gomory was tried 10 times and created 40 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) -Knapsack was tried 10 times and created 45 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) -Clique was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 10 times and created 5 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) -FlowCover was tried 10 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 10 times and created 185 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) -ZeroHalf was tried 10 times and created 48 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +Cbc0014I Cut generator 6 (TwoMirCuts) - 135 row cuts average 46.7 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 +Cbc0014I Cut generator 7 (ZeroHalf) - 46 row cuts average 20.2 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 +Cbc0010I After 0 nodes, 1 on tree, -158.25 best solution, best possible -158.55825 (0.13 seconds) +Cbc0001I Search completed - best objective -158.25, took 250 iterations and 2 nodes (0.13 seconds) +Cbc0032I Strong branching done 2 times (6 iterations), fathomed 0 nodes and fixed 0 variables +Cbc0035I Maximum depth 0, 45 variables fixed on reduced cost +Cuts at root node changed objective from -161.6 to -158.558 +Probing was tried 11 times and created 55 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 11 times and created 43 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) +Knapsack was tried 11 times and created 28 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Clique was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 9 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) +FlowCover was tried 9 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 11 times and created 138 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) +ZeroHalf was tried 11 times and created 47 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) Result - Optimal solution found -Objective value: -216.15000000 -Enumerated nodes: 0 -Total iterations: 201 -Time (CPU seconds): 0.19 -Time (Wallclock seconds): 0.20 +Objective value: -158.25000000 +Enumerated nodes: 2 +Total iterations: 250 +Time (CPU seconds): 0.13 +Time (Wallclock seconds): 0.13 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.19 (Wallclock seconds): 0.22 +Total time (CPU seconds): 0.13 (Wallclock seconds): 0.24 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/28f2f7b8b5ed4792ae3a4126fa82d53c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28f2f7b8b5ed4792ae3a4126fa82d53c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/93e3312959024af095d38d1ef3a87ba3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93e3312959024af095d38d1ef3a87ba3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 120 RHS -At line 124 BOUNDS -At line 145 ENDATA -Problem MODEL has 3 rows, 26 columns and 65 elements +At line 121 RHS +At line 125 BOUNDS +At line 146 ENDATA +Problem MODEL has 3 rows, 26 columns and 66 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.465636 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 64.5 iterations 3 -Cbc0038I Solution found of 64.5 -Cbc0038I Relaxing continuous gives 64.5 +Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements +Cbc0038I Initial state - 3 integers unsatisfied sum - 1.14294 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 48.5 iterations 3 +Cbc0038I Solution found of 48.5 +Cbc0038I Relaxing continuous gives 48.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.01 seconds) -Cbc0038I Round again with cutoff of 58.05 -Cbc0038I Pass 2: suminf. 0.02710 (1) obj. 58.05 iterations 1 -Cbc0038I Pass 3: suminf. 0.48508 (1) obj. 58.05 iterations 3 -Cbc0038I Pass 4: suminf. 1.05365 (3) obj. 58.05 iterations 5 -Cbc0038I Pass 5: suminf. 0.42956 (2) obj. 58.05 iterations 3 -Cbc0038I Pass 6: suminf. 0.26517 (1) obj. 58.05 iterations 4 -Cbc0038I Pass 7: suminf. 0.09853 (1) obj. 58.05 iterations 3 -Cbc0038I Pass 8: suminf. 0.41366 (1) obj. 58.05 iterations 3 -Cbc0038I Pass 9: suminf. 0.66764 (2) obj. 58.05 iterations 6 -Cbc0038I Pass 10: suminf. 0.25529 (1) obj. 58.05 iterations 2 -Cbc0038I Pass 11: suminf. 0.00000 (0) obj. 58.05 iterations 2 -Cbc0038I Solution found of 58.05 -Cbc0038I Relaxing continuous gives 50.5 -Cbc0038I Before mini branch and bound, 8 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Mini branch and bound improved solution from 50.5 to 14.5 (0.03 seconds) -Cbc0038I Round again with cutoff of 11.6 -Cbc0038I Pass 12: suminf. 0.25416 (2) obj. 11.6 iterations 1 -Cbc0038I Pass 13: suminf. 0.99146 (3) obj. 11.6 iterations 3 -Cbc0038I Pass 14: suminf. 0.23631 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 15: suminf. 0.23631 (2) obj. 11.6 iterations 0 -Cbc0038I Pass 16: suminf. 0.33996 (2) obj. 11.6 iterations 13 -Cbc0038I Pass 17: suminf. 0.33996 (2) obj. 11.6 iterations 0 -Cbc0038I Pass 18: suminf. 0.67708 (3) obj. 11.6 iterations 3 -Cbc0038I Pass 19: suminf. 0.43120 (1) obj. 11.6 iterations 5 -Cbc0038I Pass 20: suminf. 0.44957 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 21: suminf. 0.59661 (2) obj. 11.6 iterations 5 -Cbc0038I Pass 22: suminf. 0.56873 (3) obj. 11.6 iterations 10 -Cbc0038I Pass 23: suminf. 0.21717 (2) obj. 11.6 iterations 2 -Cbc0038I Pass 24: suminf. 0.37791 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 25: suminf. 0.15241 (1) obj. 11.6 iterations 8 -Cbc0038I Pass 26: suminf. 0.06985 (1) obj. 11.6 iterations 4 -Cbc0038I Pass 27: suminf. 0.33664 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 28: suminf. 0.58966 (3) obj. 11.6 iterations 7 -Cbc0038I Pass 29: suminf. 0.58966 (3) obj. 11.6 iterations 0 -Cbc0038I Pass 30: suminf. 0.64584 (3) obj. 11.6 iterations 9 -Cbc0038I Pass 31: suminf. 0.13560 (1) obj. 11.6 iterations 5 -Cbc0038I Pass 32: suminf. 0.31561 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 33: suminf. 0.61542 (2) obj. 11.6 iterations 7 -Cbc0038I Pass 34: suminf. 0.32932 (1) obj. 11.6 iterations 2 -Cbc0038I Pass 35: suminf. 0.48059 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 36: suminf. 1.16061 (3) obj. 11.6 iterations 9 -Cbc0038I Pass 37: suminf. 0.65492 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 38: suminf. 0.41256 (2) obj. 11.6 iterations 3 -Cbc0038I Pass 39: suminf. 0.65665 (2) obj. 11.6 iterations 4 -Cbc0038I Pass 40: suminf. 0.49201 (3) obj. 11.6 iterations 2 -Cbc0038I Pass 41: suminf. 0.39173 (2) obj. 11.6 iterations 4 +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 43.65 +Cbc0038I Pass 2: suminf. 0.02487 (1) obj. 43.65 iterations 1 +Cbc0038I Pass 3: suminf. 0.51233 (2) obj. 43.65 iterations 3 +Cbc0038I Pass 4: suminf. 0.02487 (1) obj. 43.65 iterations 3 +Cbc0038I Pass 5: suminf. 0.80403 (3) obj. 43.65 iterations 4 +Cbc0038I Pass 6: suminf. 0.14842 (2) obj. 43.65 iterations 4 +Cbc0038I Pass 7: suminf. 0.00822 (1) obj. 43.65 iterations 1 +Cbc0038I Pass 8: suminf. 0.60862 (2) obj. 43.65 iterations 4 +Cbc0038I Pass 9: suminf. 0.11703 (1) obj. 43.65 iterations 3 +Cbc0038I Pass 10: suminf. 0.00000 (0) obj. 43.65 iterations 2 +Cbc0038I Solution found of 43.65 +Cbc0038I Relaxing continuous gives 30.5 +Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0038I Mini branch and bound improved solution from 30.5 to 23.5 (0.01 seconds) +Cbc0038I Round again with cutoff of 18.8 +Cbc0038I Pass 11: suminf. 0.16887 (3) obj. 18.8 iterations 2 +Cbc0038I Pass 12: suminf. 0.85392 (3) obj. 18.8 iterations 5 +Cbc0038I Pass 13: suminf. 0.31988 (1) obj. 18.8 iterations 3 +Cbc0038I Pass 14: suminf. 0.51835 (2) obj. 18.8 iterations 3 +Cbc0038I Pass 15: suminf. 0.41085 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 16: suminf. 0.28705 (2) obj. 18.8 iterations 8 +Cbc0038I Pass 17: suminf. 0.19585 (2) obj. 18.8 iterations 3 +Cbc0038I Pass 18: suminf. 0.57773 (2) obj. 18.8 iterations 4 +Cbc0038I Pass 19: suminf. 0.36940 (1) obj. 18.8 iterations 3 +Cbc0038I Pass 20: suminf. 0.46853 (1) obj. 18.8 iterations 3 +Cbc0038I Pass 21: suminf. 0.65263 (2) obj. 18.8 iterations 5 +Cbc0038I Pass 22: suminf. 0.69833 (3) obj. 18.8 iterations 2 +Cbc0038I Pass 23: suminf. 0.77614 (3) obj. 18.8 iterations 1 +Cbc0038I Pass 24: suminf. 0.44526 (1) obj. 18.8 iterations 4 +Cbc0038I Pass 25: suminf. 0.28460 (2) obj. 18.8 iterations 3 +Cbc0038I Pass 26: suminf. 0.51821 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 27: suminf. 0.21230 (3) obj. 18.8 iterations 10 +Cbc0038I Pass 28: suminf. 0.21230 (3) obj. 18.8 iterations 0 +Cbc0038I Pass 29: suminf. 0.71814 (2) obj. 18.8 iterations 6 +Cbc0038I Pass 30: suminf. 0.06842 (1) obj. 18.8 iterations 4 +Cbc0038I Pass 31: suminf. 0.44936 (2) obj. 18.8 iterations 3 +Cbc0038I Pass 32: suminf. 0.73181 (2) obj. 18.8 iterations 5 +Cbc0038I Pass 33: suminf. 0.52297 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 34: suminf. 0.52562 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 35: suminf. 0.34912 (1) obj. 18.8 iterations 2 +Cbc0038I Pass 36: suminf. 1.33946 (3) obj. 18.8 iterations 6 +Cbc0038I Pass 37: suminf. 0.77459 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 38: suminf. 0.55907 (2) obj. 18.8 iterations 3 +Cbc0038I Pass 39: suminf. 0.75686 (2) obj. 18.8 iterations 2 +Cbc0038I Pass 40: suminf. 1.00409 (3) obj. 18.8 iterations 7 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns -Cbc0038I Mini branch and bound improved solution from 14.5 to 10.5 (0.06 seconds) +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 23.5 to 10.5 (0.02 seconds) Cbc0038I Round again with cutoff of 7.34999 -Cbc0038I Pass 41: suminf. 0.28325 (3) obj. 7.34999 iterations 1 -Cbc0038I Pass 42: suminf. 0.78031 (3) obj. 7.34999 iterations 4 -Cbc0038I Pass 43: suminf. 0.26497 (2) obj. 7.34999 iterations 4 -Cbc0038I Pass 44: suminf. 0.78031 (3) obj. 7.34999 iterations 3 -Cbc0038I Pass 45: suminf. 0.55417 (2) obj. 7.34999 iterations 9 -Cbc0038I Pass 46: suminf. 0.07393 (2) obj. 7.34999 iterations 3 -Cbc0038I Pass 47: suminf. 0.49113 (2) obj. 7.34999 iterations 5 -Cbc0038I Pass 48: suminf. 0.49113 (2) obj. 7.34999 iterations 0 -Cbc0038I Pass 49: suminf. 0.72057 (3) obj. 7.34999 iterations 3 -Cbc0038I Pass 50: suminf. 0.71208 (3) obj. 7.34999 iterations 1 -Cbc0038I Pass 51: suminf. 0.93623 (3) obj. 7.34999 iterations 4 -Cbc0038I Pass 52: suminf. 0.93623 (3) obj. 7.34999 iterations 0 -Cbc0038I Pass 53: suminf. 0.59780 (3) obj. 7.34999 iterations 2 -Cbc0038I Pass 54: suminf. 0.26440 (2) obj. 7.34999 iterations 4 -Cbc0038I Pass 55: suminf. 0.45448 (3) obj. 7.34999 iterations 4 -Cbc0038I Pass 56: suminf. 0.27993 (3) obj. 7.34999 iterations 2 -Cbc0038I Pass 57: suminf. 0.19256 (2) obj. 7.34999 iterations 7 -Cbc0038I Pass 58: suminf. 0.14954 (1) obj. 7.34999 iterations 2 -Cbc0038I Pass 59: suminf. 0.64434 (2) obj. 7.34999 iterations 4 -Cbc0038I Pass 60: suminf. 0.57049 (3) obj. 7.34999 iterations 2 -Cbc0038I Pass 61: suminf. 0.25684 (3) obj. 7.34999 iterations 2 -Cbc0038I Pass 62: suminf. 1.22242 (3) obj. 7.34999 iterations 3 -Cbc0038I Pass 63: suminf. 0.56963 (3) obj. 7.34999 iterations 2 -Cbc0038I Pass 64: suminf. 0.46313 (2) obj. 7.34999 iterations 5 -Cbc0038I Pass 65: suminf. 1.27064 (3) obj. 7.34999 iterations 5 -Cbc0038I Pass 66: suminf. 1.13013 (3) obj. 7.34999 iterations 1 -Cbc0038I Pass 67: suminf. 0.40217 (2) obj. 7.34999 iterations 3 -Cbc0038I Pass 68: suminf. 0.21481 (2) obj. 7.34999 iterations 5 -Cbc0038I Pass 69: suminf. 0.50273 (3) obj. 7.34999 iterations 4 -Cbc0038I Pass 70: suminf. 0.50273 (3) obj. 7.34999 iterations 0 +Cbc0038I Pass 40: suminf. 0.39391 (3) obj. 7.34999 iterations 1 +Cbc0038I Pass 41: suminf. 0.98118 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 42: suminf. 0.75143 (3) obj. 7.34999 iterations 1 +Cbc0038I Pass 43: suminf. 1.00243 (3) obj. 7.34999 iterations 1 +Cbc0038I Pass 44: suminf. 0.78596 (3) obj. 7.34999 iterations 11 +Cbc0038I Pass 45: suminf. 0.43760 (2) obj. 7.34999 iterations 2 +Cbc0038I Pass 46: suminf. 0.66829 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 47: suminf. 0.55617 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 48: suminf. 1.10203 (3) obj. 7.34999 iterations 3 +Cbc0038I Pass 49: suminf. 1.10203 (3) obj. 7.34999 iterations 0 +Cbc0038I Pass 50: suminf. 0.71886 (2) obj. 7.34999 iterations 4 +Cbc0038I Pass 51: suminf. 0.71886 (2) obj. 7.34999 iterations 0 +Cbc0038I Pass 52: suminf. 0.77543 (2) obj. 7.34999 iterations 4 +Cbc0038I Pass 53: suminf. 0.52432 (3) obj. 7.34999 iterations 3 +Cbc0038I Pass 54: suminf. 0.76079 (2) obj. 7.34999 iterations 2 +Cbc0038I Pass 55: suminf. 0.80041 (3) obj. 7.34999 iterations 4 +Cbc0038I Pass 56: suminf. 0.35272 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 57: suminf. 0.27892 (3) obj. 7.34999 iterations 7 +Cbc0038I Pass 58: suminf. 1.16000 (3) obj. 7.34999 iterations 4 +Cbc0038I Pass 59: suminf. 0.60049 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 60: suminf. 0.33439 (3) obj. 7.34999 iterations 6 +Cbc0038I Pass 61: suminf. 0.12253 (2) obj. 7.34999 iterations 3 +Cbc0038I Pass 62: suminf. 0.19986 (2) obj. 7.34999 iterations 2 +Cbc0038I Pass 63: suminf. 0.70596 (3) obj. 7.34999 iterations 10 +Cbc0038I Pass 64: suminf. 0.70596 (3) obj. 7.34999 iterations 0 +Cbc0038I Pass 65: suminf. 1.21291 (3) obj. 7.34999 iterations 3 +Cbc0038I Pass 66: suminf. 0.77028 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 67: suminf. 1.01539 (3) obj. 7.34999 iterations 2 +Cbc0038I Pass 68: suminf. 0.62397 (3) obj. 7.34999 iterations 3 +Cbc0038I Pass 69: suminf. 0.44830 (3) obj. 7.34999 iterations 3 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 did not improve solution (0.09 seconds) -Cbc0038I After 0.09 seconds - Feasibility pump exiting with objective of 10.5 - took 0.08 seconds -Cbc0012I Integer solution of 10.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 14 columns -Cbc0031I 3 added rows had average density of 23 -Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 576 row cuts average 26.0 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 325 row cuts average 11.1 elements, 0 column cuts (0 active) in 0.031 seconds - new frequency is -100 +Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns +Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) +Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 10.5 - took 0.03 seconds +Cbc0012I Integer solution of 10.5 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0031I 4 added rows had average density of 16.25 +Cbc0013I At root node, 4 cuts changed objective from 0 to 0 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 554 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 368 row cuts average 11.4 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 549 row cuts average 18.8 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 61 row cuts average 8.8 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 360 row cuts average 18.3 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 -Cbc0010I After 0 nodes, 1 on tree, 10.5 best solution, best possible 0 (0.27 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0012I Integer solution of 9.5 found by rounding after 1155 iterations and 57 nodes (0.31 seconds) -Cbc0012I Integer solution of 7.5 found by rounding after 1285 iterations and 83 nodes (0.32 seconds) -Cbc0016I Integer solution of 4.5 found by strong branching after 1342 iterations and 89 nodes (0.33 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 471 row cuts average 18.7 elements, 0 column cuts (0 active) in 0.007 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 68 row cuts average 9.5 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 358 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 10.5 best solution, best possible 0 (0.12 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 +Cbc0012I Integer solution of 6.5 found by rounding after 1203 iterations and 96 nodes (0.14 seconds) +Cbc0016I Integer solution of 1.5 found by strong branching after 1584 iterations and 190 nodes (0.16 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0004I Integer solution of 3.5 found after 4660 iterations and 997 nodes (0.80 seconds) -Cbc0010I After 1000 nodes, 7 on tree, 3.5 best solution, best possible 0 (0.80 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 15 columns -Cbc0010I After 2000 nodes, 6 on tree, 3.5 best solution, best possible 0 (1.44 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0001I Search completed - best objective 3.499999999999943, took 25832 iterations and 9779 nodes (1.70 seconds) -Cbc0032I Strong branching done 10380 times (23735 iterations), fathomed 549 nodes and fixed 610 variables -Cbc0041I Maximum depth 14, 1080 variables fixed on reduced cost (complete fathoming 649 times, 7241 nodes taking 15487 iterations) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0010I After 1000 nodes, 9 on tree, 1.5 best solution, best possible 0 (0.33 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0010I After 2000 nodes, 6 on tree, 1.5 best solution, best possible 0 (0.54 seconds) +Cbc0001I Search completed - best objective 1.5, took 33901 iterations and 15723 nodes (0.69 seconds) +Cbc0032I Strong branching done 10626 times (21875 iterations), fathomed 516 nodes and fixed 621 variables +Cbc0041I Maximum depth 13, 557 variables fixed on reduced cost (complete fathoming 774 times, 13013 nodes taking 25039 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -Gomory was tried 100 times and created 576 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) -Knapsack was tried 100 times and created 325 cuts of which 0 were active after adding rounds of cuts (0.031 seconds) +Probing was tried 100 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 100 times and created 554 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Knapsack was tried 100 times and created 368 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) -MixedIntegerRounding2 was tried 100 times and created 549 cuts of which 0 were active after adding rounds of cuts (0.017 seconds) -FlowCover was tried 100 times and created 61 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) -TwoMirCuts was tried 100 times and created 360 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +MixedIntegerRounding2 was tried 100 times and created 471 cuts of which 0 were active after adding rounds of cuts (0.007 seconds) +FlowCover was tried 100 times and created 68 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +TwoMirCuts was tried 100 times and created 358 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 3.50000000 -Enumerated nodes: 9779 -Total iterations: 25832 -Time (CPU seconds): 1.62 -Time (Wallclock seconds): 1.71 +Objective value: 1.50000000 +Enumerated nodes: 15723 +Total iterations: 33901 +Time (CPU seconds): 0.67 +Time (Wallclock seconds): 0.69 Option for printingOptions changed from normal to all -Total time (CPU seconds): 1.62 (Wallclock seconds): 1.71 +Total time (CPU seconds): 0.67 (Wallclock seconds): 0.69 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6058c44bf28f4de6a8d3a66a13e6a163-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6058c44bf28f4de6a8d3a66a13e6a163-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/28a6f33613d048daa0e53e2cf7664d11-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28a6f33613d048daa0e53e2cf7664d11-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6598,7 +6473,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/88ac2e9ee3af424a9816b35b904ed30c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88ac2e9ee3af424a9816b35b904ed30c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/77aa5057e3a7432592361a847c79c603-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77aa5057e3a7432592361a847c79c603-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6625,24 +6500,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/710fa54931c34393afda495be60c5a55-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/710fa54931c34393afda495be60c5a55-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/21b2c6d2609b4efc957eef21337d6e86-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21b2c6d2609b4efc957eef21337d6e86-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 14 COLUMNS -At line 85 RHS -At line 95 BOUNDS -At line 113 ENDATA -Problem MODEL has 9 rows, 14 columns and 28 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 15005 - 0.00 seconds -Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements -Cutoff increment increased from 1e-05 to 0.024975 -Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 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 15005 to 15005 +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) @@ -6654,7 +6528,7 @@ Result - Optimal solution found -Objective value: 15005.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -6667,20 +6541,23 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/18867122070142adb67969c59e0a26bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18867122070142adb67969c59e0a26bd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/15bdc9453ead4314a19c3e22fcdd821b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/15bdc9453ead4314a19c3e22fcdd821b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 358 COLUMNS -At line 4763 RHS -At line 5117 BOUNDS -At line 5848 ENDATA -Problem MODEL has 353 rows, 730 columns and 2945 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0 to -1.79769e+308 +Continuous objective value is 8630 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8630 to 8630 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6692,20 +6569,20 @@ Result - Optimal solution found -Objective value: 0.00000000 +Objective value: 8630.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 -Time (Wallclock seconds): 0.02 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/82c705510b4b4eb9b5b8072abd87e2d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82c705510b4b4eb9b5b8072abd87e2d5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/09708cbde9fe45aba0efcb7ed58c5ee1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/09708cbde9fe45aba0efcb7ed58c5ee1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -6715,13 +6592,13 @@ Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds +Continuous objective value is 8660 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Cuts at root node changed objective from 8660 to 8660 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6733,80 +6610,77 @@ Result - Optimal solution found -Objective value: 8600.00000000 +Objective value: 8660.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5561169c04214d86b78822c1ff2e1da4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5561169c04214d86b78822c1ff2e1da4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/13c8f18761e9463d882bc621c3d9f5fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13c8f18761e9463d882bc621c3d9f5fd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 10 COLUMNS -At line 42 RHS -At line 48 BOUNDS -At line 49 ENDATA -Problem MODEL has 5 rows, 6 columns and 25 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements -0 Obj 0 Primal inf 405.05674 (3) -2 Obj 0.52 -Optimal - objective value 0.52 -Optimal objective 0.52 - 2 iterations time 0.002 -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Continuous objective value is 8690 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8690 to 8690 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Result - Optimal solution found + +Objective value: 8690.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/3fac90bc8e5e42c49162fcac87333007-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fac90bc8e5e42c49162fcac87333007-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 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9ac6f5c79774494e80acb60f8e4350d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ac6f5c79774494e80acb60f8e4350d0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6ed1662aad6d4ce9be952dbf8d165af6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6ed1662aad6d4ce9be952dbf8d165af6-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.6 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.03996 -Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8720 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.6 to -1.6 +Cuts at root node changed objective from 8720 to 8720 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6818,34 +6692,53 @@ Result - Optimal solution found -Objective value: -1.60000000 +Objective value: 8720.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2e6739c5f6784fd9afe3b9a60fff0b89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e6739c5f6784fd9afe3b9a60fff0b89-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fd56cee26896412896af05c967ddbc64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd56cee26896412896af05c967ddbc64-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 8 COLUMNS -At line 23 RHS -At line 27 BOUNDS -At line 28 ENDATA -Problem MODEL has 3 rows, 7 columns and 7 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements -Empty problem - 0 rows, 0 columns and 0 elements -Optimal - objective value 301.5 -After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) -Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 +Continuous objective value is 8750 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8750 to 8750 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 8750.00000000 +Enumerated nodes: 0 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 + Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 @@ -6853,97 +6746,64 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e550d3cc9587436b8ce0c89c9a8faccf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e550d3cc9587436b8ce0c89c9a8faccf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/28023b4c10e24bac8c0e78eddafda09d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/28023b4c10e24bac8c0e78eddafda09d-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.37143 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) -Cbc0031I 2 added rows had average density of 3 -Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8780 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.33333 to -1.25 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8780 to 8780 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.25000000 +Objective value: 8780.00000000 Enumerated nodes: 0 -Total iterations: 2 +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.20 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/bf166b207e454313b4399b8e0ca55cfa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bf166b207e454313b4399b8e0ca55cfa-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/938a1c4e8a6a48d78cc952ab767f4b20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/938a1c4e8a6a48d78cc952ab767f4b20-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/31b6c79b69cb41e6a62ac39b905ac1dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/31b6c79b69cb41e6a62ac39b905ac1dc-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 8810 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.22143 to -1.22143 +Cuts at root node changed objective from 8810 to 8810 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6955,165 +6815,118 @@ Result - Optimal solution found -Objective value: -1.20000000 +Objective value: 8810.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/640ddc4590444afe91cfdecd55287322-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/640ddc4590444afe91cfdecd55287322-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/35afefb41cb142db8b03faaa3f0e0e7e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/35afefb41cb142db8b03faaa3f0e0e7e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bcf7df1d36704d2582b1236adb675026-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcf7df1d36704d2582b1236adb675026-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 6 COLUMNS -At line 23 RHS -At line 25 BOUNDS -At line 30 ENDATA -Problem MODEL has 1 rows, 4 columns and 4 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -1.02222 - 0.00 seconds -Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements -Cutoff increment increased from 1e-05 to 0.004995 -Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 2 -Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 8840 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from -1.02143 to -1 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cuts at root node changed objective from 8840 to 8840 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: -1.00000000 +Objective value: 8840.00000000 Enumerated nodes: 0 -Total iterations: 6 +Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/73dd2145bd774bdf85a5ee23f4f182e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73dd2145bd774bdf85a5ee23f4f182e5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/57da8e312cb34fd3ac0b65f046461c06-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/57da8e312cb34fd3ac0b65f046461c06-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 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 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.01 seconds) -Cbc0031I 1 added rows had average density of 4 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +Continuous objective value is 8870 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 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 8870 to 8870 +Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 246.50000000 +Objective value: 8870.00000000 Enumerated nodes: 0 -Total iterations: 1 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Total iterations: 0 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ff9e9d2199aa4fe3a1a0db5f350af2f8-pulp.mps mips /tmp/ff9e9d2199aa4fe3a1a0db5f350af2f8-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/ff9e9d2199aa4fe3a1a0db5f350af2f8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/414070dcb6de4dfcb61769f41b9b78f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/414070dcb6de4dfcb61769f41b9b78f7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements +At line 12 COLUMNS +At line 63 RHS +At line 71 BOUNDS +At line 82 ENDATA +Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/ff9e9d2199aa4fe3a1a0db5f350af2f8-pulp.mst. -MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.00 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements +Continuous objective value is 8900 - 0.00 seconds +Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 -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 +Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from 8900 to 8900 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7125,20 +6938,20 @@ Result - Optimal solution found -Objective value: 12.00000000 +Objective value: 8900.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (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/aaafe83189d6407c9b303420e22911d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaafe83189d6407c9b303420e22911d7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2c90ad12ec4541fc99b5dcf338ce9749-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2c90ad12ec4541fc99b5dcf338ce9749-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7180,71 +6993,26 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/88b44a4fde8a43098bae8add4b632321-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88b44a4fde8a43098bae8add4b632321-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e9eaf86014c04269885186397ecc1c9a-pulp.mps mips /tmp/e9eaf86014c04269885186397ecc1c9a-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/e9eaf86014c04269885186397ecc1c9a-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 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/e9eaf86014c04269885186397ecc1c9a-pulp.mst. +MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 218829 - 0.00 seconds -Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.01 seconds) -Cbc0031I 3 added rows had average density of 4 -Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.01 seconds) -Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost -Cuts at root node changed objective from 218829 to 228100 -Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 228100.00000000 -Enumerated nodes: 0 -Total iterations: 13 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/5716e0f98670478ba3a21a1f75d9a105-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5716e0f98670478ba3a21a1f75d9a105-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 10 COLUMNS -At line 25 RHS -At line 31 BOUNDS -At line 33 ENDATA -Problem MODEL has 5 rows, 2 columns and 10 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 0.966667 - 0.00 seconds -Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements -Cbc3007W No integer variables - nothing to do -Cuts at root node changed objective from 0.97 to -1.79769e+308 +Cbc0045I MIPStart provided solution with cost 12 +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.04 seconds) +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0045I Solution of 12 already found by heuristic +Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7256,20 +7024,20 @@ Result - Optimal solution found -Objective value: 0.97000000 +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.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.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/16a2aa5170744c26b4a690dab1275732-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/16a2aa5170744c26b4a690dab1275732-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fbb7a57e77924d4d894813536d18e9a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fbb7a57e77924d4d894813536d18e9a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -7286,10 +7054,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.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) +Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) +Cbc0038I After 0.01 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7306,17 +7074,17 @@ 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.03 (Wallclock seconds): 0.03 +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/9a417bebb9904efc88122f6500426265-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a417bebb9904efc88122f6500426265-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/2782f0d9fe1e4a979a60faff42d6cc39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2782f0d9fe1e4a979a60faff42d6cc39-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -7339,10 +7107,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.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) @@ -7359,17 +7127,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d3f41fd90b1241419574ff73706291c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d3f41fd90b1241419574ff73706291c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b3ed237b0df64ba3b677d3de0a8dbbea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3ed237b0df64ba3b677d3de0a8dbbea-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -7394,10 +7162,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.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.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) @@ -7414,17 +7182,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.08 +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.09 +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/30334c89b2d84759bbbf6bd0a2760039-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30334c89b2d84759bbbf6bd0a2760039-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8322ddda3bc64ea0b4e7dd7648945cd0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8322ddda3bc64ea0b4e7dd7648945cd0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -7449,10 +7217,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 23 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -7469,17 +7237,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.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 +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/5579215a2a2d4c80a0055484601df40e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5579215a2a2d4c80a0055484601df40e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/59efb5420d4e435ab63695dc8efe59b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/59efb5420d4e435ab63695dc8efe59b2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -7502,10 +7270,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 1 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -7522,17 +7290,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.04 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/5f441ab50b42479f97d102b7cd5ab118-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f441ab50b42479f97d102b7cd5ab118-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/69dc3d65670b4f77a5ecec0154eae544-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/69dc3d65670b4f77a5ecec0154eae544-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -7555,10 +7323,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -7575,17 +7343,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.04 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/e0f2a49628f14367b0831a0db32e51c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0f2a49628f14367b0831a0db32e51c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0c4283b2e61f4f439d22ae9263dad819-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0c4283b2e61f4f439d22ae9263dad819-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -7609,10 +7377,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -7629,17 +7397,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.04 +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.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/42c036e988bd40858599f01c771ae8ca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42c036e988bd40858599f01c771ae8ca-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/530b7fa135b943c6a165b2042c95d4b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/530b7fa135b943c6a165b2042c95d4b2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -7662,10 +7430,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.09 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) @@ -7682,17 +7450,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.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 +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/400c655a2f34417b85656838c10c4a03-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/400c655a2f34417b85656838c10c4a03-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/11ce82fc9912489fa4abfb72eed89ae7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/11ce82fc9912489fa4abfb72eed89ae7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -7712,10 +7480,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.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) @@ -7732,17 +7500,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.04 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.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f74adfad1fb842ad9beeb9ac37d7a1d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f74adfad1fb842ad9beeb9ac37d7a1d5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ecd452e0036440c2bbeb26a257b6aeb2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ecd452e0036440c2bbeb26a257b6aeb2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -7761,10 +7529,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) -Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7781,17 +7549,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.03 +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.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a99048dbb5164e74a879573a83faff4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a99048dbb5164e74a879573a83faff4c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/88df4bdc0c7449ceac005a5ea568e38d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88df4bdc0c7449ceac005a5ea568e38d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -7820,17 +7588,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 3 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.18 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c41ce4c20cae424e86dd7d219b0fedd7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c41ce4c20cae424e86dd7d219b0fedd7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/01ed64fb251e4e2f9734dd3db6e2ee94-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/01ed64fb251e4e2f9734dd3db6e2ee94-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -7862,17 +7630,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +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.08 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/10424a5d982644378148386a640b7aab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10424a5d982644378148386a640b7aab-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b5ea77ed2c99470989988963efc95b2d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b5ea77ed2c99470989988963efc95b2d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -7921,8 +7689,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.09 seconds) -Cbc0038I After 0.09 seconds - Feasibility pump exiting - took 0.00 seconds +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -7933,7 +7701,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.09 seconds) +Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.04 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7950,51 +7718,28 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.09 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 -command line - /usr/bin/cbc /tmp/130ded7128e14f128eab232a20d3a1fc-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/130ded7128e14f128eab232a20d3a1fc-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 7 COLUMNS -At line 14 RHS -At line 17 BOUNDS -At line 18 ENDATA -Problem MODEL has 2 rows, 2 columns and 4 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements -0 Obj -0 Dual inf 250 (2) -0 Obj -0 Dual inf 250 (2) -2 Obj 3200 -Optimal - objective value 3200 -Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +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/7962e02d370e4a12952b6b85e2c22207-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7962e02d370e4a12952b6b85e2c22207-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ef890104e5ac428b853fe36efe8d7e04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef890104e5ac428b853fe36efe8d7e04-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 13 COLUMNS +At line 72 RHS +At line 81 BOUNDS +At line 94 ENDATA +Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) @@ -8024,23 +7769,42 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/eeae2a0139e94aa9ab88fb23f8bc0174-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eeae2a0139e94aa9ab88fb23f8bc0174-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ddb401ebfefa44508905cadf204c310b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ddb401ebfefa44508905cadf204c310b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 10 COLUMNS +At line 42 RHS +At line 48 BOUNDS +At line 49 ENDATA +Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8630 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8630 to 8630 +Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements +0 Obj 0 Primal inf 405.05674 (3) +2 Obj 0.52 +Optimal - objective value 0.52 +Optimal objective 0.52 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/8d3ff542dd934c04919a040aa00db98a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8d3ff542dd934c04919a040aa00db98a-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 358 COLUMNS +At line 4763 RHS +At line 5117 BOUNDS +At line 5848 ENDATA +Problem MODEL has 353 rows, 730 columns and 2945 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 0 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8052,36 +7816,504 @@ Result - Optimal solution found -Objective value: 8630.00000000 +Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/e1dbb3e9bc0e416f8b84272a3e7c60b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e1dbb3e9bc0e416f8b84272a3e7c60b7-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 110 RHS +At line 119 BOUNDS +At line 140 ENDATA +Problem MODEL has 8 rows, 20 columns and 36 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 218829 - 0.00 seconds +Cgl0004I processed model has 8 rows, 20 columns (20 integer (4 of which binary)) and 36 elements +Cutoff increment increased from 1e-05 to 0.9999 +Cbc0012I Integer solution of 230300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 13 iterations and 0 nodes (0.00 seconds) +Cbc0031I 3 added rows had average density of 4 +Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0001I Search completed - best objective 228100, took 13 iterations and 0 nodes (0.00 seconds) +Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost +Cuts at root node changed objective from 218829 to 228100 +Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) + +Result - Optimal solution found + +Objective value: 228100.00000000 +Enumerated nodes: 0 +Total iterations: 13 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 +/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' + """ +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 = 1.0 +x_3 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 1.0 +x_7 = 1.0 +x_8 = 0.0 +x_9 = 1.0 +Status: Optimal +s_0 = 0.0 +s_1 = 0.0 +s_2 = 0.0 +w_0 = 0.5 +w_1 = 0.0 +w_2 = 1.0 +x_0 = 1.0 +x_1 = 0.0 +x_10 = 0.0 +x_11 = 1.0 +x_12 = 0.0 +x_13 = 1.0 +x_14 = 0.0 +x_15 = 1.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 = 1.0 +x_7 = 1.0 +x_8 = 0.0 +x_9 = 0.0 +objective= 1.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 items passed all tests: + 8 tests in pulp +8 tests in 1 items. +8 passed and 0 failed. +Test passed. +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 210.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8630.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 220.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8660.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 230.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8690.0 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 240.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 270.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 = 8810.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 = 280.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 = 8840.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 = 290.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 = 8870.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 = 300.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 = 8900.0 +Status: Optimal +Patt_A = 225.0 +Patt_B = 0.0 +Patt_C = 75.0 +Production Costs = 300.0 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Optimal +Status: Infeasible +Solutions Written to sudokuout.txt +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_A_D = 0.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_B_D = 900.0 +Total Cost of Transportation = 8600.0 +Status: Optimal +Ingr_BEEF = 60.0 +Ingr_CHICKEN = 0.0 +Ingr_GEL = 40.0 +Ingr_MUTTON = 0.0 +Ingr_RICE = 0.0 +Ingr_WHEAT = 0.0 +Total Cost of Ingredients per can = 0.52 +Status: Optimal +Solution Written to sudokuout.txt +Status: Optimal +BuildaPlant_Denver = 0.0 +BuildaPlant_Los_Angeles = 1.0 +BuildaPlant_Phoenix = 1.0 +BuildaPlant_San_Francisco = 1.0 +Route_Denver_Barstow = 0.0 +Route_Denver_Dallas = 0.0 +Route_Denver_San_Diego = 0.0 +Route_Denver_Tucson = 0.0 +Route_Los_Angeles_Barstow = 0.0 +Route_Los_Angeles_Dallas = 300.0 +Route_Los_Angeles_San_Diego = 1700.0 +Route_Los_Angeles_Tucson = 0.0 +Route_Phoenix_Barstow = 0.0 +Route_Phoenix_Dallas = 200.0 +Route_Phoenix_San_Diego = 0.0 +Route_Phoenix_Tucson = 1500.0 +Route_San_Francisco_Barstow = 1000.0 +Route_San_Francisco_Dallas = 700.0 +Route_San_Francisco_San_Diego = 0.0 +Route_San_Francisco_Tucson = 0.0 +Total Costs = 228100.0 +The_Gemstone_Tool_Problem: +MAXIMIZE +25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 +SUBJECT TO +Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches + - steelpurchase <= 0 + +molding_capacity0: production_0_pliers + production_0_wrenches <= 21 + +assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 + +capacity_wrenches0: production_0_wrenches <= 15 + +capacity_pliers0: production_0_pliers <= 16 + +Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches + - steelpurchase <= 0 + +molding_capacity1: production_1_pliers + production_1_wrenches <= 21 + +assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 + +capacity_wrenches1: production_1_wrenches <= 15 + +capacity_pliers1: production_1_pliers <= 16 + +Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches + - steelpurchase <= 0 + +molding_capacity2: production_2_pliers + production_2_wrenches <= 21 + +assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 + +capacity_wrenches2: production_2_wrenches <= 15 + +capacity_pliers2: production_2_pliers <= 16 + +Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches + - steelpurchase <= 0 + +molding_capacity3: production_3_pliers + production_3_wrenches <= 21 + +assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 + +capacity_wrenches3: production_3_wrenches <= 15 + +capacity_pliers3: production_3_pliers <= 16 + +VARIABLES +production_0_pliers Continuous +production_0_wrenches Continuous +production_1_pliers Continuous +production_1_wrenches Continuous +production_2_pliers Continuous +production_2_wrenches Continuous +production_3_pliers Continuous +production_3_wrenches Continuous +steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/898a5893bcca413fb1bb47dec2383e8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/898a5893bcca413fb1bb47dec2383e8a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ac8d4a0b8ccf4cec9b23c8816d88e12f-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/ac8d4a0b8ccf4cec9b23c8816d88e12f-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 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 -Continuous objective value is 8660 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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/1e04fe66799447299f8bd5b669b074fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1e04fe66799447299f8bd5b669b074fa-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 23 COLUMNS +At line 24708 RHS +At line 24727 BOUNDS +At line 27941 ENDATA +Problem MODEL has 18 rows, 3213 columns and 15062 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 12 - 0.00 seconds +Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Initial state - 0 integers unsatisfied sum - 0 +Cbc0038I Solution found of 12 +Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous +Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds +Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8660 to 8660 +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) @@ -8093,20 +8325,20 @@ Result - Optimal solution found -Objective value: 8660.00000000 +Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (CPU seconds): 0.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.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/77f80db965474c7c84a9db25aa9e3783-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/77f80db965474c7c84a9db25aa9e3783-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d6448727be644832b47352e3800dcff2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d6448727be644832b47352e3800dcff2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8116,13 +8348,13 @@ Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8690 - 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 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) +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 8690 to 8690 +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) @@ -8134,7 +8366,7 @@ Result - Optimal solution found -Objective value: 8690.00000000 +Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8147,23 +8379,45 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/74659f926056452d9b531b0c99748670-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/74659f926056452d9b531b0c99748670-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/70c97a4e2b3a412cbd6727feeabb6bf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70c97a4e2b3a412cbd6727feeabb6bf2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 21 RHS +At line 25 BOUNDS +At line 26 ENDATA +Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8720 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) +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/9d9917fafffa4d97bca9f066770025d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9d9917fafffa4d97bca9f066770025d9-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 8720 to 8720 +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) @@ -8175,7 +8429,7 @@ Result - Optimal solution found -Objective value: 8720.00000000 +Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8188,64 +8442,119 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cde1e06f684c4af1bf30cf4e683575c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cde1e06f684c4af1bf30cf4e683575c9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8320d13c0b8f4d41b1913a0e6678f07c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8320d13c0b8f4d41b1913a0e6678f07c-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 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 8750 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8750, took 0 iterations and 0 nodes (0.00 seconds) +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/97826a79a07b4c609c22240de2d4322f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97826a79a07b4c609c22240de2d4322f-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 8750 to 8750 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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.001 seconds) Result - Optimal solution found -Objective value: 8750.00000000 +Objective value: -1.25000000 Enumerated nodes: 0 -Total iterations: 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.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/3fca6e5e2c8443c7b3d1e8121a62dce2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3fca6e5e2c8443c7b3d1e8121a62dce2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6e5d0f3753b44e3ebaf2ebaed4defe07-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e5d0f3753b44e3ebaf2ebaed4defe07-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 26 RHS +At line 30 BOUNDS +At line 31 ENDATA +Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8780 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) +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/c747e522c2924f09b08540315c62556b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c747e522c2924f09b08540315c62556b-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 8780 to 8780 +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) @@ -8257,7 +8566,7 @@ Result - Optimal solution found -Objective value: 8780.00000000 +Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8270,37 +8579,69 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/21aa5eb060d64d549262221da60f3c63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/21aa5eb060d64d549262221da60f3c63-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9ff5926f1259403fbdb53faad36cea63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ff5926f1259403fbdb53faad36cea63-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 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 8810 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) +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.18 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/36f06b67514d4a9ca257be160067fe24-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/36f06b67514d4a9ca257be160067fe24-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 6 COLUMNS +At line 23 RHS +At line 25 BOUNDS +At line 30 ENDATA +Problem MODEL has 1 rows, 4 columns and 4 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is -1.02222 - 0.00 seconds +Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements +Cutoff increment increased from 1e-05 to 0.004995 +Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 2 +Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8810 to 8810 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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: 8810.00000000 +Objective value: -1.00000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 @@ -8311,23 +8652,76 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9740e6d4042e4683b7fbaf26f81edc16-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9740e6d4042e4683b7fbaf26f81edc16-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/04e0632930c14c92a6a01b3ef2abdc88-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/04e0632930c14c92a6a01b3ef2abdc88-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 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 8840 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements +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.001 seconds) + +Result - Optimal solution found + +Objective value: 246.50000000 +Enumerated nodes: 0 +Total iterations: 1 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.01 + +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/58d27599499b441dbb97e37d69a84af4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/58d27599499b441dbb97e37d69a84af4-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 13 COLUMNS +At line 84 RHS +At line 93 BOUNDS +At line 109 ENDATA +Problem MODEL has 8 rows, 15 columns and 30 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 8300 - 0.00 seconds +Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8840, took 0 iterations and 0 nodes (0.00 seconds) +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 8840 to 8840 +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) @@ -8339,7 +8733,7 @@ Result - Optimal solution found -Objective value: 8840.00000000 +Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8352,64 +8746,77 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9ce1d37f6b9f43d7beaf8852000f7d60-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ce1d37f6b9f43d7beaf8852000f7d60-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ff1a14bc64b24667a05b0f0a14513734-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff1a14bc64b24667a05b0f0a14513734-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 12 COLUMNS -At line 63 RHS -At line 71 BOUNDS -At line 82 ENDATA -Problem MODEL has 7 rows, 10 columns and 20 elements +At line 8 COLUMNS +At line 86 RHS +At line 90 BOUNDS +At line 109 ENDATA +Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8870 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8870, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 246.5 - 0.00 seconds +Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) +Cbc0031I 1 added rows had average density of 14 +Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes +Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 +Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8870 to 8870 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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: 8870.00000000 +Objective value: 246.50000000 Enumerated nodes: 0 -Total iterations: 0 +Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.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/a5718593b60c41368d9e389aa42129f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a5718593b60c41368d9e389aa42129f2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/24bb8ed4ebc64649908b121e72f98d87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/24bb8ed4ebc64649908b121e72f98d87-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 8900 - 0.00 seconds -Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8900 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8900, took 0 iterations and 0 nodes (0.00 seconds) +Continuous objective value is 251.5 - 0.00 seconds +Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements +Cutoff increment increased from 1e-05 to 0.00999 +Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8900 to 8900 +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) @@ -8421,7 +8828,7 @@ Result - Optimal solution found -Objective value: 8900.00000000 +Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8434,23 +8841,47 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/090e9ca9d3b44c52b94f9783772b92f3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/090e9ca9d3b44c52b94f9783772b92f3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7e8fad8ce7134634add3c87fc8a3c005-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7e8fad8ce7134634add3c87fc8a3c005-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 7 COLUMNS +At line 14 RHS +At line 17 BOUNDS +At line 18 ENDATA +Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8300 - 0.00 seconds -Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) +Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements +0 Obj -0 Dual inf 250 (2) +0 Obj -0 Dual inf 250 (2) +2 Obj 3200 +Optimal - objective value 3200 +Optimal objective 3200 - 2 iterations time 0.002 +Option for printingOptions changed from normal to all +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 + +Welcome to the CBC MILP Solver +Version: 2.10.12 +Build Date: Sep 17 2024 + +command line - /usr/bin/cbc /tmp/309c0970d5e945c49256422735aca24c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/309c0970d5e945c49256422735aca24c-pulp.sol (default strategy 1) +At line 2 NAME MODEL +At line 3 ROWS +At line 14 COLUMNS +At line 85 RHS +At line 95 BOUNDS +At line 113 ENDATA +Problem MODEL has 9 rows, 14 columns and 28 elements +Coin0008I MODEL read with 0 errors +Option for timeMode changed from cpu to elapsed +Continuous objective value is 15005 - 0.00 seconds +Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions +Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements +Cutoff increment increased from 1e-05 to 0.024975 +Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8300 to 8300 +Cuts at root node changed objective from 15005 to 15005 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8462,7 +8893,7 @@ Result - Optimal solution found -Objective value: 8300.00000000 +Objective value: 15005.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 @@ -8475,7 +8906,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f4c7d859e1a24adabc163bc1865dffc7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4c7d859e1a24adabc163bc1865dffc7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/efbfd74765364a2eb46808e31fe5d225-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/efbfd74765364a2eb46808e31fe5d225-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8497,7 +8928,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8bddf6d567bd49f2ad27c9ed1647cd63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bddf6d567bd49f2ad27c9ed1647cd63-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9ccc4321633f436d9db960bb26577f20-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9ccc4321633f436d9db960bb26577f20-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8530,7 +8961,7 @@ MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -8547,7 +8978,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7c1b742bcd8a4b6083fffd56b34a9a93-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7c1b742bcd8a4b6083fffd56b34a9a93-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/10d89ee6f7784f4e9b2f071065358db1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/10d89ee6f7784f4e9b2f071065358db1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8571,7 +9002,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/23de2b3d96074607bcac849fd91a33e6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23de2b3d96074607bcac849fd91a33e6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b7f0fae4dd0a4783be86e6845a8f52e7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7f0fae4dd0a4783be86e6845a8f52e7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8603,7 +9034,7 @@ 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) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -8620,7 +9051,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2eb571be77214530b7a662b78c85a541-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2eb571be77214530b7a662b78c85a541-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/80ebf75330904e57a0ed1bfab15659e3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80ebf75330904e57a0ed1bfab15659e3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8667,13 +9098,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/a207f05f103a42c58935f8f1228b0cc2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a207f05f103a42c58935f8f1228b0cc2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/006bab63fcf141219f60e127734df3fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/006bab63fcf141219f60e127734df3fe-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8709,7 +9140,7 @@ 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) +ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) Result - Optimal solution found @@ -8717,463 +9148,6 @@ Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 - -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 = 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 -Status: Optimal -s_0 = 0.0 -s_1 = 1.0 -s_2 = 0.0 -w_0 = 0.0 -w_1 = 0.0 -w_2 = 2.5 -x_0 = 0.0 -x_1 = 0.0 -x_10 = 1.0 -x_11 = 0.0 -x_12 = 0.0 -x_13 = 0.0 -x_14 = 1.0 -x_15 = 1.0 -x_16 = 1.0 -x_17 = 1.0 -x_18 = 0.0 -x_19 = 0.0 -x_2 = 1.0 -x_3 = 0.0 -x_4 = 0.0 -x_5 = 1.0 -x_6 = 1.0 -x_7 = 0.0 -x_8 = 0.0 -x_9 = 1.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 items passed all tests: - 8 tests in pulp -8 tests in 1 items. -8 passed and 0 failed. -Test passed. -Status: Optimal -Route_('Chicago',_'Gary') = 4000.0 -Route_('Chicago',_'Tempe') = 2000.0 -Route_('Cincinatti',_'Albany') = 2000.0 -Route_('Cincinatti',_'Houston') = 3000.0 -Route_('Kansas_City',_'Houston') = 4000.0 -Route_('Kansas_City',_'Tempe') = 2000.0 -Route_('Pittsburgh',_'Chicago') = 3000.0 -Route_('Pittsburgh',_'Cincinatti') = 2000.0 -Route_('Pittsburgh',_'Gary') = 2000.0 -Route_('Pittsburgh',_'Kansas_City') = 3000.0 -Route_('Youngstown',_'Albany') = 1000.0 -Route_('Youngstown',_'Chicago') = 3000.0 -Route_('Youngstown',_'Cincinatti') = 3000.0 -Route_('Youngstown',_'Kansas_City') = 3000.0 -Total Cost of Transportation = 15005.0 -Status: Optimal -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_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 -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 -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 -The choosen tables are out of a total of 3213: -('M', 'N') -('E', 'F', 'G') -('A', 'B', 'C', 'D') -('I', 'J', 'K', 'L') -('O', 'P', 'Q', 'R') -Status: Optimal -Patt_A = 225.0 -Patt_B = 0.0 -Patt_C = 75.0 -Production Costs = 300.0 -Status: Optimal -BuildaPlant_Denver = 0.0 -BuildaPlant_Los_Angeles = 1.0 -BuildaPlant_Phoenix = 1.0 -BuildaPlant_San_Francisco = 1.0 -Route_Denver_Barstow = 0.0 -Route_Denver_Dallas = 0.0 -Route_Denver_San_Diego = 0.0 -Route_Denver_Tucson = 0.0 -Route_Los_Angeles_Barstow = 0.0 -Route_Los_Angeles_Dallas = 300.0 -Route_Los_Angeles_San_Diego = 1700.0 -Route_Los_Angeles_Tucson = 0.0 -Route_Phoenix_Barstow = 0.0 -Route_Phoenix_Dallas = 200.0 -Route_Phoenix_San_Diego = 0.0 -Route_Phoenix_Tucson = 1500.0 -Route_San_Francisco_Barstow = 1000.0 -Route_San_Francisco_Dallas = 700.0 -Route_San_Francisco_San_Diego = 0.0 -Route_San_Francisco_Tucson = 0.0 -Total Costs = 228100.0 -Status: Optimal -BeefPercent = 66.0 -ChickenPercent = 34.0 -Total Cost of Ingredients per can = 0.97 -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Optimal -Status: Infeasible -Solutions Written to sudokuout.txt -Number_of_Chairs_A = 8.0 -Number_of_Chairs_B = 16.0 -Total Revenue from Production = 3200.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 -Route_B_1 = 220.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8660.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 230.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8690.0 -Status: Optimal -Route_A_1 = 300.0 -Route_A_2 = 0.0 -Route_A_3 = 0.0 -Route_A_4 = 0.0 -Route_A_5 = 700.0 -Route_B_1 = 240.0 -Route_B_2 = 900.0 -Route_B_3 = 1800.0 -Route_B_4 = 200.0 -Route_B_5 = 0.0 -Total Cost of Transportation = 8720.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 = 250.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 = 8750.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 = 260.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 = 8780.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 = 270.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 = 8810.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 = 280.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 = 8840.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 = 290.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 = 8870.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 = 300.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 = 8900.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 = [4, 0, 0] -P1 = [0, 2, 0] -P2 = [0, 0, 2] -P3 = [1, 2, 0] -Pattern_P0 = 13 -Pattern_P1 = 0 -Pattern_P2 = 150 -Pattern_P3 = 100 -Surplus_5 = 2 -Surplus_7 = 0 -Surplus_9 = 0 -objective = 246.5 -Lens: [5, 7, 9] -P0 = [0, 0, 0] -P1 = [0, 0, 1] -P2 = [0, 0, 2] -P3 = [0, 1, 0] -P4 = [0, 1, 1] -P5 = [0, 2, 0] -P6 = [1, 0, 0] -P7 = [1, 0, 1] -P8 = [1, 1, 0] -P9 = [1, 2, 0] -P10 = [2, 0, 0] -P11 = [2, 0, 1] -P12 = [2, 1, 0] -P13 = [3, 0, 0] -P14 = [4, 0, 0] -Status: Optimal -Patt_P0 = 0.0 -Patt_P1 = 0.0 -Patt_P10 = 0.0 -Patt_P11 = 26.0Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/996b483a897942a3938a7e88518472dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/996b483a897942a3938a7e88518472dc-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 36 RHS -At line 40 BOUNDS -At line 47 ENDATA -Problem MODEL has 3 rows, 6 columns and 9 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 251.5 - 0.00 seconds -Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 251.5 to 251.5 -Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 251.50000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all @@ -9183,23 +9157,20 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/78f6783194d849f8879a60476e6d674f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/78f6783194d849f8879a60476e6d674f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d05861f96d4a4179afb6fb76d1c7e4d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d05861f96d4a4179afb6fb76d1c7e4d1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS -At line 13 COLUMNS -At line 72 RHS -At line 81 BOUNDS -At line 94 ENDATA -Problem MODEL has 8 rows, 12 columns and 24 elements +At line 10 COLUMNS +At line 25 RHS +At line 31 BOUNDS +At line 33 ENDATA +Problem MODEL has 5 rows, 2 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is 8600 - 0.00 seconds -Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 8600 to 8600 +Continuous objective value is 0.966667 - 0.00 seconds +Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements +Cbc3007W No integer variables - nothing to do +Cuts at root node changed objective from 0.97 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -9211,136 +9182,12 @@ Result - Optimal solution found -Objective value: 8600.00000000 -Enumerated nodes: 0 -Total iterations: 0 -Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/82f22e37244f4a96be38101a2a3d5e1c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82f22e37244f4a96be38101a2a3d5e1c-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 8 COLUMNS -At line 86 RHS -At line 90 BOUNDS -At line 109 ENDATA -Problem MODEL has 3 rows, 18 columns and 23 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 246.5 - 0.00 seconds -Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions -Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements -Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) -Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) -Cbc0031I 1 added rows had average density of 14 -Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) -Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost -Cuts at root node changed objective from 246.5 to 246.5 -Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) - -Result - Optimal solution found - -Objective value: 246.50000000 +Objective value: 0.97000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 - -Welcome to the CBC MILP Solver -Version: 2.10.12 -Build Date: Sep 17 2024 - -command line - /usr/bin/cbc /tmp/b1aa615e90ee46d6afdb185ceef2e875-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b1aa615e90ee46d6afdb185ceef2e875-pulp.sol (default strategy 1) -At line 2 NAME MODEL -At line 3 ROWS -At line 23 COLUMNS -At line 24708 RHS -At line 24727 BOUNDS -At line 27941 ENDATA -Problem MODEL has 18 rows, 3213 columns and 15062 elements -Coin0008I MODEL read with 0 errors -Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.00 seconds -Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0038I Initial state - 0 integers unsatisfied sum - 0 -Cbc0038I Solution found of 12 -Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.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.07 -Time (Wallclock seconds): 0.09 - -Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.12 - -/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 +Time (Wallclock seconds): 0.00 -command line - /usr/bin/cbc /tmp/93a448d2dc2e49709ceb3e218dd585c5-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/93a448d2dc2e49709ceb3e218dd585c5-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 @@ -10680,10 +10527,93 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 33.074s +Ran 1005 tests in 27.085s OK (skipped=885) +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 +The choosen tables are out of a total of 3213: +('M', 'N') +('E', 'F', 'G') +('A', 'B', 'C', 'D') +('I', 'J', 'K', 'L') +('O', 'P', 'Q', 'R') +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1800.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Total Cost of Transportation = 8600.0 +P0 = [1, 0, 0] +P1 = [0, 1, 0] +P2 = [0, 0, 1] +P3 = [4, 0, 0] +P4 = [1, 2, 0] +P5 = [0, 0, 2] +Pattern_P0 = 0 +Pattern_P1 = 0 +Pattern_P2 = 0 +Pattern_P3 = 13 +Pattern_P4 = 100 +Pattern_P5 = 150 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 +Status: Optimal +Route_A_1 = 300.0 +Route_A_2 = 0.0 +Route_A_3 = 0.0 +Route_A_4 = 0.0 +Route_A_5 = 700.0 +Route_B_1 = 200.0 +Route_B_2 = 900.0 +Route_B_3 = 1700.0 +Route_B_4 = 200.0 +Route_B_5 = 0.0 +Route_C_1 = 0.0 +Route_C_2 = 0.0 +Route_C_3 = 100.0 +Route_C_4 = 0.0 +Route_C_5 = 0.0 +Total Cost of Transportation = 8300.0 +Lens: [5, 7, 9] +P0 = [0, 0, 0] +P1 = [0, 0, 1] +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 @@ -10707,20 +10637,37 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 +Number_of_Chairs_A = 8.0 +Number_of_Chairs_B = 16.0 +Total Revenue from Production = 3200.0 Status: Optimal -Route_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 +Route_('Chicago',_'Gary') = 4000.0 +Route_('Chicago',_'Tempe') = 2000.0 +Route_('Cincinatti',_'Albany') = 2000.0 +Route_('Cincinatti',_'Houston') = 3000.0 +Route_('Kansas_City',_'Houston') = 4000.0 +Route_('Kansas_City',_'Tempe') = 2000.0 +Route_('Pittsburgh',_'Chicago') = 3000.0 +Route_('Pittsburgh',_'Cincinatti') = 2000.0 +Route_('Pittsburgh',_'Gary') = 2000.0 +Route_('Pittsburgh',_'Kansas_City') = 3000.0 +Route_('Youngstown',_'Albany') = 1000.0 +Route_('Youngstown',_'Chicago') = 3000.0 +Route_('Youngstown',_'Cincinatti') = 3000.0 +Route_('Youngstown',_'Kansas_City') = 3000.0 +Total Cost of Transportation = 15005.0 +P0 = [4, 0, 0] +P1 = [0, 2, 0] +P2 = [0, 0, 2] +P3 = [1, 2, 0] +Pattern_P0 = 13 +Pattern_P1 = 0 +Pattern_P2 = 150 +Pattern_P3 = 100 +Surplus_5 = 2 +Surplus_7 = 0 +Surplus_9 = 0 +objective = 246.5 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] @@ -10757,82 +10704,10 @@ Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 -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') -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 +BeefPercent = 66.0 +ChickenPercent = 34.0 +Total Cost of Ingredients per can = 0.97 Test that logic put in place for deprecation handling of indexs works Testing 'indexs' param continues to work for LpVariable.dicts Testing 'indexs' param continues to work for LpVariable.matrix @@ -11098,90 +10973,90 @@ running install_lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/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__/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__/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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/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.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/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -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/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_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__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/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/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 -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/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp 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 +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/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__/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__/__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__/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__/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__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/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/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/__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/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/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/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/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/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__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/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/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/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/solverdir/__init__.py to __init__.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/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/tests/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc /usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/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/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/__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/mosek_api.py to mosek_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/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/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/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt @@ -11342,90 +11217,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 -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/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__/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__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__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__/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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/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.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/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp -copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.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/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.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/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_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__/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/__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__/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/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 -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 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 +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/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/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/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/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/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/__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/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis 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__/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__/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__/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__/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__/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__/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__/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__/__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__/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__/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__/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__/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__/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__/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__/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__/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/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/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/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/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/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/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/__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/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/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/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/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/__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__/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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +creating /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/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir +creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/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/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/__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__/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__/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__/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__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp +copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.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.osx -> /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/sparse.py to sparse.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/constants.py to constants.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/__init__.py to __init__.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/pulp.py to pulp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/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/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/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/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/tests/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/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/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/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/__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/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/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/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/__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/core.py to core.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-312.pyc -byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/sparse.py to sparse.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/constants.py to constants.cpython-312.pyc +byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/pulp.py to pulp.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 @@ -11455,12 +11330,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/449985/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/449985/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/449879 and its subdirectories -I: Current time: Thu Nov 21 07:44:24 -12 2024 -I: pbuilder-time-stamp: 1732218264 +I: removing directory /srv/workspace/pbuilder/449985 and its subdirectories +I: Current time: Thu Dec 25 16:10:07 +14 2025 +I: pbuilder-time-stamp: 1766628607