I: pbuilder: network access will be disabled during build I: Current time: Sun Oct 5 14:43:03 +14 2025 I: pbuilder-time-stamp: 1759624983 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: using eatmydata during job I: Copying source file I: copying [python-pulp_2.7.0+dfsg-4.dsc] I: copying [./python-pulp_2.7.0+dfsg.orig.tar.xz] I: copying [./python-pulp_2.7.0+dfsg-4.debian.tar.xz] I: Extracting source gpgv: Signature made Sun Sep 1 11:16:14 2024 gpgv: using EDDSA key A095B66EE09024BEE6A2F0722A27904BD7243EDA gpgv: issuer "nilesh@debian.org" gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify inline signature for ./python-pulp_2.7.0+dfsg-4.dsc: no acceptable signature found dpkg-source: info: extracting python-pulp in python-pulp-2.7.0+dfsg dpkg-source: info: unpacking python-pulp_2.7.0+dfsg.orig.tar.xz dpkg-source: info: unpacking python-pulp_2.7.0+dfsg-4.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying do-not-package-non-free-files.patch dpkg-source: info: applying remove-pulp-specific-locdirs.patch 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/17231/tmp/hooks/D01_modify_environment starting debug: Running on infom08-i386. I: Changing host+domainname to test build reproducibility I: Adding a custom variable just for the fun of it... I: Changing /bin/sh to bash '/bin/sh' -> '/bin/bash' lrwxrwxrwx 1 root root 9 Oct 5 00:43 /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/17231/tmp/hooks/D01_modify_environment finished I: user script /srv/workspace/pbuilder/17231/tmp/hooks/D02_print_environment starting I: set BASH=/bin/sh BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath BASH_ALIASES=() BASH_ARGC=() BASH_ARGV=() BASH_CMDS=() BASH_LINENO=([0]="12" [1]="0") BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") BASH_VERSINFO=([0]="5" [1]="2" [2]="32" [3]="1" [4]="release" [5]="i686-pc-linux-gnu") BASH_VERSION='5.2.32(1)-release' BUILDDIR=/build/reproducible-path BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' BUILDUSERNAME=pbuilder2 BUILD_ARCH=i386 DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=5 ' DIRSTACK=() DISTRIBUTION=unstable EUID=0 FUNCNAME=([0]="Echo" [1]="main") GROUPS=() HOME=/root HOSTNAME=i-capture-the-hostname HOSTTYPE=i686 HOST_ARCH=i386 IFS=' ' INVOCATION_ID=cb7b71c9c3804be4b8c43851a73f086d LANG=C LANGUAGE=de_CH:de LC_ALL=C LD_LIBRARY_PATH=/usr/lib/libeatmydata LD_PRELOAD=libeatmydata.so MACHTYPE=i686-pc-linux-gnu MAIL=/var/mail/root OPTERR=1 OPTIND=1 OSTYPE=linux-gnu PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path PBCURRENTCOMMANDLINEOPERATION=build PBUILDER_OPERATION=build PBUILDER_PKGDATADIR=/usr/share/pbuilder PBUILDER_PKGLIBDIR=/usr/lib/pbuilder PBUILDER_SYSCONFDIR=/etc PIPESTATUS=([0]="0") POSIXLY_CORRECT=y PPID=17231 PS4='+ ' 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.UYfd2ujz/pbuilderrc_MC6w --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.UYfd2ujz/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' SUDO_GID=111 SUDO_UID=104 SUDO_USER=jenkins TERM=unknown TZ=/usr/share/zoneinfo/Etc/GMT-14 UID=0 USER=root _='I: set' I: uname -a Linux i-capture-the-hostname 6.10.6+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.10.6-1~bpo12+1 (2024-08-26) x86_64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin I: user script /srv/workspace/pbuilder/17231/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: i386 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), dh-python, python3-all, python3-setuptools, coinor-cbc, python3-pyparsing dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 19756 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on dh-python; however: Package dh-python is not installed. pbuilder-satisfydepends-dummy depends on python3-all; however: Package python3-all is not installed. pbuilder-satisfydepends-dummy depends on python3-setuptools; however: Package python3-setuptools is not installed. pbuilder-satisfydepends-dummy depends on coinor-cbc; however: Package coinor-cbc is not installed. pbuilder-satisfydepends-dummy depends on python3-pyparsing; however: Package python3-pyparsing is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} coinor-cbc{a} coinor-libcbc3.1{a} coinor-libcgl1{a} coinor-libclp1{a} coinor-libcoinutils3v5{a} coinor-libosi1v5{a} debhelper{a} dh-autoreconf{a} dh-python{a} dh-strip-nondeterminism{a} dwz{a} file{a} gettext{a} gettext-base{a} groff-base{a} intltool-debian{a} libarchive-zip-perl{a} libblas3{a} libcom-err2{a} libdebhelper-perl{a} libelf1t64{a} libexpat1{a} libfile-stripnondeterminism-perl{a} libgfortran5{a} libgssapi-krb5-2{a} libicu72{a} libk5crypto3{a} libkeyutils1{a} libkrb5-3{a} libkrb5support0{a} liblapack3{a} libmagic-mgc{a} libmagic1t64{a} libnsl2{a} libpipeline1{a} libpython3-stdlib{a} libpython3.12-minimal{a} libpython3.12-stdlib{a} libreadline8t64{a} libtirpc-common{a} libtirpc3t64{a} libtool{a} libuchardet0{a} libxml2{a} m4{a} man-db{a} media-types{a} netbase{a} po-debconf{a} python3{a} python3-all{a} python3-autocommand{a} python3-inflect{a} python3-jaraco.context{a} python3-jaraco.functools{a} python3-minimal{a} python3-more-itertools{a} python3-pkg-resources{a} python3-pyparsing{a} python3-setuptools{a} python3-typeguard{a} python3-typing-extensions{a} python3-zipp{a} python3.12{a} python3.12-minimal{a} readline-common{a} sensible-utils{a} tzdata{a} The following packages are RECOMMENDED but will NOT be installed: ca-certificates curl krb5-locales libarchive-cpio-perl libltdl-dev libmail-sendmail-perl lynx wget 0 packages upgraded, 73 newly installed, 0 to remove and 0 not upgraded. Need to get 34.5 MB of archives. After unpacking 130 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main i386 libpython3.12-minimal i386 3.12.5-4 [812 kB] Get: 2 http://deb.debian.org/debian unstable/main i386 libexpat1 i386 2.6.2-2 [106 kB] Get: 3 http://deb.debian.org/debian unstable/main i386 python3.12-minimal i386 3.12.5-4 [2242 kB] Get: 4 http://deb.debian.org/debian unstable/main i386 python3-minimal i386 3.12.5-1 [26.7 kB] Get: 5 http://deb.debian.org/debian unstable/main i386 media-types all 10.1.0 [26.9 kB] Get: 6 http://deb.debian.org/debian unstable/main i386 netbase all 6.4 [12.8 kB] Get: 7 http://deb.debian.org/debian unstable/main i386 tzdata all 2024a-4 [255 kB] Get: 8 http://deb.debian.org/debian unstable/main i386 libkrb5support0 i386 1.21.3-3 [34.9 kB] Get: 9 http://deb.debian.org/debian unstable/main i386 libcom-err2 i386 1.47.1-1 [23.1 kB] Get: 10 http://deb.debian.org/debian unstable/main i386 libk5crypto3 i386 1.21.3-3 [83.6 kB] Get: 11 http://deb.debian.org/debian unstable/main i386 libkeyutils1 i386 1.6.3-3 [9432 B] Get: 12 http://deb.debian.org/debian unstable/main i386 libkrb5-3 i386 1.21.3-3 [350 kB] Get: 13 http://deb.debian.org/debian unstable/main i386 libgssapi-krb5-2 i386 1.21.3-3 [146 kB] Get: 14 http://deb.debian.org/debian unstable/main i386 libtirpc-common all 1.3.4+ds-1.3 [10.9 kB] Get: 15 http://deb.debian.org/debian unstable/main i386 libtirpc3t64 i386 1.3.4+ds-1.3 [90.2 kB] Get: 16 http://deb.debian.org/debian unstable/main i386 libnsl2 i386 1.3.0-3+b2 [42.4 kB] Get: 17 http://deb.debian.org/debian unstable/main i386 readline-common all 8.2-5 [69.3 kB] Get: 18 http://deb.debian.org/debian unstable/main i386 libreadline8t64 i386 8.2-5 [173 kB] Get: 19 http://deb.debian.org/debian unstable/main i386 libpython3.12-stdlib i386 3.12.5-4 [1957 kB] Get: 20 http://deb.debian.org/debian unstable/main i386 python3.12 i386 3.12.5-4 [667 kB] Get: 21 http://deb.debian.org/debian unstable/main i386 libpython3-stdlib i386 3.12.5-1 [9588 B] Get: 22 http://deb.debian.org/debian unstable/main i386 python3 i386 3.12.5-1 [27.6 kB] Get: 23 http://deb.debian.org/debian unstable/main i386 sensible-utils all 0.0.24 [24.8 kB] Get: 24 http://deb.debian.org/debian unstable/main i386 libmagic-mgc i386 1:5.45-3 [314 kB] Get: 25 http://deb.debian.org/debian unstable/main i386 libmagic1t64 i386 1:5.45-3 [114 kB] Get: 26 http://deb.debian.org/debian unstable/main i386 file i386 1:5.45-3 [42.9 kB] Get: 27 http://deb.debian.org/debian unstable/main i386 gettext-base i386 0.22.5-2 [201 kB] Get: 28 http://deb.debian.org/debian unstable/main i386 libuchardet0 i386 0.0.8-1+b1 [69.1 kB] Get: 29 http://deb.debian.org/debian unstable/main i386 groff-base i386 1.23.0-5 [1196 kB] Get: 30 http://deb.debian.org/debian unstable/main i386 bsdextrautils i386 2.40.2-7 [101 kB] Get: 31 http://deb.debian.org/debian unstable/main i386 libpipeline1 i386 1.5.8-1 [41.2 kB] Get: 32 http://deb.debian.org/debian unstable/main i386 man-db i386 2.13.0-1 [1428 kB] Get: 33 http://deb.debian.org/debian unstable/main i386 m4 i386 1.4.19-4 [293 kB] Get: 34 http://deb.debian.org/debian unstable/main i386 autoconf all 2.72-3 [493 kB] Get: 35 http://deb.debian.org/debian unstable/main i386 autotools-dev all 20220109.1 [51.6 kB] Get: 36 http://deb.debian.org/debian unstable/main i386 automake all 1:1.16.5-1.3 [823 kB] Get: 37 http://deb.debian.org/debian unstable/main i386 autopoint all 0.22.5-2 [723 kB] Get: 38 http://deb.debian.org/debian unstable/main i386 libblas3 i386 3.12.0-3 [140 kB] Get: 39 http://deb.debian.org/debian unstable/main i386 libgfortran5 i386 14.2.0-4 [735 kB] Get: 40 http://deb.debian.org/debian unstable/main i386 liblapack3 i386 3.12.0-3 [2167 kB] Get: 41 http://deb.debian.org/debian unstable/main i386 coinor-libcoinutils3v5 i386 2.11.4+repack1-4 [473 kB] Get: 42 http://deb.debian.org/debian unstable/main i386 coinor-libosi1v5 i386 0.108.10+ds-1 [282 kB] Get: 43 http://deb.debian.org/debian unstable/main i386 coinor-libclp1 i386 1.17.9+ds-2 [867 kB] Get: 44 http://deb.debian.org/debian unstable/main i386 coinor-libcgl1 i386 0.60.8+ds-2 [421 kB] Get: 45 http://deb.debian.org/debian unstable/main i386 coinor-libcbc3.1 i386 2.10.11+ds1-3 [738 kB] Get: 46 http://deb.debian.org/debian unstable/main i386 coinor-cbc i386 2.10.11+ds1-3 [16.4 kB] Get: 47 http://deb.debian.org/debian unstable/main i386 libdebhelper-perl all 13.20 [89.7 kB] Get: 48 http://deb.debian.org/debian unstable/main i386 libtool all 2.4.7-7 [517 kB] Get: 49 http://deb.debian.org/debian unstable/main i386 dh-autoreconf all 20 [17.1 kB] Get: 50 http://deb.debian.org/debian unstable/main i386 libarchive-zip-perl all 1.68-1 [104 kB] Get: 51 http://deb.debian.org/debian unstable/main i386 libfile-stripnondeterminism-perl all 1.14.0-1 [19.5 kB] Get: 52 http://deb.debian.org/debian unstable/main i386 dh-strip-nondeterminism all 1.14.0-1 [8448 B] Get: 53 http://deb.debian.org/debian unstable/main i386 libelf1t64 i386 0.191-2 [194 kB] Get: 54 http://deb.debian.org/debian unstable/main i386 dwz i386 0.15-1+b1 [116 kB] Get: 55 http://deb.debian.org/debian unstable/main i386 libicu72 i386 72.1-5 [9550 kB] Get: 56 http://deb.debian.org/debian unstable/main i386 libxml2 i386 2.12.7+dfsg-3+b1 [704 kB] Get: 57 http://deb.debian.org/debian unstable/main i386 gettext i386 0.22.5-2 [1631 kB] Get: 58 http://deb.debian.org/debian unstable/main i386 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 59 http://deb.debian.org/debian unstable/main i386 po-debconf all 1.0.21+nmu1 [248 kB] Get: 60 http://deb.debian.org/debian unstable/main i386 debhelper all 13.20 [915 kB] Get: 61 http://deb.debian.org/debian unstable/main i386 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 62 http://deb.debian.org/debian unstable/main i386 python3-more-itertools all 10.3.0-1 [62.0 kB] Get: 63 http://deb.debian.org/debian unstable/main i386 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 64 http://deb.debian.org/debian unstable/main i386 python3-typeguard all 4.3.0-1 [36.5 kB] Get: 65 http://deb.debian.org/debian unstable/main i386 python3-inflect all 7.3.1-1 [42.2 kB] Get: 66 http://deb.debian.org/debian unstable/main i386 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 67 http://deb.debian.org/debian unstable/main i386 python3-jaraco.functools all 4.0.2-1 [11.7 kB] Get: 68 http://deb.debian.org/debian unstable/main i386 python3-pkg-resources all 73.0.1-1 [212 kB] Get: 69 http://deb.debian.org/debian unstable/main i386 python3-zipp all 3.20.1-1 [10.2 kB] Get: 70 http://deb.debian.org/debian unstable/main i386 python3-setuptools all 73.0.1-1 [748 kB] Get: 71 http://deb.debian.org/debian unstable/main i386 dh-python all 6.20240824 [109 kB] Get: 72 http://deb.debian.org/debian unstable/main i386 python3-all i386 3.12.5-1 [1044 B] Get: 73 http://deb.debian.org/debian unstable/main i386 python3-pyparsing all 3.1.2-1 [146 kB] Fetched 34.5 MB in 2s (22.6 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:i386. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19756 files and directories currently installed.) Preparing to unpack .../libpython3.12-minimal_3.12.5-4_i386.deb ... Unpacking libpython3.12-minimal:i386 (3.12.5-4) ... Selecting previously unselected package libexpat1:i386. Preparing to unpack .../libexpat1_2.6.2-2_i386.deb ... Unpacking libexpat1:i386 (2.6.2-2) ... Selecting previously unselected package python3.12-minimal. Preparing to unpack .../python3.12-minimal_3.12.5-4_i386.deb ... Unpacking python3.12-minimal (3.12.5-4) ... Setting up libpython3.12-minimal:i386 (3.12.5-4) ... Setting up libexpat1:i386 (2.6.2-2) ... Setting up python3.12-minimal (3.12.5-4) ... Selecting previously unselected package python3-minimal. (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 ... 20076 files and directories currently installed.) Preparing to unpack .../00-python3-minimal_3.12.5-1_i386.deb ... Unpacking python3-minimal (3.12.5-1) ... Selecting previously unselected package media-types. Preparing to unpack .../01-media-types_10.1.0_all.deb ... Unpacking media-types (10.1.0) ... Selecting previously unselected package netbase. Preparing to unpack .../02-netbase_6.4_all.deb ... Unpacking netbase (6.4) ... Selecting previously unselected package tzdata. Preparing to unpack .../03-tzdata_2024a-4_all.deb ... Unpacking tzdata (2024a-4) ... Selecting previously unselected package libkrb5support0:i386. Preparing to unpack .../04-libkrb5support0_1.21.3-3_i386.deb ... Unpacking libkrb5support0:i386 (1.21.3-3) ... Selecting previously unselected package libcom-err2:i386. Preparing to unpack .../05-libcom-err2_1.47.1-1_i386.deb ... Unpacking libcom-err2:i386 (1.47.1-1) ... Selecting previously unselected package libk5crypto3:i386. Preparing to unpack .../06-libk5crypto3_1.21.3-3_i386.deb ... Unpacking libk5crypto3:i386 (1.21.3-3) ... Selecting previously unselected package libkeyutils1:i386. Preparing to unpack .../07-libkeyutils1_1.6.3-3_i386.deb ... Unpacking libkeyutils1:i386 (1.6.3-3) ... Selecting previously unselected package libkrb5-3:i386. Preparing to unpack .../08-libkrb5-3_1.21.3-3_i386.deb ... Unpacking libkrb5-3:i386 (1.21.3-3) ... Selecting previously unselected package libgssapi-krb5-2:i386. Preparing to unpack .../09-libgssapi-krb5-2_1.21.3-3_i386.deb ... Unpacking libgssapi-krb5-2:i386 (1.21.3-3) ... Selecting previously unselected package libtirpc-common. Preparing to unpack .../10-libtirpc-common_1.3.4+ds-1.3_all.deb ... Unpacking libtirpc-common (1.3.4+ds-1.3) ... Selecting previously unselected package libtirpc3t64:i386. Preparing to unpack .../11-libtirpc3t64_1.3.4+ds-1.3_i386.deb ... Adding 'diversion of /lib/i386-linux-gnu/libtirpc.so.3 to /lib/i386-linux-gnu/libtirpc.so.3.usr-is-merged by libtirpc3t64' Adding 'diversion of /lib/i386-linux-gnu/libtirpc.so.3.0.0 to /lib/i386-linux-gnu/libtirpc.so.3.0.0.usr-is-merged by libtirpc3t64' Unpacking libtirpc3t64:i386 (1.3.4+ds-1.3) ... Selecting previously unselected package libnsl2:i386. Preparing to unpack .../12-libnsl2_1.3.0-3+b2_i386.deb ... Unpacking libnsl2:i386 (1.3.0-3+b2) ... Selecting previously unselected package readline-common. Preparing to unpack .../13-readline-common_8.2-5_all.deb ... Unpacking readline-common (8.2-5) ... Selecting previously unselected package libreadline8t64:i386. Preparing to unpack .../14-libreadline8t64_8.2-5_i386.deb ... Adding 'diversion of /lib/i386-linux-gnu/libhistory.so.8 to /lib/i386-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/i386-linux-gnu/libhistory.so.8.2 to /lib/i386-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/i386-linux-gnu/libreadline.so.8 to /lib/i386-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/i386-linux-gnu/libreadline.so.8.2 to /lib/i386-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:i386 (8.2-5) ... Selecting previously unselected package libpython3.12-stdlib:i386. Preparing to unpack .../15-libpython3.12-stdlib_3.12.5-4_i386.deb ... Unpacking libpython3.12-stdlib:i386 (3.12.5-4) ... Selecting previously unselected package python3.12. Preparing to unpack .../16-python3.12_3.12.5-4_i386.deb ... Unpacking python3.12 (3.12.5-4) ... Selecting previously unselected package libpython3-stdlib:i386. Preparing to unpack .../17-libpython3-stdlib_3.12.5-1_i386.deb ... Unpacking libpython3-stdlib:i386 (3.12.5-1) ... Setting up python3-minimal (3.12.5-1) ... Selecting previously unselected package python3. (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 ... 21148 files and directories currently installed.) Preparing to unpack .../00-python3_3.12.5-1_i386.deb ... Unpacking python3 (3.12.5-1) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../01-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../02-libmagic-mgc_1%3a5.45-3_i386.deb ... Unpacking libmagic-mgc (1:5.45-3) ... Selecting previously unselected package libmagic1t64:i386. Preparing to unpack .../03-libmagic1t64_1%3a5.45-3_i386.deb ... Unpacking libmagic1t64:i386 (1:5.45-3) ... Selecting previously unselected package file. Preparing to unpack .../04-file_1%3a5.45-3_i386.deb ... Unpacking file (1:5.45-3) ... Selecting previously unselected package gettext-base. Preparing to unpack .../05-gettext-base_0.22.5-2_i386.deb ... Unpacking gettext-base (0.22.5-2) ... Selecting previously unselected package libuchardet0:i386. Preparing to unpack .../06-libuchardet0_0.0.8-1+b1_i386.deb ... Unpacking libuchardet0:i386 (0.0.8-1+b1) ... Selecting previously unselected package groff-base. Preparing to unpack .../07-groff-base_1.23.0-5_i386.deb ... Unpacking groff-base (1.23.0-5) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../08-bsdextrautils_2.40.2-7_i386.deb ... Unpacking bsdextrautils (2.40.2-7) ... Selecting previously unselected package libpipeline1:i386. Preparing to unpack .../09-libpipeline1_1.5.8-1_i386.deb ... Unpacking libpipeline1:i386 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../10-man-db_2.13.0-1_i386.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../11-m4_1.4.19-4_i386.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../12-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../13-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../14-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../15-autopoint_0.22.5-2_all.deb ... Unpacking autopoint (0.22.5-2) ... Selecting previously unselected package libblas3:i386. Preparing to unpack .../16-libblas3_3.12.0-3_i386.deb ... Unpacking libblas3:i386 (3.12.0-3) ... Selecting previously unselected package libgfortran5:i386. Preparing to unpack .../17-libgfortran5_14.2.0-4_i386.deb ... Unpacking libgfortran5:i386 (14.2.0-4) ... Selecting previously unselected package liblapack3:i386. Preparing to unpack .../18-liblapack3_3.12.0-3_i386.deb ... Unpacking liblapack3:i386 (3.12.0-3) ... Selecting previously unselected package coinor-libcoinutils3v5:i386. Preparing to unpack .../19-coinor-libcoinutils3v5_2.11.4+repack1-4_i386.deb ... Unpacking coinor-libcoinutils3v5:i386 (2.11.4+repack1-4) ... Selecting previously unselected package coinor-libosi1v5:i386. Preparing to unpack .../20-coinor-libosi1v5_0.108.10+ds-1_i386.deb ... Unpacking coinor-libosi1v5:i386 (0.108.10+ds-1) ... Selecting previously unselected package coinor-libclp1:i386. Preparing to unpack .../21-coinor-libclp1_1.17.9+ds-2_i386.deb ... Unpacking coinor-libclp1:i386 (1.17.9+ds-2) ... Selecting previously unselected package coinor-libcgl1:i386. Preparing to unpack .../22-coinor-libcgl1_0.60.8+ds-2_i386.deb ... Unpacking coinor-libcgl1:i386 (0.60.8+ds-2) ... Selecting previously unselected package coinor-libcbc3.1:i386. Preparing to unpack .../23-coinor-libcbc3.1_2.10.11+ds1-3_i386.deb ... Unpacking coinor-libcbc3.1:i386 (2.10.11+ds1-3) ... Selecting previously unselected package coinor-cbc. Preparing to unpack .../24-coinor-cbc_2.10.11+ds1-3_i386.deb ... Unpacking coinor-cbc (2.10.11+ds1-3) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../25-libdebhelper-perl_13.20_all.deb ... Unpacking libdebhelper-perl (13.20) ... Selecting previously unselected package libtool. Preparing to unpack .../26-libtool_2.4.7-7_all.deb ... Unpacking libtool (2.4.7-7) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../27-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../28-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../29-libfile-stripnondeterminism-perl_1.14.0-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.14.0-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../30-dh-strip-nondeterminism_1.14.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.0-1) ... Selecting previously unselected package libelf1t64:i386. Preparing to unpack .../31-libelf1t64_0.191-2_i386.deb ... Unpacking libelf1t64:i386 (0.191-2) ... Selecting previously unselected package dwz. Preparing to unpack .../32-dwz_0.15-1+b1_i386.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libicu72:i386. Preparing to unpack .../33-libicu72_72.1-5_i386.deb ... Unpacking libicu72:i386 (72.1-5) ... Selecting previously unselected package libxml2:i386. Preparing to unpack .../34-libxml2_2.12.7+dfsg-3+b1_i386.deb ... Unpacking libxml2:i386 (2.12.7+dfsg-3+b1) ... Selecting previously unselected package gettext. Preparing to unpack .../35-gettext_0.22.5-2_i386.deb ... Unpacking gettext (0.22.5-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../36-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../37-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../38-debhelper_13.20_all.deb ... Unpacking debhelper (13.20) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../39-python3-autocommand_2.2.2-3_all.deb ... Unpacking python3-autocommand (2.2.2-3) ... Selecting previously unselected package python3-more-itertools. Preparing to unpack .../40-python3-more-itertools_10.3.0-1_all.deb ... Unpacking python3-more-itertools (10.3.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../41-python3-typing-extensions_4.12.2-2_all.deb ... Unpacking python3-typing-extensions (4.12.2-2) ... Selecting previously unselected package python3-typeguard. Preparing to unpack .../42-python3-typeguard_4.3.0-1_all.deb ... Unpacking python3-typeguard (4.3.0-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../43-python3-inflect_7.3.1-1_all.deb ... Unpacking python3-inflect (7.3.1-1) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../44-python3-jaraco.context_6.0.0-1_all.deb ... Unpacking python3-jaraco.context (6.0.0-1) ... Selecting previously unselected package python3-jaraco.functools. Preparing to unpack .../45-python3-jaraco.functools_4.0.2-1_all.deb ... Unpacking python3-jaraco.functools (4.0.2-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../46-python3-pkg-resources_73.0.1-1_all.deb ... Unpacking python3-pkg-resources (73.0.1-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../47-python3-zipp_3.20.1-1_all.deb ... Unpacking python3-zipp (3.20.1-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../48-python3-setuptools_73.0.1-1_all.deb ... Unpacking python3-setuptools (73.0.1-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../49-dh-python_6.20240824_all.deb ... Unpacking dh-python (6.20240824) ... Selecting previously unselected package python3-all. Preparing to unpack .../50-python3-all_3.12.5-1_i386.deb ... Unpacking python3-all (3.12.5-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../51-python3-pyparsing_3.1.2-1_all.deb ... Unpacking python3-pyparsing (3.1.2-1) ... Setting up media-types (10.1.0) ... Setting up libpipeline1:i386 (1.5.8-1) ... Setting up libkeyutils1:i386 (1.6.3-3) ... Setting up libicu72:i386 (72.1-5) ... Setting up bsdextrautils (2.40.2-7) ... Setting up libmagic-mgc (1:5.45-3) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libtirpc-common (1.3.4+ds-1.3) ... Setting up libdebhelper-perl (13.20) ... Setting up libmagic1t64:i386 (1:5.45-3) ... Setting up gettext-base (0.22.5-2) ... Setting up m4 (1.4.19-4) ... Setting up libcom-err2:i386 (1.47.1-1) ... Setting up file (1:5.45-3) ... Setting up libelf1t64:i386 (0.191-2) ... Setting up libkrb5support0:i386 (1.21.3-3) ... Setting up tzdata (2024a-4) ... Current default time zone: 'Etc/UTC' Local time is now: Sun Oct 5 00:43:22 UTC 2025. Universal Time is now: Sun Oct 5 00:43:22 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up autotools-dev (20220109.1) ... Setting up libblas3:i386 (3.12.0-3) ... update-alternatives: using /usr/lib/i386-linux-gnu/blas/libblas.so.3 to provide /usr/lib/i386-linux-gnu/libblas.so.3 (libblas.so.3-i386-linux-gnu) in auto mode Setting up autopoint (0.22.5-2) ... Setting up libk5crypto3:i386 (1.21.3-3) ... Setting up libgfortran5:i386 (14.2.0-4) ... Setting up autoconf (2.72-3) ... Setting up dwz (0.15-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:i386 (0.0.8-1+b1) ... Setting up netbase (6.4) ... Setting up libkrb5-3:i386 (1.21.3-3) ... Setting up readline-common (8.2-5) ... Setting up libxml2:i386 (2.12.7+dfsg-3+b1) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.14.0-1) ... Setting up liblapack3:i386 (3.12.0-3) ... update-alternatives: using /usr/lib/i386-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/i386-linux-gnu/liblapack.so.3 (liblapack.so.3-i386-linux-gnu) in auto mode Setting up gettext (0.22.5-2) ... Setting up libtool (2.4.7-7) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up coinor-libcoinutils3v5:i386 (2.11.4+repack1-4) ... Setting up libgssapi-krb5-2:i386 (1.21.3-3) ... Setting up coinor-libosi1v5:i386 (0.108.10+ds-1) ... Setting up libreadline8t64:i386 (8.2-5) ... Setting up dh-strip-nondeterminism (1.14.0-1) ... Setting up groff-base (1.23.0-5) ... Setting up libtirpc3t64:i386 (1.3.4+ds-1.3) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up man-db (2.13.0-1) ... Not building database; man-db/auto-update is not 'true'. Setting up coinor-libclp1:i386 (1.17.9+ds-2) ... Setting up libnsl2:i386 (1.3.0-3+b2) ... Setting up coinor-libcgl1:i386 (0.60.8+ds-2) ... Setting up libpython3.12-stdlib:i386 (3.12.5-4) ... Setting up python3.12 (3.12.5-4) ... Setting up debhelper (13.20) ... Setting up coinor-libcbc3.1:i386 (2.10.11+ds1-3) ... Setting up libpython3-stdlib:i386 (3.12.5-1) ... Setting up python3 (3.12.5-1) ... Setting up python3-zipp (3.20.1-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up coinor-cbc (2.10.11+ds1-3) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up python3-more-itertools (10.3.0-1) ... Setting up python3-jaraco.functools (4.0.2-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-typeguard (4.3.0-1) ... Setting up python3-all (3.12.5-1) ... Setting up python3-inflect (7.3.1-1) ... Setting up python3-pkg-resources (73.0.1-1) ... Setting up python3-setuptools (73.0.1-1) ... Setting up dh-python (6.20240824) ... Processing triggers for libc-bin (2.40-2) ... Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: user script /srv/workspace/pbuilder/17231/tmp/hooks/A99_set_merged_usr starting Not re-configuring usrmerge for unstable I: user script /srv/workspace/pbuilder/17231/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 dpkg-buildpackage: info: source changed by Nilesh Patra dpkg-source --before-build . dpkg-buildpackage: info: host architecture i386 dpkg-source: info: using options from python-pulp-2.7.0+dfsg/debian/source/options: --extend-diff-ignore=^[^/]*[.]egg-info/ debian/rules clean dh clean --buildsystem=pybuild --with python3 dh_auto_clean -O--buildsystem=pybuild I: pybuild base:311: python3.12 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:268: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running clean removing '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build' (and everything under it) 'build/bdist.linux-i686' does not exist -- can't clean it 'build/scripts-3.12' does not exist -- can't clean it dh_autoreconf_clean -O--buildsystem=pybuild dh_clean -O--buildsystem=pybuild debian/rules binary dh binary --buildsystem=pybuild --with python3 dh_update_autotools_config -O--buildsystem=pybuild dh_autoreconf -O--buildsystem=pybuild dh_auto_configure -O--buildsystem=pybuild I: pybuild base:311: python3.12 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:268: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config dh_auto_build -O--buildsystem=pybuild I: pybuild base:311: /usr/bin/python3 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:268: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) 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/utilities.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/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt writing entry points to PuLP.egg-info/entry_points.txt writing top-level names to PuLP.egg-info/top_level.txt writing manifest file 'PuLP.egg-info/SOURCES.txt' reading manifest file 'PuLP.egg-info/SOURCES.txt' reading manifest template 'MANIFEST.in' adding license file 'LICENSE' adding license file 'AUTHORS' writing manifest file 'PuLP.egg-info/SOURCES.txt' /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.apis' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.apis' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.apis' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.apis' to be distributed and are already explicitly excluding 'pulp.apis' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.solverdir' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.solverdir' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.solverdir' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.solverdir' to be distributed and are already explicitly excluding 'pulp.solverdir' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.tests' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.tests' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.tests' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.tests' to be distributed and are already explicitly excluding 'pulp.tests' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) copying pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis copying pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir copying pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests copying pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests copying pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests copying pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests copying pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests copying pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests dh_auto_test -O--buildsystem=pybuild I: pybuild pybuild:308: cp -av examples /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build 'examples' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples' 'examples/wedding_initial.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/wedding_initial.py' 'examples/CGcolumnwise.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/CGcolumnwise.py' 'examples/test2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test2.py' 'examples/SpongeRollProblem5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem5.py' 'examples/SpongeRollProblem6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem6.py' 'examples/WhiskasModel2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/WhiskasModel2.py' 'examples/SpongeRollProblem2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem2.py' 'examples/furniture.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/furniture.py' 'examples/test6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test6.py' 'examples/BeerDistributionProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/BeerDistributionProblem.py' 'examples/CG.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/CG.py' 'examples/wedding.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/wedding.py' 'examples/SpongeRollProblem3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem3.py' 'examples/BeerDistributionProblemWarehouseExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/BeerDistributionProblemWarehouseExtension.py' 'examples/test3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test3.py' 'examples/Two_stage_Stochastic_GemstoneTools.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py' 'examples/AmericanSteelProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/AmericanSteelProblem.py' 'examples/test1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test1.py' 'examples/test5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test5.py' 'examples/BeerDistributionProblem_resolve.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/BeerDistributionProblem_resolve.py' 'examples/SpongeRollProblem1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem1.py' 'examples/Sudoku1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Sudoku1.py' 'examples/__init__.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/__init__.py' 'examples/WhiskasModel1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/WhiskasModel1.py' 'examples/test4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test4.py' 'examples/Sudoku2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Sudoku2.py' 'examples/SpongeRollProblem4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/SpongeRollProblem4.py' 'examples/test7.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/test7.py' 'examples/ComputerPlantProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/ComputerPlantProblem.py' 'examples/BeerDistributionProblemCompetitorExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/BeerDistributionProblemCompetitorExtension.py' I: pybuild base:311: cd /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build; python3.12 -m unittest discover -v /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' """ Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/0e318571e36b4e74a87e0f09d14d19f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0e318571e36b4e74a87e0f09d14d19f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 18 RHS At line 22 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 1 (-2) rows, 2 (-1) columns and 2 (-4) elements 0 Obj 51.9 Primal inf 2.099999 (1) 1 Obj 54 Optimal - objective value 54 After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2569fbd55cbd4c4bab71ffac9aaabd66-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/2569fbd55cbd4c4bab71ffac9aaabd66-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 67 RHS At line 69 BOUNDS At line 85 ENDATA Problem MODEL has 1 rows, 15 columns and 15 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 4.1943e+06 - 0.00 seconds Cgl0004I processed model has 1 rows, 15 columns (15 integer (15 of which binary)) and 15 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 1 integers unsatisfied sum - 0.221368 Cbc0038I Pass 1: suminf. 0.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.73505e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.78097e+06 Cbc0038I Pass 2: suminf. 0.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.05840 (1) obj. 3.78097e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.41603 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.11677 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.11677 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.10004 (1) obj. 3.78097e+06 iterations 2 Cbc0038I Pass 8: suminf. 0.37438 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 9: suminf. 0.41991 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Solution found of 3.86407e+06 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 6 columns Cbc0038I Mini branch and bound improved solution from 3.86407e+06 to 4.09345e+06 (0.00 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.48138 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.41603 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.41426 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.48315 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.41426 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.11436 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.11436 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 18: suminf. 0.47527 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 19: suminf. 0.37267 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 20: suminf. 0.37324 (1) obj. 4.1943e+06 iterations 3 Cbc0038I Pass 21: suminf. 0.47584 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 22: suminf. 0.37324 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 23: suminf. 0.11177 (1) obj. 4.11362e+06 iterations 8 Cbc0038I Solution found of 4.17588e+06 Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 10 columns 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.22137 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.43242 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.41603 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 7 Cbc0038I Pass 28: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 29: suminf. 0.37926 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 30: suminf. 0.36286 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 31: suminf. 0.44603 (1) obj. 4.1943e+06 iterations 3 Cbc0038I Pass 32: suminf. 0.46243 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 33: suminf. 0.44603 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 34: suminf. 0.27008 (1) obj. 4.18141e+06 iterations 3 Cbc0038I Pass 35: suminf. 0.40813 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 36: suminf. 0.39173 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 37: suminf. 0.39173 (1) obj. 4.18141e+06 iterations 0 Cbc0038I Pass 38: suminf. 0.42363 (1) obj. 4.18141e+06 iterations 5 Cbc0038I Pass 39: suminf. 0.44003 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 40: suminf. 0.42363 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 41: suminf. 0.13391 (1) obj. 4.18141e+06 iterations 5 Cbc0038I Pass 42: suminf. 0.13391 (1) obj. 4.18141e+06 iterations 0 Cbc0038I Pass 43: suminf. 0.36683 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 44: suminf. 0.35043 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 45: suminf. 0.34946 (1) obj. 4.18141e+06 iterations 3 Cbc0038I Pass 46: suminf. 0.36586 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 47: suminf. 0.34946 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 48: suminf. 0.21927 (1) obj. 4.18141e+06 iterations 4 Cbc0038I Pass 49: suminf. 0.21927 (1) obj. 4.18141e+06 iterations 0 Cbc0038I Pass 50: suminf. 0.36579 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 51: suminf. 0.34940 (1) obj. 4.18141e+06 iterations 1 Cbc0038I Pass 52: suminf. 0.08360 (1) obj. 4.1943e+06 iterations 9 Cbc0038I Pass 53: suminf. 0.08360 (1) obj. 4.1943e+06 iterations 0 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.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 6 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 7 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 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 15.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 2 row cuts average 15.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 4190215, took 7 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) Gomory was tried 2 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 2 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 2 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 2 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: 4190215.00000000 Enumerated nodes: 0 Total iterations: 7 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/79f9efa205964850bd6f1a0a3aa9fbad-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79f9efa205964850bd6f1a0a3aa9fbad-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS At line 769 RHS At line 932 BOUNDS At line 1028 ENDATA Problem MODEL has 162 rows, 149 columns and 411 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 2546.96 - 0.00 seconds Cgl0004I processed model has 138 rows, 130 columns (45 integer (45 of which binary)) and 404 elements Cbc0038I Initial state - 11 integers unsatisfied sum - 3.22004 Cbc0038I Pass 1: suminf. 0.21132 (2) obj. 2712.05 iterations 39 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3523.48 iterations 6 Cbc0038I Solution found of 3523.48 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 50 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 36 columns Cbc0038I Mini branch and bound improved solution from 3508.51 to 3508.51 (0.01 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 11 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 31 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 16 Cbc0038I Pass 9: suminf. 0.60340 (5) obj. 3412.36 iterations 3 Cbc0038I Pass 10: suminf. 1.69320 (5) obj. 3412.36 iterations 27 Cbc0038I Pass 11: suminf. 0.73997 (5) obj. 3412.36 iterations 21 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 19 Cbc0038I Pass 14: suminf. 0.81667 (2) obj. 3412.36 iterations 13 Cbc0038I Pass 15: suminf. 0.46319 (1) obj. 3412.36 iterations 1 Cbc0038I Pass 16: suminf. 0.39907 (2) obj. 3412.36 iterations 12 Cbc0038I Pass 17: suminf. 1.35725 (3) obj. 3412.36 iterations 8 Cbc0038I Pass 18: suminf. 0.89952 (3) obj. 3412.36 iterations 11 Cbc0038I Pass 19: suminf. 0.81687 (4) obj. 3412.36 iterations 39 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 15 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 24 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 17 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 31 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 83 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.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 12 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 9 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 42 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 26 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 7 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 11 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 5 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 12 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 10 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 3 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 17 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 50 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 23 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 14 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 28 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 11 Cbc0038I Pass 43: suminf. 0.06045 (1) obj. 3076.56 iterations 23 Cbc0038I Pass 44: suminf. 0.17502 (2) obj. 3076.56 iterations 10 Cbc0038I Pass 45: suminf. 1.60812 (8) obj. 3076.56 iterations 28 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 26 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 15 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 55 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 21 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 13 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 3 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3069.93 iterations 17 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.12 seconds) Cbc0038I After 0.12 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.11 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.12 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 9 added rows had average density of 59 Cbc0013I At root node, 9 cuts changed objective from 2546.9589 to 2695.6793 in 100 passes Cbc0014I Cut generator 0 (Probing) - 33 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.023 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1126 row cuts average 73.6 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.007 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 88 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.019 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 104 row cuts average 36.1 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2695.6793 (0.36 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 51 rows 61 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 69 rows 74 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5030 iterations and 132 nodes (0.82 seconds) Cbc0032I Strong branching done 1354 times (8775 iterations), fathomed 37 nodes and fixed 71 variables Cbc0035I Maximum depth 11, 267 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2695.68 Probing was tried 100 times and created 34 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) Gomory was tried 384 times and created 1819 cuts of which 0 were active after adding rounds of cuts (0.070 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.007 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 384 times and created 337 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.015 seconds) TwoMirCuts was tried 384 times and created 223 cuts of which 0 were active after adding rounds of cuts (0.031 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 338 times and created 12 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 132 Total iterations: 5030 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.83 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.81 (Wallclock seconds): 0.83 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/13bc47d8088444bab3929ea7888b1f38-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/13bc47d8088444bab3929ea7888b1f38-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 Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -93.6063 - 0.00 seconds Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 800 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 22 integers unsatisfied sum - 0.692632 Cbc0038I Pass 1: suminf. 0.23815 (2) obj. -93.5541 iterations 128 Cbc0038I Solution found of -89.55 Cbc0038I Before mini branch and bound, 188 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 4 rows 4 columns Cbc0038I Mini branch and bound improved solution from -89.55 to -90.6 (0.01 seconds) Cbc0038I Round again with cutoff of -90.95 Cbc0038I Reduced cost fixing fixed 5 variables on major pass 2 Cbc0038I Pass 2: suminf. 0.23815 (2) obj. -93.5541 iterations 0 Cbc0038I Pass 3: suminf. 0.49123 (1) obj. -90.95 iterations 27 Cbc0038I Pass 4: suminf. 0.20690 (1) obj. -91.8103 iterations 22 Cbc0038I Pass 5: suminf. 0.89154 (3) obj. -90.95 iterations 111 Cbc0038I Pass 6: suminf. 0.23815 (2) obj. -91.5041 iterations 84 Cbc0038I Pass 7: suminf. 0.54598 (2) obj. -90.95 iterations 45 Cbc0038I Pass 8: suminf. 0.30577 (3) obj. -90.95 iterations 50 Cbc0038I Pass 9: suminf. 0.23815 (2) obj. -91.0041 iterations 97 Cbc0038I Pass 10: suminf. 0.26820 (2) obj. -90.95 iterations 51 Cbc0038I Pass 11: suminf. 0.82292 (3) obj. -90.95 iterations 55 Cbc0038I Pass 12: suminf. 0.23815 (2) obj. -91.4041 iterations 96 Cbc0038I Pass 13: suminf. 0.49042 (2) obj. -90.95 iterations 56 Cbc0038I Pass 14: suminf. 0.53708 (3) obj. -90.95 iterations 37 Cbc0038I Pass 15: suminf. 0.23815 (2) obj. -91.2041 iterations 88 Cbc0038I Pass 16: suminf. 0.37931 (2) obj. -90.95 iterations 55 Cbc0038I Pass 17: suminf. 0.55771 (3) obj. -90.95 iterations 52 Cbc0038I Pass 18: suminf. 0.39867 (2) obj. -90.95 iterations 154 Cbc0038I Pass 19: suminf. 0.49042 (2) obj. -90.95 iterations 121 Cbc0038I Pass 20: suminf. 0.23815 (2) obj. -91.4041 iterations 54 Cbc0038I Pass 21: suminf. 0.49042 (2) obj. -90.95 iterations 55 Cbc0038I Pass 22: suminf. 0.67252 (3) obj. -90.95 iterations 56 Cbc0038I Pass 23: suminf. 0.23815 (2) obj. -91.5041 iterations 94 Cbc0038I Pass 24: suminf. 0.54598 (2) obj. -90.95 iterations 48 Cbc0038I Pass 25: suminf. 0.38956 (3) obj. -90.95 iterations 50 Cbc0038I Pass 26: suminf. 0.32161 (3) obj. -90.95 iterations 9 Cbc0038I Pass 27: suminf. 0.51820 (2) obj. -90.95 iterations 169 Cbc0038I Pass 28: suminf. 0.23815 (2) obj. -91.4541 iterations 56 Cbc0038I Pass 29: suminf. 0.47149 (3) obj. -90.95 iterations 111 Cbc0038I Pass 30: suminf. 0.39799 (3) obj. -90.95 iterations 9 Cbc0038I Pass 31: suminf. 0.40062 (3) obj. -90.95 iterations 24 Cbc0038I Rounding solution of -90.75 is better than previous of -90.6 Cbc0038I Before mini branch and bound, 169 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 4 rows 10 columns Cbc0038I Mini branch and bound improved solution from -90.75 to -91.05 (0.03 seconds) Cbc0038I Round again with cutoff of -91.65 Cbc0038I Reduced cost fixing fixed 16 variables on major pass 3 Cbc0038I Pass 31: suminf. 0.23815 (2) obj. -93.5541 iterations 0 Cbc0038I Pass 32: suminf. 0.26316 (1) obj. -91.65 iterations 27 Cbc0038I Pass 33: suminf. 0.20690 (1) obj. -91.8103 iterations 22 Cbc0038I Pass 34: suminf. 0.39829 (3) obj. -91.65 iterations 114 Cbc0038I Pass 35: suminf. 0.23815 (2) obj. -91.7541 iterations 85 Cbc0038I Pass 36: suminf. 0.29598 (2) obj. -91.65 iterations 51 Cbc0038I Pass 37: suminf. 0.59434 (3) obj. -91.65 iterations 58 Cbc0038I Pass 38: suminf. 0.59434 (3) obj. -91.65 iterations 9 Cbc0038I Pass 39: suminf. 0.43487 (2) obj. -91.65 iterations 138 Cbc0038I Pass 40: suminf. 0.23815 (2) obj. -92.0041 iterations 56 Cbc0038I Pass 41: suminf. 0.76108 (3) obj. -91.65 iterations 113 Cbc0038I Pass 42: suminf. 0.72446 (3) obj. -91.65 iterations 8 Cbc0038I Pass 43: suminf. 0.68487 (2) obj. -91.65 iterations 132 Cbc0038I Pass 44: suminf. 0.23815 (2) obj. -92.4541 iterations 52 Cbc0038I Pass 45: suminf. 0.68487 (2) obj. -91.65 iterations 52 Cbc0038I Pass 46: suminf. 0.30577 (3) obj. -91.65 iterations 46 Cbc0038I Pass 47: suminf. 0.23815 (2) obj. -91.7041 iterations 94 Cbc0038I Pass 48: suminf. 0.26820 (2) obj. -91.65 iterations 52 Cbc0038I Pass 49: suminf. 0.69997 (3) obj. -91.65 iterations 37 Cbc0038I Pass 50: suminf. 0.23815 (2) obj. -92.0041 iterations 95 Cbc0038I Pass 51: suminf. 0.43487 (2) obj. -91.65 iterations 53 Cbc0038I Pass 52: suminf. 0.68077 (3) obj. -91.65 iterations 41 Cbc0038I Pass 53: suminf. 0.23815 (2) obj. -92.0041 iterations 89 Cbc0038I Pass 54: suminf. 0.43487 (2) obj. -91.65 iterations 56 Cbc0038I Pass 55: suminf. 0.60640 (3) obj. -91.65 iterations 55 Cbc0038I Pass 56: suminf. 0.39867 (2) obj. -91.65 iterations 159 Cbc0038I Pass 57: suminf. 0.49042 (2) obj. -91.65 iterations 117 Cbc0038I Pass 58: suminf. 0.23815 (2) obj. -92.1041 iterations 55 Cbc0038I Pass 59: suminf. 0.49042 (2) obj. -91.65 iterations 55 Cbc0038I Pass 60: suminf. 0.31027 (3) obj. -91.65 iterations 44 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 173 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 4 rows 7 columns Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -91.05 - took 0.05 seconds Cbc0012I Integer solution of -91.05 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 220 rows 210 columns, reduced to 4 rows 6 columns Cbc0031I 3 added rows had average density of 10.666667 Cbc0013I At root node, 28 cuts changed objective from -93.606263 to -91.05 in 1 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 3 column cuts (3 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 23.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 2 row cuts average 7.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 20.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 20 row cuts average 20.9 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective -91.05, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 6 variables fixed on reduced cost Cuts at root node changed objective from -93.6063 to -91.05 Probing was tried 1 times and created 3 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 1 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 20 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -91.05000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/46407e67600f49ae945e2998a0e32426-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46407e67600f49ae945e2998a0e32426-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 121 RHS At line 125 BOUNDS At line 146 ENDATA Problem MODEL has 3 rows, 26 columns and 66 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 3 integers unsatisfied sum - 0.716619 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 150 iterations 3 Cbc0038I Solution found of 150 Cbc0038I Relaxing continuous gives 150 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 134.1 Cbc0038I Pass 2: suminf. 0.06853 (1) obj. 134.1 iterations 1 Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 134.1 iterations 3 Cbc0038I Solution found of 134.1 Cbc0038I Relaxing continuous gives 82 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 9 columns Cbc0038I Mini branch and bound improved solution from 82 to 82 (0.00 seconds) Cbc0038I Round again with cutoff of 64.8001 Cbc0038I Pass 4: suminf. 0.36724 (1) obj. 64.8001 iterations 0 Cbc0038I Pass 5: suminf. 0.07414 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 6: suminf. 0.34138 (1) obj. 64.8001 iterations 10 Cbc0038I Pass 7: suminf. 0.10000 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 8: suminf. 0.34138 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 9: suminf. 0.35209 (2) obj. 64.8001 iterations 11 Cbc0038I Pass 10: suminf. 0.35209 (2) obj. 64.8001 iterations 0 Cbc0038I Pass 11: suminf. 0.30386 (2) obj. 64.8001 iterations 4 Cbc0038I Pass 12: suminf. 0.19091 (2) obj. 64.8001 iterations 3 Cbc0038I Pass 13: suminf. 0.41787 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 14: suminf. 0.41787 (1) obj. 64.8001 iterations 0 Cbc0038I Pass 15: suminf. 0.03103 (1) obj. 64.8001 iterations 4 Cbc0038I Pass 16: suminf. 0.41034 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 17: suminf. 0.22714 (2) obj. 64.8001 iterations 2 Cbc0038I Pass 18: suminf. 0.04815 (1) obj. 64.8001 iterations 6 Cbc0038I Pass 19: suminf. 0.45577 (1) obj. 64.8001 iterations 3 Cbc0038I Pass 20: suminf. 0.00000 (0) obj. 64.8001 iterations 6 Cbc0038I Solution found of 64.8001 Cbc0038I Relaxing continuous gives 36 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 36 to 16 (0.01 seconds) Cbc0038I Round again with cutoff of 10.5001 Cbc0038I Pass 21: suminf. 0.63782 (2) obj. 10.5001 iterations 1 Cbc0038I Pass 22: suminf. 0.76294 (2) obj. 10.5001 iterations 2 Cbc0038I Pass 23: suminf. 1.14411 (3) obj. 10.5001 iterations 7 Cbc0038I Pass 24: suminf. 1.11647 (3) obj. 10.5001 iterations 2 Cbc0038I Pass 25: suminf. 0.78362 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 26: suminf. 0.65604 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 27: suminf. 0.80726 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 28: suminf. 0.47988 (3) obj. 10.5001 iterations 3 Cbc0038I Pass 29: suminf. 0.71591 (3) obj. 10.5001 iterations 3 Cbc0038I Pass 30: suminf. 0.53302 (2) obj. 10.5001 iterations 5 Cbc0038I Pass 31: suminf. 0.71591 (3) obj. 10.5001 iterations 2 Cbc0038I Pass 32: suminf. 0.48656 (2) obj. 10.5001 iterations 7 Cbc0038I Pass 33: suminf. 0.48656 (2) obj. 10.5001 iterations 0 Cbc0038I Pass 34: suminf. 0.76294 (2) obj. 10.5001 iterations 4 Cbc0038I Pass 35: suminf. 0.63782 (2) obj. 10.5001 iterations 2 Cbc0038I Pass 36: suminf. 0.30775 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 37: suminf. 0.30775 (3) obj. 10.5001 iterations 0 Cbc0038I Pass 38: suminf. 0.93257 (3) obj. 10.5001 iterations 3 Cbc0038I Pass 39: suminf. 0.74169 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 40: suminf. 0.88678 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 41: suminf. 0.32235 (2) obj. 10.5001 iterations 7 Cbc0038I Pass 42: suminf. 0.36624 (2) obj. 10.5001 iterations 6 Cbc0038I Pass 43: suminf. 0.36624 (2) obj. 10.5001 iterations 0 Cbc0038I Pass 44: suminf. 0.82829 (3) obj. 10.5001 iterations 5 Cbc0038I Pass 45: suminf. 0.43525 (3) obj. 10.5001 iterations 3 Cbc0038I Pass 46: suminf. 0.37456 (3) obj. 10.5001 iterations 6 Cbc0038I Pass 47: suminf. 0.37456 (3) obj. 10.5001 iterations 0 Cbc0038I Pass 48: suminf. 0.83254 (3) obj. 10.5001 iterations 4 Cbc0038I Pass 49: suminf. 0.22906 (2) obj. 10.5001 iterations 3 Cbc0038I Pass 50: suminf. 1.41915 (3) obj. 10.5001 iterations 4 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Mini branch and bound improved solution from 16 to 10 (0.02 seconds) Cbc0038I Round again with cutoff of 6.30007 Cbc0038I Pass 50: suminf. 0.66624 (3) obj. 6.30007 iterations 1 Cbc0038I Pass 51: suminf. 0.86279 (3) obj. 6.30007 iterations 2 Cbc0038I Pass 52: suminf. 0.61370 (3) obj. 6.30007 iterations 4 Cbc0038I Pass 53: suminf. 0.94142 (3) obj. 6.30007 iterations 4 Cbc0038I Pass 54: suminf. 0.69551 (2) obj. 6.30007 iterations 5 Cbc0038I Pass 55: suminf. 1.08253 (3) obj. 6.30007 iterations 3 Cbc0038I Pass 56: suminf. 0.48470 (2) obj. 6.30007 iterations 5 Cbc0038I Pass 57: suminf. 0.42135 (2) obj. 6.30007 iterations 1 Cbc0038I Pass 58: suminf. 0.71684 (2) obj. 6.30007 iterations 4 Cbc0038I Pass 59: suminf. 0.60307 (2) obj. 6.30007 iterations 2 Cbc0038I Pass 60: suminf. 0.71446 (3) obj. 6.30007 iterations 11 Cbc0038I Pass 61: suminf. 0.90532 (3) obj. 6.30007 iterations 5 Cbc0038I Pass 62: suminf. 0.32029 (3) obj. 6.30007 iterations 4 Cbc0038I Pass 63: suminf. 0.74432 (3) obj. 6.30007 iterations 3 Cbc0038I Pass 64: suminf. 0.55030 (3) obj. 6.30007 iterations 1 Cbc0038I Pass 65: suminf. 0.66614 (3) obj. 6.30007 iterations 2 Cbc0038I Pass 66: suminf. 0.48880 (3) obj. 6.30007 iterations 5 Cbc0038I Pass 67: suminf. 0.77503 (3) obj. 6.30007 iterations 3 Cbc0038I Pass 68: suminf. 0.42590 (3) obj. 6.30007 iterations 2 Cbc0038I Pass 69: suminf. 0.33979 (3) obj. 6.30007 iterations 3 Cbc0038I Pass 70: suminf. 0.33979 (3) obj. 6.30007 iterations 0 Cbc0038I Pass 71: suminf. 0.63574 (3) obj. 6.30007 iterations 7 Cbc0038I Pass 72: suminf. 0.48825 (3) obj. 6.30007 iterations 2 Cbc0038I Pass 73: suminf. 0.59060 (3) obj. 6.30007 iterations 1 Cbc0038I Pass 74: suminf. 0.67304 (3) obj. 6.30007 iterations 8 Cbc0038I Pass 75: suminf. 0.67304 (3) obj. 6.30007 iterations 0 Cbc0038I Pass 76: suminf. 0.97881 (3) obj. 6.30007 iterations 4 Cbc0038I Pass 77: suminf. 0.85460 (3) obj. 6.30007 iterations 2 Cbc0038I Pass 78: suminf. 0.71104 (3) obj. 6.30007 iterations 11 Cbc0038I Pass 79: suminf. 0.40598 (3) obj. 6.30007 iterations 6 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 23 columns Cbc0038I Mini branch and bound improved solution from 10 to 7 (0.03 seconds) Cbc0038I Round again with cutoff of 3.60006 Cbc0038I Pass 79: suminf. 0.68767 (3) obj. 3.60006 iterations 0 Cbc0038I Pass 80: suminf. 0.82580 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 81: suminf. 0.65782 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 82: suminf. 0.92952 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 83: suminf. 0.71481 (3) obj. 3.60006 iterations 5 Cbc0038I Pass 84: suminf. 1.05727 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 85: suminf. 0.51093 (2) obj. 3.60006 iterations 5 Cbc0038I Pass 86: suminf. 0.45815 (2) obj. 3.60006 iterations 1 Cbc0038I Pass 87: suminf. 0.70933 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 88: suminf. 0.65576 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 89: suminf. 1.02943 (3) obj. 3.60006 iterations 3 Cbc0038I Pass 90: suminf. 1.02943 (3) obj. 3.60006 iterations 0 Cbc0038I Pass 91: suminf. 1.04219 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 92: suminf. 0.65929 (3) obj. 3.60006 iterations 3 Cbc0038I Pass 93: suminf. 0.87260 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 94: suminf. 0.59840 (2) obj. 3.60006 iterations 5 Cbc0038I Pass 95: suminf. 0.55297 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 96: suminf. 0.57918 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 97: suminf. 0.38257 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 98: suminf. 0.72477 (3) obj. 3.60006 iterations 5 Cbc0038I Pass 99: suminf. 0.37168 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 100: suminf. 0.82255 (3) obj. 3.60006 iterations 2 Cbc0038I Pass 101: suminf. 0.71084 (3) obj. 3.60006 iterations 1 Cbc0038I Pass 102: suminf. 0.95076 (3) obj. 3.60006 iterations 8 Cbc0038I Pass 103: suminf. 0.72745 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 104: suminf. 0.47688 (3) obj. 3.60006 iterations 3 Cbc0038I Pass 105: suminf. 0.24268 (3) obj. 3.60006 iterations 5 Cbc0038I Pass 106: suminf. 1.11859 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 107: suminf. 0.73460 (3) obj. 3.60006 iterations 4 Cbc0038I Pass 108: suminf. 0.72510 (3) obj. 3.60006 iterations 2 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 24 columns Cbc0038I Mini branch and bound improved solution from 7 to 5 (0.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 5 - took 0.04 seconds Cbc0012I Integer solution of 5 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0031I 3 added rows had average density of 20.666667 Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 591 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 539 row cuts average 11.3 elements, 0 column cuts (0 active) in 0.027 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) - 476 row cuts average 19.5 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 102 row cuts average 9.0 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 319 row cuts average 18.6 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0010I After 0 nodes, 1 on tree, 5 best solution, best possible 0 (0.14 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0012I Integer solution of 2 found by DiveCoefficient after 1639 iterations and 140 nodes (0.18 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 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 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 Cbc0010I After 1000 nodes, 5 on tree, 2 best solution, best possible 0 (0.37 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0001I Search completed - best objective 2, took 17938 iterations and 6735 nodes (0.52 seconds) Cbc0032I Strong branching done 7780 times (20682 iterations), fathomed 464 nodes and fixed 533 variables Cbc0041I Maximum depth 12, 245 variables fixed on reduced cost (complete fathoming 272 times, 5087 nodes taking 9676 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.003 seconds) Gomory was tried 100 times and created 591 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) Knapsack was tried 100 times and created 539 cuts of which 0 were active after adding rounds of cuts (0.027 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 476 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 100 times and created 102 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 100 times and created 319 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 2.00000000 Enumerated nodes: 6735 Total iterations: 17938 Time (CPU seconds): 0.51 Time (Wallclock seconds): 0.52 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.51 (Wallclock seconds): 0.52 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ae5bca69d1df4f7e9e20e6aa3ffd3e8b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae5bca69d1df4f7e9e20e6aa3ffd3e8b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 18 RHS At line 22 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 1 (-2) rows, 2 (-1) columns and 2 (-4) elements 0 Obj 51.9 Primal inf 2.099999 (1) 1 Obj 54 Optimal - objective value 54 After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/d8260c9ce48c4eb180ccf4702168d1a9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d8260c9ce48c4eb180ccf4702168d1a9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 18 RHS At line 22 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 1 (-2) rows, 2 (-1) columns and 2 (-4) elements 0 Obj 51.9 Primal inf 2.099999 (1) 1 Obj 54 Optimal - objective value 54 After Postsolve, objective 54, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 54 - 1 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 test_doctest (pulp.tests.test_examples.Examples_DocsTests.test_doctest) runs all doctests ... ok test_examples (pulp.tests.test_examples.Examples_DocsTests.test_examples) ... /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py:1352: UserWarning: Spaces are not permitted in the name. Converted to '_' warnings.warn("Spaces are not permitted in the name. Converted to '_'") Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ab09c1099e9a4929bd6b0b40105bc670-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ab09c1099e9a4929bd6b0b40105bc670-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 10 iterations and 0 nodes (0.00 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 5.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 10 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 10 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/d5b90fb40f404a9fab4a6eb49274cc0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d5b90fb40f404a9fab4a6eb49274cc0a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS At line 85 RHS At line 95 BOUNDS At line 113 ENDATA Problem MODEL has 9 rows, 14 columns and 28 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 15005 - 0.00 seconds Cgl0003I 0 fixed, 1 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 4 rows, 6 columns (6 integer (0 of which binary)) and 10 elements Cutoff increment increased from 1e-05 to 0.024975 Cbc0012I Integer solution of 15005 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 15005, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 15005 to 15005 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 15005.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/eb39de58175241d9a7f82dfafdbc8977-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb39de58175241d9a7f82dfafdbc8977-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/bfe1b90b768845e18d9caa13e5e9b0a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bfe1b90b768845e18d9caa13e5e9b0a4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS At line 4757 RHS At line 5108 BOUNDS At line 5839 ENDATA Problem MODEL has 350 rows, 730 columns and 2942 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 7 fixed, 0 tightened bounds, 0 strengthened rows, 20 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0004I processed model has 31 rows, 30 columns (30 integer (30 of which binary)) and 106 elements 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.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ca632ec571ff46a1bfb94dc22d2dd7c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca632ec571ff46a1bfb94dc22d2dd7c5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS At line 4839 RHS At line 5191 BOUNDS At line 5922 ENDATA Problem MODEL has 351 rows, 730 columns and 3023 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 8 fixed, 0 tightened bounds, 1 strengthened rows, 23 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 31 rows, 28 columns (28 integer (28 of which binary)) and 119 elements Cbc0038I Initial state - 20 integers unsatisfied sum - 7.5 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 0 iterations 4 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 7 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/5f9ffdfa2cd84c1a882a803681d22059-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f9ffdfa2cd84c1a882a803681d22059-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS At line 4921 RHS At line 5274 BOUNDS At line 6005 ENDATA Problem MODEL has 352 rows, 730 columns and 3104 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 8 fixed, 0 tightened bounds, 2 strengthened rows, 27 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 32 rows, 28 columns (28 integer (28 of which binary)) and 142 elements 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.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/c4803ec1dd6247d39106860618c858a1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c4803ec1dd6247d39106860618c858a1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 5003 RHS At line 5357 BOUNDS At line 6088 ENDATA Problem MODEL has 353 rows, 730 columns and 3185 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 35 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 12 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 32 rows, 26 columns (26 integer (26 of which binary)) and 148 elements 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.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/f2930ead17a44dfe91b30acaac90da2b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f2930ead17a44dfe91b30acaac90da2b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS At line 5085 RHS At line 5440 BOUNDS At line 6171 ENDATA Problem MODEL has 354 rows, 730 columns and 3266 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 10 fixed, 0 tightened bounds, 4 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 25 rows, 20 columns (20 integer (20 of which binary)) and 127 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 1.11022e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 20 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/00caf86d7ad24a75a9c2154a2d85feef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/00caf86d7ad24a75a9c2154a2d85feef-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS At line 5167 RHS At line 5523 BOUNDS At line 6254 ENDATA Problem MODEL has 355 rows, 730 columns and 3347 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 11 fixed, 0 tightened bounds, 5 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 22 rows, 17 columns (17 integer (17 of which binary)) and 113 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2545605cbb394c9fb5c21755dd8c273f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2545605cbb394c9fb5c21755dd8c273f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS At line 5249 RHS At line 5606 BOUNDS At line 6337 ENDATA Problem MODEL has 356 rows, 730 columns and 3428 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 10 fixed, 0 tightened bounds, 6 strengthened rows, 31 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 3 strengthened rows, 8 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 8 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 6 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 23 rows, 17 columns (17 integer (17 of which binary)) and 127 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 1.33227e-15 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.05 Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/d32f11c0396c44d98396fbadf167588d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d32f11c0396c44d98396fbadf167588d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS At line 5331 RHS At line 5689 BOUNDS At line 6420 ENDATA Problem MODEL has 357 rows, 730 columns and 3509 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 13 fixed, 0 tightened bounds, 7 strengthened rows, 60 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 14 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 6 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 13 rows, 9 columns (9 integer (9 of which binary)) and 72 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 2.22045e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/e0fdbea3d5de47fc96d56de6b6eee534-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0fdbea3d5de47fc96d56de6b6eee534-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS At line 5413 RHS At line 5772 BOUNDS At line 6503 ENDATA Problem MODEL has 358 rows, 730 columns and 3590 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 17 fixed, 0 tightened bounds, 8 strengthened rows, 84 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 11 rows, 9 columns (9 integer (9 of which binary)) and 48 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 9 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/8ca9da7f66d348379e7da243399f22dd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ca9da7f66d348379e7da243399f22dd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS At line 5495 RHS At line 5855 BOUNDS At line 6586 ENDATA Problem MODEL has 359 rows, 730 columns and 3671 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 9 strengthened rows, 16 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 2 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 2 columns (2 integer (2 of which binary)) and 6 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 2 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I After 0.03 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.03 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.03 seconds) 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) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/c025efc8146d490db1b655737826150c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c025efc8146d490db1b655737826150c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS At line 5577 RHS At line 5938 BOUNDS At line 6669 ENDATA Problem MODEL has 360 rows, 730 columns and 3752 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 10 strengthened rows, 78 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ca6bbdab24f44d8d8552b9bb775b8b9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca6bbdab24f44d8d8552b9bb775b8b9c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS At line 5659 RHS At line 6021 BOUNDS At line 6752 ENDATA Problem MODEL has 361 rows, 730 columns and 3833 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - -0.00 seconds Cgl0003I 35 fixed, 0 tightened bounds, 11 strengthened rows, 19 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/d33553376e9946a1b64a434960f71e37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d33553376e9946a1b64a434960f71e37-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS At line 5741 RHS At line 6104 BOUNDS At line 6835 ENDATA Problem MODEL has 362 rows, 730 columns and 3914 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0003I 30 fixed, 0 tightened bounds, 12 strengthened rows, 26 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 4 rows, 2 columns (2 integer (2 of which binary)) and 8 elements Cbc0038I Initial state - 2 integers unsatisfied sum - 0.285714 Cbc0038I Pass 1: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 2: suminf. 1.00000 (2) obj. 0 iterations 1 Cbc0038I Pass 3: suminf. 1.00000 (2) obj. 0 iterations 0 Cbc0038I Pass 4: suminf. 1.00000 (2) obj. 0 iterations 0 Cbc0038I Pass 5: suminf. 1.00000 (2) obj. 0 iterations 0 Cbc0038I Pass 6: suminf. 0.28571 (2) obj. 0 iterations 2 Cbc0038I Pass 7: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 8: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 9: suminf. 0.28571 (2) obj. 0 iterations 1 Cbc0038I Pass 10: suminf. 1.00000 (2) obj. 0 iterations 1 Cbc0038I Pass 11: suminf. 0.28571 (2) obj. 0 iterations 2 Cbc0038I Pass 12: suminf. 0.28571 (2) obj. 0 iterations 1 Cbc0038I Pass 13: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 14: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 15: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 16: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 17: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 18: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 19: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 20: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 21: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 22: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 23: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 24: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 25: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 26: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 27: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 28: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I Pass 29: suminf. 0.28571 (2) obj. 0 iterations 0 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.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 Cbc0014I Cut generator 1 (Gomory) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 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.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) 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 - Problem proven infeasible No feasible solution found Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ae553dd188e64994b8356564a50eaf72-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ae553dd188e64994b8356564a50eaf72-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ad92368e8c404a36b69f20183a536aee-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad92368e8c404a36b69f20183a536aee-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/52bb813f10a2471f8065c13e3a5a9377-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/52bb813f10a2471f8065c13e3a5a9377-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 /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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/9e6ee855c4104fb9b4ae1cbf6d2a515d-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/9e6ee855c4104fb9b4ae1cbf6d2a515d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/cb63a48610d7441a94d53f09718ebb9c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cb63a48610d7441a94d53f09718ebb9c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 86 RHS At line 90 BOUNDS At line 109 ENDATA Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/0b86da1f9d6b49878e19ac1899814669-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0b86da1f9d6b49878e19ac1899814669-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/b703817c57d844d19233843156393b5e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b703817c57d844d19233843156393b5e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8630 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8630 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8630, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8630 to 8630 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8630.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/9a32ba83287b4c24a07691bd6c895480-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9a32ba83287b4c24a07691bd6c895480-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8660 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8660 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8660, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8660 to 8660 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 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.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2acde6fc48714706a36ca434c08d1715-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2acde6fc48714706a36ca434c08d1715-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8690 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8690 to 8690 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/6319b4b3bdf043f7a26c34a5906a78b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6319b4b3bdf043f7a26c34a5906a78b7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8720 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8720 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8720, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8720 to 8720 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8720.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 0.0 x_1 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 0.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 Status: Optimal s_0 = 0.0 s_1 = 1.0 s_2 = 0.0 w_0 = 1.0 w_1 = 0.0 w_2 = 0.0 x_0 = 0.0 x_1 = 1.0 x_10 = 1.0 x_11 = 0.0 x_12 = 1.0 x_13 = 0.0 x_14 = 0.0 x_15 = 1.0 x_16 = 1.0 x_17 = 1.0 x_18 = 1.0 x_19 = 1.0 x_2 = 1.0 x_3 = 0.0 x_4 = 0.0 x_5 = 0.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 1.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 items passed all tests: 8 tests in pulp 8 tests in 1 items. 8 passed and 0 failed. Test passed. Status: Optimal BuildaPlant_Denver = 0.0 BuildaPlant_Los_Angeles = 1.0 BuildaPlant_Phoenix = 1.0 BuildaPlant_San_Francisco = 1.0 Route_Denver_Barstow = 0.0 Route_Denver_Dallas = 0.0 Route_Denver_San_Diego = 0.0 Route_Denver_Tucson = 0.0 Route_Los_Angeles_Barstow = 0.0 Route_Los_Angeles_Dallas = 300.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 0.0 Route_Phoenix_Dallas = 200.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 1000.0 Route_San_Francisco_Dallas = 700.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Status: Optimal Route_('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 Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1700.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_C_1 = 0.0 Route_C_2 = 0.0 Route_C_3 = 100.0 Route_C_4 = 0.0 Route_C_5 = 0.0 Total Cost of Transportation = 8300.0 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt 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 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous 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 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 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.0Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/851bc37235c34c48bbbef657ebb74076-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/851bc37235c34c48bbbef657ebb74076-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8750 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8750 found by DiveCoefficient after 0 iterations and 0 nodes (0.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 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/e27b00dc209c4a308b65874469adcbfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e27b00dc209c4a308b65874469adcbfd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8780 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8780 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8780, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8780 to 8780 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8780.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/baee9e8734c7490e963535ff4428ec38-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/baee9e8734c7490e963535ff4428ec38-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8810 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8810 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8810, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8810 to 8810 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8810.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/be151237a0d9441fb6ec803cc509a07c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be151237a0d9441fb6ec803cc509a07c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8840 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8840 found by DiveCoefficient after 0 iterations and 0 nodes (0.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 8840 to 8840 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8840.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/ad26b44f56a944d399de62b68d3fdef7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad26b44f56a944d399de62b68d3fdef7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8870 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8870 found by DiveCoefficient after 0 iterations and 0 nodes (0.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 8870 to 8870 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8870.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/156df4f7df1745b49d26f076c59eacba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/156df4f7df1745b49d26f076c59eacba-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 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) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8900 to 8900 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8900.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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/23d658d7b2594cdc9b9494624e0ebbbf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/23d658d7b2594cdc9b9494624e0ebbbf-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2db30e88314d4a6384472109a7054141-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2db30e88314d4a6384472109a7054141-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 25 RHS At line 31 BOUNDS At line 33 ENDATA Problem MODEL has 5 rows, 2 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0.966667 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0.97 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.97000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/f96843b6482844a9bccc45514f2ca3f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f96843b6482844a9bccc45514f2ca3f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/79e092be50f748c880f174c0dcafb264-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/79e092be50f748c880f174c0dcafb264-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.06 seconds) Cbc0038I After 0.06 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.06 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 12 to 12 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.05 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/eb9dd8d588fb4da3a1ea4dbff5bf6f08-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb9dd8d588fb4da3a1ea4dbff5bf6f08-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/625b9a534b444344ac575bf5e69e97ba-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/625b9a534b444344ac575bf5e69e97ba-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 86 RHS At line 90 BOUNDS At line 109 ENDATA Problem MODEL has 3 rows, 18 columns and 23 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds Cgl0003I 0 fixed, 17 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 17 columns (17 integer (0 of which binary)) and 23 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 246.96 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 17 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2f3c9dd2538d4da59d0d0998b956c683-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f3c9dd2538d4da59d0d0998b956c683-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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/4fc3d9c5c56c447b9c518b7624c348bf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4fc3d9c5c56c447b9c518b7624c348bf-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/553fc7503feb4f19a8af81be01f8dc63-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/553fc7503feb4f19a8af81be01f8dc63-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.08571 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3.5 Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.06667 to -1.05 Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.05000000 Enumerated nodes: 0 Total iterations: 4 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/205474e394684ccd864e59862133767c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/205474e394684ccd864e59862133767c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/154c28976b6240fd99cc6bd577837907-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/154c28976b6240fd99cc6bd577837907-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in -0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in -0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in -0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in -0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (-0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2a952eecb67b44059295b14b5b83f406-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2a952eecb67b44059295b14b5b83f406-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 38 RHS At line 42 BOUNDS At line 50 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds Cgl0003I 0 fixed, 7 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 7 columns (7 integer (0 of which binary)) and 8 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/083c3335c60747b1a147911d0f9cca80-pulp.mps mips /tmp/083c3335c60747b1a147911d0f9cca80-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/083c3335c60747b1a147911d0f9cca80-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors opening mipstart file /tmp/083c3335c60747b1a147911d0f9cca80-pulp.mst. MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0045I MIPStart provided solution with cost 12 Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.05 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0045I Solution of 12 already found by heuristic Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.05 Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/94d60e13489d4e5c82558d9145ecd070-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94d60e13489d4e5c82558d9145ecd070-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/e0b8aaddb01043d38faf198baa11006c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e0b8aaddb01043d38faf198baa11006c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/4446519ce51846c39ccbe933108f3fe1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4446519ce51846c39ccbe933108f3fe1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/61a9523eee064a7f85cc8d12a1cba8fd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/61a9523eee064a7f85cc8d12a1cba8fd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/febc3faf87a94257a8995f5dd64ec6f5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/febc3faf87a94257a8995f5dd64ec6f5-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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/2e82be513eb543478c793b9dda401998-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2e82be513eb543478c793b9dda401998-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/70206e19e7dc49328d8d8f3a299d146b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/70206e19e7dc49328d8d8f3a299d146b-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.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/f4dad99fedb6481a9b92804f0cc1e730-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f4dad99fedb6481a9b92804f0cc1e730-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.11 Build Date: May 11 2024 command line - /usr/bin/cbc /tmp/e133a14db7ef4dedbfb3445cbe1d105a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e133a14db7ef4dedbfb3445cbe1d105a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 46 RHS At line 50 BOUNDS At line 60 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 246.5 - 0.00 seconds Cgl0003I 0 fixed, 9 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 9 columns (9 integer (0 of which binary)) and 10 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 9 columns, reduced to 0 rows 0 columns Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.CHOCO_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.CHOCO_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.CHOCO_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.CHOCO_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.CHOCO_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.CHOCO_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.CHOCO_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.CHOCO_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.CHOCO_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.CHOCO_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.CHOCO_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.CHOCO_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CHOCO_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.CHOCO_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CHOCO_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.CHOCO_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.CHOCO_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.CHOCO_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.CHOCO_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.COINMP_DLLTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.COINMP_DLLTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.COINMP_DLLTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.COINMP_DLLTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.COINMP_DLLTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.COINMP_DLLTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.COINMP_DLLTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.COINMP_DLLTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.COINMP_DLLTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.COINMP_DLLTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.COINMP_DLLTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.COINMP_DLLTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.COINMP_DLLTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.COINMP_DLLTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.COINMP_DLLTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.COINMP_DLLTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.COINMP_DLLTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.COINMP_DLLTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.COINMP_DLLTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.COINMP_DLLTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.COINMP_DLLTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.COINMP_DLLTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.COINMP_DLLTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.COINMP_DLLTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.COINMP_DLLTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.COINMP_DLLTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.COINMP_DLLTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.COINMP_DLLTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.COINMP_DLLTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.COIN_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... ok test_LpVariable_indexs_param (pulp.tests.test_pulp.COIN_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py:1265: DeprecationWarning: 'indexs' is deprecated; use 'indices'. assign_vars = LpVariable.dicts(name="test", indexs=(customers, agents)) /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_pulp.py:1278: DeprecationWarning: 'indexs' is deprecated; use 'indices'. assign_vars_matrix = LpVariable.matrix( ok test_LpVariable_indices_param (pulp.tests.test_pulp.COIN_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... ok test_assignInvalidStatus (pulp.tests.test_pulp.COIN_CMDTest.test_assignInvalidStatus) ... ok test_export_dict_LP (pulp.tests.test_pulp.COIN_CMDTest.test_export_dict_LP) ... ok test_export_dict_LP_no_obj (pulp.tests.test_pulp.COIN_CMDTest.test_export_dict_LP_no_obj) ... ok test_export_dict_MIP (pulp.tests.test_pulp.COIN_CMDTest.test_export_dict_MIP) ... ok test_export_dict_max (pulp.tests.test_pulp.COIN_CMDTest.test_export_dict_max) ... ok test_export_json_LP (pulp.tests.test_pulp.COIN_CMDTest.test_export_json_LP) ... ok test_export_solver_dict_LP (pulp.tests.test_pulp.COIN_CMDTest.test_export_solver_dict_LP) ... ok test_export_solver_json (pulp.tests.test_pulp.COIN_CMDTest.test_export_solver_json) ... /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/coin_api.py:189: ResourceWarning: unclosed file <_io.TextIOWrapper name='/dev/null' mode='w' encoding='utf-8'> pipe = open(self.optionsDict["logPath"], "w") ResourceWarning: Enable tracemalloc to get the object allocation traceback ok test_false_constraint (pulp.tests.test_pulp.COIN_CMDTest.test_false_constraint) ... ok test_importMPS_RHS_fields56 (pulp.tests.test_pulp.COIN_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... ok test_importMPS_binary (pulp.tests.test_pulp.COIN_CMDTest.test_importMPS_binary) ... ok test_importMPS_integer (pulp.tests.test_pulp.COIN_CMDTest.test_importMPS_integer) ... ok test_importMPS_maximize (pulp.tests.test_pulp.COIN_CMDTest.test_importMPS_maximize) ... ok test_importMPS_noname (pulp.tests.test_pulp.COIN_CMDTest.test_importMPS_noname) ... ok test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.COIN_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... ok test_invalid_var_names (pulp.tests.test_pulp.COIN_CMDTest.test_invalid_var_names) ... ok test_logPath (pulp.tests.test_pulp.COIN_CMDTest.test_logPath) ... ok test_makeDict_behavior (pulp.tests.test_pulp.COIN_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... ok test_makeDict_default_value (pulp.tests.test_pulp.COIN_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... ok test_measuring_solving_time (pulp.tests.test_pulp.COIN_CMDTest.test_measuring_solving_time) ... ok test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.COIN_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... ok test_pulpTestAll (pulp.tests.test_pulp.COIN_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... ok test_pulp_001 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... ok test_pulp_009 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_009) ... ok test_pulp_010 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_010) ... ok test_pulp_011 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_011) ... ok test_pulp_012 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_012) ... ok test_pulp_013 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_013) ... ok test_pulp_014 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_014) ... ok test_pulp_015 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_015) ... ok test_pulp_016 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_016) ... ok test_pulp_017 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_017) ... ok test_pulp_018 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_018) ... ok test_pulp_019 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_019) ... ok test_pulp_020 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_020) ... ok test_pulp_021 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_021) ... ok test_pulp_022 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_022) ... ok test_pulp_023 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_023) ... ok test_pulp_030 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_030) ... ok test_pulp_040 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_040) ... ok test_pulp_050 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_050) ... ok test_pulp_060 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_060) ... ok test_pulp_061 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_061) ... ok test_pulp_070 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_070) ... ok test_pulp_075 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_075) ... ok test_pulp_080 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... ok test_pulp_090 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_090) ... ok test_pulp_100 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... ok test_pulp_110 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... ok test_pulp_120 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... ok test_pulp_121 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... ok test_pulp_122 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... ok test_pulp_123 (pulp.tests.test_pulp.COIN_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... ok test_timeLimit (pulp.tests.test_pulp.COIN_CMDTest.test_timeLimit) ... ok test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.COIN_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... ok test_unset_objective_value__is_valid (pulp.tests.test_pulp.COIN_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CPLEX_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.CPLEX_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.CPLEX_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.CPLEX_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.CPLEX_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.CPLEX_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.CPLEX_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.CPLEX_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.CPLEX_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.CPLEX_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.CPLEX_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.CPLEX_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.CPLEX_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.CPLEX_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.CPLEX_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CPLEX_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CPLEX_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.CPLEX_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.CPLEX_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.CPLEX_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.CPLEX_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CPLEX_PYTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.CPLEX_PYTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.CPLEX_PYTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.CPLEX_PYTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.CPLEX_PYTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.CPLEX_PYTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.CPLEX_PYTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.CPLEX_PYTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.CPLEX_PYTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.CPLEX_PYTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.CPLEX_PYTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.CPLEX_PYTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.CPLEX_PYTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.CPLEX_PYTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.CPLEX_PYTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.CPLEX_PYTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.CPLEX_PYTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.CPLEX_PYTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.CPLEX_PYTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.CPLEX_PYTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.CPLEX_PYTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.CPLEX_PYTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.CPLEX_PYTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.CPLEX_PYTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.CPLEX_PYTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.CPLEX_PYTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.CPLEX_PYTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.CPLEX_PYTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.CPLEX_PYTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.GLPK_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.GLPK_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.GLPK_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.GLPK_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.GLPK_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.GLPK_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.GLPK_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.GLPK_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.GLPK_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.GLPK_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.GLPK_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.GLPK_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.GLPK_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.GLPK_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.GLPK_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.GLPK_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.GLPK_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.GLPK_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.GLPK_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.GLPK_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.GLPK_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GLPK_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.GLPK_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GLPK_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GLPK_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.GLPK_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.GLPK_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.GLPK_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.GLPK_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.GUROBITest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.GUROBITest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.GUROBITest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.GUROBITest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.GUROBITest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.GUROBITest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.GUROBITest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.GUROBITest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.GUROBITest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.GUROBITest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.GUROBITest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.GUROBITest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.GUROBITest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.GUROBITest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.GUROBITest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.GUROBITest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.GUROBITest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.GUROBITest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.GUROBITest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.GUROBITest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.GUROBITest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GUROBITest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.GUROBITest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GUROBITest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GUROBITest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.GUROBITest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.GUROBITest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.GUROBITest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.GUROBITest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.GUROBITest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.GUROBITest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.GUROBITest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.GUROBITest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.GUROBITest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.GUROBITest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.GUROBITest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.GUROBITest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.GUROBITest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.GUROBITest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.GUROBITest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.GUROBITest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.GUROBITest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.GUROBITest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.GUROBITest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.GUROBITest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.GUROBITest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.GUROBITest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.GUROBITest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.GUROBITest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.GUROBITest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.GUROBITest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.GUROBITest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.GUROBITest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.GUROBITest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.GUROBITest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.GUROBITest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.GUROBITest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.GUROBITest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.GUROBITest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.GUROBI_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.GUROBI_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.GUROBI_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.GUROBI_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.GUROBI_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.GUROBI_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.GUROBI_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.GUROBI_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.GUROBI_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.GUROBI_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.GUROBI_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.GUROBI_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.GUROBI_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.GUROBI_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.GUROBI_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.GUROBI_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.GUROBI_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.GUROBI_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.GUROBI_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.GUROBI_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.GUROBI_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.GUROBI_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.HiGHS_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.HiGHS_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.HiGHS_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.HiGHS_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.HiGHS_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.HiGHS_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.HiGHS_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.HiGHS_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.HiGHS_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.HiGHS_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.HiGHS_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.HiGHS_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.HiGHS_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.HiGHS_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.HiGHS_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.HiGHS_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.HiGHS_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.HiGHS_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.HiGHS_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.HiGHS_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.HiGHS_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.HiGHS_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.MIPCL_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.MIPCL_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.MIPCL_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.MIPCL_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.MIPCL_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.MIPCL_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.MIPCL_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.MIPCL_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.MIPCL_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.MIPCL_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.MIPCL_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.MIPCL_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.MIPCL_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.MIPCL_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.MIPCL_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.MIPCL_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.MIPCL_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.MIPCL_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.MIPCL_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.MIPCL_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.MIPCL_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.MIPCL_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.MOSEKTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.MOSEKTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.MOSEKTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.MOSEKTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.MOSEKTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.MOSEKTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.MOSEKTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.MOSEKTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.MOSEKTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.MOSEKTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.MOSEKTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.MOSEKTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.MOSEKTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.MOSEKTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.MOSEKTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.MOSEKTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.MOSEKTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.MOSEKTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.MOSEKTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.MOSEKTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.MOSEKTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.MOSEKTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.MOSEKTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.MOSEKTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.MOSEKTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.MOSEKTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.MOSEKTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.MOSEKTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.MOSEKTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.MOSEKTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.MOSEKTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.MOSEKTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.MOSEKTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.MOSEKTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.MOSEKTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.MOSEKTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.MOSEKTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.MOSEKTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.MOSEKTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.MOSEKTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.MOSEKTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.MOSEKTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.MOSEKTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.MOSEKTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.MOSEKTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.MOSEKTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.MOSEKTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.MOSEKTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.MOSEKTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.MOSEKTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.MOSEKTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.MOSEKTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.MOSEKTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.MOSEKTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.MOSEKTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.MOSEKTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.MOSEKTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.MOSEKTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.MOSEKTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... ok test_LpVariable_indexs_param (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... ok test_LpVariable_indices_param (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... ok test_assignInvalidStatus (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_assignInvalidStatus) ... ok test_export_dict_LP (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_dict_LP) ... ok test_export_dict_LP_no_obj (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_dict_LP_no_obj) ... ok test_export_dict_MIP (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_dict_MIP) ... ok test_export_dict_max (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_dict_max) ... ok test_export_json_LP (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_json_LP) ... ok test_export_solver_dict_LP (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_solver_dict_LP) ... ok test_export_solver_json (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_export_solver_json) ... ok test_false_constraint (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_false_constraint) ... ok test_importMPS_RHS_fields56 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... ok test_importMPS_binary (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_importMPS_binary) ... ok test_importMPS_integer (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_importMPS_integer) ... ok test_importMPS_maximize (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_importMPS_maximize) ... ok test_importMPS_noname (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_importMPS_noname) ... ok test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... ok test_invalid_var_names (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_invalid_var_names) ... ok test_logPath (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_logPath) ... ok test_makeDict_behavior (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... ok test_makeDict_default_value (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... ok test_measuring_solving_time (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_measuring_solving_time) ... ok test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... ok test_pulpTestAll (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... ok test_pulp_001 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... ok test_pulp_009 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_009) ... ok test_pulp_010 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_010) ... ok test_pulp_011 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_011) ... ok test_pulp_012 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_012) ... ok test_pulp_013 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_013) ... ok test_pulp_014 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_014) ... ok test_pulp_015 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_015) ... ok test_pulp_016 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_016) ... ok test_pulp_017 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_017) ... ok test_pulp_018 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_018) ... ok test_pulp_019 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_019) ... ok test_pulp_020 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_020) ... ok test_pulp_021 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_021) ... ok test_pulp_022 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_022) ... ok test_pulp_023 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_023) ... ok test_pulp_030 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_030) ... ok test_pulp_040 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_040) ... ok test_pulp_050 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_050) ... ok test_pulp_060 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_060) ... ok test_pulp_061 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_061) ... ok test_pulp_070 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_070) ... ok test_pulp_075 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_075) ... ok test_pulp_080 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... ok test_pulp_090 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_090) ... ok test_pulp_100 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... ok test_pulp_110 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... ok test_pulp_120 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... ok test_pulp_121 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... ok test_pulp_122 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... ok test_pulp_123 (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... ok test_timeLimit (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_timeLimit) ... ok test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... ok test_unset_objective_value__is_valid (pulp.tests.test_pulp.PULP_CBC_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.PYGLPKTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.PYGLPKTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.PYGLPKTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.PYGLPKTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.PYGLPKTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.PYGLPKTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.PYGLPKTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.PYGLPKTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.PYGLPKTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.PYGLPKTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.PYGLPKTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.PYGLPKTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.PYGLPKTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.PYGLPKTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.PYGLPKTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.PYGLPKTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.PYGLPKTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.PYGLPKTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.PYGLPKTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.PYGLPKTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.PYGLPKTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.PYGLPKTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.PYGLPKTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.PYGLPKTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.PYGLPKTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.PYGLPKTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.PYGLPKTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.PYGLPKTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.PYGLPKTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.SCIP_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.SCIP_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.SCIP_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.SCIP_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.SCIP_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.SCIP_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.SCIP_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.SCIP_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.SCIP_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.SCIP_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.SCIP_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.SCIP_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.SCIP_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.SCIP_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.SCIP_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.SCIP_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.SCIP_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.SCIP_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.SCIP_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.SCIP_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.SCIP_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.SCIP_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.SCIP_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.SCIP_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.SCIP_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.SCIP_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.SCIP_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.SCIP_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.SCIP_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.XPRESS_CMDTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.XPRESS_CMDTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.XPRESS_CMDTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.XPRESS_CMDTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.XPRESS_CMDTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.XPRESS_CMDTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.XPRESS_CMDTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.XPRESS_CMDTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.XPRESS_CMDTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.XPRESS_CMDTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.XPRESS_CMDTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.XPRESS_CMDTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.XPRESS_CMDTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.XPRESS_CMDTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.XPRESS_CMDTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.XPRESS_CMDTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_CMDTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.XPRESS_CMDTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.XPRESS_CMDTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.XPRESS_CMDTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.XPRESS_CMDTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.XPRESS_CMDTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.XPRESS_PyTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.XPRESS_PyTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.XPRESS_PyTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.XPRESS_PyTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.XPRESS_PyTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.XPRESS_PyTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.XPRESS_PyTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.XPRESS_PyTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.XPRESS_PyTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.XPRESS_PyTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.XPRESS_PyTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.XPRESS_PyTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.XPRESS_PyTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.XPRESS_PyTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.XPRESS_PyTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.XPRESS_PyTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.XPRESS_PyTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.XPRESS_PyTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.XPRESS_PyTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.XPRESS_PyTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.XPRESS_PyTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.XPRESS_PyTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.XPRESS_PyTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.XPRESS_PyTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.XPRESS_PyTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.XPRESS_PyTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.XPRESS_PyTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.XPRESS_PyTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.XPRESS_PyTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.YAPOSIBTest.test_LpVariable_indexs_deprecation_logic) Test that logic put in place for deprecation handling of indexs works ... skipped "solver not available" test_LpVariable_indexs_param (pulp.tests.test_pulp.YAPOSIBTest.test_LpVariable_indexs_param) Test that 'indexs' param continues to work ... skipped "solver not available" test_LpVariable_indices_param (pulp.tests.test_pulp.YAPOSIBTest.test_LpVariable_indices_param) Test that 'indices' argument works ... skipped "solver not available" test_assignInvalidStatus (pulp.tests.test_pulp.YAPOSIBTest.test_assignInvalidStatus) ... skipped "solver not available" test_export_dict_LP (pulp.tests.test_pulp.YAPOSIBTest.test_export_dict_LP) ... skipped "solver not available" test_export_dict_LP_no_obj (pulp.tests.test_pulp.YAPOSIBTest.test_export_dict_LP_no_obj) ... skipped "solver not available" test_export_dict_MIP (pulp.tests.test_pulp.YAPOSIBTest.test_export_dict_MIP) ... skipped "solver not available" test_export_dict_max (pulp.tests.test_pulp.YAPOSIBTest.test_export_dict_max) ... skipped "solver not available" test_export_json_LP (pulp.tests.test_pulp.YAPOSIBTest.test_export_json_LP) ... skipped "solver not available" test_export_solver_dict_LP (pulp.tests.test_pulp.YAPOSIBTest.test_export_solver_dict_LP) ... skipped "solver not available" test_export_solver_json (pulp.tests.test_pulp.YAPOSIBTest.test_export_solver_json) ... skipped "solver not available" test_false_constraint (pulp.tests.test_pulp.YAPOSIBTest.test_false_constraint) ... skipped "solver not available" test_importMPS_RHS_fields56 (pulp.tests.test_pulp.YAPOSIBTest.test_importMPS_RHS_fields56) Import MPS file with RHS definitions in fields 5 & 6. ... skipped "solver not available" test_importMPS_binary (pulp.tests.test_pulp.YAPOSIBTest.test_importMPS_binary) ... skipped "solver not available" test_importMPS_integer (pulp.tests.test_pulp.YAPOSIBTest.test_importMPS_integer) ... skipped "solver not available" test_importMPS_maximize (pulp.tests.test_pulp.YAPOSIBTest.test_importMPS_maximize) ... skipped "solver not available" test_importMPS_noname (pulp.tests.test_pulp.YAPOSIBTest.test_importMPS_noname) ... skipped "solver not available" test_infeasible_problem__is_not_valid (pulp.tests.test_pulp.YAPOSIBTest.test_infeasible_problem__is_not_valid) Given a problem where x cannot converge to any value ... skipped "solver not available" test_invalid_var_names (pulp.tests.test_pulp.YAPOSIBTest.test_invalid_var_names) ... skipped "solver not available" test_logPath (pulp.tests.test_pulp.YAPOSIBTest.test_logPath) ... skipped "solver not available" test_makeDict_behavior (pulp.tests.test_pulp.YAPOSIBTest.test_makeDict_behavior) Test if makeDict is returning the expected value. ... skipped "solver not available" test_makeDict_default_value (pulp.tests.test_pulp.YAPOSIBTest.test_makeDict_default_value) Test if makeDict is returning a default value when specified. ... skipped "solver not available" test_measuring_solving_time (pulp.tests.test_pulp.YAPOSIBTest.test_measuring_solving_time) ... skipped "solver not available" test_parse_cplex_mipopt_solution (pulp.tests.test_pulp.YAPOSIBTest.test_parse_cplex_mipopt_solution) Ensures `readsol` can parse CPLEX mipopt solutions (see issue #508). ... skipped "solver not available" test_pulpTestAll (pulp.tests.test_pulp.YAPOSIBTest.test_pulpTestAll) Test the availability of the function pulpTestAll ... skipped "solver not available" test_pulp_001 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_001) Test that a variable is deleted when it is suptracted to 0 ... skipped "solver not available" test_pulp_009 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_009) ... skipped "solver not available" test_pulp_010 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_010) ... skipped "solver not available" test_pulp_011 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_011) ... skipped "solver not available" test_pulp_012 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_012) ... skipped "solver not available" test_pulp_013 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_013) ... skipped "solver not available" test_pulp_014 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_014) ... skipped "solver not available" test_pulp_015 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_015) ... skipped "solver not available" test_pulp_016 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_016) ... skipped "solver not available" test_pulp_017 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_017) ... skipped "solver not available" test_pulp_018 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_018) ... skipped "solver not available" test_pulp_019 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_019) ... skipped "solver not available" test_pulp_020 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_020) ... skipped "solver not available" test_pulp_021 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_021) ... skipped "solver not available" test_pulp_022 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_022) ... skipped "solver not available" test_pulp_023 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_023) ... skipped "solver not available" test_pulp_030 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_030) ... skipped "solver not available" test_pulp_040 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_040) ... skipped "solver not available" test_pulp_050 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_050) ... skipped "solver not available" test_pulp_060 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_060) ... skipped "solver not available" test_pulp_061 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_061) ... skipped "solver not available" test_pulp_070 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_070) ... skipped "solver not available" test_pulp_075 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_075) ... skipped "solver not available" test_pulp_080 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_080) Test the reporting of dual variables slacks and reduced costs ... skipped "solver not available" test_pulp_090 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_090) ... skipped "solver not available" test_pulp_100 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_100) Test the ability to sequentially solve a problem ... skipped "solver not available" test_pulp_110 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_110) Test the ability to use fractional constraints ... skipped "solver not available" test_pulp_120 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_120) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_121 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_121) Test the ability to use Elastic constraints ... skipped "solver not available" test_pulp_122 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_122) Test the ability to use Elastic constraints (penalty unchanged) ... skipped "solver not available" test_pulp_123 (pulp.tests.test_pulp.YAPOSIBTest.test_pulp_123) Test the ability to use Elastic constraints (penalty unbounded) ... skipped "solver not available" test_timeLimit (pulp.tests.test_pulp.YAPOSIBTest.test_timeLimit) ... skipped "solver not available" test_unbounded_problem__is_not_valid (pulp.tests.test_pulp.YAPOSIBTest.test_unbounded_problem__is_not_valid) Given an unbounded problem, where x will tend to infinity ... skipped "solver not available" test_unset_objective_value__is_valid (pulp.tests.test_pulp.YAPOSIBTest.test_unset_objective_value__is_valid) Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- Ran 1005 tests in 24.902s OK (skipped=885) 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 Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 The 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 = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_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 P0 = [4, 0, 0] P1 = [0, 2, 0] P2 = [0, 0, 2] P3 = [1, 2, 0] Pattern_P0 = 13 Pattern_P1 = 0 Pattern_P2 = 150 Pattern_P3 = 100 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 Test that logic put in place for deprecation handling of indexs works Testing 'indexs' param continues to work for LpVariable.dicts Testing 'indexs' param continues to work for LpVariable.matrix Testing 'indices' argument works in LpVariable.dicts Testing 'indices' param continues to work for LpVariable.matrix Testing invalid status Testing continuous LP solution - export dict Testing export dict for LP Testing export dict MIP Testing maximize continuous LP solution Testing continuous LP solution - export JSON Testing continuous LP solution - export solver dict Testing continuous LP solution - export solver JSON Testing reading MPS files - binary variable, no constraint names Testing reading MPS files - integer variable Testing reading MPS files - maximize Testing reading MPS files - noname Testing invalid var names Testing logPath argument Testing makeDict general behavior Testing makeDict default value behavior Testing measuring optimization time Testing that `readsol` can parse CPLEX mipopt solution Testing the availability of the function pulpTestAll Testing zero subtraction Testing inconsistent lp solution Testing continuous LP solution Testing maximize continuous LP solution Testing unbounded continuous LP solution Testing Long Names Testing repeated Names Testing zero constraint Testing zero objective Testing LpVariable (not LpAffineExpression) objective Testing Long lines in LP Testing LpAffineExpression divide Testing MIP solution Testing MIP solution with floats in objective Testing Initial value in MIP solution Testing fixing value in MIP solution Testing MIP relaxation Testing feasibility problem (no objective) Testing an infeasible problem Testing an integer infeasible problem Testing another integer infeasible problem Testing column based modelling Testing fractional constraints Testing elastic constraints (no change) Testing elastic constraints (freebound) Testing elastic constraints (penalty unchanged) Testing elastic constraints (penalty unbounded) Testing timeLimit argument 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 Testing 'indices' argument works in LpVariable.dicts Testing 'indices' param continues to work for LpVariable.matrix Testing invalid status Testing continuous LP solution - export dict Testing export dict for LP Testing export dict MIP Testing maximize continuous LP solution Testing continuous LP solution - export JSON Testing continuous LP solution - export solver dict Testing continuous LP solution - export solver JSON Testing reading MPS files - binary variable, no constraint names Testing reading MPS files - integer variable Testing reading MPS files - maximize Testing reading MPS files - noname Testing invalid var names Testing logPath argument Testing makeDict general behavior Testing makeDict default value behavior Testing measuring optimization time Testing that `readsol` can parse CPLEX mipopt solution Testing the availability of the function pulpTestAll Testing zero subtraction Testing inconsistent lp solution Testing continuous LP solution Testing maximize continuous LP solution Testing unbounded continuous LP solution Testing Long Names Testing repeated Names Testing zero constraint Testing zero objective Testing LpVariable (not LpAffineExpression) objective Testing Long lines in LP Testing LpAffineExpression divide Testing MIP solution Testing MIP solution with floats in objective Testing Initial value in MIP solution Testing fixing value in MIP solution Testing MIP relaxation Testing feasibility problem (no objective) Testing an infeasible problem Testing an integer infeasible problem Testing another integer infeasible problem Testing column based modelling Testing dual variables and slacks reporting Testing fractional constraints Testing elastic constraints (no change) Testing elastic constraints (freebound) Testing elastic constraints (penalty unchanged) Testing elastic constraints (penalty unbounded) Testing timeLimit argument I: pybuild pybuild:334: rm -rf /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/*.lp create-stamp debian/debhelper-build-stamp dh_testroot -O--buildsystem=pybuild dh_prep -O--buildsystem=pybuild dh_auto_install --destdir=debian/python3-pulp/ -O--buildsystem=pybuild I: pybuild base:311: /usr/bin/python3 setup.py install --root /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:268: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running install /usr/lib/python3/dist-packages/setuptools/_distutils/cmd.py:66: SetuptoolsDeprecationWarning: setup.py install is deprecated. !! ******************************************************************************** Please avoid running ``setup.py`` directly. Instead, use pypa/build, pypa/installer or other standards-based tools. See https://blog.ganssle.io/articles/2021/10/setup-py-deprecated.html for details. ******************************************************************************** !! self.initialize_options() running build running build_py running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt writing entry points to PuLP.egg-info/entry_points.txt writing top-level names to PuLP.egg-info/top_level.txt reading manifest file 'PuLP.egg-info/SOURCES.txt' reading manifest template 'MANIFEST.in' adding license file 'LICENSE' adding license file 'AUTHORS' writing manifest file 'PuLP.egg-info/SOURCES.txt' /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.apis' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.apis' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.apis' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.apis' to be distributed and are already explicitly excluding 'pulp.apis' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.solverdir' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.solverdir' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.solverdir' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.solverdir' to be distributed and are already explicitly excluding 'pulp.solverdir' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) /usr/lib/python3/dist-packages/setuptools/command/build_py.py:218: _Warning: Package 'pulp.tests' is absent from the `packages` configuration. !! ******************************************************************************** ############################ # Package would be ignored # ############################ Python recognizes 'pulp.tests' as an importable package[^1], but it is absent from setuptools' `packages` configuration. This leads to an ambiguous overall configuration. If you want to distribute this package, please make sure that 'pulp.tests' is explicitly added to the `packages` configuration field. Alternatively, you can also rely on setuptools' discovery methods (for example by using `find_namespace_packages(...)`/`find_namespace:` instead of `find_packages(...)`/`find:`). You can read more about "package discovery" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/package_discovery.html If you don't want 'pulp.tests' to be distributed and are already explicitly excluding 'pulp.tests' via `find_namespace_packages(...)/find_namespace` or `find_packages(...)/find`, you can try to use `exclude_package_data`, or `include-package-data=False` in combination with a more fine grained `package-data` configuration. You can read more about "package data files" on setuptools documentation page: - https://setuptools.pypa.io/en/latest/userguide/datafiles.html [^1]: For Python, any directory (with suitable naming) can be imported, even if it does not contain any `.py` files. On the other hand, currently there is no concept of package data directory, all directories are treated like packages. ******************************************************************************** !! check.warn(importable) running install_lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12 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/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/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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__/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__/__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__/choco_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/core.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/coin_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/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__/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__/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__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__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__/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/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/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/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/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/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/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/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/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/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/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/__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/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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 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__/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__/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__/__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__/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__/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__/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__ 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 creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/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__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/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/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_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/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.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.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/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 copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp 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 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/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/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/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/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/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/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/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/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/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/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/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/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc /usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/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/test_pulp.py to test_pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__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/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_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/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/pulp.py to pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc 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 running install_scripts Installing pulptest script to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/bin dh_installdocs -O--buildsystem=pybuild dh_installchangelogs -O--buildsystem=pybuild dh_python3 -O--buildsystem=pybuild dh_installsystemduser -O--buildsystem=pybuild dh_lintian -O--buildsystem=pybuild dh_perl -O--buildsystem=pybuild dh_link -O--buildsystem=pybuild dh_strip_nondeterminism -O--buildsystem=pybuild dh_compress -O--buildsystem=pybuild dh_fixperms -O--buildsystem=pybuild dh_missing -O--buildsystem=pybuild dh_installdeb -O--buildsystem=pybuild dh_gencontrol -O--buildsystem=pybuild dh_md5sums -O--buildsystem=pybuild dh_builddeb -O--buildsystem=pybuild dpkg-deb: building package 'python3-pulp' in '../python3-pulp_2.7.0+dfsg-4_all.deb'. dpkg-genbuildinfo --build=binary -O../python-pulp_2.7.0+dfsg-4_i386.buildinfo dpkg-genchanges --build=binary -O../python-pulp_2.7.0+dfsg-4_i386.changes dpkg-genchanges: info: binary-only upload (no source code included) dpkg-source --after-build . dpkg-source: info: using options from python-pulp-2.7.0+dfsg/debian/source/options: --extend-diff-ignore=^[^/]*[.]egg-info/ 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/17231/tmp/hooks/B01_cleanup starting I: user script /srv/workspace/pbuilder/17231/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/17231 and its subdirectories I: Current time: Sun Oct 5 14:44:03 +14 2025 I: pbuilder-time-stamp: 1759625043