Running as unit: rb-build-arm64_12-69671.service ==================================================================================== Fri Nov 22 03:45:28 UTC 2024 - running /srv/jenkins/bin/reproducible_build.sh (for job reproducible_builder_arm64_12) on jenkins, called using "codethink04-arm64 codethink03-arm64" as arguments. Fri Nov 22 03:45:28 UTC 2024 - actually running "reproducible_build.sh" (md5sum 68e686e434c9ab7bc3ec047d8b309cbc) as "/tmp/jenkins-script-Gf82dl6e" $ git clone https://salsa.debian.org/qa/jenkins.debian.net.git ; more CONTRIBUTING Fri Nov 22 03:45:28 UTC 2024 - checking /var/lib/jenkins/offline_nodes if codethink04-arm64.debian.net is marked as down. Fri Nov 22 03:45:28 UTC 2024 - checking via ssh if codethink04-arm64.debian.net is up. removed '/tmp/read-only-fs-test-btDXyr' Fri Nov 22 03:45:28 UTC 2024 - checking /var/lib/jenkins/offline_nodes if codethink03-arm64.debian.net is marked as down. Fri Nov 22 03:45:29 UTC 2024 - checking via ssh if codethink03-arm64.debian.net is up. removed '/tmp/read-only-fs-test-xz3soD' ok, let's check if python-pulp is building anywhere yet… ok, python-pulp is not building anywhere… UPDATE 1 ============================================================================= Initialising reproducibly build of python-pulp in unstable on arm64 on jenkins now. 1st build will be done on codethink04-arm64.debian.net. 2nd build will be done on codethink03-arm64.debian.net. ============================================================================= Fri Nov 22 03:45:46 UTC 2024 I: starting to build python-pulp/unstable/arm64 on jenkins on '2024-11-22 03:45' Fri Nov 22 03:45:46 UTC 2024 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/arm64_12/69671/console.log 1732247146 arm64 unstable python-pulp Fri Nov 22 03:45:46 UTC 2024 I: Downloading source for unstable/python-pulp=2.7.0+dfsg-4 --2024-11-22 03:45:46-- http://deb.debian.org/debian/pool/main/p/python-pulp/python-pulp_2.7.0%2bdfsg-4.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 1595 (1.6K) [text/prs.lines.tag] Saving to: ‘python-pulp_2.7.0+dfsg-4.dsc’ 0K . 100% 259M=0s 2024-11-22 03:45:46 (259 MB/s) - ‘python-pulp_2.7.0+dfsg-4.dsc’ saved [1595/1595] --2024-11-22 03:45:46-- http://deb.debian.org/debian/pool/main/p/python-pulp/python-pulp_2.7.0%2bdfsg-4.dsc Connecting to 46.16.76.132:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 1595 (1.6K) [text/prs.lines.tag] Saving to: ‘python-pulp_2.7.0+dfsg-4.dsc’ 0K . 100% 259M=0s 2024-11-22 03:45:46 (259 MB/s) - ‘python-pulp_2.7.0+dfsg-4.dsc’ saved [1595/1595] Fri Nov 22 03:45:46 UTC 2024 I: python-pulp_2.7.0+dfsg-4.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: python-pulp Binary: python3-pulp Architecture: all Version: 2.7.0+dfsg-4 Maintainer: Debian Math Team Uploaders: Steffen Moeller , Nilesh Patra Homepage: https://github.com/coin-or/pulp Standards-Version: 4.7.0 Vcs-Browser: https://salsa.debian.org/math-team/python-pulp Vcs-Git: https://salsa.debian.org/math-team/python-pulp.git Testsuite: autopkgtest, autopkgtest-pkg-python Testsuite-Triggers: python3-all Build-Depends: debhelper-compat (= 13), dh-python, python3-all, python3-setuptools Build-Depends-Indep: coinor-cbc, python3-pyparsing Package-List: python3-pulp deb python optional arch=all Checksums-Sha1: 5e52339238643995eaef5797155e30826d7334de 12124180 python-pulp_2.7.0+dfsg.orig.tar.xz b8d549dae6491b493cddf0f71db268f052ff21e7 13500 python-pulp_2.7.0+dfsg-4.debian.tar.xz Checksums-Sha256: 160bfb537697e69c5256adc28549de409d9ff19f6b918251303dcbb0701fec78 12124180 python-pulp_2.7.0+dfsg.orig.tar.xz b40a7e4636f1aa3fcf466c50a2dd088d0e577cbc3e1da3a1bcefe60740d77386 13500 python-pulp_2.7.0+dfsg-4.debian.tar.xz Files: e475ee479819e56a925ab1b8c04e8cab 12124180 python-pulp_2.7.0+dfsg.orig.tar.xz eff849384fea4514b4e3d5589c99ed44 13500 python-pulp_2.7.0+dfsg-4.debian.tar.xz -----BEGIN PGP SIGNATURE----- iIgEARYIADAWIQSglbZu4JAkvuai8HIqJ5BL1yQ+2gUCZtRM/hIcbmlsZXNoQGRl Ymlhbi5vcmcACgkQKieQS9ckPtor9gD+N0L7rHUSn7B/VnpYnzUTUqaaJgaJMqUw JAIpVv03f1kBAJbbTK9zviATL0g7YkSnOx0P8uJu9xmDVmQlZm4YE+QB =wyW9 -----END PGP SIGNATURE----- Fri Nov 22 03:45:46 UTC 2024 I: Checking whether the package is not for us Fri Nov 22 03:45:46 UTC 2024 I: Starting 1st build on remote node codethink04-arm64.debian.net. Fri Nov 22 03:45:46 UTC 2024 I: Preparing to do remote build '1' on codethink04-arm64.debian.net. Fri Nov 22 03:45:46 UTC 2024 - checking /var/lib/jenkins/offline_nodes if codethink04-arm64.debian.net is marked as down. Fri Nov 22 03:45:46 UTC 2024 - checking via ssh if codethink04-arm64.debian.net is up. removed '/tmp/read-only-fs-test-B0Bx0I' ==================================================================================== Fri Nov 22 03:45:50 UTC 2024 - running /srv/jenkins/bin/reproducible_build.sh (for job /srv/jenkins/bin/reproducible_build.sh) on codethink04-arm64, called using "1 python-pulp unstable /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV 2.7.0+dfsg-4" as arguments. Fri Nov 22 03:45:51 UTC 2024 - actually running "reproducible_build.sh" (md5sum 68e686e434c9ab7bc3ec047d8b309cbc) as "/tmp/jenkins-script-6AiBISZW" $ git clone https://salsa.debian.org/qa/jenkins.debian.net.git ; more CONTRIBUTING Fri Nov 22 03:45:51 UTC 2024 I: Downloading source for unstable/python-pulp=2.7.0+dfsg-4 Reading package lists... NOTICE: 'python-pulp' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/math-team/python-pulp.git Please use: git clone https://salsa.debian.org/math-team/python-pulp.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 12.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (dsc) [1595 B] Get:2 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (tar) [12.1 MB] Get:3 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (diff) [13.5 kB] Fetched 12.1 MB in 0s (27.5 MB/s) Download complete and in download only mode Reading package lists... NOTICE: 'python-pulp' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/math-team/python-pulp.git Please use: git clone https://salsa.debian.org/math-team/python-pulp.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 12.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (dsc) [1595 B] Get:2 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (tar) [12.1 MB] Get:3 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (diff) [13.5 kB] Fetched 12.1 MB in 0s (27.5 MB/s) Download complete and in download only mode ============================================================================= Building python-pulp in unstable on arm64 on codethink04-arm64 now. Date: Fri Nov 22 03:45:51 GMT 2024 Date UTC: Fri Nov 22 03:45:51 UTC 2024 ============================================================================= W: /root/.pbuilderrc does not exist I: Logging to b1/build.log I: pbuilder: network access will be disabled during build I: Current time: Thu Nov 21 15:45:52 -12 2024 I: pbuilder-time-stamp: 1732247152 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: 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/2878175/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='arm64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='arm64' IFS=' ' INVOCATION_ID='21c0219a68b24a86a54eea250ad6f401' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='2878175' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/pbuilderrc_kljq --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' SUDO_GID='109' SUDO_UID='104' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://192.168.101.4:3128' I: uname -a Linux codethink04-arm64 6.1.0-27-cloud-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin I: user script /srv/workspace/pbuilder/2878175/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: arm64 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 ... 20084 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} libpython3.13-minimal{a} libpython3.13-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-jaraco.text{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} python3.13{a} python3.13-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, 78 newly installed, 0 to remove and 0 not upgraded. Need to get 37.6 MB of archives. After unpacking 155 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main arm64 libpython3.12-minimal arm64 3.12.7-3 [808 kB] Get: 2 http://deb.debian.org/debian unstable/main arm64 libexpat1 arm64 2.6.4-1 [90.7 kB] Get: 3 http://deb.debian.org/debian unstable/main arm64 python3.12-minimal arm64 3.12.7-3 [1940 kB] Get: 4 http://deb.debian.org/debian unstable/main arm64 python3-minimal arm64 3.12.7-1 [26.8 kB] Get: 5 http://deb.debian.org/debian unstable/main arm64 media-types all 10.1.0 [26.9 kB] Get: 6 http://deb.debian.org/debian unstable/main arm64 netbase all 6.4 [12.8 kB] Get: 7 http://deb.debian.org/debian unstable/main arm64 tzdata all 2024b-3 [255 kB] Get: 8 http://deb.debian.org/debian unstable/main arm64 libkrb5support0 arm64 1.21.3-3 [32.1 kB] Get: 9 http://deb.debian.org/debian unstable/main arm64 libcom-err2 arm64 1.47.1-1+b1 [23.1 kB] Get: 10 http://deb.debian.org/debian unstable/main arm64 libk5crypto3 arm64 1.21.3-3 [80.8 kB] Get: 11 http://deb.debian.org/debian unstable/main arm64 libkeyutils1 arm64 1.6.3-4 [9352 B] Get: 12 http://deb.debian.org/debian unstable/main arm64 libkrb5-3 arm64 1.21.3-3 [310 kB] Get: 13 http://deb.debian.org/debian unstable/main arm64 libgssapi-krb5-2 arm64 1.21.3-3 [126 kB] Get: 14 http://deb.debian.org/debian unstable/main arm64 libtirpc-common all 1.3.4+ds-1.3 [10.9 kB] Get: 15 http://deb.debian.org/debian unstable/main arm64 libtirpc3t64 arm64 1.3.4+ds-1.3+b1 [78.7 kB] Get: 16 http://deb.debian.org/debian unstable/main arm64 libnsl2 arm64 1.3.0-3+b3 [37.9 kB] Get: 17 http://deb.debian.org/debian unstable/main arm64 readline-common all 8.2-5 [69.3 kB] Get: 18 http://deb.debian.org/debian unstable/main arm64 libreadline8t64 arm64 8.2-5 [159 kB] Get: 19 http://deb.debian.org/debian unstable/main arm64 libpython3.12-stdlib arm64 3.12.7-3 [1902 kB] Get: 20 http://deb.debian.org/debian unstable/main arm64 python3.12 arm64 3.12.7-3 [671 kB] Get: 21 http://deb.debian.org/debian unstable/main arm64 libpython3-stdlib arm64 3.12.7-1 [9708 B] Get: 22 http://deb.debian.org/debian unstable/main arm64 python3 arm64 3.12.7-1 [27.8 kB] Get: 23 http://deb.debian.org/debian unstable/main arm64 libpython3.13-minimal arm64 3.13.0-2 [850 kB] Get: 24 http://deb.debian.org/debian unstable/main arm64 python3.13-minimal arm64 3.13.0-2 [1838 kB] Get: 25 http://deb.debian.org/debian unstable/main arm64 sensible-utils all 0.0.24 [24.8 kB] Get: 26 http://deb.debian.org/debian unstable/main arm64 libmagic-mgc arm64 1:5.45-3+b1 [314 kB] Get: 27 http://deb.debian.org/debian unstable/main arm64 libmagic1t64 arm64 1:5.45-3+b1 [102 kB] Get: 28 http://deb.debian.org/debian unstable/main arm64 file arm64 1:5.45-3+b1 [43.4 kB] Get: 29 http://deb.debian.org/debian unstable/main arm64 gettext-base arm64 0.22.5-2 [198 kB] Get: 30 http://deb.debian.org/debian unstable/main arm64 libuchardet0 arm64 0.0.8-1+b2 [69.2 kB] Get: 31 http://deb.debian.org/debian unstable/main arm64 groff-base arm64 1.23.0-5 [1129 kB] Get: 32 http://deb.debian.org/debian unstable/main arm64 bsdextrautils arm64 2.40.2-11 [91.2 kB] Get: 33 http://deb.debian.org/debian unstable/main arm64 libpipeline1 arm64 1.5.8-1 [40.2 kB] Get: 34 http://deb.debian.org/debian unstable/main arm64 man-db arm64 2.13.0-1 [1404 kB] Get: 35 http://deb.debian.org/debian unstable/main arm64 m4 arm64 1.4.19-4 [277 kB] Get: 36 http://deb.debian.org/debian unstable/main arm64 autoconf all 2.72-3 [493 kB] Get: 37 http://deb.debian.org/debian unstable/main arm64 autotools-dev all 20220109.1 [51.6 kB] Get: 38 http://deb.debian.org/debian unstable/main arm64 automake all 1:1.16.5-1.3 [823 kB] Get: 39 http://deb.debian.org/debian unstable/main arm64 autopoint all 0.22.5-2 [723 kB] Get: 40 http://deb.debian.org/debian unstable/main arm64 libblas3 arm64 3.12.0-4 [98.7 kB] Get: 41 http://deb.debian.org/debian unstable/main arm64 libgfortran5 arm64 14.2.0-8 [361 kB] Get: 42 http://deb.debian.org/debian unstable/main arm64 liblapack3 arm64 3.12.0-4 [1812 kB] Get: 43 http://deb.debian.org/debian unstable/main arm64 coinor-libcoinutils3v5 arm64 2.11.11+ds-1+b1 [397 kB] Get: 44 http://deb.debian.org/debian unstable/main arm64 coinor-libosi1v5 arm64 0.108.10+ds-1+b1 [248 kB] Get: 45 http://deb.debian.org/debian unstable/main arm64 coinor-libclp1 arm64 1.17.10+ds-1 [751 kB] Get: 46 http://deb.debian.org/debian unstable/main arm64 coinor-libcgl1 arm64 0.60.9+ds-1 [359 kB] Get: 47 http://deb.debian.org/debian unstable/main arm64 coinor-libcbc3.1 arm64 2.10.12+ds-1 [615 kB] Get: 48 http://deb.debian.org/debian unstable/main arm64 coinor-cbc arm64 2.10.12+ds-1 [16.3 kB] Get: 49 http://deb.debian.org/debian unstable/main arm64 libdebhelper-perl all 13.20 [89.7 kB] Get: 50 http://deb.debian.org/debian unstable/main arm64 libtool all 2.4.7-8 [517 kB] Get: 51 http://deb.debian.org/debian unstable/main arm64 dh-autoreconf all 20 [17.1 kB] Get: 52 http://deb.debian.org/debian unstable/main arm64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 53 http://deb.debian.org/debian unstable/main arm64 libfile-stripnondeterminism-perl all 1.14.0-1 [19.5 kB] Get: 54 http://deb.debian.org/debian unstable/main arm64 dh-strip-nondeterminism all 1.14.0-1 [8448 B] Get: 55 http://deb.debian.org/debian unstable/main arm64 libelf1t64 arm64 0.192-4 [189 kB] Get: 56 http://deb.debian.org/debian unstable/main arm64 dwz arm64 0.15-1+b1 [102 kB] Get: 57 http://deb.debian.org/debian unstable/main arm64 libicu72 arm64 72.1-5+b1 [9239 kB] Get: 58 http://deb.debian.org/debian unstable/main arm64 libxml2 arm64 2.12.7+dfsg+really2.9.14-0.2+b1 [630 kB] Get: 59 http://deb.debian.org/debian unstable/main arm64 gettext arm64 0.22.5-2 [1532 kB] Get: 60 http://deb.debian.org/debian unstable/main arm64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 61 http://deb.debian.org/debian unstable/main arm64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 62 http://deb.debian.org/debian unstable/main arm64 debhelper all 13.20 [915 kB] Get: 63 http://deb.debian.org/debian unstable/main arm64 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 64 http://deb.debian.org/debian unstable/main arm64 python3-more-itertools all 10.5.0-1 [63.8 kB] Get: 65 http://deb.debian.org/debian unstable/main arm64 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 66 http://deb.debian.org/debian unstable/main arm64 python3-typeguard all 4.4.1-1 [37.0 kB] Get: 67 http://deb.debian.org/debian unstable/main arm64 python3-inflect all 7.3.1-2 [32.4 kB] Get: 68 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 69 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.functools all 4.1.0-1 [12.0 kB] Get: 70 http://deb.debian.org/debian unstable/main arm64 python3-pkg-resources all 75.2.0-1 [213 kB] Get: 71 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.text all 4.0.0-1 [11.4 kB] Get: 72 http://deb.debian.org/debian unstable/main arm64 python3-zipp all 3.21.0-1 [10.6 kB] Get: 73 http://deb.debian.org/debian unstable/main arm64 python3-setuptools all 75.2.0-1 [731 kB] Get: 74 http://deb.debian.org/debian unstable/main arm64 dh-python all 6.20241024 [109 kB] Get: 75 http://deb.debian.org/debian unstable/main arm64 libpython3.13-stdlib arm64 3.13.0-2 [1922 kB] Get: 76 http://deb.debian.org/debian unstable/main arm64 python3.13 arm64 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main arm64 python3-all arm64 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main arm64 python3-pyparsing all 3.1.2-1 [146 kB] Fetched 37.6 MB in 0s (131 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:arm64. (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 ... 20084 files and directories currently installed.) Preparing to unpack .../libpython3.12-minimal_3.12.7-3_arm64.deb ... Unpacking libpython3.12-minimal:arm64 (3.12.7-3) ... Selecting previously unselected package libexpat1:arm64. Preparing to unpack .../libexpat1_2.6.4-1_arm64.deb ... Unpacking libexpat1:arm64 (2.6.4-1) ... Selecting previously unselected package python3.12-minimal. Preparing to unpack .../python3.12-minimal_3.12.7-3_arm64.deb ... Unpacking python3.12-minimal (3.12.7-3) ... Setting up libpython3.12-minimal:arm64 (3.12.7-3) ... Setting up libexpat1:arm64 (2.6.4-1) ... Setting up python3.12-minimal (3.12.7-3) ... 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 ... 20404 files and directories currently installed.) Preparing to unpack .../00-python3-minimal_3.12.7-1_arm64.deb ... Unpacking python3-minimal (3.12.7-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_2024b-3_all.deb ... Unpacking tzdata (2024b-3) ... Selecting previously unselected package libkrb5support0:arm64. Preparing to unpack .../04-libkrb5support0_1.21.3-3_arm64.deb ... Unpacking libkrb5support0:arm64 (1.21.3-3) ... Selecting previously unselected package libcom-err2:arm64. Preparing to unpack .../05-libcom-err2_1.47.1-1+b1_arm64.deb ... Unpacking libcom-err2:arm64 (1.47.1-1+b1) ... Selecting previously unselected package libk5crypto3:arm64. Preparing to unpack .../06-libk5crypto3_1.21.3-3_arm64.deb ... Unpacking libk5crypto3:arm64 (1.21.3-3) ... Selecting previously unselected package libkeyutils1:arm64. Preparing to unpack .../07-libkeyutils1_1.6.3-4_arm64.deb ... Unpacking libkeyutils1:arm64 (1.6.3-4) ... Selecting previously unselected package libkrb5-3:arm64. Preparing to unpack .../08-libkrb5-3_1.21.3-3_arm64.deb ... Unpacking libkrb5-3:arm64 (1.21.3-3) ... Selecting previously unselected package libgssapi-krb5-2:arm64. Preparing to unpack .../09-libgssapi-krb5-2_1.21.3-3_arm64.deb ... Unpacking libgssapi-krb5-2:arm64 (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:arm64. Preparing to unpack .../11-libtirpc3t64_1.3.4+ds-1.3+b1_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3 to /lib/aarch64-linux-gnu/libtirpc.so.3.usr-is-merged by libtirpc3t64' Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3.0.0 to /lib/aarch64-linux-gnu/libtirpc.so.3.0.0.usr-is-merged by libtirpc3t64' Unpacking libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Selecting previously unselected package libnsl2:arm64. Preparing to unpack .../12-libnsl2_1.3.0-3+b3_arm64.deb ... Unpacking libnsl2:arm64 (1.3.0-3+b3) ... 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:arm64. Preparing to unpack .../14-libreadline8t64_8.2-5_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8 to /lib/aarch64-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8.2 to /lib/aarch64-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8 to /lib/aarch64-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8.2 to /lib/aarch64-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:arm64 (8.2-5) ... Selecting previously unselected package libpython3.12-stdlib:arm64. Preparing to unpack .../15-libpython3.12-stdlib_3.12.7-3_arm64.deb ... Unpacking libpython3.12-stdlib:arm64 (3.12.7-3) ... Selecting previously unselected package python3.12. Preparing to unpack .../16-python3.12_3.12.7-3_arm64.deb ... Unpacking python3.12 (3.12.7-3) ... Selecting previously unselected package libpython3-stdlib:arm64. Preparing to unpack .../17-libpython3-stdlib_3.12.7-1_arm64.deb ... Unpacking libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3-minimal (3.12.7-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 ... 21466 files and directories currently installed.) Preparing to unpack .../00-python3_3.12.7-1_arm64.deb ... Unpacking python3 (3.12.7-1) ... Selecting previously unselected package libpython3.13-minimal:arm64. Preparing to unpack .../01-libpython3.13-minimal_3.13.0-2_arm64.deb ... Unpacking libpython3.13-minimal:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13-minimal. Preparing to unpack .../02-python3.13-minimal_3.13.0-2_arm64.deb ... Unpacking python3.13-minimal (3.13.0-2) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../03-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../04-libmagic-mgc_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:arm64. Preparing to unpack .../05-libmagic1t64_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic1t64:arm64 (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../06-file_1%3a5.45-3+b1_arm64.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../07-gettext-base_0.22.5-2_arm64.deb ... Unpacking gettext-base (0.22.5-2) ... Selecting previously unselected package libuchardet0:arm64. Preparing to unpack .../08-libuchardet0_0.0.8-1+b2_arm64.deb ... Unpacking libuchardet0:arm64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../09-groff-base_1.23.0-5_arm64.deb ... Unpacking groff-base (1.23.0-5) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../10-bsdextrautils_2.40.2-11_arm64.deb ... Unpacking bsdextrautils (2.40.2-11) ... Selecting previously unselected package libpipeline1:arm64. Preparing to unpack .../11-libpipeline1_1.5.8-1_arm64.deb ... Unpacking libpipeline1:arm64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.13.0-1_arm64.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../13-m4_1.4.19-4_arm64.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../14-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../15-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../16-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 .../17-autopoint_0.22.5-2_all.deb ... Unpacking autopoint (0.22.5-2) ... Selecting previously unselected package libblas3:arm64. Preparing to unpack .../18-libblas3_3.12.0-4_arm64.deb ... Unpacking libblas3:arm64 (3.12.0-4) ... Selecting previously unselected package libgfortran5:arm64. Preparing to unpack .../19-libgfortran5_14.2.0-8_arm64.deb ... Unpacking libgfortran5:arm64 (14.2.0-8) ... Selecting previously unselected package liblapack3:arm64. Preparing to unpack .../20-liblapack3_3.12.0-4_arm64.deb ... Unpacking liblapack3:arm64 (3.12.0-4) ... Selecting previously unselected package coinor-libcoinutils3v5:arm64. Preparing to unpack .../21-coinor-libcoinutils3v5_2.11.11+ds-1+b1_arm64.deb ... Unpacking coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Selecting previously unselected package coinor-libosi1v5:arm64. Preparing to unpack .../22-coinor-libosi1v5_0.108.10+ds-1+b1_arm64.deb ... Unpacking coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Selecting previously unselected package coinor-libclp1:arm64. Preparing to unpack .../23-coinor-libclp1_1.17.10+ds-1_arm64.deb ... Unpacking coinor-libclp1:arm64 (1.17.10+ds-1) ... Selecting previously unselected package coinor-libcgl1:arm64. Preparing to unpack .../24-coinor-libcgl1_0.60.9+ds-1_arm64.deb ... Unpacking coinor-libcgl1:arm64 (0.60.9+ds-1) ... Selecting previously unselected package coinor-libcbc3.1:arm64. Preparing to unpack .../25-coinor-libcbc3.1_2.10.12+ds-1_arm64.deb ... Unpacking coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Selecting previously unselected package coinor-cbc. Preparing to unpack .../26-coinor-cbc_2.10.12+ds-1_arm64.deb ... Unpacking coinor-cbc (2.10.12+ds-1) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../27-libdebhelper-perl_13.20_all.deb ... Unpacking libdebhelper-perl (13.20) ... Selecting previously unselected package libtool. Preparing to unpack .../28-libtool_2.4.7-8_all.deb ... Unpacking libtool (2.4.7-8) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../29-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../30-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 .../31-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 .../32-dh-strip-nondeterminism_1.14.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.0-1) ... Selecting previously unselected package libelf1t64:arm64. Preparing to unpack .../33-libelf1t64_0.192-4_arm64.deb ... Unpacking libelf1t64:arm64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../34-dwz_0.15-1+b1_arm64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libicu72:arm64. Preparing to unpack .../35-libicu72_72.1-5+b1_arm64.deb ... Unpacking libicu72:arm64 (72.1-5+b1) ... Selecting previously unselected package libxml2:arm64. Preparing to unpack .../36-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_arm64.deb ... Unpacking libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package gettext. Preparing to unpack .../37-gettext_0.22.5-2_arm64.deb ... Unpacking gettext (0.22.5-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../38-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 .../39-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../40-debhelper_13.20_all.deb ... Unpacking debhelper (13.20) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../41-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 .../42-python3-more-itertools_10.5.0-1_all.deb ... Unpacking python3-more-itertools (10.5.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../43-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 .../44-python3-typeguard_4.4.1-1_all.deb ... Unpacking python3-typeguard (4.4.1-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../45-python3-inflect_7.3.1-2_all.deb ... Unpacking python3-inflect (7.3.1-2) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../46-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 .../47-python3-jaraco.functools_4.1.0-1_all.deb ... Unpacking python3-jaraco.functools (4.1.0-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../48-python3-pkg-resources_75.2.0-1_all.deb ... Unpacking python3-pkg-resources (75.2.0-1) ... Selecting previously unselected package python3-jaraco.text. Preparing to unpack .../49-python3-jaraco.text_4.0.0-1_all.deb ... Unpacking python3-jaraco.text (4.0.0-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../50-python3-zipp_3.21.0-1_all.deb ... Unpacking python3-zipp (3.21.0-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../51-python3-setuptools_75.2.0-1_all.deb ... Unpacking python3-setuptools (75.2.0-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../52-dh-python_6.20241024_all.deb ... Unpacking dh-python (6.20241024) ... Selecting previously unselected package libpython3.13-stdlib:arm64. Preparing to unpack .../53-libpython3.13-stdlib_3.13.0-2_arm64.deb ... Unpacking libpython3.13-stdlib:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13. Preparing to unpack .../54-python3.13_3.13.0-2_arm64.deb ... Unpacking python3.13 (3.13.0-2) ... Selecting previously unselected package python3-all. Preparing to unpack .../55-python3-all_3.12.7-1_arm64.deb ... Unpacking python3-all (3.12.7-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../56-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:arm64 (1.5.8-1) ... Setting up libkeyutils1:arm64 (1.6.3-4) ... Setting up libicu72:arm64 (72.1-5+b1) ... Setting up bsdextrautils (2.40.2-11) ... Setting up libmagic-mgc (1:5.45-3+b1) ... 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:arm64 (1:5.45-3+b1) ... Setting up gettext-base (0.22.5-2) ... Setting up m4 (1.4.19-4) ... Setting up libcom-err2:arm64 (1.47.1-1+b1) ... Setting up file (1:5.45-3+b1) ... Setting up libelf1t64:arm64 (0.192-4) ... Setting up libkrb5support0:arm64 (1.21.3-3) ... Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' Local time is now: Fri Nov 22 03:46:17 UTC 2024. Universal Time is now: Fri Nov 22 03:46:17 UTC 2024. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:arm64 (3.13.0-2) ... Setting up autotools-dev (20220109.1) ... Setting up libblas3:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/blas/libblas.so.3 to provide /usr/lib/aarch64-linux-gnu/libblas.so.3 (libblas.so.3-aarch64-linux-gnu) in auto mode Setting up autopoint (0.22.5-2) ... Setting up libk5crypto3:arm64 (1.21.3-3) ... Setting up libgfortran5:arm64 (14.2.0-8) ... Setting up autoconf (2.72-3) ... Setting up dwz (0.15-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:arm64 (0.0.8-1+b2) ... Setting up python3.13-minimal (3.13.0-2) ... Setting up netbase (6.4) ... Setting up libkrb5-3:arm64 (1.21.3-3) ... Setting up readline-common (8.2-5) ... Setting up libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+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:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/aarch64-linux-gnu/liblapack.so.3 (liblapack.so.3-aarch64-linux-gnu) in auto mode Setting up gettext (0.22.5-2) ... Setting up libtool (2.4.7-8) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Setting up libgssapi-krb5-2:arm64 (1.21.3-3) ... Setting up coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Setting up libreadline8t64:arm64 (8.2-5) ... Setting up dh-strip-nondeterminism (1.14.0-1) ... Setting up groff-base (1.23.0-5) ... Setting up libpython3.13-stdlib:arm64 (3.13.0-2) ... Setting up libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Setting up python3.13 (3.13.0-2) ... 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:arm64 (1.17.10+ds-1) ... Setting up libnsl2:arm64 (1.3.0-3+b3) ... Setting up coinor-libcgl1:arm64 (0.60.9+ds-1) ... Setting up libpython3.12-stdlib:arm64 (3.12.7-3) ... Setting up python3.12 (3.12.7-3) ... Setting up debhelper (13.20) ... Setting up coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Setting up libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3 (3.12.7-1) ... Setting up python3-zipp (3.21.0-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up coinor-cbc (2.10.12+ds-1) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up python3-more-itertools (10.5.0-1) ... Setting up python3-jaraco.functools (4.1.0-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-typeguard (4.4.1-1) ... Setting up python3-all (3.12.7-1) ... Setting up python3-inflect (7.3.1-2) ... Setting up python3-jaraco.text (4.0.0-1) ... Setting up python3-pkg-resources (75.2.0-1) ... Setting up python3-setuptools (75.2.0-1) ... Setting up dh-python (6.20241024) ... Processing triggers for libc-bin (2.40-3) ... 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: Running cd /build/reproducible-path/python-pulp-2.7.0+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../python-pulp_2.7.0+dfsg-4_source.changes 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 arm64 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.13 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running clean removing '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build' (and everything under it) 'build/bdist.linux-aarch64' does not exist -- can't clean it 'build/scripts-3.13' does not exist -- can't clean it I: pybuild base:311: python3.12 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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-aarch64' 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.13 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config I: pybuild base:311: python3.12 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config dh_auto_build -O--buildsystem=pybuild I: pybuild base:311: /usr/bin/python3.13 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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.13_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO 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.13_pulp/build/pulp copying pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir copying pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests I: pybuild base:311: /usr/bin/python3 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/sparse.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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt 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) 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.13_pulp/build 'examples' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples' 'examples/wedding_initial.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding_initial.py' 'examples/CGcolumnwise.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CGcolumnwise.py' 'examples/test2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test2.py' 'examples/SpongeRollProblem5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem5.py' 'examples/SpongeRollProblem6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem6.py' 'examples/WhiskasModel2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel2.py' 'examples/SpongeRollProblem2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem2.py' 'examples/furniture.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/furniture.py' 'examples/test6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test6.py' 'examples/BeerDistributionProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem.py' 'examples/CG.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CG.py' 'examples/wedding.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding.py' 'examples/SpongeRollProblem3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem3.py' 'examples/BeerDistributionProblemWarehouseExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemWarehouseExtension.py' 'examples/test3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test3.py' 'examples/Two_stage_Stochastic_GemstoneTools.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py' 'examples/AmericanSteelProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/AmericanSteelProblem.py' 'examples/test1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test1.py' 'examples/test5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test5.py' 'examples/BeerDistributionProblem_resolve.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem_resolve.py' 'examples/SpongeRollProblem1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem1.py' 'examples/Sudoku1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku1.py' 'examples/__init__.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/__init__.py' 'examples/WhiskasModel1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel1.py' 'examples/test4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test4.py' 'examples/Sudoku2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku2.py' 'examples/SpongeRollProblem4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem4.py' 'examples/test7.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test7.py' 'examples/ComputerPlantProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/ComputerPlantProblem.py' 'examples/BeerDistributionProblemCompetitorExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemCompetitorExtension.py' I: pybuild base:311: cd /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build; python3.13 -m unittest discover -v /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3b7024752a3542b69e68f0e0b17993db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b7024752a3542b69e68f0e0b17993db-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/779f914e57bc460d92c517831de40e13-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/779f914e57bc460d92c517831de40e13-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.04 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 9 iterations and 0 nodes (0.04 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: 9 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.05 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7624dfc79f8b424596919d392d920b35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7624dfc79f8b424596919d392d920b35-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.15 seconds) Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.82 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.058 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) MixedIntegerRounding2 was tried 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.83 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.80 (Wallclock seconds): 0.83 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1635 RHS At line 1856 BOUNDS At line 2067 ENDATA Problem MODEL has 220 rows, 210 columns and 780 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -134.966 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 781 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 22 integers unsatisfied sum - 6.42583 Cbc0038I Pass 1: suminf. 0.83366 (3) obj. -133.251 iterations 89 Cbc0038I Pass 2: suminf. 0.48842 (2) obj. -131.836 iterations 1 Cbc0038I Solution found of -127.15 Cbc0038I Before mini branch and bound, 186 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 7 columns Cbc0038I Mini branch and bound improved solution from -127.15 to -132.45 (0.03 seconds) Cbc0038I Round again with cutoff of -132.75 Cbc0038I Reduced cost fixing fixed 19 variables on major pass 2 Cbc0038I Pass 3: suminf. 0.83366 (3) obj. -133.251 iterations 0 Cbc0038I Pass 4: suminf. 0.60514 (3) obj. -132.75 iterations 4 Cbc0038I Pass 5: suminf. 0.63773 (3) obj. -132.75 iterations 30 Cbc0038I Pass 6: suminf. 0.61397 (3) obj. -132.75 iterations 4 Cbc0038I Pass 7: suminf. 0.44383 (2) obj. -132.81 iterations 34 Cbc0038I Pass 8: suminf. 0.42821 (2) obj. -132.75 iterations 5 Cbc0038I Pass 9: suminf. 0.61166 (2) obj. -132.75 iterations 30 Cbc0038I Pass 10: suminf. 0.09859 (1) obj. -133.194 iterations 31 Cbc0038I Pass 11: suminf. 0.24194 (1) obj. -132.75 iterations 11 Cbc0038I Pass 12: suminf. 1.04715 (4) obj. -132.75 iterations 72 Cbc0038I Pass 13: suminf. 0.78445 (3) obj. -132.75 iterations 84 Cbc0038I Pass 14: suminf. 0.92284 (3) obj. -132.75 iterations 63 Cbc0038I Pass 15: suminf. 0.92284 (3) obj. -132.75 iterations 2 Cbc0038I Pass 16: suminf. 0.91711 (3) obj. -132.75 iterations 65 Cbc0038I Pass 17: suminf. 1.24080 (4) obj. -132.75 iterations 58 Cbc0038I Pass 18: suminf. 0.66611 (3) obj. -132.75 iterations 78 Cbc0038I Pass 19: suminf. 0.75401 (3) obj. -132.75 iterations 30 Cbc0038I Pass 20: suminf. 0.73025 (3) obj. -132.75 iterations 4 Cbc0038I Pass 21: suminf. 0.74552 (3) obj. -132.75 iterations 28 Cbc0038I Pass 22: suminf. 0.53527 (3) obj. -132.75 iterations 94 Cbc0038I Pass 23: suminf. 0.73025 (3) obj. -132.75 iterations 63 Cbc0038I Pass 24: suminf. 0.95457 (4) obj. -132.75 iterations 44 Cbc0038I Pass 25: suminf. 0.93934 (4) obj. -132.75 iterations 8 Cbc0038I Pass 26: suminf. 0.90755 (3) obj. -132.75 iterations 101 Cbc0038I Pass 27: suminf. 0.90755 (3) obj. -132.75 iterations 4 Cbc0038I Pass 28: suminf. 0.33121 (3) obj. -132.75 iterations 76 Cbc0038I Pass 29: suminf. 0.33121 (3) obj. -132.75 iterations 2 Cbc0038I Pass 30: suminf. 1.03450 (3) obj. -132.75 iterations 64 Cbc0038I Pass 31: suminf. 0.48626 (3) obj. -132.75 iterations 33 Cbc0038I Pass 32: suminf. 0.57265 (3) obj. -132.75 iterations 27 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 175 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 12 columns Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -132.45 - took 0.04 seconds Cbc0012I Integer solution of -132.45 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 5 columns Cbc0012I Integer solution of -132.7 found by DiveCoefficient after 9 iterations and 0 nodes (0.07 seconds) Cbc0031I 4 added rows had average density of 7 Cbc0013I At root node, 4 cuts changed objective from -134.96566 to -132.7 in 3 passes Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 10.0 elements, 7 column cuts (7 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) - 3 row cuts average 6.7 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) - 6 row cuts average 7.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 7 (ZeroHalf) - 2 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective -132.7, took 9 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 20 variables fixed on reduced cost Cuts at root node changed objective from -134.966 to -132.7 Probing was tried 3 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 3 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 6 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -132.70000000 Enumerated nodes: 0 Total iterations: 9 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/bcd86eb39bd04cd68ce02f08b049e09d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcd86eb39bd04cd68ce02f08b049e09d-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 Cbc0038I Initial state - 3 integers unsatisfied sum - 1.13548 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 73.5 iterations 3 Cbc0038I Solution found of 73.5 Cbc0038I Relaxing continuous gives 73.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 5 columns Cbc0038I Mini branch and bound improved solution from 73.5 to 60.5 (0.01 seconds) Cbc0038I Round again with cutoff of 54.45 Cbc0038I Pass 2: suminf. 0.11272 (1) obj. 54.45 iterations 1 Cbc0038I Pass 3: suminf. 0.37992 (2) obj. 54.45 iterations 4 Cbc0038I Pass 4: suminf. 0.37331 (3) obj. 54.45 iterations 4 Cbc0038I Pass 5: suminf. 0.29454 (1) obj. 54.45 iterations 4 Cbc0038I Pass 6: suminf. 0.39345 (1) obj. 54.45 iterations 3 Cbc0038I Pass 7: suminf. 0.25035 (1) obj. 54.45 iterations 2 Cbc0038I Pass 8: suminf. 0.23625 (2) obj. 54.45 iterations 6 Cbc0038I Pass 9: suminf. 0.34502 (2) obj. 54.45 iterations 3 Cbc0038I Pass 10: suminf. 0.23625 (2) obj. 54.45 iterations 2 Cbc0038I Pass 11: suminf. 1.05750 (3) obj. 54.45 iterations 7 Cbc0038I Pass 12: suminf. 0.52585 (2) obj. 54.45 iterations 2 Cbc0038I Pass 13: suminf. 0.03237 (1) obj. 54.45 iterations 4 Cbc0038I Pass 14: suminf. 0.50626 (2) obj. 54.45 iterations 4 Cbc0038I Pass 15: suminf. 0.46754 (2) obj. 54.45 iterations 5 Cbc0038I Pass 16: suminf. 0.22550 (1) obj. 54.45 iterations 4 Cbc0038I Pass 17: suminf. 0.22562 (2) obj. 54.45 iterations 4 Cbc0038I Pass 18: suminf. 0.42671 (2) obj. 54.45 iterations 3 Cbc0038I Pass 19: suminf. 0.14661 (1) obj. 54.45 iterations 2 Cbc0038I Pass 20: suminf. 0.46446 (1) obj. 54.45 iterations 3 Cbc0038I Pass 21: suminf. 0.46394 (2) obj. 54.45 iterations 3 Cbc0038I Pass 22: suminf. 0.31979 (1) obj. 54.45 iterations 3 Cbc0038I Pass 23: suminf. 0.46141 (1) obj. 54.45 iterations 2 Cbc0038I Pass 24: suminf. 0.46159 (2) obj. 54.45 iterations 9 Cbc0038I Pass 25: suminf. 0.64270 (3) obj. 54.45 iterations 3 Cbc0038I Pass 26: suminf. 0.65055 (2) obj. 54.45 iterations 6 Cbc0038I Pass 27: suminf. 0.00000 (0) obj. 54.45 iterations 2 Cbc0038I Solution found of 54.45 Cbc0038I Relaxing continuous gives 49.5 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 49.5 to 8.5 (0.02 seconds) Cbc0038I Round again with cutoff of 6.79999 Cbc0038I Pass 28: suminf. 0.55893 (2) obj. 6.79999 iterations 1 Cbc0038I Pass 29: suminf. 0.72720 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 30: suminf. 0.65402 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 31: suminf. 0.96879 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 32: suminf. 0.56864 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 33: suminf. 1.02816 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 34: suminf. 0.72462 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 35: suminf. 0.39468 (2) obj. 6.79999 iterations 6 Cbc0038I Pass 36: suminf. 0.69176 (2) obj. 6.79999 iterations 5 Cbc0038I Pass 37: suminf. 0.64807 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 38: suminf. 0.64657 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 39: suminf. 0.64657 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 40: suminf. 0.85388 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 41: suminf. 0.69811 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 42: suminf. 1.12985 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 43: suminf. 0.52410 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 44: suminf. 0.21566 (2) obj. 6.79999 iterations 3 Cbc0038I Pass 45: suminf. 0.85968 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 46: suminf. 0.41789 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 47: suminf. 0.65140 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 48: suminf. 0.54313 (3) obj. 6.79999 iterations 1 Cbc0038I Pass 49: suminf. 1.13535 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 50: suminf. 0.59074 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 51: suminf. 0.76947 (2) obj. 6.79999 iterations 2 Cbc0038I Pass 52: suminf. 0.87409 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 53: suminf. 0.77689 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 54: suminf. 0.87409 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 55: suminf. 0.67975 (3) obj. 6.79999 iterations 6 Cbc0038I Pass 56: suminf. 0.67975 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 57: suminf. 0.94944 (3) obj. 6.79999 iterations 6 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 8.5 - took 0.03 seconds Cbc0012I Integer solution of 8.5 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0031I 5 added rows had average density of 15.8 Cbc0013I At root node, 5 cuts changed objective from 0 to 0.5 in 100 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (6 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 615 row cuts average 25.7 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 395 row cuts average 11.9 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 569 row cuts average 18.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 69 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 502 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 8.5 best solution, best possible 0.5 (0.14 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 19 columns Cbc0004I Integer solution of 6.5 found after 7147 iterations and 159 nodes (0.38 seconds) Cbc0004I Integer solution of 4.5 found after 7621 iterations and 169 nodes (0.39 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 Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0012I Integer solution of 3.5 found by DiveCoefficient after 25261 iterations and 523 nodes (0.93 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0010I After 1000 nodes, 3 on tree, 3.5 best solution, best possible 0.5 (1.59 seconds) Cbc0001I Search completed - best objective 3.5, took 104343 iterations and 6110 nodes (2.91 seconds) Cbc0032I Strong branching done 13820 times (70997 iterations), fathomed 74 nodes and fixed 504 variables Cbc0041I Maximum depth 12, 1194 variables fixed on reduced cost (complete fathoming 347 times, 4212 nodes taking 15962 iterations) Cuts at root node changed objective from 0 to 0.5 Probing was tried 100 times and created 2 cuts of which 5 were active after adding rounds of cuts (0.003 seconds) Gomory was tried 5453 times and created 21098 cuts of which 0 were active after adding rounds of cuts (0.278 seconds) Knapsack was tried 5456 times and created 12707 cuts of which 0 were active after adding rounds of cuts (0.484 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 5456 times and created 26211 cuts of which 0 were active after adding rounds of cuts (0.308 seconds) FlowCover was tried 100 times and created 69 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 5453 times and created 16424 cuts of which 0 were active after adding rounds of cuts (0.169 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 3.50000000 Enumerated nodes: 6110 Total iterations: 104343 Time (CPU seconds): 2.84 Time (Wallclock seconds): 2.92 Option for printingOptions changed from normal to all Total time (CPU seconds): 2.84 (Wallclock seconds): 2.92 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/90061b971f6d40f095d6e45caa07ac21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90061b971f6d40f095d6e45caa07ac21-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ffabd6ea41824531bb89b88ed6677f75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffabd6ea41824531bb89b88ed6677f75-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.13_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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2530a16774fc408ea70f8ab62a84f5f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2530a16774fc408ea70f8ab62a84f5f7-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 14 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/aada24fce3294bf8a3a79cd98467c267-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aada24fce3294bf8a3a79cd98467c267-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3345af0068634c889fcfd510a7e5f877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3345af0068634c889fcfd510a7e5f877-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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cf23d7698d904c179ffd6315b0f714c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf23d7698d904c179ffd6315b0f714c9-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/328392d437484d6d902feefba39c660f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/328392d437484d6d902feefba39c660f-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, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/907c223330a64878a7fc58750b0ae5fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/907c223330a64878a7fc58750b0ae5fa-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d7fff2cf58be4117a59c69097a44205e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7fff2cf58be4117a59c69097a44205e-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/90bb325226b74ac4b36d69f0564cb4c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90bb325226b74ac4b36d69f0564cb4c1-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dc6383586fb0462f90165f0c45839b7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc6383586fb0462f90165f0c45839b7a-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 Time (Wallclock seconds): 0.08 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2974c407efd744d6b9205bab6b9c1014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2974c407efd744d6b9205bab6b9c1014-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ac34bc61df914f93b6fe82df2a183b0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac34bc61df914f93b6fe82df2a183b0f-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f25457a716bc4d7290391e764dcf16fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f25457a716bc4d7290391e764dcf16fb-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/96a1bc0102cc445da6fa0ff9d0d85344-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96a1bc0102cc445da6fa0ff9d0d85344-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c2fe0db21d624b19b22ec277d257c4f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2fe0db21d624b19b22ec277d257c4f4-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.07 seconds) Cbc0038I After 0.07 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.07 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d76e592f967c45ee96d3bca6ed62fb10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d76e592f967c45ee96d3bca6ed62fb10-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/07c29f963c0e4a08b0f02ee0432d3992-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07c29f963c0e4a08b0f02ee0432d3992-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/96720283dbe44999bfaea0141823ce97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96720283dbe44999bfaea0141823ce97-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/036bec5ca2754ed6bf6108c533de14a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/036bec5ca2754ed6bf6108c533de14a8-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/46246ce0d7074b31b084ec2f1d4144bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46246ce0d7074b31b084ec2f1d4144bd-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a4508484106f493d9480033817768d26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4508484106f493d9480033817768d26-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6be8a1e460484c1098fbde8719d7abbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6be8a1e460484c1098fbde8719d7abbb-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3090527010f14b39889274948f058787-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3090527010f14b39889274948f058787-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dd873f00868f4148bb023f25a19525e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd873f00868f4148bb023f25a19525e4-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fe0bb2cba32d4521aa461b3593614957-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe0bb2cba32d4521aa461b3593614957-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9aaf392989174166a2532bfe1297a3c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9aaf392989174166a2532bfe1297a3c1-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.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 0.0 x_5 = 0.0 x_6 = 1.0 x_7 = 1.0 x_8 = 1.0 x_9 = 0.0 Status: Optimal s_0 = 1.0 s_1 = 0.0 s_2 = 0.0 w_0 = 0.0 w_1 = 1.0 w_2 = 1.5 x_0 = 1.0 x_1 = 0.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 1.0 x_14 = 1.0 x_15 = 1.0 x_16 = 1.0 x_17 = 1.0 x_18 = 0.0 x_19 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 0.0 x_6 = 0.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 3.5 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 item passed all tests: 8 tests in pulp 8 tests in 1 item. 8 passed. Test passed. Status: Optimal 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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/482b986519254a999b5623cd11b4a9cd-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/482b986519254a999b5623cd11b4a9cd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/93d15466fe2041c2984ed86e356778be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93d15466fe2041c2984ed86e356778be-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 72 RHS At line 81 BOUNDS At line 94 ENDATA Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/26d2d82d4cda4d87ba307aed0164a8a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26d2d82d4cda4d87ba307aed0164a8a4-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 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.07 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 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.06 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7e4cdf1f36864268ab24f1d3f318ec15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e4cdf1f36864268ab24f1d3f318ec15-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/17328d62811c41c083026fddb76921b5-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/17328d62811c41c083026fddb76921b5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5750027555e046e3b5f589a5d988186d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5750027555e046e3b5f589a5d988186d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/53ef67ce115448cea35026c9a046fff6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53ef67ce115448cea35026c9a046fff6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c14459c8cd614fdab0e7ab7a799534da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c14459c8cd614fdab0e7ab7a799534da-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d078ed130019448ea3e206d582be46d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d078ed130019448ea3e206d582be46d7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6d2ce629d8d14e2a94c83d4321784454-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d2ce629d8d14e2a94c83d4321784454-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4a895427f0ea49a4a7bc3c272de404f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a895427f0ea49a4a7bc3c272de404f8-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.01 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4da9a00ff06948909aa181d99921d415-pulp.mps mips /tmp/4da9a00ff06948909aa181d99921d415-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/4da9a00ff06948909aa181d99921d415-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/4da9a00ff06948909aa181d99921d415-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.06 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 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.13_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.13_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.13_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 27.113s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13_pulp/build/examples /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/*.lp 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b9c404466b2f419386657fb4dbf8dfc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9c404466b2f419386657fb4dbf8dfc4-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7453983c13644fa8be8f6dbd3e043f87-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7453983c13644fa8be8f6dbd3e043f87-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) 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 9 iterations and 0 nodes (0.05 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: 9 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f52d7582d5174f82a139dc382cb634c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f52d7582d5174f82a139dc382cb634c7-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.16 seconds) Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.15 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.81 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.036 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.82 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.80 (Wallclock seconds): 0.82 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1653 RHS At line 1874 BOUNDS At line 2085 ENDATA Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -140.072 - 0.00 seconds Cgl0004I processed model has 185 rows, 178 columns (178 integer (178 of which binary)) and 674 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 21 integers unsatisfied sum - 6.87096 Cbc0038I Solution found of -137.95 Cbc0038I Before mini branch and bound, 157 integers at bound fixed and 0 continuous Cbc0038I Full problem 185 rows 178 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound improved solution from -137.95 to -139.2 (0.02 seconds) Cbc0038I Round again with cutoff of -139.35 Cbc0038I Reduced cost fixing fixed 48 variables on major pass 2 Cbc0038I Pass 1: suminf. 0.45672 (2) obj. -139.35 iterations 96 Cbc0038I Pass 2: suminf. 0.06818 (1) obj. -139.35 iterations 38 Cbc0038I Pass 3: suminf. 0.20896 (1) obj. -139.66 iterations 12 Cbc0038I Pass 4: suminf. 0.81382 (3) obj. -139.35 iterations 48 Cbc0038I Pass 5: suminf. 0.51000 (2) obj. -139.35 iterations 88 Cbc0038I Pass 6: suminf. 0.81947 (2) obj. -139.35 iterations 52 Cbc0038I Pass 7: suminf. 0.77692 (3) obj. -139.35 iterations 26 Cbc0038I Pass 8: suminf. 0.79808 (2) obj. -139.35 iterations 20 Cbc0038I Pass 9: suminf. 0.79808 (2) obj. -139.35 iterations 2 Cbc0038I Pass 10: suminf. 0.73123 (3) obj. -139.35 iterations 28 Cbc0038I Pass 11: suminf. 0.52119 (2) obj. -139.35 iterations 22 Cbc0038I Pass 12: suminf. 0.85382 (3) obj. -139.35 iterations 18 Cbc0038I Pass 13: suminf. 0.85382 (3) obj. -139.35 iterations 1 Cbc0038I Pass 14: suminf. 0.21393 (2) obj. -139.35 iterations 68 Cbc0038I Pass 15: suminf. 0.20455 (1) obj. -139.35 iterations 26 Cbc0038I Pass 16: suminf. 0.20896 (1) obj. -139.36 iterations 15 Cbc0038I Pass 17: suminf. 0.51234 (3) obj. -139.35 iterations 43 Cbc0038I Pass 18: suminf. 0.72046 (3) obj. -139.35 iterations 5 Cbc0038I Pass 19: suminf. 0.20455 (1) obj. -139.35 iterations 69 Cbc0038I Pass 20: suminf. 0.20896 (1) obj. -139.36 iterations 25 Cbc0038I Pass 21: suminf. 1.26878 (20) obj. -139.35 iterations 55 Cbc0038I Pass 22: suminf. 0.66525 (3) obj. -139.35 iterations 1 Cbc0038I Pass 23: suminf. 0.86629 (3) obj. -139.35 iterations 2 Cbc0038I Pass 24: suminf. 0.59248 (2) obj. -139.35 iterations 77 Cbc0038I Pass 25: suminf. 0.61424 (2) obj. -139.35 iterations 33 Cbc0038I Pass 26: suminf. 0.61424 (2) obj. -139.35 iterations 1 Cbc0038I Pass 27: suminf. 0.64646 (2) obj. -139.416 iterations 25 Cbc0038I Pass 28: suminf. 1.02759 (3) obj. -139.35 iterations 48 Cbc0038I Pass 29: suminf. 0.73974 (3) obj. -139.35 iterations 9 Cbc0038I Pass 30: suminf. 0.73974 (3) obj. -139.35 iterations 1 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 146 integers at bound fixed and 0 continuous Cbc0038I Full problem 185 rows 178 columns, reduced to 2 rows 6 columns Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -139.2 - took 0.04 seconds Cbc0012I Integer solution of -139.2 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0031I 9 added rows had average density of 8.7777778 Cbc0013I At root node, 13 cuts changed objective from -140.07186 to -139.2 in 2 passes Cbc0014I Cut generator 0 (Probing) - 10 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 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) - 9 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.001 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) - 17 row cuts average 17.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 4 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective -139.2, took 21 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 64 variables fixed on reduced cost Cuts at root node changed objective from -140.072 to -139.2 Probing was tried 2 times and created 10 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 9 cuts of which 0 were active after adding rounds of cuts (0.001 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 2 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 2 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -139.20000000 Enumerated nodes: 0 Total iterations: 21 Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4e102e63c00f4c919432840ac657f534-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e102e63c00f4c919432840ac657f534-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 120 RHS At line 124 BOUNDS At line 145 ENDATA Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 3 integers unsatisfied sum - 0.973263 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 153 iterations 3 Cbc0038I Solution found of 153 Cbc0038I Relaxing continuous gives 153 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 136.8 Cbc0038I Pass 2: suminf. 0.07232 (1) obj. 136.8 iterations 1 Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 136.8 iterations 3 Cbc0038I Solution found of 136.8 Cbc0038I Relaxing continuous gives 71 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns Cbc0038I Mini branch and bound improved solution from 71 to 52 (0.01 seconds) Cbc0038I Round again with cutoff of 40.8001 Cbc0038I Pass 4: suminf. 0.50970 (2) obj. 40.8001 iterations 1 Cbc0038I Pass 5: suminf. 0.61767 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 6: suminf. 0.24695 (2) obj. 40.8001 iterations 2 Cbc0038I Pass 7: suminf. 0.76286 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 8: suminf. 0.40951 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 9: suminf. 0.81284 (2) obj. 40.8001 iterations 6 Cbc0038I Pass 10: suminf. 0.00000 (0) obj. 40.8001 iterations 2 Cbc0038I Solution found of 40.8001 Cbc0038I Relaxing continuous gives 27 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns Cbc0038I Mini branch and bound improved solution from 27 to 23 (0.01 seconds) Cbc0038I Round again with cutoff of 15.4001 Cbc0038I Pass 11: suminf. 0.63835 (2) obj. 15.4001 iterations 0 Cbc0038I Pass 12: suminf. 1.07479 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 13: suminf. 0.35410 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 14: suminf. 0.84974 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 15: suminf. 0.37676 (3) obj. 15.4001 iterations 2 Cbc0038I Pass 16: suminf. 0.28454 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 17: suminf. 0.28454 (1) obj. 15.4001 iterations 0 Cbc0038I Pass 18: suminf. 0.50016 (2) obj. 15.4001 iterations 10 Cbc0038I Pass 19: suminf. 0.03378 (1) obj. 15.4001 iterations 2 Cbc0038I Pass 20: suminf. 0.17067 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 21: suminf. 1.01300 (3) obj. 15.4001 iterations 10 Cbc0038I Pass 22: suminf. 1.01300 (3) obj. 15.4001 iterations 0 Cbc0038I Pass 23: suminf. 0.55390 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 24: suminf. 0.22133 (2) obj. 15.4001 iterations 4 Cbc0038I Pass 25: suminf. 0.39196 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 26: suminf. 0.53592 (3) obj. 15.4001 iterations 6 Cbc0038I Pass 27: suminf. 0.41061 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 28: suminf. 0.16808 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 29: suminf. 0.48799 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 30: suminf. 0.75659 (3) obj. 15.4001 iterations 7 Cbc0038I Pass 31: suminf. 0.62667 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 32: suminf. 0.64381 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 33: suminf. 0.32040 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 34: suminf. 0.75330 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 35: suminf. 0.42295 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 36: suminf. 0.63247 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 37: suminf. 0.96282 (3) obj. 15.4001 iterations 7 Cbc0038I Pass 38: suminf. 0.23075 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 39: suminf. 0.83585 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 40: suminf. 0.70075 (3) obj. 15.4001 iterations 5 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns Cbc0038I Mini branch and bound improved solution from 23 to 5 (0.03 seconds) Cbc0038I Round again with cutoff of 2.80007 Cbc0038I Pass 40: suminf. 0.72303 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 41: suminf. 0.40721 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 42: suminf. 0.18115 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 43: suminf. 0.70597 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 44: suminf. 0.45692 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 45: suminf. 0.97612 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 46: suminf. 0.59208 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 47: suminf. 0.87356 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 48: suminf. 0.76850 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 49: suminf. 0.87136 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 50: suminf. 0.26915 (2) obj. 2.80007 iterations 8 Cbc0038I Pass 51: suminf. 0.13346 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 52: suminf. 0.24341 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 53: suminf. 0.64162 (3) obj. 2.80007 iterations 8 Cbc0038I Pass 54: suminf. 0.64162 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 55: suminf. 0.75064 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 56: suminf. 0.35312 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 57: suminf. 0.90927 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 58: suminf. 0.74218 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 59: suminf. 1.09430 (3) obj. 2.80007 iterations 5 Cbc0038I Pass 60: suminf. 1.09430 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 61: suminf. 1.02717 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 62: suminf. 0.72162 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 63: suminf. 0.73585 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 64: suminf. 0.63751 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 65: suminf. 0.27083 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 66: suminf. 0.07790 (2) obj. 2.80007 iterations 4 Cbc0038I Pass 67: suminf. 0.81315 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 68: suminf. 0.81315 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 69: suminf. 0.08820 (3) obj. 2.80007 iterations 4 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 did not improve solution (0.05 seconds) Cbc0038I After 0.05 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.05 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0031I 5 added rows had average density of 20 Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 575 row cuts average 25.8 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 697 row cuts average 11.2 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) - 508 row cuts average 19.1 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 124 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 333 row cuts average 18.8 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.16 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0004I Integer solution of 1 found after 1594 iterations and 118 nodes (0.20 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 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 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns Cbc0010I After 1000 nodes, 5 on tree, 1 best solution, best possible 0 (0.43 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0001I Search completed - best objective 1, took 19173 iterations and 6290 nodes (0.67 seconds) Cbc0032I Strong branching done 9294 times (23648 iterations), fathomed 475 nodes and fixed 549 variables Cbc0041I Maximum depth 13, 64 variables fixed on reduced cost (complete fathoming 370 times, 4420 nodes taking 9476 iterations) Cuts at root node changed objective from 0 to 0 Probing was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Gomory was tried 100 times and created 575 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Knapsack was tried 100 times and created 697 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 508 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 100 times and created 124 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 100 times and created 333 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.00000000 Enumerated nodes: 6290 Total iterations: 19173 Time (CPU seconds): 0.66 Time (Wallclock seconds): 0.68 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.66 (Wallclock seconds): 0.68 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b29f1c439cb242bbbfe82217ba7af284-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b29f1c439cb242bbbfe82217ba7af284-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/aaaaf5c1006446f7b8111958c6801b64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaaaf5c1006446f7b8111958c6801b64-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/955983a23f3546f6b944872d7ed48449-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/955983a23f3546f6b944872d7ed48449-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 14 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c8e8e421d72c46989512d750b8db77e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8e8e421d72c46989512d750b8db77e1-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/eb85efe495d54e58a48f2886726abc0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb85efe495d54e58a48f2886726abc0f-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.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.02 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/39e4c772623443619718cf6d3215e0f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39e4c772623443619718cf6d3215e0f8-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0ec3036276fc4213a3a5070e20c8b2f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ec3036276fc4213a3a5070e20c8b2f9-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3da5882cb7f84ce1836312daca4625d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3da5882cb7f84ce1836312daca4625d3-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.01 seconds Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5f17a00eedfa4c74a726f773d1cce9cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f17a00eedfa4c74a726f773d1cce9cf-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b3d92acbd4884226902fa1dc0275112f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3d92acbd4884226902fa1dc0275112f-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/bd9175baddcd42a180b4878784c84b04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd9175baddcd42a180b4878784c84b04-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/03496577738547dba976c10fd63697d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03496577738547dba976c10fd63697d1-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0cd4c06c8a7342639cead5790e5455a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cd4c06c8a7342639cead5790e5455a2-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/372cfbb20fca44b399fa838208922e93-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/372cfbb20fca44b399fa838208922e93-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/40da0198cbcc4509b3d453fe113b4e87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40da0198cbcc4509b3d453fe113b4e87-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8ddf88c2252a405ab57536adba9378ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ddf88c2252a405ab57536adba9378ea-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4ffcab2d7f19486aababb5d3b0f13791-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ffcab2d7f19486aababb5d3b0f13791-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.06 seconds) Cbc0038I After 0.06 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.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 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.06 Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e3b478b6856a40948324f89156e93b8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3b478b6856a40948324f89156e93b8a-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/84f427ba96504f3094f5829060cd2165-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84f427ba96504f3094f5829060cd2165-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b353139065224feeb04d0e9b03339825-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b353139065224feeb04d0e9b03339825-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/12b2291772494428a29bc32cfa56ea4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12b2291772494428a29bc32cfa56ea4d-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3f74ff23371a4859a9aa01d186672cec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f74ff23371a4859a9aa01d186672cec-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e9fbf70c152244c881136905f984c0a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9fbf70c152244c881136905f984c0a3-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8690 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8690 to 8690 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/30ad2dce94254e4ba4cb4720362864e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30ad2dce94254e4ba4cb4720362864e8-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a454510deaf5456083df70aeb8c3a349-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a454510deaf5456083df70aeb8c3a349-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/18578bf2ebe74786bcc2523b6e247ec0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18578bf2ebe74786bcc2523b6e247ec0-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2912eae5fcd044d58d22aecc5ec04627-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2912eae5fcd044d58d22aecc5ec04627-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fb57ad9fade64a6692fbdfde12688da8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb57ad9fade64a6692fbdfde12688da8-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.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/82210abdfec04e99a572af17c2f3e01b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82210abdfec04e99a572af17c2f3e01b-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/88e4853b8b1f471bb4e29d5408f02798-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88e4853b8b1f471bb4e29d5408f02798-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-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.01 (Wallclock seconds): 0.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 1.0 x_8 = 0.0 x_9 = 0.0 Status: Optimal s_0 = 0.0 s_1 = 0.0 s_2 = 0.0 w_0 = 0.0 w_1 = 1.0 w_2 = 0.0 x_0 = 1.0 x_1 = 1.0 x_10 = 1.0 x_11 = 1.0 x_12 = 1.0 x_13 = 0.0 x_14 = 1.0 x_15 = 1.0 x_16 = 0.0 x_17 = 0.0 x_18 = 1.0 x_19 = 1.0 x_2 = 0.0 x_3 = 0.0 x_4 = 0.0 x_5 = 0.0 x_6 = 0.0 x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 objective= 1.0 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 items passed all tests: 8 tests in pulp 8 tests in 1 items. 8 passed and 0 failed. Test passed. Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c202a6d9cb8d403a858f2c868192fdfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c202a6d9cb8d403a858f2c868192fdfd-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.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2f7f7fa204534309a8612b2af81fe6c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f7f7fa204534309a8612b2af81fe6c5-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 12 to 12 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/97b414047073428490114d7a88cf72db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97b414047073428490114d7a88cf72db-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ff1b869af34f48708b97635ad33916d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff1b869af34f48708b97635ad33916d9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5bf3ef66608943e892553b41536064bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bf3ef66608943e892553b41536064bd-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cdb860c0da454c88a60f0fe935950792-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdb860c0da454c88a60f0fe935950792-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a6ec013fb03a4bc690594407fc2976d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6ec013fb03a4bc690594407fc2976d5-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/925f730714764a1b9e166853af805853-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/925f730714764a1b9e166853af805853-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.01 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mps mips /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-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/fbc4b6c8b4944ac586730fc7abdb4fcb-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 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 27.404s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13 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:261: 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/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc /usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt running install_scripts Installing pulptest script to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/bin 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:261: 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/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/run_tests.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_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/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir 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__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/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__/__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/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/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/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/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/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/__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/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.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/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/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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc /usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/highs_api.py to highs_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/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/coin_api.py to coin_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/constants.py to constants.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/pulp.py to pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt 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_arm64.buildinfo dpkg-genchanges --build=binary -O../python-pulp_2.7.0+dfsg-4_arm64.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: 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/2878175 and its subdirectories I: Current time: Thu Nov 21 15:47:40 -12 2024 I: pbuilder-time-stamp: 1732247260 Fri Nov 22 03:47:40 UTC 2024 I: Signing ./b1/python-pulp_2.7.0+dfsg-4_arm64.buildinfo as python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc Fri Nov 22 03:47:40 UTC 2024 I: Signed ./b1/python-pulp_2.7.0+dfsg-4_arm64.buildinfo as ./b1/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc Fri Nov 22 03:47:40 UTC 2024 - build #1 for python-pulp/unstable/arm64 on codethink04-arm64 done. Starting cleanup. All cleanup done. Fri Nov 22 03:47:40 UTC 2024 - reproducible_build.sh stopped running as /tmp/jenkins-script-6AiBISZW, removing. /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV: total 16 drwxr-xr-x 2 jenkins jenkins 4096 Nov 22 03:47 b1 drwxr-xr-x 2 jenkins jenkins 4096 Nov 22 03:45 b2 -rw-r--r-- 1 jenkins jenkins 1595 Sep 1 11:15 python-pulp_2.7.0+dfsg-4.dsc -rw------- 1 jenkins jenkins 2760 Nov 22 03:45 rbuildlog.tnWyVMg /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1: total 916 -rw-r--r-- 1 jenkins jenkins 817882 Nov 22 03:47 build.log -rw-r--r-- 1 jenkins jenkins 13500 Nov 22 03:47 python-pulp_2.7.0+dfsg-4.debian.tar.xz -rw-r--r-- 1 jenkins jenkins 1595 Nov 22 03:47 python-pulp_2.7.0+dfsg-4.dsc -rw-r--r-- 1 jenkins jenkins 6312 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.buildinfo -rw-r--r-- 1 jenkins jenkins 7194 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc -rw-r--r-- 1 jenkins jenkins 1174 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.changes -rw-r--r-- 1 jenkins jenkins 1378 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_source.changes -rw-r--r-- 1 jenkins jenkins 72400 Nov 22 03:47 python3-pulp_2.7.0+dfsg-4_all.deb /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b2: total 0 Fri Nov 22 03:47:41 UTC 2024 I: Deleting $TMPDIR on codethink04-arm64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Thu Nov 21 15:45:52 -12 2024 I: pbuilder-time-stamp: 1732247152 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: 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/2878175/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/reproducible-path' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='arm64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='arm64' IFS=' ' INVOCATION_ID='21c0219a68b24a86a54eea250ad6f401' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='2878175' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/pbuilderrc_kljq --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' SUDO_GID='109' SUDO_UID='104' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://192.168.101.4:3128' I: uname -a Linux codethink04-arm64 6.1.0-27-cloud-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin I: user script /srv/workspace/pbuilder/2878175/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: arm64 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 ... 20084 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} libpython3.13-minimal{a} libpython3.13-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-jaraco.text{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} python3.13{a} python3.13-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, 78 newly installed, 0 to remove and 0 not upgraded. Need to get 37.6 MB of archives. After unpacking 155 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main arm64 libpython3.12-minimal arm64 3.12.7-3 [808 kB] Get: 2 http://deb.debian.org/debian unstable/main arm64 libexpat1 arm64 2.6.4-1 [90.7 kB] Get: 3 http://deb.debian.org/debian unstable/main arm64 python3.12-minimal arm64 3.12.7-3 [1940 kB] Get: 4 http://deb.debian.org/debian unstable/main arm64 python3-minimal arm64 3.12.7-1 [26.8 kB] Get: 5 http://deb.debian.org/debian unstable/main arm64 media-types all 10.1.0 [26.9 kB] Get: 6 http://deb.debian.org/debian unstable/main arm64 netbase all 6.4 [12.8 kB] Get: 7 http://deb.debian.org/debian unstable/main arm64 tzdata all 2024b-3 [255 kB] Get: 8 http://deb.debian.org/debian unstable/main arm64 libkrb5support0 arm64 1.21.3-3 [32.1 kB] Get: 9 http://deb.debian.org/debian unstable/main arm64 libcom-err2 arm64 1.47.1-1+b1 [23.1 kB] Get: 10 http://deb.debian.org/debian unstable/main arm64 libk5crypto3 arm64 1.21.3-3 [80.8 kB] Get: 11 http://deb.debian.org/debian unstable/main arm64 libkeyutils1 arm64 1.6.3-4 [9352 B] Get: 12 http://deb.debian.org/debian unstable/main arm64 libkrb5-3 arm64 1.21.3-3 [310 kB] Get: 13 http://deb.debian.org/debian unstable/main arm64 libgssapi-krb5-2 arm64 1.21.3-3 [126 kB] Get: 14 http://deb.debian.org/debian unstable/main arm64 libtirpc-common all 1.3.4+ds-1.3 [10.9 kB] Get: 15 http://deb.debian.org/debian unstable/main arm64 libtirpc3t64 arm64 1.3.4+ds-1.3+b1 [78.7 kB] Get: 16 http://deb.debian.org/debian unstable/main arm64 libnsl2 arm64 1.3.0-3+b3 [37.9 kB] Get: 17 http://deb.debian.org/debian unstable/main arm64 readline-common all 8.2-5 [69.3 kB] Get: 18 http://deb.debian.org/debian unstable/main arm64 libreadline8t64 arm64 8.2-5 [159 kB] Get: 19 http://deb.debian.org/debian unstable/main arm64 libpython3.12-stdlib arm64 3.12.7-3 [1902 kB] Get: 20 http://deb.debian.org/debian unstable/main arm64 python3.12 arm64 3.12.7-3 [671 kB] Get: 21 http://deb.debian.org/debian unstable/main arm64 libpython3-stdlib arm64 3.12.7-1 [9708 B] Get: 22 http://deb.debian.org/debian unstable/main arm64 python3 arm64 3.12.7-1 [27.8 kB] Get: 23 http://deb.debian.org/debian unstable/main arm64 libpython3.13-minimal arm64 3.13.0-2 [850 kB] Get: 24 http://deb.debian.org/debian unstable/main arm64 python3.13-minimal arm64 3.13.0-2 [1838 kB] Get: 25 http://deb.debian.org/debian unstable/main arm64 sensible-utils all 0.0.24 [24.8 kB] Get: 26 http://deb.debian.org/debian unstable/main arm64 libmagic-mgc arm64 1:5.45-3+b1 [314 kB] Get: 27 http://deb.debian.org/debian unstable/main arm64 libmagic1t64 arm64 1:5.45-3+b1 [102 kB] Get: 28 http://deb.debian.org/debian unstable/main arm64 file arm64 1:5.45-3+b1 [43.4 kB] Get: 29 http://deb.debian.org/debian unstable/main arm64 gettext-base arm64 0.22.5-2 [198 kB] Get: 30 http://deb.debian.org/debian unstable/main arm64 libuchardet0 arm64 0.0.8-1+b2 [69.2 kB] Get: 31 http://deb.debian.org/debian unstable/main arm64 groff-base arm64 1.23.0-5 [1129 kB] Get: 32 http://deb.debian.org/debian unstable/main arm64 bsdextrautils arm64 2.40.2-11 [91.2 kB] Get: 33 http://deb.debian.org/debian unstable/main arm64 libpipeline1 arm64 1.5.8-1 [40.2 kB] Get: 34 http://deb.debian.org/debian unstable/main arm64 man-db arm64 2.13.0-1 [1404 kB] Get: 35 http://deb.debian.org/debian unstable/main arm64 m4 arm64 1.4.19-4 [277 kB] Get: 36 http://deb.debian.org/debian unstable/main arm64 autoconf all 2.72-3 [493 kB] Get: 37 http://deb.debian.org/debian unstable/main arm64 autotools-dev all 20220109.1 [51.6 kB] Get: 38 http://deb.debian.org/debian unstable/main arm64 automake all 1:1.16.5-1.3 [823 kB] Get: 39 http://deb.debian.org/debian unstable/main arm64 autopoint all 0.22.5-2 [723 kB] Get: 40 http://deb.debian.org/debian unstable/main arm64 libblas3 arm64 3.12.0-4 [98.7 kB] Get: 41 http://deb.debian.org/debian unstable/main arm64 libgfortran5 arm64 14.2.0-8 [361 kB] Get: 42 http://deb.debian.org/debian unstable/main arm64 liblapack3 arm64 3.12.0-4 [1812 kB] Get: 43 http://deb.debian.org/debian unstable/main arm64 coinor-libcoinutils3v5 arm64 2.11.11+ds-1+b1 [397 kB] Get: 44 http://deb.debian.org/debian unstable/main arm64 coinor-libosi1v5 arm64 0.108.10+ds-1+b1 [248 kB] Get: 45 http://deb.debian.org/debian unstable/main arm64 coinor-libclp1 arm64 1.17.10+ds-1 [751 kB] Get: 46 http://deb.debian.org/debian unstable/main arm64 coinor-libcgl1 arm64 0.60.9+ds-1 [359 kB] Get: 47 http://deb.debian.org/debian unstable/main arm64 coinor-libcbc3.1 arm64 2.10.12+ds-1 [615 kB] Get: 48 http://deb.debian.org/debian unstable/main arm64 coinor-cbc arm64 2.10.12+ds-1 [16.3 kB] Get: 49 http://deb.debian.org/debian unstable/main arm64 libdebhelper-perl all 13.20 [89.7 kB] Get: 50 http://deb.debian.org/debian unstable/main arm64 libtool all 2.4.7-8 [517 kB] Get: 51 http://deb.debian.org/debian unstable/main arm64 dh-autoreconf all 20 [17.1 kB] Get: 52 http://deb.debian.org/debian unstable/main arm64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 53 http://deb.debian.org/debian unstable/main arm64 libfile-stripnondeterminism-perl all 1.14.0-1 [19.5 kB] Get: 54 http://deb.debian.org/debian unstable/main arm64 dh-strip-nondeterminism all 1.14.0-1 [8448 B] Get: 55 http://deb.debian.org/debian unstable/main arm64 libelf1t64 arm64 0.192-4 [189 kB] Get: 56 http://deb.debian.org/debian unstable/main arm64 dwz arm64 0.15-1+b1 [102 kB] Get: 57 http://deb.debian.org/debian unstable/main arm64 libicu72 arm64 72.1-5+b1 [9239 kB] Get: 58 http://deb.debian.org/debian unstable/main arm64 libxml2 arm64 2.12.7+dfsg+really2.9.14-0.2+b1 [630 kB] Get: 59 http://deb.debian.org/debian unstable/main arm64 gettext arm64 0.22.5-2 [1532 kB] Get: 60 http://deb.debian.org/debian unstable/main arm64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 61 http://deb.debian.org/debian unstable/main arm64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 62 http://deb.debian.org/debian unstable/main arm64 debhelper all 13.20 [915 kB] Get: 63 http://deb.debian.org/debian unstable/main arm64 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 64 http://deb.debian.org/debian unstable/main arm64 python3-more-itertools all 10.5.0-1 [63.8 kB] Get: 65 http://deb.debian.org/debian unstable/main arm64 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 66 http://deb.debian.org/debian unstable/main arm64 python3-typeguard all 4.4.1-1 [37.0 kB] Get: 67 http://deb.debian.org/debian unstable/main arm64 python3-inflect all 7.3.1-2 [32.4 kB] Get: 68 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 69 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.functools all 4.1.0-1 [12.0 kB] Get: 70 http://deb.debian.org/debian unstable/main arm64 python3-pkg-resources all 75.2.0-1 [213 kB] Get: 71 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.text all 4.0.0-1 [11.4 kB] Get: 72 http://deb.debian.org/debian unstable/main arm64 python3-zipp all 3.21.0-1 [10.6 kB] Get: 73 http://deb.debian.org/debian unstable/main arm64 python3-setuptools all 75.2.0-1 [731 kB] Get: 74 http://deb.debian.org/debian unstable/main arm64 dh-python all 6.20241024 [109 kB] Get: 75 http://deb.debian.org/debian unstable/main arm64 libpython3.13-stdlib arm64 3.13.0-2 [1922 kB] Get: 76 http://deb.debian.org/debian unstable/main arm64 python3.13 arm64 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main arm64 python3-all arm64 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main arm64 python3-pyparsing all 3.1.2-1 [146 kB] Fetched 37.6 MB in 0s (131 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:arm64. (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 ... 20084 files and directories currently installed.) Preparing to unpack .../libpython3.12-minimal_3.12.7-3_arm64.deb ... Unpacking libpython3.12-minimal:arm64 (3.12.7-3) ... Selecting previously unselected package libexpat1:arm64. Preparing to unpack .../libexpat1_2.6.4-1_arm64.deb ... Unpacking libexpat1:arm64 (2.6.4-1) ... Selecting previously unselected package python3.12-minimal. Preparing to unpack .../python3.12-minimal_3.12.7-3_arm64.deb ... Unpacking python3.12-minimal (3.12.7-3) ... Setting up libpython3.12-minimal:arm64 (3.12.7-3) ... Setting up libexpat1:arm64 (2.6.4-1) ... Setting up python3.12-minimal (3.12.7-3) ... 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 ... 20404 files and directories currently installed.) Preparing to unpack .../00-python3-minimal_3.12.7-1_arm64.deb ... Unpacking python3-minimal (3.12.7-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_2024b-3_all.deb ... Unpacking tzdata (2024b-3) ... Selecting previously unselected package libkrb5support0:arm64. Preparing to unpack .../04-libkrb5support0_1.21.3-3_arm64.deb ... Unpacking libkrb5support0:arm64 (1.21.3-3) ... Selecting previously unselected package libcom-err2:arm64. Preparing to unpack .../05-libcom-err2_1.47.1-1+b1_arm64.deb ... Unpacking libcom-err2:arm64 (1.47.1-1+b1) ... Selecting previously unselected package libk5crypto3:arm64. Preparing to unpack .../06-libk5crypto3_1.21.3-3_arm64.deb ... Unpacking libk5crypto3:arm64 (1.21.3-3) ... Selecting previously unselected package libkeyutils1:arm64. Preparing to unpack .../07-libkeyutils1_1.6.3-4_arm64.deb ... Unpacking libkeyutils1:arm64 (1.6.3-4) ... Selecting previously unselected package libkrb5-3:arm64. Preparing to unpack .../08-libkrb5-3_1.21.3-3_arm64.deb ... Unpacking libkrb5-3:arm64 (1.21.3-3) ... Selecting previously unselected package libgssapi-krb5-2:arm64. Preparing to unpack .../09-libgssapi-krb5-2_1.21.3-3_arm64.deb ... Unpacking libgssapi-krb5-2:arm64 (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:arm64. Preparing to unpack .../11-libtirpc3t64_1.3.4+ds-1.3+b1_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3 to /lib/aarch64-linux-gnu/libtirpc.so.3.usr-is-merged by libtirpc3t64' Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3.0.0 to /lib/aarch64-linux-gnu/libtirpc.so.3.0.0.usr-is-merged by libtirpc3t64' Unpacking libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Selecting previously unselected package libnsl2:arm64. Preparing to unpack .../12-libnsl2_1.3.0-3+b3_arm64.deb ... Unpacking libnsl2:arm64 (1.3.0-3+b3) ... 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:arm64. Preparing to unpack .../14-libreadline8t64_8.2-5_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8 to /lib/aarch64-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8.2 to /lib/aarch64-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8 to /lib/aarch64-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8.2 to /lib/aarch64-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:arm64 (8.2-5) ... Selecting previously unselected package libpython3.12-stdlib:arm64. Preparing to unpack .../15-libpython3.12-stdlib_3.12.7-3_arm64.deb ... Unpacking libpython3.12-stdlib:arm64 (3.12.7-3) ... Selecting previously unselected package python3.12. Preparing to unpack .../16-python3.12_3.12.7-3_arm64.deb ... Unpacking python3.12 (3.12.7-3) ... Selecting previously unselected package libpython3-stdlib:arm64. Preparing to unpack .../17-libpython3-stdlib_3.12.7-1_arm64.deb ... Unpacking libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3-minimal (3.12.7-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 ... 21466 files and directories currently installed.) Preparing to unpack .../00-python3_3.12.7-1_arm64.deb ... Unpacking python3 (3.12.7-1) ... Selecting previously unselected package libpython3.13-minimal:arm64. Preparing to unpack .../01-libpython3.13-minimal_3.13.0-2_arm64.deb ... Unpacking libpython3.13-minimal:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13-minimal. Preparing to unpack .../02-python3.13-minimal_3.13.0-2_arm64.deb ... Unpacking python3.13-minimal (3.13.0-2) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../03-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../04-libmagic-mgc_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:arm64. Preparing to unpack .../05-libmagic1t64_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic1t64:arm64 (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../06-file_1%3a5.45-3+b1_arm64.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../07-gettext-base_0.22.5-2_arm64.deb ... Unpacking gettext-base (0.22.5-2) ... Selecting previously unselected package libuchardet0:arm64. Preparing to unpack .../08-libuchardet0_0.0.8-1+b2_arm64.deb ... Unpacking libuchardet0:arm64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../09-groff-base_1.23.0-5_arm64.deb ... Unpacking groff-base (1.23.0-5) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../10-bsdextrautils_2.40.2-11_arm64.deb ... Unpacking bsdextrautils (2.40.2-11) ... Selecting previously unselected package libpipeline1:arm64. Preparing to unpack .../11-libpipeline1_1.5.8-1_arm64.deb ... Unpacking libpipeline1:arm64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.13.0-1_arm64.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../13-m4_1.4.19-4_arm64.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../14-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../15-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../16-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 .../17-autopoint_0.22.5-2_all.deb ... Unpacking autopoint (0.22.5-2) ... Selecting previously unselected package libblas3:arm64. Preparing to unpack .../18-libblas3_3.12.0-4_arm64.deb ... Unpacking libblas3:arm64 (3.12.0-4) ... Selecting previously unselected package libgfortran5:arm64. Preparing to unpack .../19-libgfortran5_14.2.0-8_arm64.deb ... Unpacking libgfortran5:arm64 (14.2.0-8) ... Selecting previously unselected package liblapack3:arm64. Preparing to unpack .../20-liblapack3_3.12.0-4_arm64.deb ... Unpacking liblapack3:arm64 (3.12.0-4) ... Selecting previously unselected package coinor-libcoinutils3v5:arm64. Preparing to unpack .../21-coinor-libcoinutils3v5_2.11.11+ds-1+b1_arm64.deb ... Unpacking coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Selecting previously unselected package coinor-libosi1v5:arm64. Preparing to unpack .../22-coinor-libosi1v5_0.108.10+ds-1+b1_arm64.deb ... Unpacking coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Selecting previously unselected package coinor-libclp1:arm64. Preparing to unpack .../23-coinor-libclp1_1.17.10+ds-1_arm64.deb ... Unpacking coinor-libclp1:arm64 (1.17.10+ds-1) ... Selecting previously unselected package coinor-libcgl1:arm64. Preparing to unpack .../24-coinor-libcgl1_0.60.9+ds-1_arm64.deb ... Unpacking coinor-libcgl1:arm64 (0.60.9+ds-1) ... Selecting previously unselected package coinor-libcbc3.1:arm64. Preparing to unpack .../25-coinor-libcbc3.1_2.10.12+ds-1_arm64.deb ... Unpacking coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Selecting previously unselected package coinor-cbc. Preparing to unpack .../26-coinor-cbc_2.10.12+ds-1_arm64.deb ... Unpacking coinor-cbc (2.10.12+ds-1) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../27-libdebhelper-perl_13.20_all.deb ... Unpacking libdebhelper-perl (13.20) ... Selecting previously unselected package libtool. Preparing to unpack .../28-libtool_2.4.7-8_all.deb ... Unpacking libtool (2.4.7-8) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../29-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../30-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 .../31-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 .../32-dh-strip-nondeterminism_1.14.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.0-1) ... Selecting previously unselected package libelf1t64:arm64. Preparing to unpack .../33-libelf1t64_0.192-4_arm64.deb ... Unpacking libelf1t64:arm64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../34-dwz_0.15-1+b1_arm64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libicu72:arm64. Preparing to unpack .../35-libicu72_72.1-5+b1_arm64.deb ... Unpacking libicu72:arm64 (72.1-5+b1) ... Selecting previously unselected package libxml2:arm64. Preparing to unpack .../36-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_arm64.deb ... Unpacking libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package gettext. Preparing to unpack .../37-gettext_0.22.5-2_arm64.deb ... Unpacking gettext (0.22.5-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../38-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 .../39-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../40-debhelper_13.20_all.deb ... Unpacking debhelper (13.20) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../41-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 .../42-python3-more-itertools_10.5.0-1_all.deb ... Unpacking python3-more-itertools (10.5.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../43-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 .../44-python3-typeguard_4.4.1-1_all.deb ... Unpacking python3-typeguard (4.4.1-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../45-python3-inflect_7.3.1-2_all.deb ... Unpacking python3-inflect (7.3.1-2) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../46-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 .../47-python3-jaraco.functools_4.1.0-1_all.deb ... Unpacking python3-jaraco.functools (4.1.0-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../48-python3-pkg-resources_75.2.0-1_all.deb ... Unpacking python3-pkg-resources (75.2.0-1) ... Selecting previously unselected package python3-jaraco.text. Preparing to unpack .../49-python3-jaraco.text_4.0.0-1_all.deb ... Unpacking python3-jaraco.text (4.0.0-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../50-python3-zipp_3.21.0-1_all.deb ... Unpacking python3-zipp (3.21.0-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../51-python3-setuptools_75.2.0-1_all.deb ... Unpacking python3-setuptools (75.2.0-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../52-dh-python_6.20241024_all.deb ... Unpacking dh-python (6.20241024) ... Selecting previously unselected package libpython3.13-stdlib:arm64. Preparing to unpack .../53-libpython3.13-stdlib_3.13.0-2_arm64.deb ... Unpacking libpython3.13-stdlib:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13. Preparing to unpack .../54-python3.13_3.13.0-2_arm64.deb ... Unpacking python3.13 (3.13.0-2) ... Selecting previously unselected package python3-all. Preparing to unpack .../55-python3-all_3.12.7-1_arm64.deb ... Unpacking python3-all (3.12.7-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../56-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:arm64 (1.5.8-1) ... Setting up libkeyutils1:arm64 (1.6.3-4) ... Setting up libicu72:arm64 (72.1-5+b1) ... Setting up bsdextrautils (2.40.2-11) ... Setting up libmagic-mgc (1:5.45-3+b1) ... 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:arm64 (1:5.45-3+b1) ... Setting up gettext-base (0.22.5-2) ... Setting up m4 (1.4.19-4) ... Setting up libcom-err2:arm64 (1.47.1-1+b1) ... Setting up file (1:5.45-3+b1) ... Setting up libelf1t64:arm64 (0.192-4) ... Setting up libkrb5support0:arm64 (1.21.3-3) ... Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' Local time is now: Fri Nov 22 03:46:17 UTC 2024. Universal Time is now: Fri Nov 22 03:46:17 UTC 2024. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:arm64 (3.13.0-2) ... Setting up autotools-dev (20220109.1) ... Setting up libblas3:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/blas/libblas.so.3 to provide /usr/lib/aarch64-linux-gnu/libblas.so.3 (libblas.so.3-aarch64-linux-gnu) in auto mode Setting up autopoint (0.22.5-2) ... Setting up libk5crypto3:arm64 (1.21.3-3) ... Setting up libgfortran5:arm64 (14.2.0-8) ... Setting up autoconf (2.72-3) ... Setting up dwz (0.15-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:arm64 (0.0.8-1+b2) ... Setting up python3.13-minimal (3.13.0-2) ... Setting up netbase (6.4) ... Setting up libkrb5-3:arm64 (1.21.3-3) ... Setting up readline-common (8.2-5) ... Setting up libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+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:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/aarch64-linux-gnu/liblapack.so.3 (liblapack.so.3-aarch64-linux-gnu) in auto mode Setting up gettext (0.22.5-2) ... Setting up libtool (2.4.7-8) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Setting up libgssapi-krb5-2:arm64 (1.21.3-3) ... Setting up coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Setting up libreadline8t64:arm64 (8.2-5) ... Setting up dh-strip-nondeterminism (1.14.0-1) ... Setting up groff-base (1.23.0-5) ... Setting up libpython3.13-stdlib:arm64 (3.13.0-2) ... Setting up libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Setting up python3.13 (3.13.0-2) ... 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:arm64 (1.17.10+ds-1) ... Setting up libnsl2:arm64 (1.3.0-3+b3) ... Setting up coinor-libcgl1:arm64 (0.60.9+ds-1) ... Setting up libpython3.12-stdlib:arm64 (3.12.7-3) ... Setting up python3.12 (3.12.7-3) ... Setting up debhelper (13.20) ... Setting up coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Setting up libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3 (3.12.7-1) ... Setting up python3-zipp (3.21.0-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up coinor-cbc (2.10.12+ds-1) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up python3-more-itertools (10.5.0-1) ... Setting up python3-jaraco.functools (4.1.0-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-typeguard (4.4.1-1) ... Setting up python3-all (3.12.7-1) ... Setting up python3-inflect (7.3.1-2) ... Setting up python3-jaraco.text (4.0.0-1) ... Setting up python3-pkg-resources (75.2.0-1) ... Setting up python3-setuptools (75.2.0-1) ... Setting up dh-python (6.20241024) ... Processing triggers for libc-bin (2.40-3) ... 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: Running cd /build/reproducible-path/python-pulp-2.7.0+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../python-pulp_2.7.0+dfsg-4_source.changes 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 arm64 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.13 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running clean removing '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build' (and everything under it) 'build/bdist.linux-aarch64' does not exist -- can't clean it 'build/scripts-3.13' does not exist -- can't clean it I: pybuild base:311: python3.12 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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-aarch64' 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.13 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config I: pybuild base:311: python3.12 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config dh_auto_build -O--buildsystem=pybuild I: pybuild base:311: /usr/bin/python3.13 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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.13_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO 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.13_pulp/build/pulp copying pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir copying pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests I: pybuild base:311: /usr/bin/python3 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/sparse.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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt 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) 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.13_pulp/build 'examples' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples' 'examples/wedding_initial.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding_initial.py' 'examples/CGcolumnwise.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CGcolumnwise.py' 'examples/test2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test2.py' 'examples/SpongeRollProblem5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem5.py' 'examples/SpongeRollProblem6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem6.py' 'examples/WhiskasModel2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel2.py' 'examples/SpongeRollProblem2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem2.py' 'examples/furniture.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/furniture.py' 'examples/test6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test6.py' 'examples/BeerDistributionProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem.py' 'examples/CG.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CG.py' 'examples/wedding.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding.py' 'examples/SpongeRollProblem3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem3.py' 'examples/BeerDistributionProblemWarehouseExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemWarehouseExtension.py' 'examples/test3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test3.py' 'examples/Two_stage_Stochastic_GemstoneTools.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py' 'examples/AmericanSteelProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/AmericanSteelProblem.py' 'examples/test1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test1.py' 'examples/test5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test5.py' 'examples/BeerDistributionProblem_resolve.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem_resolve.py' 'examples/SpongeRollProblem1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem1.py' 'examples/Sudoku1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku1.py' 'examples/__init__.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/__init__.py' 'examples/WhiskasModel1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel1.py' 'examples/test4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test4.py' 'examples/Sudoku2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku2.py' 'examples/SpongeRollProblem4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem4.py' 'examples/test7.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test7.py' 'examples/ComputerPlantProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/ComputerPlantProblem.py' 'examples/BeerDistributionProblemCompetitorExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemCompetitorExtension.py' I: pybuild base:311: cd /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build; python3.13 -m unittest discover -v /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3b7024752a3542b69e68f0e0b17993db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b7024752a3542b69e68f0e0b17993db-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/779f914e57bc460d92c517831de40e13-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/779f914e57bc460d92c517831de40e13-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.04 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 9 iterations and 0 nodes (0.04 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: 9 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.05 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7624dfc79f8b424596919d392d920b35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7624dfc79f8b424596919d392d920b35-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.15 seconds) Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.82 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.058 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.001 seconds) MixedIntegerRounding2 was tried 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.83 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.80 (Wallclock seconds): 0.83 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1635 RHS At line 1856 BOUNDS At line 2067 ENDATA Problem MODEL has 220 rows, 210 columns and 780 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -134.966 - 0.00 seconds Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 781 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 22 integers unsatisfied sum - 6.42583 Cbc0038I Pass 1: suminf. 0.83366 (3) obj. -133.251 iterations 89 Cbc0038I Pass 2: suminf. 0.48842 (2) obj. -131.836 iterations 1 Cbc0038I Solution found of -127.15 Cbc0038I Before mini branch and bound, 186 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 7 columns Cbc0038I Mini branch and bound improved solution from -127.15 to -132.45 (0.03 seconds) Cbc0038I Round again with cutoff of -132.75 Cbc0038I Reduced cost fixing fixed 19 variables on major pass 2 Cbc0038I Pass 3: suminf. 0.83366 (3) obj. -133.251 iterations 0 Cbc0038I Pass 4: suminf. 0.60514 (3) obj. -132.75 iterations 4 Cbc0038I Pass 5: suminf. 0.63773 (3) obj. -132.75 iterations 30 Cbc0038I Pass 6: suminf. 0.61397 (3) obj. -132.75 iterations 4 Cbc0038I Pass 7: suminf. 0.44383 (2) obj. -132.81 iterations 34 Cbc0038I Pass 8: suminf. 0.42821 (2) obj. -132.75 iterations 5 Cbc0038I Pass 9: suminf. 0.61166 (2) obj. -132.75 iterations 30 Cbc0038I Pass 10: suminf. 0.09859 (1) obj. -133.194 iterations 31 Cbc0038I Pass 11: suminf. 0.24194 (1) obj. -132.75 iterations 11 Cbc0038I Pass 12: suminf. 1.04715 (4) obj. -132.75 iterations 72 Cbc0038I Pass 13: suminf. 0.78445 (3) obj. -132.75 iterations 84 Cbc0038I Pass 14: suminf. 0.92284 (3) obj. -132.75 iterations 63 Cbc0038I Pass 15: suminf. 0.92284 (3) obj. -132.75 iterations 2 Cbc0038I Pass 16: suminf. 0.91711 (3) obj. -132.75 iterations 65 Cbc0038I Pass 17: suminf. 1.24080 (4) obj. -132.75 iterations 58 Cbc0038I Pass 18: suminf. 0.66611 (3) obj. -132.75 iterations 78 Cbc0038I Pass 19: suminf. 0.75401 (3) obj. -132.75 iterations 30 Cbc0038I Pass 20: suminf. 0.73025 (3) obj. -132.75 iterations 4 Cbc0038I Pass 21: suminf. 0.74552 (3) obj. -132.75 iterations 28 Cbc0038I Pass 22: suminf. 0.53527 (3) obj. -132.75 iterations 94 Cbc0038I Pass 23: suminf. 0.73025 (3) obj. -132.75 iterations 63 Cbc0038I Pass 24: suminf. 0.95457 (4) obj. -132.75 iterations 44 Cbc0038I Pass 25: suminf. 0.93934 (4) obj. -132.75 iterations 8 Cbc0038I Pass 26: suminf. 0.90755 (3) obj. -132.75 iterations 101 Cbc0038I Pass 27: suminf. 0.90755 (3) obj. -132.75 iterations 4 Cbc0038I Pass 28: suminf. 0.33121 (3) obj. -132.75 iterations 76 Cbc0038I Pass 29: suminf. 0.33121 (3) obj. -132.75 iterations 2 Cbc0038I Pass 30: suminf. 1.03450 (3) obj. -132.75 iterations 64 Cbc0038I Pass 31: suminf. 0.48626 (3) obj. -132.75 iterations 33 Cbc0038I Pass 32: suminf. 0.57265 (3) obj. -132.75 iterations 27 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 175 integers at bound fixed and 0 continuous Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 12 columns Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -132.45 - took 0.04 seconds Cbc0012I Integer solution of -132.45 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 5 columns Cbc0012I Integer solution of -132.7 found by DiveCoefficient after 9 iterations and 0 nodes (0.07 seconds) Cbc0031I 4 added rows had average density of 7 Cbc0013I At root node, 4 cuts changed objective from -134.96566 to -132.7 in 3 passes Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 10.0 elements, 7 column cuts (7 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) - 3 row cuts average 6.7 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) - 6 row cuts average 7.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 7 (ZeroHalf) - 2 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective -132.7, took 9 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 20 variables fixed on reduced cost Cuts at root node changed objective from -134.966 to -132.7 Probing was tried 3 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 3 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 6 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -132.70000000 Enumerated nodes: 0 Total iterations: 9 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/bcd86eb39bd04cd68ce02f08b049e09d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcd86eb39bd04cd68ce02f08b049e09d-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 Cbc0038I Initial state - 3 integers unsatisfied sum - 1.13548 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 73.5 iterations 3 Cbc0038I Solution found of 73.5 Cbc0038I Relaxing continuous gives 73.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 5 columns Cbc0038I Mini branch and bound improved solution from 73.5 to 60.5 (0.01 seconds) Cbc0038I Round again with cutoff of 54.45 Cbc0038I Pass 2: suminf. 0.11272 (1) obj. 54.45 iterations 1 Cbc0038I Pass 3: suminf. 0.37992 (2) obj. 54.45 iterations 4 Cbc0038I Pass 4: suminf. 0.37331 (3) obj. 54.45 iterations 4 Cbc0038I Pass 5: suminf. 0.29454 (1) obj. 54.45 iterations 4 Cbc0038I Pass 6: suminf. 0.39345 (1) obj. 54.45 iterations 3 Cbc0038I Pass 7: suminf. 0.25035 (1) obj. 54.45 iterations 2 Cbc0038I Pass 8: suminf. 0.23625 (2) obj. 54.45 iterations 6 Cbc0038I Pass 9: suminf. 0.34502 (2) obj. 54.45 iterations 3 Cbc0038I Pass 10: suminf. 0.23625 (2) obj. 54.45 iterations 2 Cbc0038I Pass 11: suminf. 1.05750 (3) obj. 54.45 iterations 7 Cbc0038I Pass 12: suminf. 0.52585 (2) obj. 54.45 iterations 2 Cbc0038I Pass 13: suminf. 0.03237 (1) obj. 54.45 iterations 4 Cbc0038I Pass 14: suminf. 0.50626 (2) obj. 54.45 iterations 4 Cbc0038I Pass 15: suminf. 0.46754 (2) obj. 54.45 iterations 5 Cbc0038I Pass 16: suminf. 0.22550 (1) obj. 54.45 iterations 4 Cbc0038I Pass 17: suminf. 0.22562 (2) obj. 54.45 iterations 4 Cbc0038I Pass 18: suminf. 0.42671 (2) obj. 54.45 iterations 3 Cbc0038I Pass 19: suminf. 0.14661 (1) obj. 54.45 iterations 2 Cbc0038I Pass 20: suminf. 0.46446 (1) obj. 54.45 iterations 3 Cbc0038I Pass 21: suminf. 0.46394 (2) obj. 54.45 iterations 3 Cbc0038I Pass 22: suminf. 0.31979 (1) obj. 54.45 iterations 3 Cbc0038I Pass 23: suminf. 0.46141 (1) obj. 54.45 iterations 2 Cbc0038I Pass 24: suminf. 0.46159 (2) obj. 54.45 iterations 9 Cbc0038I Pass 25: suminf. 0.64270 (3) obj. 54.45 iterations 3 Cbc0038I Pass 26: suminf. 0.65055 (2) obj. 54.45 iterations 6 Cbc0038I Pass 27: suminf. 0.00000 (0) obj. 54.45 iterations 2 Cbc0038I Solution found of 54.45 Cbc0038I Relaxing continuous gives 49.5 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 49.5 to 8.5 (0.02 seconds) Cbc0038I Round again with cutoff of 6.79999 Cbc0038I Pass 28: suminf. 0.55893 (2) obj. 6.79999 iterations 1 Cbc0038I Pass 29: suminf. 0.72720 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 30: suminf. 0.65402 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 31: suminf. 0.96879 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 32: suminf. 0.56864 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 33: suminf. 1.02816 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 34: suminf. 0.72462 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 35: suminf. 0.39468 (2) obj. 6.79999 iterations 6 Cbc0038I Pass 36: suminf. 0.69176 (2) obj. 6.79999 iterations 5 Cbc0038I Pass 37: suminf. 0.64807 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 38: suminf. 0.64657 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 39: suminf. 0.64657 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 40: suminf. 0.85388 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 41: suminf. 0.69811 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 42: suminf. 1.12985 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 43: suminf. 0.52410 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 44: suminf. 0.21566 (2) obj. 6.79999 iterations 3 Cbc0038I Pass 45: suminf. 0.85968 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 46: suminf. 0.41789 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 47: suminf. 0.65140 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 48: suminf. 0.54313 (3) obj. 6.79999 iterations 1 Cbc0038I Pass 49: suminf. 1.13535 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 50: suminf. 0.59074 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 51: suminf. 0.76947 (2) obj. 6.79999 iterations 2 Cbc0038I Pass 52: suminf. 0.87409 (3) obj. 6.79999 iterations 5 Cbc0038I Pass 53: suminf. 0.77689 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 54: suminf. 0.87409 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 55: suminf. 0.67975 (3) obj. 6.79999 iterations 6 Cbc0038I Pass 56: suminf. 0.67975 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 57: suminf. 0.94944 (3) obj. 6.79999 iterations 6 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 8.5 - took 0.03 seconds Cbc0012I Integer solution of 8.5 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0031I 5 added rows had average density of 15.8 Cbc0013I At root node, 5 cuts changed objective from 0 to 0.5 in 100 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (6 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 615 row cuts average 25.7 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 395 row cuts average 11.9 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 569 row cuts average 18.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 69 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 502 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 8.5 best solution, best possible 0.5 (0.14 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 19 columns Cbc0004I Integer solution of 6.5 found after 7147 iterations and 159 nodes (0.38 seconds) Cbc0004I Integer solution of 4.5 found after 7621 iterations and 169 nodes (0.39 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 Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0012I Integer solution of 3.5 found by DiveCoefficient after 25261 iterations and 523 nodes (0.93 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0010I After 1000 nodes, 3 on tree, 3.5 best solution, best possible 0.5 (1.59 seconds) Cbc0001I Search completed - best objective 3.5, took 104343 iterations and 6110 nodes (2.91 seconds) Cbc0032I Strong branching done 13820 times (70997 iterations), fathomed 74 nodes and fixed 504 variables Cbc0041I Maximum depth 12, 1194 variables fixed on reduced cost (complete fathoming 347 times, 4212 nodes taking 15962 iterations) Cuts at root node changed objective from 0 to 0.5 Probing was tried 100 times and created 2 cuts of which 5 were active after adding rounds of cuts (0.003 seconds) Gomory was tried 5453 times and created 21098 cuts of which 0 were active after adding rounds of cuts (0.278 seconds) Knapsack was tried 5456 times and created 12707 cuts of which 0 were active after adding rounds of cuts (0.484 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 5456 times and created 26211 cuts of which 0 were active after adding rounds of cuts (0.308 seconds) FlowCover was tried 100 times and created 69 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 5453 times and created 16424 cuts of which 0 were active after adding rounds of cuts (0.169 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 3.50000000 Enumerated nodes: 6110 Total iterations: 104343 Time (CPU seconds): 2.84 Time (Wallclock seconds): 2.92 Option for printingOptions changed from normal to all Total time (CPU seconds): 2.84 (Wallclock seconds): 2.92 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/90061b971f6d40f095d6e45caa07ac21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90061b971f6d40f095d6e45caa07ac21-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ffabd6ea41824531bb89b88ed6677f75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffabd6ea41824531bb89b88ed6677f75-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.13_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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2530a16774fc408ea70f8ab62a84f5f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2530a16774fc408ea70f8ab62a84f5f7-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 14 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/aada24fce3294bf8a3a79cd98467c267-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aada24fce3294bf8a3a79cd98467c267-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3345af0068634c889fcfd510a7e5f877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3345af0068634c889fcfd510a7e5f877-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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cf23d7698d904c179ffd6315b0f714c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf23d7698d904c179ffd6315b0f714c9-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/328392d437484d6d902feefba39c660f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/328392d437484d6d902feefba39c660f-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, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/907c223330a64878a7fc58750b0ae5fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/907c223330a64878a7fc58750b0ae5fa-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d7fff2cf58be4117a59c69097a44205e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7fff2cf58be4117a59c69097a44205e-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/90bb325226b74ac4b36d69f0564cb4c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90bb325226b74ac4b36d69f0564cb4c1-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dc6383586fb0462f90165f0c45839b7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc6383586fb0462f90165f0c45839b7a-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 Time (Wallclock seconds): 0.08 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2974c407efd744d6b9205bab6b9c1014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2974c407efd744d6b9205bab6b9c1014-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ac34bc61df914f93b6fe82df2a183b0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac34bc61df914f93b6fe82df2a183b0f-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f25457a716bc4d7290391e764dcf16fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f25457a716bc4d7290391e764dcf16fb-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/96a1bc0102cc445da6fa0ff9d0d85344-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96a1bc0102cc445da6fa0ff9d0d85344-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c2fe0db21d624b19b22ec277d257c4f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2fe0db21d624b19b22ec277d257c4f4-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.07 seconds) Cbc0038I After 0.07 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.07 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d76e592f967c45ee96d3bca6ed62fb10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d76e592f967c45ee96d3bca6ed62fb10-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/07c29f963c0e4a08b0f02ee0432d3992-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07c29f963c0e4a08b0f02ee0432d3992-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/96720283dbe44999bfaea0141823ce97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96720283dbe44999bfaea0141823ce97-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/036bec5ca2754ed6bf6108c533de14a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/036bec5ca2754ed6bf6108c533de14a8-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/46246ce0d7074b31b084ec2f1d4144bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46246ce0d7074b31b084ec2f1d4144bd-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a4508484106f493d9480033817768d26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4508484106f493d9480033817768d26-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6be8a1e460484c1098fbde8719d7abbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6be8a1e460484c1098fbde8719d7abbb-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3090527010f14b39889274948f058787-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3090527010f14b39889274948f058787-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dd873f00868f4148bb023f25a19525e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd873f00868f4148bb023f25a19525e4-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fe0bb2cba32d4521aa461b3593614957-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe0bb2cba32d4521aa461b3593614957-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9aaf392989174166a2532bfe1297a3c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9aaf392989174166a2532bfe1297a3c1-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.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 0.0 x_5 = 0.0 x_6 = 1.0 x_7 = 1.0 x_8 = 1.0 x_9 = 0.0 Status: Optimal s_0 = 1.0 s_1 = 0.0 s_2 = 0.0 w_0 = 0.0 w_1 = 1.0 w_2 = 1.5 x_0 = 1.0 x_1 = 0.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 1.0 x_14 = 1.0 x_15 = 1.0 x_16 = 1.0 x_17 = 1.0 x_18 = 0.0 x_19 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 0.0 x_6 = 0.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 3.5 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 item passed all tests: 8 tests in pulp 8 tests in 1 item. 8 passed. Test passed. Status: Optimal 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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/482b986519254a999b5623cd11b4a9cd-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/482b986519254a999b5623cd11b4a9cd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/93d15466fe2041c2984ed86e356778be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93d15466fe2041c2984ed86e356778be-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 72 RHS At line 81 BOUNDS At line 94 ENDATA Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/26d2d82d4cda4d87ba307aed0164a8a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26d2d82d4cda4d87ba307aed0164a8a4-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 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.07 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 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.06 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7e4cdf1f36864268ab24f1d3f318ec15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e4cdf1f36864268ab24f1d3f318ec15-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/17328d62811c41c083026fddb76921b5-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/17328d62811c41c083026fddb76921b5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5750027555e046e3b5f589a5d988186d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5750027555e046e3b5f589a5d988186d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/53ef67ce115448cea35026c9a046fff6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53ef67ce115448cea35026c9a046fff6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c14459c8cd614fdab0e7ab7a799534da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c14459c8cd614fdab0e7ab7a799534da-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d078ed130019448ea3e206d582be46d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d078ed130019448ea3e206d582be46d7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6d2ce629d8d14e2a94c83d4321784454-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d2ce629d8d14e2a94c83d4321784454-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4a895427f0ea49a4a7bc3c272de404f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a895427f0ea49a4a7bc3c272de404f8-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.01 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4da9a00ff06948909aa181d99921d415-pulp.mps mips /tmp/4da9a00ff06948909aa181d99921d415-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/4da9a00ff06948909aa181d99921d415-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/4da9a00ff06948909aa181d99921d415-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.06 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 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.13_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.13_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.13_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 27.113s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13_pulp/build/examples /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/*.lp 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b9c404466b2f419386657fb4dbf8dfc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9c404466b2f419386657fb4dbf8dfc4-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7453983c13644fa8be8f6dbd3e043f87-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7453983c13644fa8be8f6dbd3e043f87-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) 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 9 iterations and 0 nodes (0.05 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: 9 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f52d7582d5174f82a139dc382cb634c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f52d7582d5174f82a139dc382cb634c7-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.16 seconds) Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.15 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.81 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.036 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.82 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.80 (Wallclock seconds): 0.82 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1653 RHS At line 1874 BOUNDS At line 2085 ENDATA Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -140.072 - 0.00 seconds Cgl0004I processed model has 185 rows, 178 columns (178 integer (178 of which binary)) and 674 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 21 integers unsatisfied sum - 6.87096 Cbc0038I Solution found of -137.95 Cbc0038I Before mini branch and bound, 157 integers at bound fixed and 0 continuous Cbc0038I Full problem 185 rows 178 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound improved solution from -137.95 to -139.2 (0.02 seconds) Cbc0038I Round again with cutoff of -139.35 Cbc0038I Reduced cost fixing fixed 48 variables on major pass 2 Cbc0038I Pass 1: suminf. 0.45672 (2) obj. -139.35 iterations 96 Cbc0038I Pass 2: suminf. 0.06818 (1) obj. -139.35 iterations 38 Cbc0038I Pass 3: suminf. 0.20896 (1) obj. -139.66 iterations 12 Cbc0038I Pass 4: suminf. 0.81382 (3) obj. -139.35 iterations 48 Cbc0038I Pass 5: suminf. 0.51000 (2) obj. -139.35 iterations 88 Cbc0038I Pass 6: suminf. 0.81947 (2) obj. -139.35 iterations 52 Cbc0038I Pass 7: suminf. 0.77692 (3) obj. -139.35 iterations 26 Cbc0038I Pass 8: suminf. 0.79808 (2) obj. -139.35 iterations 20 Cbc0038I Pass 9: suminf. 0.79808 (2) obj. -139.35 iterations 2 Cbc0038I Pass 10: suminf. 0.73123 (3) obj. -139.35 iterations 28 Cbc0038I Pass 11: suminf. 0.52119 (2) obj. -139.35 iterations 22 Cbc0038I Pass 12: suminf. 0.85382 (3) obj. -139.35 iterations 18 Cbc0038I Pass 13: suminf. 0.85382 (3) obj. -139.35 iterations 1 Cbc0038I Pass 14: suminf. 0.21393 (2) obj. -139.35 iterations 68 Cbc0038I Pass 15: suminf. 0.20455 (1) obj. -139.35 iterations 26 Cbc0038I Pass 16: suminf. 0.20896 (1) obj. -139.36 iterations 15 Cbc0038I Pass 17: suminf. 0.51234 (3) obj. -139.35 iterations 43 Cbc0038I Pass 18: suminf. 0.72046 (3) obj. -139.35 iterations 5 Cbc0038I Pass 19: suminf. 0.20455 (1) obj. -139.35 iterations 69 Cbc0038I Pass 20: suminf. 0.20896 (1) obj. -139.36 iterations 25 Cbc0038I Pass 21: suminf. 1.26878 (20) obj. -139.35 iterations 55 Cbc0038I Pass 22: suminf. 0.66525 (3) obj. -139.35 iterations 1 Cbc0038I Pass 23: suminf. 0.86629 (3) obj. -139.35 iterations 2 Cbc0038I Pass 24: suminf. 0.59248 (2) obj. -139.35 iterations 77 Cbc0038I Pass 25: suminf. 0.61424 (2) obj. -139.35 iterations 33 Cbc0038I Pass 26: suminf. 0.61424 (2) obj. -139.35 iterations 1 Cbc0038I Pass 27: suminf. 0.64646 (2) obj. -139.416 iterations 25 Cbc0038I Pass 28: suminf. 1.02759 (3) obj. -139.35 iterations 48 Cbc0038I Pass 29: suminf. 0.73974 (3) obj. -139.35 iterations 9 Cbc0038I Pass 30: suminf. 0.73974 (3) obj. -139.35 iterations 1 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 146 integers at bound fixed and 0 continuous Cbc0038I Full problem 185 rows 178 columns, reduced to 2 rows 6 columns Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -139.2 - took 0.04 seconds Cbc0012I Integer solution of -139.2 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0031I 9 added rows had average density of 8.7777778 Cbc0013I At root node, 13 cuts changed objective from -140.07186 to -139.2 in 2 passes Cbc0014I Cut generator 0 (Probing) - 10 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 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) - 9 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.001 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) - 17 row cuts average 17.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 4 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective -139.2, took 21 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 64 variables fixed on reduced cost Cuts at root node changed objective from -140.072 to -139.2 Probing was tried 2 times and created 10 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 9 cuts of which 0 were active after adding rounds of cuts (0.001 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 2 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 2 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -139.20000000 Enumerated nodes: 0 Total iterations: 21 Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4e102e63c00f4c919432840ac657f534-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e102e63c00f4c919432840ac657f534-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 120 RHS At line 124 BOUNDS At line 145 ENDATA Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 3 integers unsatisfied sum - 0.973263 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 153 iterations 3 Cbc0038I Solution found of 153 Cbc0038I Relaxing continuous gives 153 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 136.8 Cbc0038I Pass 2: suminf. 0.07232 (1) obj. 136.8 iterations 1 Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 136.8 iterations 3 Cbc0038I Solution found of 136.8 Cbc0038I Relaxing continuous gives 71 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns Cbc0038I Mini branch and bound improved solution from 71 to 52 (0.01 seconds) Cbc0038I Round again with cutoff of 40.8001 Cbc0038I Pass 4: suminf. 0.50970 (2) obj. 40.8001 iterations 1 Cbc0038I Pass 5: suminf. 0.61767 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 6: suminf. 0.24695 (2) obj. 40.8001 iterations 2 Cbc0038I Pass 7: suminf. 0.76286 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 8: suminf. 0.40951 (2) obj. 40.8001 iterations 3 Cbc0038I Pass 9: suminf. 0.81284 (2) obj. 40.8001 iterations 6 Cbc0038I Pass 10: suminf. 0.00000 (0) obj. 40.8001 iterations 2 Cbc0038I Solution found of 40.8001 Cbc0038I Relaxing continuous gives 27 Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns Cbc0038I Mini branch and bound improved solution from 27 to 23 (0.01 seconds) Cbc0038I Round again with cutoff of 15.4001 Cbc0038I Pass 11: suminf. 0.63835 (2) obj. 15.4001 iterations 0 Cbc0038I Pass 12: suminf. 1.07479 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 13: suminf. 0.35410 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 14: suminf. 0.84974 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 15: suminf. 0.37676 (3) obj. 15.4001 iterations 2 Cbc0038I Pass 16: suminf. 0.28454 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 17: suminf. 0.28454 (1) obj. 15.4001 iterations 0 Cbc0038I Pass 18: suminf. 0.50016 (2) obj. 15.4001 iterations 10 Cbc0038I Pass 19: suminf. 0.03378 (1) obj. 15.4001 iterations 2 Cbc0038I Pass 20: suminf. 0.17067 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 21: suminf. 1.01300 (3) obj. 15.4001 iterations 10 Cbc0038I Pass 22: suminf. 1.01300 (3) obj. 15.4001 iterations 0 Cbc0038I Pass 23: suminf. 0.55390 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 24: suminf. 0.22133 (2) obj. 15.4001 iterations 4 Cbc0038I Pass 25: suminf. 0.39196 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 26: suminf. 0.53592 (3) obj. 15.4001 iterations 6 Cbc0038I Pass 27: suminf. 0.41061 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 28: suminf. 0.16808 (1) obj. 15.4001 iterations 3 Cbc0038I Pass 29: suminf. 0.48799 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 30: suminf. 0.75659 (3) obj. 15.4001 iterations 7 Cbc0038I Pass 31: suminf. 0.62667 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 32: suminf. 0.64381 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 33: suminf. 0.32040 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 34: suminf. 0.75330 (3) obj. 15.4001 iterations 4 Cbc0038I Pass 35: suminf. 0.42295 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 36: suminf. 0.63247 (2) obj. 15.4001 iterations 2 Cbc0038I Pass 37: suminf. 0.96282 (3) obj. 15.4001 iterations 7 Cbc0038I Pass 38: suminf. 0.23075 (2) obj. 15.4001 iterations 3 Cbc0038I Pass 39: suminf. 0.83585 (3) obj. 15.4001 iterations 3 Cbc0038I Pass 40: suminf. 0.70075 (3) obj. 15.4001 iterations 5 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns Cbc0038I Mini branch and bound improved solution from 23 to 5 (0.03 seconds) Cbc0038I Round again with cutoff of 2.80007 Cbc0038I Pass 40: suminf. 0.72303 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 41: suminf. 0.40721 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 42: suminf. 0.18115 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 43: suminf. 0.70597 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 44: suminf. 0.45692 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 45: suminf. 0.97612 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 46: suminf. 0.59208 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 47: suminf. 0.87356 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 48: suminf. 0.76850 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 49: suminf. 0.87136 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 50: suminf. 0.26915 (2) obj. 2.80007 iterations 8 Cbc0038I Pass 51: suminf. 0.13346 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 52: suminf. 0.24341 (3) obj. 2.80007 iterations 2 Cbc0038I Pass 53: suminf. 0.64162 (3) obj. 2.80007 iterations 8 Cbc0038I Pass 54: suminf. 0.64162 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 55: suminf. 0.75064 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 56: suminf. 0.35312 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 57: suminf. 0.90927 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 58: suminf. 0.74218 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 59: suminf. 1.09430 (3) obj. 2.80007 iterations 5 Cbc0038I Pass 60: suminf. 1.09430 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 61: suminf. 1.02717 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 62: suminf. 0.72162 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 63: suminf. 0.73585 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 64: suminf. 0.63751 (3) obj. 2.80007 iterations 3 Cbc0038I Pass 65: suminf. 0.27083 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 66: suminf. 0.07790 (2) obj. 2.80007 iterations 4 Cbc0038I Pass 67: suminf. 0.81315 (3) obj. 2.80007 iterations 4 Cbc0038I Pass 68: suminf. 0.81315 (3) obj. 2.80007 iterations 0 Cbc0038I Pass 69: suminf. 0.08820 (3) obj. 2.80007 iterations 4 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 did not improve solution (0.05 seconds) Cbc0038I After 0.05 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.05 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0031I 5 added rows had average density of 20 Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 575 row cuts average 25.8 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 697 row cuts average 11.2 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) - 508 row cuts average 19.1 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 124 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 333 row cuts average 18.8 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.16 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0004I Integer solution of 1 found after 1594 iterations and 118 nodes (0.20 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 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 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns Cbc0010I After 1000 nodes, 5 on tree, 1 best solution, best possible 0 (0.43 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0001I Search completed - best objective 1, took 19173 iterations and 6290 nodes (0.67 seconds) Cbc0032I Strong branching done 9294 times (23648 iterations), fathomed 475 nodes and fixed 549 variables Cbc0041I Maximum depth 13, 64 variables fixed on reduced cost (complete fathoming 370 times, 4420 nodes taking 9476 iterations) Cuts at root node changed objective from 0 to 0 Probing was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Gomory was tried 100 times and created 575 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) Knapsack was tried 100 times and created 697 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 508 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) FlowCover was tried 100 times and created 124 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) TwoMirCuts was tried 100 times and created 333 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.00000000 Enumerated nodes: 6290 Total iterations: 19173 Time (CPU seconds): 0.66 Time (Wallclock seconds): 0.68 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.66 (Wallclock seconds): 0.68 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b29f1c439cb242bbbfe82217ba7af284-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b29f1c439cb242bbbfe82217ba7af284-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/aaaaf5c1006446f7b8111958c6801b64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaaaf5c1006446f7b8111958c6801b64-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/955983a23f3546f6b944872d7ed48449-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/955983a23f3546f6b944872d7ed48449-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 14 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c8e8e421d72c46989512d750b8db77e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8e8e421d72c46989512d750b8db77e1-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/eb85efe495d54e58a48f2886726abc0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb85efe495d54e58a48f2886726abc0f-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.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.02 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/39e4c772623443619718cf6d3215e0f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39e4c772623443619718cf6d3215e0f8-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0ec3036276fc4213a3a5070e20c8b2f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ec3036276fc4213a3a5070e20c8b2f9-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3da5882cb7f84ce1836312daca4625d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3da5882cb7f84ce1836312daca4625d3-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.01 seconds Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5f17a00eedfa4c74a726f773d1cce9cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f17a00eedfa4c74a726f773d1cce9cf-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b3d92acbd4884226902fa1dc0275112f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3d92acbd4884226902fa1dc0275112f-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/bd9175baddcd42a180b4878784c84b04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd9175baddcd42a180b4878784c84b04-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/03496577738547dba976c10fd63697d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03496577738547dba976c10fd63697d1-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0cd4c06c8a7342639cead5790e5455a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cd4c06c8a7342639cead5790e5455a2-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/372cfbb20fca44b399fa838208922e93-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/372cfbb20fca44b399fa838208922e93-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/40da0198cbcc4509b3d453fe113b4e87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40da0198cbcc4509b3d453fe113b4e87-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8ddf88c2252a405ab57536adba9378ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ddf88c2252a405ab57536adba9378ea-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4ffcab2d7f19486aababb5d3b0f13791-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ffcab2d7f19486aababb5d3b0f13791-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.06 seconds) Cbc0038I After 0.06 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.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 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.06 Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e3b478b6856a40948324f89156e93b8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3b478b6856a40948324f89156e93b8a-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/84f427ba96504f3094f5829060cd2165-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84f427ba96504f3094f5829060cd2165-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b353139065224feeb04d0e9b03339825-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b353139065224feeb04d0e9b03339825-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/12b2291772494428a29bc32cfa56ea4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12b2291772494428a29bc32cfa56ea4d-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3f74ff23371a4859a9aa01d186672cec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f74ff23371a4859a9aa01d186672cec-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e9fbf70c152244c881136905f984c0a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9fbf70c152244c881136905f984c0a3-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8690 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8690 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8690, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8690 to 8690 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8690.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/30ad2dce94254e4ba4cb4720362864e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30ad2dce94254e4ba4cb4720362864e8-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a454510deaf5456083df70aeb8c3a349-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a454510deaf5456083df70aeb8c3a349-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/18578bf2ebe74786bcc2523b6e247ec0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18578bf2ebe74786bcc2523b6e247ec0-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2912eae5fcd044d58d22aecc5ec04627-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2912eae5fcd044d58d22aecc5ec04627-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fb57ad9fade64a6692fbdfde12688da8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb57ad9fade64a6692fbdfde12688da8-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.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/82210abdfec04e99a572af17c2f3e01b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82210abdfec04e99a572af17c2f3e01b-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/88e4853b8b1f471bb4e29d5408f02798-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88e4853b8b1f471bb4e29d5408f02798-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-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.01 (Wallclock seconds): 0.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 1.0 x_8 = 0.0 x_9 = 0.0 Status: Optimal s_0 = 0.0 s_1 = 0.0 s_2 = 0.0 w_0 = 0.0 w_1 = 1.0 w_2 = 0.0 x_0 = 1.0 x_1 = 1.0 x_10 = 1.0 x_11 = 1.0 x_12 = 1.0 x_13 = 0.0 x_14 = 1.0 x_15 = 1.0 x_16 = 0.0 x_17 = 0.0 x_18 = 1.0 x_19 = 1.0 x_2 = 0.0 x_3 = 0.0 x_4 = 0.0 x_5 = 0.0 x_6 = 0.0 x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 objective= 1.0 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 items passed all tests: 8 tests in pulp 8 tests in 1 items. 8 passed and 0 failed. Test passed. Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c202a6d9cb8d403a858f2c868192fdfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c202a6d9cb8d403a858f2c868192fdfd-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.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/2f7f7fa204534309a8612b2af81fe6c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f7f7fa204534309a8612b2af81fe6c5-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 12 to 12 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/97b414047073428490114d7a88cf72db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97b414047073428490114d7a88cf72db-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ff1b869af34f48708b97635ad33916d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff1b869af34f48708b97635ad33916d9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5bf3ef66608943e892553b41536064bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bf3ef66608943e892553b41536064bd-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cdb860c0da454c88a60f0fe935950792-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdb860c0da454c88a60f0fe935950792-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a6ec013fb03a4bc690594407fc2976d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6ec013fb03a4bc690594407fc2976d5-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/925f730714764a1b9e166853af805853-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/925f730714764a1b9e166853af805853-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.01 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mps mips /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-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/fbc4b6c8b4944ac586730fc7abdb4fcb-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 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 27.404s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13 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:261: 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/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc /usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt running install_scripts Installing pulptest script to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/bin 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:261: 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/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/run_tests.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_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/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir 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__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/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__/__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/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/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/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/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/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/__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/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.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/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/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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc /usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/highs_api.py to highs_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/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/coin_api.py to coin_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/constants.py to constants.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/pulp.py to pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt 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_arm64.buildinfo dpkg-genchanges --build=binary -O../python-pulp_2.7.0+dfsg-4_arm64.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: 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/2878175 and its subdirectories I: Current time: Thu Nov 21 15:47:40 -12 2024 I: pbuilder-time-stamp: 1732247260 Fri Nov 22 03:47:42 UTC 2024 I: 1st build successful. Starting 2nd build on remote node codethink03-arm64.debian.net. Fri Nov 22 03:47:42 UTC 2024 I: Preparing to do remote build '2' on codethink03-arm64.debian.net. Fri Nov 22 03:47:42 UTC 2024 - checking /var/lib/jenkins/offline_nodes if codethink03-arm64.debian.net is marked as down. Fri Nov 22 03:47:42 UTC 2024 - checking via ssh if codethink03-arm64.debian.net is up. removed '/tmp/read-only-fs-test-7MsOj5' ==================================================================================== Thu Dec 25 10:10:43 UTC 2025 - running /srv/jenkins/bin/reproducible_build.sh (for job /srv/jenkins/bin/reproducible_build.sh) on codethink03-arm64, called using "2 python-pulp unstable /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV 2.7.0+dfsg-4" as arguments. Thu Dec 25 10:10:43 UTC 2025 - actually running "reproducible_build.sh" (md5sum 68e686e434c9ab7bc3ec047d8b309cbc) as "/tmp/jenkins-script-yvsyLV5H" $ git clone https://salsa.debian.org/qa/jenkins.debian.net.git ; more CONTRIBUTING Thu Dec 25 10:10:43 UTC 2025 I: Downloading source for unstable/python-pulp=2.7.0+dfsg-4 Reading package lists... NOTICE: 'python-pulp' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/math-team/python-pulp.git Please use: git clone https://salsa.debian.org/math-team/python-pulp.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 12.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (dsc) [1595 B] Get:2 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (tar) [12.1 MB] Get:3 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (diff) [13.5 kB] Fetched 12.1 MB in 0s (109 MB/s) Download complete and in download only mode Reading package lists... NOTICE: 'python-pulp' packaging is maintained in the 'Git' version control system at: https://salsa.debian.org/math-team/python-pulp.git Please use: git clone https://salsa.debian.org/math-team/python-pulp.git to retrieve the latest (possibly unreleased) updates to the package. Need to get 12.1 MB of source archives. Get:1 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (dsc) [1595 B] Get:2 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (tar) [12.1 MB] Get:3 http://deb.debian.org/debian unstable/main python-pulp 2.7.0+dfsg-4 (diff) [13.5 kB] Fetched 12.1 MB in 0s (109 MB/s) Download complete and in download only mode ============================================================================= Re-Building python-pulp in unstable on arm64 on codethink03-arm64 now. Date: Thu Dec 25 10:10:44 GMT 2025 Date UTC: Thu Dec 25 10:10:44 UTC 2025 ============================================================================= ++ mktemp -t pbuilderrc_XXXX --tmpdir=/srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV + local TMPCFG=/srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/pbuilderrc_J1ON + case ${ARCH} in + case $ARCH in + locale=nl_BE + language=nl + case "${SUITE}" in + reproducible_buildflags=+all + extra_deb_build_options= + case "${SRCPACKAGE}" in + cat + echo BUILDDIR=/build/reproducible-path + '[' python-pulp = debian-installer -o python-pulp = debian-installer-netboot-images ']' + pbuilder_options=() + local pbuilder_options + DEBBUILDOPTS=-b + BINARYTARGET= + '[' python-pulp = u-boot ']' + case "${SRCPACKAGE}" in + PBUILDERTIMEOUT=24 + local PRESULT=0 + sudo 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.f7vAQdqV/pbuilderrc_J1ON --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.f7vAQdqV/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc W: /root/.pbuilderrc does not exist I: Logging to b2/build.log I: pbuilder: network access will be disabled during build I: Current time: Fri Dec 26 00:10:44 +14 2025 I: pbuilder-time-stamp: 1766657444 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: 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/4109425/tmp/hooks/D01_modify_environment starting debug: Running on codethink03-arm64. I: Changing host+domainname to test build reproducibility I: Adding a custom variable just for the fun of it... I: Changing /bin/sh to bash '/bin/sh' -> '/bin/bash' lrwxrwxrwx 1 root root 9 Dec 25 10:10 /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/4109425/tmp/hooks/D01_modify_environment finished I: user script /srv/workspace/pbuilder/4109425/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]="aarch64-unknown-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=arm64 DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' DIRSTACK=() DISTRIBUTION=unstable EUID=0 FUNCNAME=([0]="Echo" [1]="main") GROUPS=() HOME=/root HOSTNAME=i-capture-the-hostname HOSTTYPE=aarch64 HOST_ARCH=arm64 IFS=' ' INVOCATION_ID=355203635c5141e7b9dd3801829b1ed7 LANG=C LANGUAGE=nl_BE:nl LC_ALL=C MACHTYPE=aarch64-unknown-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=4109425 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.f7vAQdqV/pbuilderrc_J1ON --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.f7vAQdqV/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' SUDO_GID=109 SUDO_UID=104 SUDO_USER=jenkins TERM=unknown TZ=/usr/share/zoneinfo/Etc/GMT-14 UID=0 USER=root _='I: set' http_proxy=http://192.168.101.4:3128 I: uname -a Linux i-capture-the-hostname 6.1.0-27-cloud-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux I: ls -l /bin lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin I: user script /srv/workspace/pbuilder/4109425/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: arm64 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 ... 20084 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} libpython3.13-minimal{a} libpython3.13-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-jaraco.text{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} python3.13{a} python3.13-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, 78 newly installed, 0 to remove and 0 not upgraded. Need to get 37.6 MB of archives. After unpacking 155 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main arm64 libpython3.12-minimal arm64 3.12.7-3 [808 kB] Get: 2 http://deb.debian.org/debian unstable/main arm64 libexpat1 arm64 2.6.4-1 [90.7 kB] Get: 3 http://deb.debian.org/debian unstable/main arm64 python3.12-minimal arm64 3.12.7-3 [1940 kB] Get: 4 http://deb.debian.org/debian unstable/main arm64 python3-minimal arm64 3.12.7-1 [26.8 kB] Get: 5 http://deb.debian.org/debian unstable/main arm64 media-types all 10.1.0 [26.9 kB] Get: 6 http://deb.debian.org/debian unstable/main arm64 netbase all 6.4 [12.8 kB] Get: 7 http://deb.debian.org/debian unstable/main arm64 tzdata all 2024b-3 [255 kB] Get: 8 http://deb.debian.org/debian unstable/main arm64 libkrb5support0 arm64 1.21.3-3 [32.1 kB] Get: 9 http://deb.debian.org/debian unstable/main arm64 libcom-err2 arm64 1.47.1-1+b1 [23.1 kB] Get: 10 http://deb.debian.org/debian unstable/main arm64 libk5crypto3 arm64 1.21.3-3 [80.8 kB] Get: 11 http://deb.debian.org/debian unstable/main arm64 libkeyutils1 arm64 1.6.3-4 [9352 B] Get: 12 http://deb.debian.org/debian unstable/main arm64 libkrb5-3 arm64 1.21.3-3 [310 kB] Get: 13 http://deb.debian.org/debian unstable/main arm64 libgssapi-krb5-2 arm64 1.21.3-3 [126 kB] Get: 14 http://deb.debian.org/debian unstable/main arm64 libtirpc-common all 1.3.4+ds-1.3 [10.9 kB] Get: 15 http://deb.debian.org/debian unstable/main arm64 libtirpc3t64 arm64 1.3.4+ds-1.3+b1 [78.7 kB] Get: 16 http://deb.debian.org/debian unstable/main arm64 libnsl2 arm64 1.3.0-3+b3 [37.9 kB] Get: 17 http://deb.debian.org/debian unstable/main arm64 readline-common all 8.2-5 [69.3 kB] Get: 18 http://deb.debian.org/debian unstable/main arm64 libreadline8t64 arm64 8.2-5 [159 kB] Get: 19 http://deb.debian.org/debian unstable/main arm64 libpython3.12-stdlib arm64 3.12.7-3 [1902 kB] Get: 20 http://deb.debian.org/debian unstable/main arm64 python3.12 arm64 3.12.7-3 [671 kB] Get: 21 http://deb.debian.org/debian unstable/main arm64 libpython3-stdlib arm64 3.12.7-1 [9708 B] Get: 22 http://deb.debian.org/debian unstable/main arm64 python3 arm64 3.12.7-1 [27.8 kB] Get: 23 http://deb.debian.org/debian unstable/main arm64 libpython3.13-minimal arm64 3.13.0-2 [850 kB] Get: 24 http://deb.debian.org/debian unstable/main arm64 python3.13-minimal arm64 3.13.0-2 [1838 kB] Get: 25 http://deb.debian.org/debian unstable/main arm64 sensible-utils all 0.0.24 [24.8 kB] Get: 26 http://deb.debian.org/debian unstable/main arm64 libmagic-mgc arm64 1:5.45-3+b1 [314 kB] Get: 27 http://deb.debian.org/debian unstable/main arm64 libmagic1t64 arm64 1:5.45-3+b1 [102 kB] Get: 28 http://deb.debian.org/debian unstable/main arm64 file arm64 1:5.45-3+b1 [43.4 kB] Get: 29 http://deb.debian.org/debian unstable/main arm64 gettext-base arm64 0.22.5-2 [198 kB] Get: 30 http://deb.debian.org/debian unstable/main arm64 libuchardet0 arm64 0.0.8-1+b2 [69.2 kB] Get: 31 http://deb.debian.org/debian unstable/main arm64 groff-base arm64 1.23.0-5 [1129 kB] Get: 32 http://deb.debian.org/debian unstable/main arm64 bsdextrautils arm64 2.40.2-11 [91.2 kB] Get: 33 http://deb.debian.org/debian unstable/main arm64 libpipeline1 arm64 1.5.8-1 [40.2 kB] Get: 34 http://deb.debian.org/debian unstable/main arm64 man-db arm64 2.13.0-1 [1404 kB] Get: 35 http://deb.debian.org/debian unstable/main arm64 m4 arm64 1.4.19-4 [277 kB] Get: 36 http://deb.debian.org/debian unstable/main arm64 autoconf all 2.72-3 [493 kB] Get: 37 http://deb.debian.org/debian unstable/main arm64 autotools-dev all 20220109.1 [51.6 kB] Get: 38 http://deb.debian.org/debian unstable/main arm64 automake all 1:1.16.5-1.3 [823 kB] Get: 39 http://deb.debian.org/debian unstable/main arm64 autopoint all 0.22.5-2 [723 kB] Get: 40 http://deb.debian.org/debian unstable/main arm64 libblas3 arm64 3.12.0-4 [98.7 kB] Get: 41 http://deb.debian.org/debian unstable/main arm64 libgfortran5 arm64 14.2.0-8 [361 kB] Get: 42 http://deb.debian.org/debian unstable/main arm64 liblapack3 arm64 3.12.0-4 [1812 kB] Get: 43 http://deb.debian.org/debian unstable/main arm64 coinor-libcoinutils3v5 arm64 2.11.11+ds-1+b1 [397 kB] Get: 44 http://deb.debian.org/debian unstable/main arm64 coinor-libosi1v5 arm64 0.108.10+ds-1+b1 [248 kB] Get: 45 http://deb.debian.org/debian unstable/main arm64 coinor-libclp1 arm64 1.17.10+ds-1 [751 kB] Get: 46 http://deb.debian.org/debian unstable/main arm64 coinor-libcgl1 arm64 0.60.9+ds-1 [359 kB] Get: 47 http://deb.debian.org/debian unstable/main arm64 coinor-libcbc3.1 arm64 2.10.12+ds-1 [615 kB] Get: 48 http://deb.debian.org/debian unstable/main arm64 coinor-cbc arm64 2.10.12+ds-1 [16.3 kB] Get: 49 http://deb.debian.org/debian unstable/main arm64 libdebhelper-perl all 13.20 [89.7 kB] Get: 50 http://deb.debian.org/debian unstable/main arm64 libtool all 2.4.7-8 [517 kB] Get: 51 http://deb.debian.org/debian unstable/main arm64 dh-autoreconf all 20 [17.1 kB] Get: 52 http://deb.debian.org/debian unstable/main arm64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 53 http://deb.debian.org/debian unstable/main arm64 libfile-stripnondeterminism-perl all 1.14.0-1 [19.5 kB] Get: 54 http://deb.debian.org/debian unstable/main arm64 dh-strip-nondeterminism all 1.14.0-1 [8448 B] Get: 55 http://deb.debian.org/debian unstable/main arm64 libelf1t64 arm64 0.192-4 [189 kB] Get: 56 http://deb.debian.org/debian unstable/main arm64 dwz arm64 0.15-1+b1 [102 kB] Get: 57 http://deb.debian.org/debian unstable/main arm64 libicu72 arm64 72.1-5+b1 [9239 kB] Get: 58 http://deb.debian.org/debian unstable/main arm64 libxml2 arm64 2.12.7+dfsg+really2.9.14-0.2+b1 [630 kB] Get: 59 http://deb.debian.org/debian unstable/main arm64 gettext arm64 0.22.5-2 [1532 kB] Get: 60 http://deb.debian.org/debian unstable/main arm64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 61 http://deb.debian.org/debian unstable/main arm64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 62 http://deb.debian.org/debian unstable/main arm64 debhelper all 13.20 [915 kB] Get: 63 http://deb.debian.org/debian unstable/main arm64 python3-autocommand all 2.2.2-3 [13.6 kB] Get: 64 http://deb.debian.org/debian unstable/main arm64 python3-more-itertools all 10.5.0-1 [63.8 kB] Get: 65 http://deb.debian.org/debian unstable/main arm64 python3-typing-extensions all 4.12.2-2 [73.0 kB] Get: 66 http://deb.debian.org/debian unstable/main arm64 python3-typeguard all 4.4.1-1 [37.0 kB] Get: 67 http://deb.debian.org/debian unstable/main arm64 python3-inflect all 7.3.1-2 [32.4 kB] Get: 68 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.context all 6.0.0-1 [7984 B] Get: 69 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.functools all 4.1.0-1 [12.0 kB] Get: 70 http://deb.debian.org/debian unstable/main arm64 python3-pkg-resources all 75.2.0-1 [213 kB] Get: 71 http://deb.debian.org/debian unstable/main arm64 python3-jaraco.text all 4.0.0-1 [11.4 kB] Get: 72 http://deb.debian.org/debian unstable/main arm64 python3-zipp all 3.21.0-1 [10.6 kB] Get: 73 http://deb.debian.org/debian unstable/main arm64 python3-setuptools all 75.2.0-1 [731 kB] Get: 74 http://deb.debian.org/debian unstable/main arm64 dh-python all 6.20241024 [109 kB] Get: 75 http://deb.debian.org/debian unstable/main arm64 libpython3.13-stdlib arm64 3.13.0-2 [1922 kB] Get: 76 http://deb.debian.org/debian unstable/main arm64 python3.13 arm64 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main arm64 python3-all arm64 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main arm64 python3-pyparsing all 3.1.2-1 [146 kB] Fetched 37.6 MB in 0s (155 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:arm64. (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 ... 20084 files and directories currently installed.) Preparing to unpack .../libpython3.12-minimal_3.12.7-3_arm64.deb ... Unpacking libpython3.12-minimal:arm64 (3.12.7-3) ... Selecting previously unselected package libexpat1:arm64. Preparing to unpack .../libexpat1_2.6.4-1_arm64.deb ... Unpacking libexpat1:arm64 (2.6.4-1) ... Selecting previously unselected package python3.12-minimal. Preparing to unpack .../python3.12-minimal_3.12.7-3_arm64.deb ... Unpacking python3.12-minimal (3.12.7-3) ... Setting up libpython3.12-minimal:arm64 (3.12.7-3) ... Setting up libexpat1:arm64 (2.6.4-1) ... Setting up python3.12-minimal (3.12.7-3) ... 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 ... 20404 files and directories currently installed.) Preparing to unpack .../00-python3-minimal_3.12.7-1_arm64.deb ... Unpacking python3-minimal (3.12.7-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_2024b-3_all.deb ... Unpacking tzdata (2024b-3) ... Selecting previously unselected package libkrb5support0:arm64. Preparing to unpack .../04-libkrb5support0_1.21.3-3_arm64.deb ... Unpacking libkrb5support0:arm64 (1.21.3-3) ... Selecting previously unselected package libcom-err2:arm64. Preparing to unpack .../05-libcom-err2_1.47.1-1+b1_arm64.deb ... Unpacking libcom-err2:arm64 (1.47.1-1+b1) ... Selecting previously unselected package libk5crypto3:arm64. Preparing to unpack .../06-libk5crypto3_1.21.3-3_arm64.deb ... Unpacking libk5crypto3:arm64 (1.21.3-3) ... Selecting previously unselected package libkeyutils1:arm64. Preparing to unpack .../07-libkeyutils1_1.6.3-4_arm64.deb ... Unpacking libkeyutils1:arm64 (1.6.3-4) ... Selecting previously unselected package libkrb5-3:arm64. Preparing to unpack .../08-libkrb5-3_1.21.3-3_arm64.deb ... Unpacking libkrb5-3:arm64 (1.21.3-3) ... Selecting previously unselected package libgssapi-krb5-2:arm64. Preparing to unpack .../09-libgssapi-krb5-2_1.21.3-3_arm64.deb ... Unpacking libgssapi-krb5-2:arm64 (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:arm64. Preparing to unpack .../11-libtirpc3t64_1.3.4+ds-1.3+b1_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3 to /lib/aarch64-linux-gnu/libtirpc.so.3.usr-is-merged by libtirpc3t64' Adding 'diversion of /lib/aarch64-linux-gnu/libtirpc.so.3.0.0 to /lib/aarch64-linux-gnu/libtirpc.so.3.0.0.usr-is-merged by libtirpc3t64' Unpacking libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Selecting previously unselected package libnsl2:arm64. Preparing to unpack .../12-libnsl2_1.3.0-3+b3_arm64.deb ... Unpacking libnsl2:arm64 (1.3.0-3+b3) ... 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:arm64. Preparing to unpack .../14-libreadline8t64_8.2-5_arm64.deb ... Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8 to /lib/aarch64-linux-gnu/libhistory.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libhistory.so.8.2 to /lib/aarch64-linux-gnu/libhistory.so.8.2.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8 to /lib/aarch64-linux-gnu/libreadline.so.8.usr-is-merged by libreadline8t64' Adding 'diversion of /lib/aarch64-linux-gnu/libreadline.so.8.2 to /lib/aarch64-linux-gnu/libreadline.so.8.2.usr-is-merged by libreadline8t64' Unpacking libreadline8t64:arm64 (8.2-5) ... Selecting previously unselected package libpython3.12-stdlib:arm64. Preparing to unpack .../15-libpython3.12-stdlib_3.12.7-3_arm64.deb ... Unpacking libpython3.12-stdlib:arm64 (3.12.7-3) ... Selecting previously unselected package python3.12. Preparing to unpack .../16-python3.12_3.12.7-3_arm64.deb ... Unpacking python3.12 (3.12.7-3) ... Selecting previously unselected package libpython3-stdlib:arm64. Preparing to unpack .../17-libpython3-stdlib_3.12.7-1_arm64.deb ... Unpacking libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3-minimal (3.12.7-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 ... 21466 files and directories currently installed.) Preparing to unpack .../00-python3_3.12.7-1_arm64.deb ... Unpacking python3 (3.12.7-1) ... Selecting previously unselected package libpython3.13-minimal:arm64. Preparing to unpack .../01-libpython3.13-minimal_3.13.0-2_arm64.deb ... Unpacking libpython3.13-minimal:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13-minimal. Preparing to unpack .../02-python3.13-minimal_3.13.0-2_arm64.deb ... Unpacking python3.13-minimal (3.13.0-2) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../03-sensible-utils_0.0.24_all.deb ... Unpacking sensible-utils (0.0.24) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../04-libmagic-mgc_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic-mgc (1:5.45-3+b1) ... Selecting previously unselected package libmagic1t64:arm64. Preparing to unpack .../05-libmagic1t64_1%3a5.45-3+b1_arm64.deb ... Unpacking libmagic1t64:arm64 (1:5.45-3+b1) ... Selecting previously unselected package file. Preparing to unpack .../06-file_1%3a5.45-3+b1_arm64.deb ... Unpacking file (1:5.45-3+b1) ... Selecting previously unselected package gettext-base. Preparing to unpack .../07-gettext-base_0.22.5-2_arm64.deb ... Unpacking gettext-base (0.22.5-2) ... Selecting previously unselected package libuchardet0:arm64. Preparing to unpack .../08-libuchardet0_0.0.8-1+b2_arm64.deb ... Unpacking libuchardet0:arm64 (0.0.8-1+b2) ... Selecting previously unselected package groff-base. Preparing to unpack .../09-groff-base_1.23.0-5_arm64.deb ... Unpacking groff-base (1.23.0-5) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../10-bsdextrautils_2.40.2-11_arm64.deb ... Unpacking bsdextrautils (2.40.2-11) ... Selecting previously unselected package libpipeline1:arm64. Preparing to unpack .../11-libpipeline1_1.5.8-1_arm64.deb ... Unpacking libpipeline1:arm64 (1.5.8-1) ... Selecting previously unselected package man-db. Preparing to unpack .../12-man-db_2.13.0-1_arm64.deb ... Unpacking man-db (2.13.0-1) ... Selecting previously unselected package m4. Preparing to unpack .../13-m4_1.4.19-4_arm64.deb ... Unpacking m4 (1.4.19-4) ... Selecting previously unselected package autoconf. Preparing to unpack .../14-autoconf_2.72-3_all.deb ... Unpacking autoconf (2.72-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../15-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../16-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 .../17-autopoint_0.22.5-2_all.deb ... Unpacking autopoint (0.22.5-2) ... Selecting previously unselected package libblas3:arm64. Preparing to unpack .../18-libblas3_3.12.0-4_arm64.deb ... Unpacking libblas3:arm64 (3.12.0-4) ... Selecting previously unselected package libgfortran5:arm64. Preparing to unpack .../19-libgfortran5_14.2.0-8_arm64.deb ... Unpacking libgfortran5:arm64 (14.2.0-8) ... Selecting previously unselected package liblapack3:arm64. Preparing to unpack .../20-liblapack3_3.12.0-4_arm64.deb ... Unpacking liblapack3:arm64 (3.12.0-4) ... Selecting previously unselected package coinor-libcoinutils3v5:arm64. Preparing to unpack .../21-coinor-libcoinutils3v5_2.11.11+ds-1+b1_arm64.deb ... Unpacking coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Selecting previously unselected package coinor-libosi1v5:arm64. Preparing to unpack .../22-coinor-libosi1v5_0.108.10+ds-1+b1_arm64.deb ... Unpacking coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Selecting previously unselected package coinor-libclp1:arm64. Preparing to unpack .../23-coinor-libclp1_1.17.10+ds-1_arm64.deb ... Unpacking coinor-libclp1:arm64 (1.17.10+ds-1) ... Selecting previously unselected package coinor-libcgl1:arm64. Preparing to unpack .../24-coinor-libcgl1_0.60.9+ds-1_arm64.deb ... Unpacking coinor-libcgl1:arm64 (0.60.9+ds-1) ... Selecting previously unselected package coinor-libcbc3.1:arm64. Preparing to unpack .../25-coinor-libcbc3.1_2.10.12+ds-1_arm64.deb ... Unpacking coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Selecting previously unselected package coinor-cbc. Preparing to unpack .../26-coinor-cbc_2.10.12+ds-1_arm64.deb ... Unpacking coinor-cbc (2.10.12+ds-1) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../27-libdebhelper-perl_13.20_all.deb ... Unpacking libdebhelper-perl (13.20) ... Selecting previously unselected package libtool. Preparing to unpack .../28-libtool_2.4.7-8_all.deb ... Unpacking libtool (2.4.7-8) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../29-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../30-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 .../31-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 .../32-dh-strip-nondeterminism_1.14.0-1_all.deb ... Unpacking dh-strip-nondeterminism (1.14.0-1) ... Selecting previously unselected package libelf1t64:arm64. Preparing to unpack .../33-libelf1t64_0.192-4_arm64.deb ... Unpacking libelf1t64:arm64 (0.192-4) ... Selecting previously unselected package dwz. Preparing to unpack .../34-dwz_0.15-1+b1_arm64.deb ... Unpacking dwz (0.15-1+b1) ... Selecting previously unselected package libicu72:arm64. Preparing to unpack .../35-libicu72_72.1-5+b1_arm64.deb ... Unpacking libicu72:arm64 (72.1-5+b1) ... Selecting previously unselected package libxml2:arm64. Preparing to unpack .../36-libxml2_2.12.7+dfsg+really2.9.14-0.2+b1_arm64.deb ... Unpacking libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+b1) ... Selecting previously unselected package gettext. Preparing to unpack .../37-gettext_0.22.5-2_arm64.deb ... Unpacking gettext (0.22.5-2) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../38-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 .../39-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../40-debhelper_13.20_all.deb ... Unpacking debhelper (13.20) ... Selecting previously unselected package python3-autocommand. Preparing to unpack .../41-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 .../42-python3-more-itertools_10.5.0-1_all.deb ... Unpacking python3-more-itertools (10.5.0-1) ... Selecting previously unselected package python3-typing-extensions. Preparing to unpack .../43-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 .../44-python3-typeguard_4.4.1-1_all.deb ... Unpacking python3-typeguard (4.4.1-1) ... Selecting previously unselected package python3-inflect. Preparing to unpack .../45-python3-inflect_7.3.1-2_all.deb ... Unpacking python3-inflect (7.3.1-2) ... Selecting previously unselected package python3-jaraco.context. Preparing to unpack .../46-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 .../47-python3-jaraco.functools_4.1.0-1_all.deb ... Unpacking python3-jaraco.functools (4.1.0-1) ... Selecting previously unselected package python3-pkg-resources. Preparing to unpack .../48-python3-pkg-resources_75.2.0-1_all.deb ... Unpacking python3-pkg-resources (75.2.0-1) ... Selecting previously unselected package python3-jaraco.text. Preparing to unpack .../49-python3-jaraco.text_4.0.0-1_all.deb ... Unpacking python3-jaraco.text (4.0.0-1) ... Selecting previously unselected package python3-zipp. Preparing to unpack .../50-python3-zipp_3.21.0-1_all.deb ... Unpacking python3-zipp (3.21.0-1) ... Selecting previously unselected package python3-setuptools. Preparing to unpack .../51-python3-setuptools_75.2.0-1_all.deb ... Unpacking python3-setuptools (75.2.0-1) ... Selecting previously unselected package dh-python. Preparing to unpack .../52-dh-python_6.20241024_all.deb ... Unpacking dh-python (6.20241024) ... Selecting previously unselected package libpython3.13-stdlib:arm64. Preparing to unpack .../53-libpython3.13-stdlib_3.13.0-2_arm64.deb ... Unpacking libpython3.13-stdlib:arm64 (3.13.0-2) ... Selecting previously unselected package python3.13. Preparing to unpack .../54-python3.13_3.13.0-2_arm64.deb ... Unpacking python3.13 (3.13.0-2) ... Selecting previously unselected package python3-all. Preparing to unpack .../55-python3-all_3.12.7-1_arm64.deb ... Unpacking python3-all (3.12.7-1) ... Selecting previously unselected package python3-pyparsing. Preparing to unpack .../56-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:arm64 (1.5.8-1) ... Setting up libkeyutils1:arm64 (1.6.3-4) ... Setting up libicu72:arm64 (72.1-5+b1) ... Setting up bsdextrautils (2.40.2-11) ... Setting up libmagic-mgc (1:5.45-3+b1) ... 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:arm64 (1:5.45-3+b1) ... Setting up gettext-base (0.22.5-2) ... Setting up m4 (1.4.19-4) ... Setting up libcom-err2:arm64 (1.47.1-1+b1) ... Setting up file (1:5.45-3+b1) ... Setting up libelf1t64:arm64 (0.192-4) ... Setting up libkrb5support0:arm64 (1.21.3-3) ... Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' Local time is now: Thu Dec 25 10:11:04 UTC 2025. Universal Time is now: Thu Dec 25 10:11:04 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:arm64 (3.13.0-2) ... Setting up autotools-dev (20220109.1) ... Setting up libblas3:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/blas/libblas.so.3 to provide /usr/lib/aarch64-linux-gnu/libblas.so.3 (libblas.so.3-aarch64-linux-gnu) in auto mode Setting up autopoint (0.22.5-2) ... Setting up libk5crypto3:arm64 (1.21.3-3) ... Setting up libgfortran5:arm64 (14.2.0-8) ... Setting up autoconf (2.72-3) ... Setting up dwz (0.15-1+b1) ... Setting up sensible-utils (0.0.24) ... Setting up libuchardet0:arm64 (0.0.8-1+b2) ... Setting up python3.13-minimal (3.13.0-2) ... Setting up netbase (6.4) ... Setting up libkrb5-3:arm64 (1.21.3-3) ... Setting up readline-common (8.2-5) ... Setting up libxml2:arm64 (2.12.7+dfsg+really2.9.14-0.2+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:arm64 (3.12.0-4) ... update-alternatives: using /usr/lib/aarch64-linux-gnu/lapack/liblapack.so.3 to provide /usr/lib/aarch64-linux-gnu/liblapack.so.3 (liblapack.so.3-aarch64-linux-gnu) in auto mode Setting up gettext (0.22.5-2) ... Setting up libtool (2.4.7-8) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up coinor-libcoinutils3v5:arm64 (2.11.11+ds-1+b1) ... Setting up libgssapi-krb5-2:arm64 (1.21.3-3) ... Setting up coinor-libosi1v5:arm64 (0.108.10+ds-1+b1) ... Setting up libreadline8t64:arm64 (8.2-5) ... Setting up dh-strip-nondeterminism (1.14.0-1) ... Setting up groff-base (1.23.0-5) ... Setting up libpython3.13-stdlib:arm64 (3.13.0-2) ... Setting up libtirpc3t64:arm64 (1.3.4+ds-1.3+b1) ... Setting up python3.13 (3.13.0-2) ... 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:arm64 (1.17.10+ds-1) ... Setting up libnsl2:arm64 (1.3.0-3+b3) ... Setting up coinor-libcgl1:arm64 (0.60.9+ds-1) ... Setting up libpython3.12-stdlib:arm64 (3.12.7-3) ... Setting up python3.12 (3.12.7-3) ... Setting up debhelper (13.20) ... Setting up coinor-libcbc3.1:arm64 (2.10.12+ds-1) ... Setting up libpython3-stdlib:arm64 (3.12.7-1) ... Setting up python3 (3.12.7-1) ... Setting up python3-zipp (3.21.0-1) ... Setting up python3-autocommand (2.2.2-3) ... Setting up coinor-cbc (2.10.12+ds-1) ... Setting up python3-pyparsing (3.1.2-1) ... Setting up python3-typing-extensions (4.12.2-2) ... Setting up python3-more-itertools (10.5.0-1) ... Setting up python3-jaraco.functools (4.1.0-1) ... Setting up python3-jaraco.context (6.0.0-1) ... Setting up python3-typeguard (4.4.1-1) ... Setting up python3-all (3.12.7-1) ... Setting up python3-inflect (7.3.1-2) ... Setting up python3-jaraco.text (4.0.0-1) ... Setting up python3-pkg-resources (75.2.0-1) ... Setting up python3-setuptools (75.2.0-1) ... Setting up dh-python (6.20241024) ... Processing triggers for libc-bin (2.40-3) ... 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/4109425/tmp/hooks/A99_set_merged_usr starting Not re-configuring usrmerge for unstable I: user script /srv/workspace/pbuilder/4109425/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 arm64 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.13 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running clean removing '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build' (and everything under it) 'build/bdist.linux-aarch64' does not exist -- can't clean it 'build/scripts-3.13' does not exist -- can't clean it I: pybuild base:311: python3.12 setup.py clean /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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-aarch64' 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.13 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config I: pybuild base:311: python3.12 setup.py config /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: UserWarning: Unknown distribution option: 'test_suite' warnings.warn(msg) running config dh_auto_build -O--buildsystem=pybuild I: pybuild base:311: /usr/bin/python3.13 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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.13_pulp/build/pulp copying pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp running egg_info creating PuLP.egg-info writing PuLP.egg-info/PKG-INFO 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.13_pulp/build/pulp copying pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp copying pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis copying pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir copying pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests copying pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests I: pybuild base:311: /usr/bin/python3 setup.py build /usr/lib/python3/dist-packages/setuptools/_distutils/dist.py:261: 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/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp copying pulp/sparse.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/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp running egg_info writing PuLP.egg-info/PKG-INFO writing dependency_links to PuLP.egg-info/dependency_links.txt 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) 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.13_pulp/build 'examples' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples' 'examples/wedding_initial.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding_initial.py' 'examples/CGcolumnwise.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CGcolumnwise.py' 'examples/test2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test2.py' 'examples/SpongeRollProblem5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem5.py' 'examples/SpongeRollProblem6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem6.py' 'examples/WhiskasModel2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel2.py' 'examples/SpongeRollProblem2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem2.py' 'examples/furniture.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/furniture.py' 'examples/test6.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test6.py' 'examples/BeerDistributionProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem.py' 'examples/CG.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/CG.py' 'examples/wedding.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/wedding.py' 'examples/SpongeRollProblem3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem3.py' 'examples/BeerDistributionProblemWarehouseExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemWarehouseExtension.py' 'examples/test3.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test3.py' 'examples/Two_stage_Stochastic_GemstoneTools.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py' 'examples/AmericanSteelProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/AmericanSteelProblem.py' 'examples/test1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test1.py' 'examples/test5.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test5.py' 'examples/BeerDistributionProblem_resolve.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblem_resolve.py' 'examples/SpongeRollProblem1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem1.py' 'examples/Sudoku1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku1.py' 'examples/__init__.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/__init__.py' 'examples/WhiskasModel1.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/WhiskasModel1.py' 'examples/test4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test4.py' 'examples/Sudoku2.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Sudoku2.py' 'examples/SpongeRollProblem4.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/SpongeRollProblem4.py' 'examples/test7.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/test7.py' 'examples/ComputerPlantProblem.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/ComputerPlantProblem.py' 'examples/BeerDistributionProblemCompetitorExtension.py' -> '/build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/BeerDistributionProblemCompetitorExtension.py' I: pybuild base:311: cd /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build; python3.13 -m unittest discover -v /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' """ Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/1f8cf16f857d437e949de041bb29927c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f8cf16f857d437e949de041bb29927c-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/385414f0e85346f89aac0e9befe371e9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/385414f0e85346f89aac0e9befe371e9-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.01 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) 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 9 iterations and 0 nodes (0.05 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: 9 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.05 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/63122a6ef6e8494bb0410e4035f211a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63122a6ef6e8494bb0410e4035f211a4-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.12 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.16 seconds) Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.15 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.80 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 seconds) FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) TwoMirCuts was tried 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 Time (Wallclock seconds): 0.81 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.81 (Wallclock seconds): 0.81 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/30bd6521306041fea690672ced149bd3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30bd6521306041fea690672ced149bd3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1654 RHS At line 1875 BOUNDS At line 2086 ENDATA Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -130.848 - 0.00 seconds Cgl0004I processed model has 164 rows, 159 columns (159 integer (159 of which binary)) and 597 elements Cbc0038I Initial state - 16 integers unsatisfied sum - 0.179775 Cbc0038I Pass 1: suminf. 0.01316 (1) obj. -130.801 iterations 60 Cbc0038I Solution found of -127.1 Cbc0038I Before mini branch and bound, 142 integers at bound fixed and 0 continuous Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 3 columns Cbc0038I Mini branch and bound improved solution from -127.1 to -130.65 (0.02 seconds) Cbc0038I Round again with cutoff of -130.67 Cbc0038I Reduced cost fixing fixed 79 variables on major pass 2 Cbc0038I Pass 2: suminf. 0.01316 (1) obj. -130.801 iterations 0 Cbc0038I Pass 3: suminf. 0.04806 (1) obj. -130.67 iterations 6 Cbc0038I Pass 4: suminf. 0.25084 (2) obj. -130.67 iterations 44 Cbc0038I Pass 5: suminf. 0.10312 (2) obj. -130.67 iterations 26 Cbc0038I Pass 6: suminf. 0.11579 (2) obj. -130.67 iterations 41 Cbc0038I Pass 7: suminf. 0.09495 (2) obj. -130.67 iterations 23 Cbc0038I Pass 8: suminf. 0.11579 (2) obj. -130.67 iterations 32 Cbc0038I Pass 9: suminf. 0.20357 (2) obj. -130.67 iterations 34 Cbc0038I Pass 10: suminf. 0.44543 (16) obj. -130.67 iterations 5 Cbc0038I Pass 11: suminf. 0.44725 (2) obj. -130.67 iterations 3 Cbc0038I Pass 12: suminf. 0.06801 (1) obj. -130.67 iterations 69 Cbc0038I Pass 13: suminf. 0.09763 (2) obj. -130.67 iterations 25 Cbc0038I Pass 14: suminf. 0.10312 (2) obj. -130.67 iterations 9 Cbc0038I Pass 15: suminf. 0.25084 (2) obj. -130.67 iterations 16 Cbc0038I Pass 16: suminf. 0.20357 (2) obj. -130.67 iterations 47 Cbc0038I Pass 17: suminf. 0.11579 (2) obj. -130.67 iterations 28 Cbc0038I Pass 18: suminf. 0.44543 (16) obj. -130.67 iterations 19 Cbc0038I Pass 19: suminf. 0.44543 (16) obj. -130.67 iterations 0 Cbc0038I Pass 20: suminf. 0.11579 (2) obj. -130.67 iterations 35 Cbc0038I Pass 21: suminf. 0.10903 (2) obj. -130.67 iterations 33 Cbc0038I Pass 22: suminf. 0.47639 (16) obj. -130.67 iterations 18 Cbc0038I Pass 23: suminf. 0.25084 (2) obj. -130.67 iterations 3 Cbc0038I Pass 24: suminf. 0.25084 (2) obj. -130.67 iterations 0 Cbc0038I Pass 25: suminf. 0.08722 (2) obj. -130.67 iterations 46 Cbc0038I Pass 26: suminf. 0.57526 (16) obj. -130.67 iterations 22 Cbc0038I Pass 27: suminf. 0.25084 (2) obj. -130.67 iterations 15 Cbc0038I Pass 28: suminf. 0.44543 (16) obj. -130.67 iterations 15 Cbc0038I Pass 29: suminf. 0.44543 (16) obj. -130.67 iterations 0 Cbc0038I Pass 30: suminf. 0.06024 (2) obj. -130.67 iterations 34 Cbc0038I Pass 31: suminf. 0.44543 (16) obj. -130.67 iterations 45 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 138 integers at bound fixed and 0 continuous Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 2 columns Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of -130.65 - took 0.03 seconds Cbc0012I Integer solution of -130.65 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 2 columns Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from -130.84775 to -130.84775 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 8 column cuts (8 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 -130.6499999999999, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 79 variables fixed on reduced cost Cuts at root node changed objective from -130.848 to -130.848 Probing was tried 1 times and created 9 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: -130.65000000 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ef5d895a076a4194ac9ccaf76dbaa1b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef5d895a076a4194ac9ccaf76dbaa1b0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 120 RHS At line 124 BOUNDS At line 145 ENDATA Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements Cbc0038I Initial state - 3 integers unsatisfied sum - 0.973708 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 60 iterations 3 Cbc0038I Solution found of 60 Cbc0038I Relaxing continuous gives 60 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 54 Cbc0038I Pass 2: suminf. 0.05172 (1) obj. 54 iterations 1 Cbc0038I Pass 3: suminf. 0.46087 (1) obj. 54 iterations 3 Cbc0038I Pass 4: suminf. 0.00877 (1) obj. 54 iterations 3 Cbc0038I Pass 5: suminf. 0.27184 (1) obj. 54 iterations 3 Cbc0038I Pass 6: suminf. 0.19984 (2) obj. 54 iterations 3 Cbc0038I Pass 7: suminf. 0.27184 (1) obj. 54 iterations 3 Cbc0038I Pass 8: suminf. 0.59640 (3) obj. 54 iterations 12 Cbc0038I Pass 9: suminf. 0.46602 (1) obj. 54 iterations 5 Cbc0038I Pass 10: suminf. 0.18243 (1) obj. 54 iterations 5 Cbc0038I Pass 11: suminf. 0.50355 (2) obj. 54 iterations 3 Cbc0038I Pass 12: suminf. 0.75769 (3) obj. 54 iterations 11 Cbc0038I Pass 13: suminf. 0.39742 (3) obj. 54 iterations 2 Cbc0038I Pass 14: suminf. 0.29734 (2) obj. 54 iterations 2 Cbc0038I Pass 15: suminf. 0.13592 (1) obj. 54 iterations 5 Cbc0038I Pass 16: suminf. 0.29915 (1) obj. 54 iterations 4 Cbc0038I Pass 17: suminf. 0.25446 (2) obj. 54 iterations 4 Cbc0038I Pass 18: suminf. 0.39646 (2) obj. 54 iterations 7 Cbc0038I Pass 19: suminf. 0.00855 (1) obj. 54 iterations 2 Cbc0038I Pass 20: suminf. 0.47009 (1) obj. 54 iterations 3 Cbc0038I Pass 21: suminf. 0.36283 (1) obj. 54 iterations 3 Cbc0038I Pass 22: suminf. 0.30955 (2) obj. 54 iterations 8 Cbc0038I Pass 23: suminf. 0.27438 (2) obj. 54 iterations 4 Cbc0038I Pass 24: suminf. 0.87326 (2) obj. 54 iterations 7 Cbc0038I Pass 25: suminf. 0.29054 (1) obj. 54 iterations 3 Cbc0038I Pass 26: suminf. 0.32479 (1) obj. 54 iterations 2 Cbc0038I Pass 27: suminf. 0.37018 (2) obj. 54 iterations 8 Cbc0038I Pass 28: suminf. 0.37018 (2) obj. 54 iterations 0 Cbc0038I Pass 29: suminf. 0.06725 (2) obj. 54 iterations 5 Cbc0038I Pass 30: suminf. 0.06725 (2) obj. 54 iterations 0 Cbc0038I Pass 31: suminf. 0.18145 (3) obj. 54 iterations 3 Cbc0038I Rounding solution of 56 is better than previous of 60 Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 22 columns Cbc0038I Mini branch and bound improved solution from 56 to 9 (0.02 seconds) Cbc0038I Round again with cutoff of 7.19999 Cbc0038I Pass 31: suminf. 0.66252 (3) obj. 7.19999 iterations 3 Cbc0038I Pass 32: suminf. 0.97808 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 33: suminf. 0.97808 (3) obj. 7.19999 iterations 0 Cbc0038I Pass 34: suminf. 0.66252 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 35: suminf. 0.64103 (3) obj. 7.19999 iterations 5 Cbc0038I Pass 36: suminf. 0.26166 (3) obj. 7.19999 iterations 4 Cbc0038I Pass 37: suminf. 1.14189 (3) obj. 7.19999 iterations 4 Cbc0038I Pass 38: suminf. 0.44329 (2) obj. 7.19999 iterations 3 Cbc0038I Pass 39: suminf. 0.26166 (3) obj. 7.19999 iterations 3 Cbc0038I Pass 40: suminf. 0.64192 (3) obj. 7.19999 iterations 7 Cbc0038I Pass 41: suminf. 0.49758 (2) obj. 7.19999 iterations 3 Cbc0038I Pass 42: suminf. 0.86088 (3) obj. 7.19999 iterations 3 Cbc0038I Pass 43: suminf. 0.57305 (3) obj. 7.19999 iterations 15 Cbc0038I Pass 44: suminf. 0.34310 (1) obj. 7.19999 iterations 3 Cbc0038I Pass 45: suminf. 0.58157 (2) obj. 7.19999 iterations 4 Cbc0038I Pass 46: suminf. 0.40135 (2) obj. 7.19999 iterations 2 Cbc0038I Pass 47: suminf. 0.43320 (3) obj. 7.19999 iterations 9 Cbc0038I Pass 48: suminf. 1.23824 (3) obj. 7.19999 iterations 4 Cbc0038I Pass 49: suminf. 1.23824 (3) obj. 7.19999 iterations 0 Cbc0038I Pass 50: suminf. 0.31737 (3) obj. 7.19999 iterations 3 Cbc0038I Pass 51: suminf. 0.31737 (3) obj. 7.19999 iterations 0 Cbc0038I Pass 52: suminf. 1.10317 (3) obj. 7.19999 iterations 4 Cbc0038I Pass 53: suminf. 0.56045 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 54: suminf. 0.42889 (3) obj. 7.19999 iterations 1 Cbc0038I Pass 55: suminf. 0.93104 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 56: suminf. 0.31737 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 57: suminf. 1.10317 (3) obj. 7.19999 iterations 4 Cbc0038I Pass 58: suminf. 0.56045 (3) obj. 7.19999 iterations 2 Cbc0038I Pass 59: suminf. 0.42889 (3) obj. 7.19999 iterations 1 Cbc0038I Pass 60: suminf. 0.93104 (3) obj. 7.19999 iterations 2 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 22 columns Cbc0038I Mini branch and bound improved solution from 9 to 7 (0.04 seconds) Cbc0038I Round again with cutoff of 4.89999 Cbc0038I Pass 60: suminf. 0.70980 (3) obj. 4.89999 iterations 0 Cbc0038I Pass 61: suminf. 1.02408 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 62: suminf. 1.02408 (3) obj. 4.89999 iterations 0 Cbc0038I Pass 63: suminf. 0.70980 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 64: suminf. 1.07450 (3) obj. 4.89999 iterations 11 Cbc0038I Pass 65: suminf. 0.85986 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 66: suminf. 1.03180 (3) obj. 4.89999 iterations 1 Cbc0038I Pass 67: suminf. 0.56111 (3) obj. 4.89999 iterations 13 Cbc0038I Pass 68: suminf. 0.29502 (2) obj. 4.89999 iterations 4 Cbc0038I Pass 69: suminf. 0.39391 (3) obj. 4.89999 iterations 3 Cbc0038I Pass 70: suminf. 0.35363 (2) obj. 4.89999 iterations 3 Cbc0038I Pass 71: suminf. 0.66383 (3) obj. 4.89999 iterations 3 Cbc0038I Pass 72: suminf. 0.51683 (3) obj. 4.89999 iterations 6 Cbc0038I Pass 73: suminf. 0.65475 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 74: suminf. 1.03902 (3) obj. 4.89999 iterations 8 Cbc0038I Pass 75: suminf. 0.71511 (3) obj. 4.89999 iterations 3 Cbc0038I Pass 76: suminf. 0.55199 (3) obj. 4.89999 iterations 3 Cbc0038I Pass 77: suminf. 0.65550 (3) obj. 4.89999 iterations 1 Cbc0038I Pass 78: suminf. 0.96025 (3) obj. 4.89999 iterations 6 Cbc0038I Pass 79: suminf. 0.83583 (2) obj. 4.89999 iterations 4 Cbc0038I Pass 80: suminf. 0.87447 (3) obj. 4.89999 iterations 3 Cbc0038I Pass 81: suminf. 0.83375 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 82: suminf. 0.47035 (2) obj. 4.89999 iterations 3 Cbc0038I Pass 83: suminf. 0.38513 (2) obj. 4.89999 iterations 4 Cbc0038I Pass 84: suminf. 0.51771 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 85: suminf. 0.92162 (3) obj. 4.89999 iterations 4 Cbc0038I Pass 86: suminf. 0.48953 (3) obj. 4.89999 iterations 4 Cbc0038I Pass 87: suminf. 0.89090 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 88: suminf. 0.61455 (3) obj. 4.89999 iterations 2 Cbc0038I Pass 89: suminf. 0.78014 (3) obj. 4.89999 iterations 3 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 did not improve solution (0.05 seconds) Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 7 - took 0.05 seconds Cbc0012I Integer solution of 7 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0031I 3 added rows had average density of 22.666667 Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.002 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 542 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 207 row cuts average 10.2 elements, 0 column cuts (0 active) in 0.008 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) - 507 row cuts average 17.8 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 36 row cuts average 8.1 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 356 row cuts average 18.6 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 Cbc0010I After 0 nodes, 1 on tree, 7 best solution, best possible 0 (0.13 seconds) Cbc0016I Integer solution of 4 found by strong branching after 973 iterations and 41 nodes (0.15 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0016I Integer solution of 3 found by strong branching after 2874 iterations and 370 nodes (0.24 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0004I Integer solution of 1 found after 3989 iterations and 587 nodes (0.31 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0010I After 1000 nodes, 9 on tree, 1 best solution, best possible 0 (0.42 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0001I Search completed - best objective 1, took 14816 iterations and 4531 nodes (0.56 seconds) Cbc0032I Strong branching done 7050 times (18905 iterations), fathomed 452 nodes and fixed 363 variables Cbc0041I Maximum depth 12, 515 variables fixed on reduced cost (complete fathoming 238 times, 3013 nodes taking 6760 iterations) Cuts at root node changed objective from 0 to 0 Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) Gomory was tried 100 times and created 542 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) Knapsack was tried 100 times and created 207 cuts of which 0 were active after adding rounds of cuts (0.008 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 507 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) FlowCover was tried 100 times and created 36 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) TwoMirCuts was tried 100 times and created 356 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 1.00000000 Enumerated nodes: 4531 Total iterations: 14816 Time (CPU seconds): 0.46 Time (Wallclock seconds): 0.57 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.46 (Wallclock seconds): 0.57 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6914997a5dc84c73b7f0cd3c9aec64cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6914997a5dc84c73b7f0cd3c9aec64cd-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/bdce000063374b6a9f43f8a473926cd7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bdce000063374b6a9f43f8a473926cd7-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.13_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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7f85000352454eb08160c0b6a3f00585-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f85000352454eb08160c0b6a3f00585-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/be03dbcf581440069b62f88cc5e4ad7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be03dbcf581440069b62f88cc5e4ad7c-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 14 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 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 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: 14 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/644dbe50d8d04aec8dc30136555edcc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/644dbe50d8d04aec8dc30136555edcc5-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/640c1968cea340228072e3773a5ccd5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/640c1968cea340228072e3773a5ccd5b-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.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.03 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/91cf9424f70b468cab03d4026e3fbbe5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91cf9424f70b468cab03d4026e3fbbe5-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f09a0623380b4494806e364938f38bfe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f09a0623380b4494806e364938f38bfe-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.08 seconds) Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5e8d9d67dab04c93a74d89eab713842c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e8d9d67dab04c93a74d89eab713842c-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, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c36708bd546c46a3bc42337a30b71932-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c36708bd546c46a3bc42337a30b71932-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/951feb97a37049528b46b021ebb85a9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/951feb97a37049528b46b021ebb85a9d-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/17e4c10f556e4787bfb22bd1ddc0711d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17e4c10f556e4787bfb22bd1ddc0711d-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 Time (Wallclock seconds): 0.07 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6f1fc3900a784e14aba03a1d3ae2862c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f1fc3900a784e14aba03a1d3ae2862c-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5c7a9c5768a841379ef79b42fc18bf25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c7a9c5768a841379ef79b42fc18bf25-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4a2353f2a5d44d129d8f0d3d0082e710-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a2353f2a5d44d129d8f0d3d0082e710-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d0c1f5c828aa423ba6684a9a13025bd3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0c1f5c828aa423ba6684a9a13025bd3-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b7cb3be160be4dbbbe57ccf127a5146f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7cb3be160be4dbbbe57ccf127a5146f-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.08 Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ed271a6b1ca24ab8b34cd4fe1c3e8135-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed271a6b1ca24ab8b34cd4fe1c3e8135-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.07 seconds) Cbc0038I After 0.07 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.07 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c0b461eadf224598a4836f587a6d8387-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0b461eadf224598a4836f587a6d8387-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3a4512addc49405297144b068e358e99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a4512addc49405297144b068e358e99-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.02 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/14911ef3b4b84feb910a1488133b2c3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14911ef3b4b84feb910a1488133b2c3e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/af594aa5f9594e20a08866a61c602f4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af594aa5f9594e20a08866a61c602f4e-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fa44296842034813a58db74b9d3019dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa44296842034813a58db74b9d3019dc-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/08c11cd540bf4eb7957094958f5c3773-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08c11cd540bf4eb7957094958f5c3773-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/27419fa113fd4b4c91b51e82b4283f54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27419fa113fd4b4c91b51e82b4283f54-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c07eaf6d48de4951893dd4f199218f0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c07eaf6d48de4951893dd4f199218f0a-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/627a879978804a9ab0cdb502515dc05d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/627a879978804a9ab0cdb502515dc05d-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/65eb9a4817754388b81e2e9c523ab154-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65eb9a4817754388b81e2e9c523ab154-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a218483e1b0146aaacb2413d6ea17873-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a218483e1b0146aaacb2413d6ea17873-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/506b11ce6fa84393858b749bf93083c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/506b11ce6fa84393858b749bf93083c1-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/65a1da7f563f4da180b2e1108a458ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65a1da7f563f4da180b2e1108a458ed5-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f341fa52bee04e3ab7c341e4cb6d2814-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f341fa52bee04e3ab7c341e4cb6d2814-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/85b7ac7f0b794108bccada2baaa4f242-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85b7ac7f0b794108bccada2baaa4f242-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.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 0.0 x_1 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 0.0 x_7 = 1.0 x_8 = 0.0 x_9 = 1.0 Status: Optimal s_0 = 0.0 s_1 = 0.5 s_2 = 0.0 w_0 = 0.0 w_1 = 0.0 w_2 = 0.5 x_0 = 1.0 x_1 = 0.0 x_10 = 0.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 = 0.0 x_19 = 1.0 x_2 = 1.0 x_3 = 1.0 x_4 = 0.0 x_5 = 0.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 1.0 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 item passed all tests: 8 tests in pulp 8 tests in 1 item. 8 passed. Test passed. Status: Optimal Route_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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d6840e8fd8e74ac28e7c4f2e73540fc6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/d6840e8fd8e74ac28e7c4f2e73540fc6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dd11293a07874c4a9514f40cd15ababd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd11293a07874c4a9514f40cd15ababd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 72 RHS At line 81 BOUNDS At line 94 ENDATA Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0013d0a345e64e5189fa522b4d3b05ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0013d0a345e64e5189fa522b4d3b05ff-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ca18a3c656dd4a6d9b0add0e8df9fa26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca18a3c656dd4a6d9b0add0e8df9fa26-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 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.07 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 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.06 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8dd4463f23b44b5081cb14e4986b09e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8dd4463f23b44b5081cb14e4986b09e5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS At line 63 RHS At line 71 BOUNDS At line 82 ENDATA Problem MODEL has 7 rows, 10 columns and 20 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 7 rows, 10 columns (10 integer (0 of which binary)) and 20 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/87e9f90aa4cc4ff598b38755611851b7-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/87e9f90aa4cc4ff598b38755611851b7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9846b1828404456f9b6ab14d2a92eeab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9846b1828404456f9b6ab14d2a92eeab-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/193204097c6845309575d2866bbc916d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/193204097c6845309575d2866bbc916d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/434bdaad6e4c4ad484882b6250148006-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/434bdaad6e4c4ad484882b6250148006-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c0672eb96e5a4b15b9cadc1f363df2fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0672eb96e5a4b15b9cadc1f363df2fe-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/de1a2b941786485481a557757d7cbc75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de1a2b941786485481a557757d7cbc75-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c9f1a01f693643e7b9c36a7e475f99d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9f1a01f693643e7b9c36a7e475f99d2-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ec2fc99aaf814b9d9b92f9c810056e67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec2fc99aaf814b9d9b92f9c810056e67-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/282597bfb5bc4197bd6f873cede3944d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/282597bfb5bc4197bd6f873cede3944d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/80b1d8a3cf1e42658897230a90b8285d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80b1d8a3cf1e42658897230a90b8285d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e2ef669530834f67af33e113167f4696-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ef669530834f67af33e113167f4696-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/534e4e251ab540c78687fbfe6c69ca37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/534e4e251ab540c78687fbfe6c69ca37-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/87213a9ad8c74fc3ac9b16001858e9f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87213a9ad8c74fc3ac9b16001858e9f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/956a9c5bffcb4c499230879c8de7d669-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/956a9c5bffcb4c499230879c8de7d669-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a41c163c168e437c8071645db3b3797a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a41c163c168e437c8071645db3b3797a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6972e3a35e184eba915d60f228a94a89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6972e3a35e184eba915d60f228a94a89-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c6b3fb9f680c433dbe4db8b06a2491f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6b3fb9f680c433dbe4db8b06a2491f0-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.01 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.mps mips /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/dfd57628d9294dfc9779bb593855d90a-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/dfd57628d9294dfc9779bb593855d90a-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.06 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.10 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.13_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.13_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.13_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 27.034s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13_pulp/build/examples /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/*.lp 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fd45f015c5cd4cfe8063a81d5699256f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd45f015c5cd4cfe8063a81d5699256f-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8846dae6274241aeafd7b547a89acfe9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/8846dae6274241aeafd7b547a89acfe9-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.117203 Cbc0038I Pass 1: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Solution found of 3.70254e+06 Cbc0038I Before mini branch and bound, 14 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 3.75171e+06 Cbc0038I Pass 2: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 3: suminf. 0.06253 (1) obj. 3.75171e+06 iterations 2 Cbc0038I Pass 4: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 5: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 6: suminf. 0.06203 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 7: suminf. 0.06284 (1) obj. 3.75171e+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.01 seconds) Cbc0038I Round again with cutoff of 4.11362e+06 Cbc0038I Pass 10: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 11: suminf. 0.47728 (1) obj. 4.11362e+06 iterations 2 Cbc0038I Pass 12: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 13: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 5 Cbc0038I Pass 14: suminf. 0.47551 (1) obj. 4.11362e+06 iterations 1 Cbc0038I Pass 15: suminf. 0.37291 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 16: suminf. 0.05947 (1) obj. 4.1943e+06 iterations 2 Cbc0038I Pass 17: suminf. 0.05947 (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, 4 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 11 columns Cbc0038I Mini branch and bound did not improve solution (0.03 seconds) Cbc0038I Round again with cutoff of 4.18141e+06 Cbc0038I Pass 24: suminf. 0.11720 (1) obj. 4.1943e+06 iterations 0 Cbc0038I Pass 25: suminf. 0.39108 (1) obj. 4.18141e+06 iterations 2 Cbc0038I Pass 26: suminf. 0.37468 (1) obj. 4.1943e+06 iterations 1 Cbc0038I Pass 27: suminf. 0.04616 (1) obj. 4.1943e+06 iterations 9 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.04 seconds) Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) 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 9 iterations and 0 nodes (0.05 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: 9 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.05 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fa1489f100534e04b1f69f29c8e439b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa1489f100534e04b1f69f29c8e439b7-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 41 Cbc0038I Pass 2: suminf. 0.00000 (0) obj. 3513.99 iterations 3 Cbc0038I Solution found of 3513.99 Cbc0038I Relaxing continuous gives 3508.51 Cbc0038I Before mini branch and bound, 33 integers at bound fixed and 49 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 34 rows 37 columns Cbc0038I Mini branch and bound did not improve solution (0.02 seconds) Cbc0038I Round again with cutoff of 3412.36 Cbc0038I Pass 3: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 4: suminf. 0.18854 (1) obj. 3412.36 iterations 10 Cbc0038I Pass 5: suminf. 0.15087 (1) obj. 3078.47 iterations 3 Cbc0038I Pass 6: suminf. 1.43534 (6) obj. 3412.36 iterations 33 Cbc0038I Pass 7: suminf. 0.67621 (4) obj. 3412.36 iterations 19 Cbc0038I Pass 8: suminf. 0.62081 (4) obj. 3412.36 iterations 15 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 24 Cbc0038I Pass 12: suminf. 0.06045 (2) obj. 3412.36 iterations 27 Cbc0038I Pass 13: suminf. 1.69786 (5) obj. 3412.36 iterations 17 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. 3403.23 iterations 38 Cbc0038I Pass 20: suminf. 0.38652 (5) obj. 3412.36 iterations 16 Cbc0038I Pass 21: suminf. 0.94297 (3) obj. 3412.36 iterations 23 Cbc0038I Pass 22: suminf. 0.00000 (0) obj. 3412.36 iterations 19 Cbc0038I Solution found of 3412.36 Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.10 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 Cbc0038I Pass 25: suminf. 0.15478 (4) obj. 3076.56 iterations 11 Cbc0038I Pass 26: suminf. 0.40349 (4) obj. 3076.56 iterations 7 Cbc0038I Pass 27: suminf. 1.01552 (4) obj. 3076.56 iterations 59 Cbc0038I Pass 28: suminf. 0.50768 (2) obj. 3076.56 iterations 24 Cbc0038I Pass 29: suminf. 0.21132 (2) obj. 2928.38 iterations 5 Cbc0038I Pass 30: suminf. 0.32821 (3) obj. 3076.56 iterations 17 Cbc0038I Pass 31: suminf. 0.27944 (7) obj. 3076.56 iterations 6 Cbc0038I Pass 32: suminf. 1.75131 (6) obj. 3076.56 iterations 11 Cbc0038I Pass 33: suminf. 0.21132 (2) obj. 2849.26 iterations 17 Cbc0038I Pass 34: suminf. 0.50760 (2) obj. 3076.56 iterations 8 Cbc0038I Pass 35: suminf. 0.48310 (6) obj. 3076.56 iterations 5 Cbc0038I Pass 36: suminf. 1.75131 (6) obj. 3076.56 iterations 20 Cbc0038I Pass 37: suminf. 1.87842 (10) obj. 3076.56 iterations 48 Cbc0038I Pass 38: suminf. 0.56850 (3) obj. 3076.56 iterations 34 Cbc0038I Pass 39: suminf. 0.60271 (4) obj. 3076.56 iterations 16 Cbc0038I Pass 40: suminf. 0.35209 (4) obj. 3076.56 iterations 19 Cbc0038I Pass 41: suminf. 1.25851 (4) obj. 3076.56 iterations 29 Cbc0038I Pass 42: suminf. 0.87809 (2) obj. 3076.56 iterations 10 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 30 Cbc0038I Pass 46: suminf. 0.52364 (3) obj. 3076.56 iterations 27 Cbc0038I Pass 47: suminf. 0.17502 (2) obj. 3076.56 iterations 14 Cbc0038I Pass 48: suminf. 1.49749 (6) obj. 3076.56 iterations 47 Cbc0038I Pass 49: suminf. 0.33422 (3) obj. 3076.56 iterations 20 Cbc0038I Pass 50: suminf. 0.93164 (3) obj. 3076.56 iterations 12 Cbc0038I Pass 51: suminf. 0.93164 (3) obj. 3076.56 iterations 4 Cbc0038I Pass 52: suminf. 0.16639 (2) obj. 3076.56 iterations 16 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.15 seconds) Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.40 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.80 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Result - Optimal solution found Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.79 Time (Wallclock seconds): 0.80 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.80 (Wallclock seconds): 0.80 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5ac3756b82c742e68917a24526ca17a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ac3756b82c742e68917a24526ca17a2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS At line 1655 RHS At line 1876 BOUNDS At line 2087 ENDATA Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -60.6 - 0.00 seconds Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements Cutoff increment increased from 1e-05 to 0.04995 Cbc0038I Initial state - 0 integers unsatisfied sum - 7.43849e-15 Cbc0038I Solution found of -60.6 Cbc0038I Before mini branch and bound, 209 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 -60.6 - took 0.00 seconds Cbc0012I Integer solution of -60.6 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) Cbc0001I Search completed - best objective -60.60000000000001, took 0 iterations and 0 nodes (0.02 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -60.6 to -60.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: -60.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.01 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e4387185f89b4dad8d7445f0a47b9845-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4387185f89b4dad8d7445f0a47b9845-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 120 RHS At line 124 BOUNDS At line 145 ENDATA Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements Cbc0038I Initial state - 3 integers unsatisfied sum - 0.451927 Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 26.5 iterations 3 Cbc0038I Solution found of 26.5 Cbc0038I Relaxing continuous gives 26.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) Cbc0038I Round again with cutoff of 23.85 Cbc0038I Pass 2: suminf. 0.01906 (1) obj. 23.85 iterations 1 Cbc0038I Pass 3: suminf. 0.73716 (2) obj. 23.85 iterations 4 Cbc0038I Pass 4: suminf. 0.72682 (2) obj. 23.85 iterations 2 Cbc0038I Pass 5: suminf. 0.25284 (2) obj. 23.85 iterations 2 Cbc0038I Pass 6: suminf. 0.88960 (2) obj. 23.85 iterations 4 Cbc0038I Pass 7: suminf. 0.63923 (2) obj. 23.85 iterations 11 Cbc0038I Pass 8: suminf. 0.05691 (1) obj. 23.85 iterations 9 Cbc0038I Pass 9: suminf. 0.55659 (2) obj. 23.85 iterations 3 Cbc0038I Pass 10: suminf. 0.97429 (3) obj. 23.85 iterations 8 Cbc0038I Pass 11: suminf. 0.46747 (3) obj. 23.85 iterations 2 Cbc0038I Pass 12: suminf. 1.21917 (3) obj. 23.85 iterations 4 Cbc0038I Pass 13: suminf. 0.93479 (3) obj. 23.85 iterations 1 Cbc0038I Pass 14: suminf. 0.47608 (2) obj. 23.85 iterations 3 Cbc0038I Pass 15: suminf. 0.21431 (1) obj. 23.85 iterations 3 Cbc0038I Pass 16: suminf. 0.45805 (2) obj. 23.85 iterations 4 Cbc0038I Pass 17: suminf. 0.58833 (3) obj. 23.85 iterations 5 Cbc0038I Pass 18: suminf. 0.26490 (2) obj. 23.85 iterations 2 Cbc0038I Pass 19: suminf. 0.90221 (3) obj. 23.85 iterations 5 Cbc0038I Pass 20: suminf. 0.82802 (3) obj. 23.85 iterations 9 Cbc0038I Pass 21: suminf. 0.82802 (3) obj. 23.85 iterations 0 Cbc0038I Pass 22: suminf. 0.43826 (2) obj. 23.85 iterations 4 Cbc0038I Pass 23: suminf. 0.25205 (2) obj. 23.85 iterations 3 Cbc0038I Pass 24: suminf. 0.63508 (2) obj. 23.85 iterations 6 Cbc0038I Pass 25: suminf. 0.40566 (2) obj. 23.85 iterations 3 Cbc0038I Pass 26: suminf. 0.25943 (2) obj. 23.85 iterations 5 Cbc0038I Pass 27: suminf. 0.25943 (2) obj. 23.85 iterations 0 Cbc0038I Pass 28: suminf. 0.67295 (2) obj. 23.85 iterations 3 Cbc0038I Pass 29: suminf. 0.36758 (1) obj. 23.85 iterations 2 Cbc0038I Pass 30: suminf. 0.46783 (2) obj. 23.85 iterations 3 Cbc0038I Pass 31: suminf. 0.51904 (3) obj. 23.85 iterations 9 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 26.5 to 8.5 (0.03 seconds) Cbc0038I Round again with cutoff of 6.79999 Cbc0038I Pass 31: suminf. 0.30588 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 32: suminf. 0.42356 (3) obj. 6.79999 iterations 6 Cbc0038I Pass 33: suminf. 0.29359 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 34: suminf. 0.55512 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 35: suminf. 0.55512 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 36: suminf. 0.80386 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 37: suminf. 0.51810 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 38: suminf. 0.89901 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 39: suminf. 0.56754 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 40: suminf. 1.01302 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 41: suminf. 0.69299 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 42: suminf. 0.89257 (3) obj. 6.79999 iterations 1 Cbc0038I Pass 43: suminf. 0.30588 (3) obj. 6.79999 iterations 9 Cbc0038I Pass 44: suminf. 0.30588 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 45: suminf. 0.42356 (3) obj. 6.79999 iterations 6 Cbc0038I Pass 46: suminf. 0.29359 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 47: suminf. 0.55512 (3) obj. 6.79999 iterations 4 Cbc0038I Pass 48: suminf. 0.55512 (3) obj. 6.79999 iterations 0 Cbc0038I Pass 49: suminf. 0.80386 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 50: suminf. 0.51810 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 51: suminf. 0.89901 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 52: suminf. 0.56754 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 53: suminf. 1.01302 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 54: suminf. 0.69299 (3) obj. 6.79999 iterations 3 Cbc0038I Pass 55: suminf. 0.89257 (3) obj. 6.79999 iterations 1 Cbc0038I Pass 56: suminf. 1.09495 (3) obj. 6.79999 iterations 10 Cbc0038I Pass 57: suminf. 0.67442 (3) obj. 6.79999 iterations 2 Cbc0038I Pass 58: suminf. 0.71360 (3) obj. 6.79999 iterations 1 Cbc0038I Pass 59: suminf. 0.43750 (2) obj. 6.79999 iterations 4 Cbc0038I Pass 60: suminf. 0.30579 (3) obj. 6.79999 iterations 4 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 1 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Mini branch and bound improved solution from 8.5 to 7.5 (0.05 seconds) Cbc0038I Round again with cutoff of 4.75999 Cbc0038I Pass 60: suminf. 0.34675 (3) obj. 4.75999 iterations 0 Cbc0038I Pass 61: suminf. 0.40842 (3) obj. 4.75999 iterations 6 Cbc0038I Pass 62: suminf. 0.33184 (3) obj. 4.75999 iterations 2 Cbc0038I Pass 63: suminf. 0.56744 (3) obj. 4.75999 iterations 4 Cbc0038I Pass 64: suminf. 0.56744 (3) obj. 4.75999 iterations 0 Cbc0038I Pass 65: suminf. 0.78808 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 66: suminf. 0.55500 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 67: suminf. 0.87809 (3) obj. 4.75999 iterations 2 Cbc0038I Pass 68: suminf. 0.58035 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 69: suminf. 0.95916 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 70: suminf. 0.85008 (3) obj. 4.75999 iterations 4 Cbc0038I Pass 71: suminf. 0.84740 (3) obj. 4.75999 iterations 6 Cbc0038I Pass 72: suminf. 0.84740 (3) obj. 4.75999 iterations 0 Cbc0038I Pass 73: suminf. 0.53190 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 74: suminf. 0.15888 (1) obj. 4.75999 iterations 4 Cbc0038I Pass 75: suminf. 0.19428 (1) obj. 4.75999 iterations 3 Cbc0038I Pass 76: suminf. 0.92790 (2) obj. 4.75999 iterations 13 Cbc0038I Pass 77: suminf. 0.92716 (2) obj. 4.75999 iterations 2 Cbc0038I Pass 78: suminf. 0.83261 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 79: suminf. 0.82619 (3) obj. 4.75999 iterations 2 Cbc0038I Pass 80: suminf. 0.36219 (3) obj. 4.75999 iterations 5 Cbc0038I Pass 81: suminf. 0.51000 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 82: suminf. 0.94371 (3) obj. 4.75999 iterations 13 Cbc0038I Pass 83: suminf. 0.83682 (2) obj. 4.75999 iterations 3 Cbc0038I Pass 84: suminf. 0.47862 (3) obj. 4.75999 iterations 5 Cbc0038I Pass 85: suminf. 0.34098 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 86: suminf. 1.08496 (3) obj. 4.75999 iterations 3 Cbc0038I Pass 87: suminf. 0.72364 (3) obj. 4.75999 iterations 1 Cbc0038I Pass 88: suminf. 1.00904 (3) obj. 4.75999 iterations 2 Cbc0038I Pass 89: suminf. 0.40341 (2) obj. 4.75999 iterations 5 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 7.5 - took 0.06 seconds Cbc0012I Integer solution of 7.5 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0031I 3 added rows had average density of 16.666667 Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 570 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 409 row cuts average 10.6 elements, 0 column cuts (0 active) in 0.015 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) - 520 row cuts average 18.5 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 65 row cuts average 8.3 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 369 row cuts average 18.2 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 Cbc0010I After 0 nodes, 1 on tree, 7.5 best solution, best possible 0 (0.15 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0016I Integer solution of 6.5 found by strong branching after 1692 iterations and 170 nodes (0.19 seconds) Cbc0016I Integer solution of 5.5 found by strong branching after 2146 iterations and 255 nodes (0.21 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns Cbc0016I Integer solution of 4.5 found by strong branching after 2658 iterations and 346 nodes (0.24 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns Cbc0016I Integer solution of 3.5 found by strong branching after 3016 iterations and 415 nodes (0.26 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0010I After 1000 nodes, 7 on tree, 3.5 best solution, best possible 0 (0.41 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0010I After 2000 nodes, 5 on tree, 3.5 best solution, best possible 0 (0.66 seconds) Cbc0001I Search completed - best objective 3.5, took 27797 iterations and 9433 nodes (0.76 seconds) Cbc0032I Strong branching done 11122 times (30556 iterations), fathomed 482 nodes and fixed 525 variables Cbc0041I Maximum depth 14, 789 variables fixed on reduced cost (complete fathoming 596 times, 7071 nodes taking 16911 iterations) Cuts at root node changed objective from 0 to 0 Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) Gomory was tried 100 times and created 570 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) Knapsack was tried 100 times and created 409 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 100 times and created 520 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) FlowCover was tried 100 times and created 65 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) TwoMirCuts was tried 100 times and created 369 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: 3.50000000 Enumerated nodes: 9433 Total iterations: 27797 Time (CPU seconds): 0.68 Time (Wallclock seconds): 0.76 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.68 (Wallclock seconds): 0.76 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a7eb96c6fc244ea89f01e0007ac320fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7eb96c6fc244ea89f01e0007ac320fc-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0dc451a288304b68b84d074b26d74bca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dc451a288304b68b84d074b26d74bca-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/42de0809e60a427ba2ac1908b0052a4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42de0809e60a427ba2ac1908b0052a4c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 84 RHS At line 93 BOUNDS At line 109 ENDATA Problem MODEL has 8 rows, 15 columns and 30 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8300 - 0.00 seconds Cgl0004I processed model has 8 rows, 15 columns (15 integer (0 of which binary)) and 30 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8300 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8300 to 8300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a3db483a0efe4e1babf620d494c807dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3db483a0efe4e1babf620d494c807dc-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 14 iterations and 0 nodes (0.01 seconds) Cbc0031I 3 added rows had average density of 4 Cbc0013I At root node, 3 cuts changed objective from 218829.41 to 228100 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 4.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) - 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 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 1 variables fixed on reduced cost Cuts at root node changed objective from 218829 to 228100 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/56cc40d3c84d422c8c1ce4b7bbb80a9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56cc40d3c84d422c8c1ce4b7bbb80a9a-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ba6f32e6541f46a5ad76bb37e4441f50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba6f32e6541f46a5ad76bb37e4441f50-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.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.03 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f04d9288bfac462784b3e34eddd483a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f04d9288bfac462784b3e34eddd483a6-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, 26 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 11 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 120 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/738236103e9746b8be376ae1afd28fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/738236103e9746b8be376ae1afd28fae-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, 21 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 10 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 10 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 Cgl0004I processed model has 31 rows, 26 columns (26 integer (26 of which binary)) and 128 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/1021d492aa544036bf267dfc11eb14be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1021d492aa544036bf267dfc11eb14be-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, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 2 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 28 rows, 22 columns (22 integer (22 of which binary)) and 111 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c6f158937c8441958544f226d9a12389-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6f158937c8441958544f226d9a12389-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 17 fixed, 0 tightened bounds, 4 strengthened rows, 29 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 6 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 17 rows, 16 columns (16 integer (16 of which binary)) and 62 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 Time (Wallclock seconds): 0.07 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/5741012eb6d94f7899dde436957164d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5741012eb6d94f7899dde436957164d1-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 22 fixed, 0 tightened bounds, 5 strengthened rows, 41 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 9 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 5 strengthened rows, 0 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 15 rows, 11 columns (11 integer (11 of which binary)) and 82 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 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.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3a927550f34a4394846f6487e003b99e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a927550f34a4394846f6487e003b99e-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 22 fixed, 0 tightened bounds, 6 strengthened rows, 24 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 4 strengthened rows, 2 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, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 14 rows, 11 columns (11 integer (11 of which binary)) and 74 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fd24b9596b5a4b5aab1f81d114f67eb3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd24b9596b5a4b5aab1f81d114f67eb3-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 22 fixed, 0 tightened bounds, 7 strengthened rows, 22 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 strengthened rows, 0 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 7 strengthened rows, 1 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 7 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 Cgl0004I processed model has 14 rows, 9 columns (9 integer (9 of which binary)) and 82 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.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/7242ed76d2154f038dbf1247edd39e1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7242ed76d2154f038dbf1247edd39e1d-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 22 fixed, 0 tightened bounds, 8 strengthened rows, 18 substitutions Cgl0003I 2 fixed, 0 tightened bounds, 3 strengthened rows, 7 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 7 rows, 6 columns (6 integer (6 of which binary)) and 30 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/454baf9d3b9b4b828130240a1e2138b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/454baf9d3b9b4b828130240a1e2138b8-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 22 fixed, 0 tightened bounds, 9 strengthened rows, 74 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 3 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 8 strengthened rows, 5 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 3 strengthened rows, 0 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 2 strengthened rows, 0 substitutions Cgl0004I processed model has 5 rows, 3 columns (3 integer (3 of which binary)) and 15 elements Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.06 seconds) 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.06 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8bc61f39831f48e4b21105ad8817fb14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bc61f39831f48e4b21105ad8817fb14-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 23 fixed, 0 tightened bounds, 10 strengthened rows, 33 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 4 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 strengthened rows, 1 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.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f561013693674b61b5750b945872ea0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f561013693674b61b5750b945872ea0a-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 30 fixed, 0 tightened bounds, 11 strengthened rows, 93 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 8 substitutions Cgl0003I 5 fixed, 0 tightened bounds, 3 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: 0 Time (CPU seconds): 0.03 Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/f43dccfffe9e4d8b83662bb5564d4e91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f43dccfffe9e4d8b83662bb5564d4e91-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.05 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 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.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) 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.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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/c632f54b244949849db5fbb4669911b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c632f54b244949849db5fbb4669911b1-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/65b7b2669e674c599458b84062d9aad3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65b7b2669e674c599458b84062d9aad3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS At line 4763 RHS At line 5117 BOUNDS At line 5848 ENDATA Problem MODEL has 353 rows, 730 columns and 2945 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements Cbc3007W No integer variables - nothing to do Cuts at root node changed objective from 0 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.02 Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.03 (Wallclock seconds): 0.03 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/e44ec505c3e4405189b3c44edb9a22ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e44ec505c3e4405189b3c44edb9a22ac-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 32 ENDATA Problem MODEL has 3 rows, 3 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 300 - 0.00 seconds Cgl0003I 0 fixed, 3 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 3 columns (3 integer (0 of which binary)) and 6 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 300 found by greedy cover after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 300, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 300 to 300 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 300.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/001adbcd039344f0be76b9acf1db43c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/001adbcd039344f0be76b9acf1db43c4-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/41a16d3a1827418fa0a72fee78c751b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41a16d3a1827418fa0a72fee78c751b0-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b3ba396fdc6445168bdb375d9ae6431a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3ba396fdc6445168bdb375d9ae6431a-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/070fc36648b54adca11ff54639a474c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/070fc36648b54adca11ff54639a474c4-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/46d04174eda841b7ab1a2c55a2755d71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46d04174eda841b7ab1a2c55a2755d71-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 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/701e6fbb1580419aa20be6dd881dcffd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/701e6fbb1580419aa20be6dd881dcffd-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.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/739166f934294e2698814760aaa778ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/739166f934294e2698814760aaa778ef-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/75ad73a5cf0844d38dc8056170708cb1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75ad73a5cf0844d38dc8056170708cb1-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/fb91f0b38285446bafae24c1a314292c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb91f0b38285446bafae24c1a314292c-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/0465f27c530746a48b0089488b8d591c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0465f27c530746a48b0089488b8d591c-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.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4a19c1f5b21f41929defa342728b0cab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a19c1f5b21f41929defa342728b0cab-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/41f11c03106b4e9980fd39181eaeb03d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41f11c03106b4e9980fd39181eaeb03d-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.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/examples/Two_stage_Stochastic_GemstoneTools.py:1: SyntaxWarning: invalid escape sequence '\i' """ Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 0.0 x_14 = 0.0 x_2 = 1.0 x_3 = 1.0 x_4 = 1.0 x_5 = 1.0 x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 objective= 4190215.0 Minimum total cost: 3208.9570439999998 D S U T0 T1 T2 T3 T4 80.0 50.0 0.0 30.0 + 20.0 + 10.0 + 10.0 + 10.0 + 103.9 50.0 0.0 30.0 + 30.0 + 23.9 + 10.0 + 10.0 + 35.0 50.0 0.0 0.0 - * 0.0 - * 15.0 + 10.0 + 10.0 + 140.6 50.0 10.6 30.0 + 30.0 + 30.0 + 30.0 + 10.0 + 11.1 39.4 1.1 0.0 - * 0.0 - * 0.0 - * 10.0 + 0.0 - 148.9 38.3 28.9 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 x_3 = 0.0 x_4 = 0.0 x_5 = 0.0 x_6 = 1.0 x_7 = 1.0 x_8 = 0.0 x_9 = 1.0 Status: Optimal s_0 = 1.0 s_1 = 0.0 s_2 = 1.5 w_0 = 0.0 w_1 = 1.0 w_2 = 0.0 x_0 = 1.0 x_1 = 1.0 x_10 = 0.0 x_11 = 0.0 x_12 = 0.0 x_13 = 1.0 x_14 = 0.0 x_15 = 1.0 x_16 = 1.0 x_17 = 0.0 x_18 = 1.0 x_19 = 1.0 x_2 = 0.0 x_3 = 1.0 x_4 = 0.0 x_5 = 1.0 x_6 = 0.0 x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 objective= 3.5 Status: Optimal x = 4.0 y = -1.0 z = 6.0 objective= 54.0 Status: Optimal x = 4.0 Reduced Cost = 0.0 y = -1.0 Reduced Cost = 12.0 z = 6.0 Reduced Cost = 0.0 objective= 54.0 Sensitivity Analysis Constraint Shadow Price Slack c1 : x + y <= 5 0.0 2.0 c2 : x + z >= 10 1.0 -0.0 c3 : -y + z = 7 8.0 -0.0 Trying: x = LpVariable("x", 0, 3) Expecting nothing ok Trying: y = LpVariable("y", 0, 1) Expecting nothing ok Trying: prob = LpProblem("myProblem", const.LpMinimize) Expecting nothing ok Trying: prob += x + y <= 2 Expecting nothing ok Trying: prob += -4 * x + y Expecting nothing ok Trying: status = prob.solve(PULP_CBC_CMD(msg=0)) Expecting nothing ok Trying: const.LpStatus[status] Expecting: 'Optimal' ok Trying: value(x) Expecting: 2.0 ok 1 items passed all tests: 8 tests in pulp 8 tests in 1 items. 8 passed and 0 failed. Test passed. Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 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 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 = 300.0 Route_Los_Angeles_Dallas = 0.0 Route_Los_Angeles_San_Diego = 1700.0 Route_Los_Angeles_Tucson = 0.0 Route_Phoenix_Barstow = 200.0 Route_Phoenix_Dallas = 0.0 Route_Phoenix_San_Diego = 0.0 Route_Phoenix_Tucson = 1500.0 Route_San_Francisco_Barstow = 500.0 Route_San_Francisco_Dallas = 1200.0 Route_San_Francisco_San_Diego = 0.0 Route_San_Francisco_Tucson = 0.0 Total Costs = 228100.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Optimal Status: Infeasible Solutions Written to sudokuout.txt Status: Optimal BeefPercent = 66.0 ChickenPercent = 34.0 Total Cost of Ingredients per can = 0.97 Status: Optimal Solution Written to sudokuout.txt Status: Optimal Patt_A = 225.0 Patt_B = 0.0 Patt_C = 75.0 Production Costs = 300.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 210.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8630.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 220.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8660.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 230.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8690.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 240.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8720.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 250.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8750.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 260.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8780.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 270.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8810.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 280.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8840.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 290.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8870.0 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 300.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8900.0 Status: Optimal Route_('Chicago',_'Gary') = 4000.0 Route_('Chicago',_'Tempe') = 2000.0 Route_('Cincinatti',_'Albany') = 2000.0 Route_('Cincinatti',_'Houston') = 3000.0 Route_('Kansas_City',_'Houston') = 4000.0 Route_('Kansas_City',_'Tempe') = 2000.0 Route_('Pittsburgh',_'Chicago') = 3000.0 Route_('Pittsburgh',_'Cincinatti') = 2000.0 Route_('Pittsburgh',_'Gary') = 2000.0 Route_('Pittsburgh',_'Kansas_City') = 3000.0 Route_('Youngstown',_'Albany') = 1000.0 Route_('Youngstown',_'Chicago') = 3000.0 Route_('Youngstown',_'Cincinatti') = 3000.0 Route_('Youngstown',_'Kansas_City') = 3000.0 Total Cost of Transportation = 15005.0 The_Gemstone_Tool_Problem: MAXIMIZE 25.0*production_0_pliers + 40.0*production_0_wrenches + 25.0*production_1_pliers + 40.0*production_1_wrenches + 25.0*production_2_pliers + 22.5*production_2_wrenches + 25.0*production_3_pliers + 22.5*production_3_wrenches + -58*steelpurchase + 0.0 SUBJECT TO Steel_capacity0: production_0_pliers + 1.5 production_0_wrenches - steelpurchase <= 0 molding_capacity0: production_0_pliers + production_0_wrenches <= 21 assembly_capacity0: 0.5 production_0_pliers + 0.3 production_0_wrenches <= 8 capacity_wrenches0: production_0_wrenches <= 15 capacity_pliers0: production_0_pliers <= 16 Steel_capacity1: production_1_pliers + 1.5 production_1_wrenches - steelpurchase <= 0 molding_capacity1: production_1_pliers + production_1_wrenches <= 21 assembly_capacity1: 0.5 production_1_pliers + 0.3 production_1_wrenches <= 10 capacity_wrenches1: production_1_wrenches <= 15 capacity_pliers1: production_1_pliers <= 16 Steel_capacity2: production_2_pliers + 1.5 production_2_wrenches - steelpurchase <= 0 molding_capacity2: production_2_pliers + production_2_wrenches <= 21 assembly_capacity2: 0.5 production_2_pliers + 0.3 production_2_wrenches <= 8 capacity_wrenches2: production_2_wrenches <= 15 capacity_pliers2: production_2_pliers <= 16 Steel_capacity3: production_3_pliers + 1.5 production_3_wrenches - steelpurchase <= 0 molding_capacity3: production_3_pliers + production_3_wrenches <= 21 assembly_capacity3: 0.5 production_3_pliers + 0.3 production_3_wrenches <= 10 capacity_wrenches3: production_3_wrenches <= 15 capacity_pliers3: production_3_pliers <= 16 VARIABLES production_0_pliers Continuous production_0_wrenches Continuous production_1_pliers Continuous production_1_wrenches Continuous production_2_pliers Continuous production_2_wrenches Continuous production_3_pliers Continuous production_3_wrenches Continuous steelpurchase Continuous Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/00c53daf6b18484d85ec86e8b4e3cee0-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/00c53daf6b18484d85ec86e8b4e3cee0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS At line 71 RHS At line 92 BOUNDS At line 93 ENDATA Problem MODEL has 20 rows, 9 columns and 36 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 12 (-8) rows, 9 (0) columns and 28 (-8) elements 0 Obj -0 Dual inf 224.99999 (8) 10 Obj 863.25 Optimal - objective value 863.25 After Postsolve, objective 863.25, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 863.25 - 10 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/6182717e91f24fc1973a513b3de137a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6182717e91f24fc1973a513b3de137a0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS At line 72 RHS At line 81 BOUNDS At line 94 ENDATA Problem MODEL has 8 rows, 12 columns and 24 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 8600 - 0.00 seconds Cgl0004I processed model has 8 rows, 12 columns (12 integer (0 of which binary)) and 24 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0012I Integer solution of 8600 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 8600, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 8600 to 8600 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/934e2f6651964ab381452f74f1283e78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/934e2f6651964ab381452f74f1283e78-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.01 seconds) Cbc0031I 1 added rows had average density of 14 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 14.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/a3147c2fbcd54bc4960abfb70ebf4c39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3147c2fbcd54bc4960abfb70ebf4c39-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS At line 24708 RHS At line 24727 BOUNDS At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 12 Cbc0038I Before mini branch and bound, 3213 integers at bound fixed and 0 continuous Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0001I Search completed - best objective 12, took 0 iterations and 0 nodes (0.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 12 to 12 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/9419cbd661e14dfeabf51b87b219778c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9419cbd661e14dfeabf51b87b219778c-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.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ee0f668665d5411c8084efa37c8ce0a6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/ee0f668665d5411c8084efa37c8ce0a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS At line 14 RHS At line 17 BOUNDS At line 18 ENDATA Problem MODEL has 2 rows, 2 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (0) rows, 2 (0) columns and 4 (0) elements 0 Obj -0 Dual inf 250 (2) 0 Obj -0 Dual inf 250 (2) 2 Obj 3200 Optimal - objective value 3200 Optimal objective 3200 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4df1939b6a534de9b55560751c7e2189-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4df1939b6a534de9b55560751c7e2189-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 36 RHS At line 40 BOUNDS At line 47 ENDATA Problem MODEL has 3 rows, 6 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 251.5 - 0.00 seconds Cgl0003I 0 fixed, 6 tightened bounds, 0 strengthened rows, 0 substitutions Cgl0004I processed model has 3 rows, 6 columns (6 integer (0 of which binary)) and 9 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 251.5 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective 251.5, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 251.5 to 251.5 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 251.50000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/b108fe45995e488ba088f81ee11977a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b108fe45995e488ba088f81ee11977a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS At line 42 RHS At line 48 BOUNDS At line 49 ENDATA Problem MODEL has 5 rows, 6 columns and 25 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 5 (0) rows, 6 (0) columns and 25 (0) elements 0 Obj 0 Primal inf 405.05674 (3) 2 Obj 0.52 Optimal - objective value 0.52 Optimal objective 0.52 - 2 iterations time 0.002 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4cd9ada53aa34580a473d8b1bc34ce01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4cd9ada53aa34580a473d8b1bc34ce01-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 324 After Postsolve, objective 324, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 324 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/1252ffa1f108467688839716b5237398-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1252ffa1f108467688839716b5237398-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.6 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.03996 Cbc0012I Integer solution of -1.6 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.6, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.6 to -1.6 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.60000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/22feef4fe4a2473d8e20eac0d8bff8f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22feef4fe4a2473d8e20eac0d8bff8f2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 23 RHS At line 27 BOUNDS At line 28 ENDATA Problem MODEL has 3 rows, 7 columns and 7 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-7) columns and 0 (-7) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 301.5 After Postsolve, objective 301.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 301.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/3f40de4a2f8e4327bd8fe8a701a738d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f40de4a2f8e4327bd8fe8a701a738d0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 2 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/56081d35732c4c4582691c3888192fac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56081d35732c4c4582691c3888192fac-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 26 RHS At line 30 BOUNDS At line 31 ENDATA Problem MODEL has 3 rows, 8 columns and 9 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-3) columns and 6 (-3) elements 0 Obj 168 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 168 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 276.5 Optimal - objective value 276.5 After Postsolve, objective 276.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 276.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/8008c818b6b84f64b7b59f96c436a78d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8008c818b6b84f64b7b59f96c436a78d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.24444 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1.2 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0001I Search completed - best objective -1.2, took 0 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.22143 to -1.22143 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.20000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/151344e3bee84653bf8e4acd5c018788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/151344e3bee84653bf8e4acd5c018788-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 28 RHS At line 32 BOUNDS At line 33 ENDATA Problem MODEL has 3 rows, 9 columns and 10 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-4) columns and 6 (-4) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/75e7368a772e44b5be00f3eb3315e432-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75e7368a772e44b5be00f3eb3315e432-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/1655637f1c5d4ff2a770514f00627ea5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1655637f1c5d4ff2a770514f00627ea5-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.01 seconds) Cbc0031I 1 added rows had average density of 4 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 4.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 246.5 to 246.5 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/cdaa98c2ab70474aba2c0a798a0621d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdaa98c2ab70474aba2c0a798a0621d8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 21 RHS At line 25 BOUNDS At line 26 ENDATA Problem MODEL has 3 rows, 6 columns and 6 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 0 (-3) rows, 0 (-6) columns and 0 (-6) elements Empty problem - 0 rows, 0 columns and 0 elements Optimal - objective value 251.5 After Postsolve, objective 251.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 251.5 - 0 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/4f05953337ff433a817015f9992c79af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f05953337ff433a817015f9992c79af-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.08571 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0012I Integer solution of -1.05 found by DiveCoefficient after 4 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3.5 Cbc0013I At root node, 2 cuts changed objective from -1.0666667 to -1.05 in 4 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -1.05, took 4 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.06667 to -1.05 Probing was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 4 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 4 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 4 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.05000000 Enumerated nodes: 0 Total iterations: 4 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/ed3a33dd93fe4ecd89de272d0a226434-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed3a33dd93fe4ecd89de272d0a226434-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS At line 24 RHS At line 28 BOUNDS At line 29 ENDATA Problem MODEL has 3 rows, 7 columns and 8 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Presolve 2 (-1) rows, 5 (-2) columns and 6 (-2) elements 0 Obj 138 Primal inf 206.31374 (2) Dual inf 0.99077337 (2) 0 Obj 138 Primal inf 206.31374 (2) Dual inf 3.5946036e+10 (3) 2 Obj 246.5 Optimal - objective value 246.5 After Postsolve, objective 246.5, infeasibilities - dual 0 (0), primal 0 (0) Optimal objective 246.5 - 2 iterations time 0.002, Presolve 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/94986f6c2a8a4853a2b126bdd31053b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94986f6c2a8a4853a2b126bdd31053b2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS At line 23 RHS At line 25 BOUNDS At line 30 ENDATA Problem MODEL has 1 rows, 4 columns and 4 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is -1.02222 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.004995 Cbc0012I Integer solution of -1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 2 Cbc0013I At root node, 3 cuts changed objective from -1.0214286 to -1 in 3 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 2.0 elements, 1 column cuts (1 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 1 (Gomory) - 4 row cuts average 3.2 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0001I Search completed - best objective -0.9999999999999999, took 6 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.02143 to -1 Probing was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 3 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 3 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/d1cf38fccba14acdab316bcc89a94e3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1cf38fccba14acdab316bcc89a94e3d-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.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 command line - /usr/bin/cbc /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.mps mips /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/698df1c6a166472f9d7e58c0afe7bf09-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/698df1c6a166472f9d7e58c0afe7bf09-pulp.mst. MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.00 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0045I MIPStart provided solution with cost 12 Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.03 seconds) Cbc0006I The LP relaxation is infeasible or too expensive Cbc0045I Solution of 12 already found by heuristic Cuts at root node changed objective from 1.79769e+308 to -1.79769e+308 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Gomory was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Knapsack was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Clique was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) MixedIntegerRounding2 was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) FlowCover was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) TwoMirCuts was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ZeroHalf was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 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 26.861s OK (skipped=885) Status: Optimal production_0_pliers = 4.75 production_0_wrenches = 15.0 production_1_pliers = 4.75 production_1_wrenches = 15.0 production_2_pliers = 8.5 production_2_wrenches = 12.5 production_3_pliers = 16.0 production_3_wrenches = 5.0 steelpurchase = 27.25 Total price = 863.25 Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_A_D = 0.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Route_B_D = 900.0 Total Cost of Transportation = 8600.0 Lens: [5, 7, 9] P0 = [0, 0, 0] P1 = [0, 0, 1] P2 = [0, 0, 2] P3 = [0, 1, 0] P4 = [0, 1, 1] P5 = [0, 2, 0] P6 = [1, 0, 0] P7 = [1, 0, 1] P8 = [1, 1, 0] P9 = [1, 2, 0] P10 = [2, 0, 0] P11 = [2, 0, 1] P12 = [2, 1, 0] P13 = [3, 0, 0] P14 = [4, 0, 0] Status: Optimal Patt_P0 = 0.0 Patt_P1 = 0.0 Patt_P10 = 0.0 Patt_P11 = 26.0 Patt_P12 = 0.0 Patt_P13 = 0.0 Patt_P14 = 0.0 Patt_P2 = 137.0 Patt_P3 = 0.0 Patt_P4 = 0.0 Patt_P5 = 0.0 Patt_P6 = 0.0 Patt_P7 = 0.0 Patt_P8 = 0.0 Patt_P9 = 100.0 Surp_5 = 2.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 246.50000000000003 The choosen tables are out of a total of 3213: ('M', 'N') ('E', 'F', 'G') ('A', 'B', 'C', 'D') ('I', 'J', 'K', 'L') ('O', 'P', 'Q', 'R') Status: Optimal Route_A_1 = 300.0 Route_A_2 = 0.0 Route_A_3 = 0.0 Route_A_4 = 0.0 Route_A_5 = 700.0 Route_B_1 = 200.0 Route_B_2 = 900.0 Route_B_3 = 1800.0 Route_B_4 = 200.0 Route_B_5 = 0.0 Total Cost of Transportation = 8600.0 Number_of_Chairs_A = 8.0 Number_of_Chairs_B = 16.0 Total Revenue from Production = 3200.0 Status: Optimal Patt_A = 200.0 Patt_B = 0.0 Patt_C = 100.0 Surp_5 = 50.0 Surp_7 = 0.0 Surp_9 = 0.0 Production Costs = 251.5 Status: Optimal Ingr_BEEF = 60.0 Ingr_CHICKEN = 0.0 Ingr_GEL = 40.0 Ingr_MUTTON = 0.0 Ingr_RICE = 0.0 Ingr_WHEAT = 0.0 Total Cost of Ingredients per can = 0.52 P0 = [1, 0, 0] P1 = [0, 1, 0] P2 = [0, 0, 1] P3 = [4, 0, 0] P4 = [1, 2, 0] P5 = [0, 0, 2] Pattern_P0 = 0 Pattern_P1 = 0 Pattern_P2 = 0 Pattern_P3 = 13 Pattern_P4 = 100 Pattern_P5 = 150 Surplus_5 = 2 Surplus_7 = 0 Surplus_9 = 0 objective = 246.5 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') 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.13 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:261: 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/lib/python3.13/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/mps_lp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/sparse.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/utilities.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/constants.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_examples.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/run_tests.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/highs_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/scip_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/mipcl_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/choco_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/glpk_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/gurobi_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/cplex_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/core.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/coin_api.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__pycache__/__init__.cpython-313.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/scip_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/glpk_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/cplex_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/core.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/coin_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/choco_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/apis/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.win -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/sparse.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/pulp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.13_pulp/build/pulp/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/tests/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-313.pyc /usr/lib/python3.13/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/mipcl_api.py to mipcl_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/highs_api.py to highs_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/glpk_api.py to glpk_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/cplex_api.py to cplex_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/core.py to core.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/coin_api.py to coin_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/apis/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/constants.py to constants.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/utilities.py to utilities.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/sparse.py to sparse.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/pulp.py to pulp.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/__init__.py to __init__.cpython-313.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/pulp/mps_lp.py to mps_lp.cpython-313.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.13/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt running install_scripts Installing pulptest script to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/bin 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:261: 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/lib/python3.12/dist-packages creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/mps_lp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/sparse.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/utilities.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/constants.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__pycache__ creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_examples.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/bin_packing_problem.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/test_pulp.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/run_tests.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/test_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/test_examples.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/run_tests.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/bin_packing_problem.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/tests/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir creating /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__pycache__/__init__.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/solverdir/__init__.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir 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__/highs_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/xpress_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/scip_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/mosek_api.cpython-312.pyc -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/__pycache__ copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/__pycache__/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__/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__/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__/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__/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__/__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/xpress_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/mosek_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/mipcl_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/highs_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/gurobi_api.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/apis/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/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/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/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/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/__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/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.osx -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.linux -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/pulp.cfg.buildout -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/constants.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/utilities.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp copying /build/reproducible-path/python-pulp-2.7.0+dfsg/.pybuild/cpython3_3.12_pulp/build/pulp/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/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/mps_lp.py -> /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_pulp.py to test_pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/test_examples.py to test_examples.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/run_tests.py to run_tests.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/bin_packing_problem.py to bin_packing_problem.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/tests/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/solverdir/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py to xpress_api.cpython-312.pyc /usr/lib/python3.12/dist-packages/pulp/apis/xpress_api.py:322: SyntaxWarning: invalid escape sequence '\ ' byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/scip_api.py to scip_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/mosek_api.py to mosek_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/highs_api.py to highs_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/gurobi_api.py to gurobi_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/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/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/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/coin_api.py to coin_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/apis/choco_api.py to choco_api.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/constants.py to constants.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/utilities.py to utilities.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/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/pulp.py to pulp.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/__init__.py to __init__.cpython-312.pyc byte-compiling /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/pulp/mps_lp.py to mps_lp.cpython-312.pyc running install_egg_info Copying PuLP.egg-info to /build/reproducible-path/python-pulp-2.7.0+dfsg/debian/python3-pulp/usr/lib/python3.12/dist-packages/PuLP-2.7.0.egg-info Skipping SOURCES.txt 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_arm64.buildinfo dpkg-genchanges --build=binary -O../python-pulp_2.7.0+dfsg-4_arm64.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/4109425/tmp/hooks/B01_cleanup starting I: user script /srv/workspace/pbuilder/4109425/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/4109425 and its subdirectories I: Current time: Fri Dec 26 00:12:28 +14 2025 I: pbuilder-time-stamp: 1766657548 + false + set +x Thu Dec 25 10:12:28 UTC 2025 I: Signing ./b2/python-pulp_2.7.0+dfsg-4_arm64.buildinfo as python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc Thu Dec 25 10:12:28 UTC 2025 I: Signed ./b2/python-pulp_2.7.0+dfsg-4_arm64.buildinfo as ./b2/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc Thu Dec 25 10:12:28 UTC 2025 - build #2 for python-pulp/unstable/arm64 on codethink03-arm64 done. Starting cleanup. All cleanup done. Thu Dec 25 10:12:28 UTC 2025 - reproducible_build.sh stopped running as /tmp/jenkins-script-yvsyLV5H, removing. /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV: total 820 drwxr-xr-x 2 jenkins jenkins 4096 Nov 22 03:47 b1 drwxr-xr-x 2 jenkins jenkins 4096 Nov 22 03:49 b2 -rw-r--r-- 1 jenkins jenkins 1595 Sep 1 11:15 python-pulp_2.7.0+dfsg-4.dsc -rw------- 1 jenkins jenkins 820943 Nov 22 03:47 rbuildlog.tnWyVMg /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1: total 924 -rw-r--r-- 1 jenkins jenkins 817882 Nov 22 03:47 build.log -rw-r--r-- 1 jenkins jenkins 13500 Nov 22 03:47 python-pulp_2.7.0+dfsg-4.debian.tar.xz -rw-r--r-- 1 jenkins jenkins 1595 Nov 22 03:47 python-pulp_2.7.0+dfsg-4.dsc -rw-r--r-- 1 jenkins jenkins 6312 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.buildinfo -rw-r--r-- 1 jenkins jenkins 7194 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc -rw-r--r-- 1 jenkins jenkins 1174 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_arm64.changes -rw-r--r-- 1 jenkins jenkins 1378 Nov 22 03:47 python-pulp_2.7.0+dfsg-4_source.changes -rw-r--r-- 1 jenkins jenkins 72400 Nov 22 03:47 python3-pulp_2.7.0+dfsg-4_all.deb /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b2: total 920 -rw-r--r-- 1 jenkins jenkins 819905 Nov 22 03:49 build.log -rw-r--r-- 1 jenkins jenkins 13500 Nov 22 03:49 python-pulp_2.7.0+dfsg-4.debian.tar.xz -rw-r--r-- 1 jenkins jenkins 1595 Nov 22 03:49 python-pulp_2.7.0+dfsg-4.dsc -rw-r--r-- 1 jenkins jenkins 6312 Nov 22 03:49 python-pulp_2.7.0+dfsg-4_arm64.buildinfo -rw-r--r-- 1 jenkins jenkins 7194 Nov 22 03:49 python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc -rw-r--r-- 1 jenkins jenkins 1174 Nov 22 03:49 python-pulp_2.7.0+dfsg-4_arm64.changes -rw-r--r-- 1 jenkins jenkins 1378 Nov 22 03:49 python-pulp_2.7.0+dfsg-4_source.changes -rw-r--r-- 1 jenkins jenkins 72400 Nov 22 03:49 python3-pulp_2.7.0+dfsg-4_all.deb Fri Nov 22 03:49:30 UTC 2024 I: Deleting $TMPDIR on codethink03-arm64.debian.net. Fri Nov 22 03:49:30 UTC 2024 I: python-pulp_2.7.0+dfsg-4_arm64.changes: Format: 1.8 Date: Sun, 01 Sep 2024 16:35:34 +0530 Source: python-pulp Binary: python3-pulp Architecture: all Version: 2.7.0+dfsg-4 Distribution: unstable Urgency: medium Maintainer: Debian Math Team Changed-By: Nilesh Patra Description: python3-pulp - LP modeler - Python 3.x Closes: 1080235 Changes: python-pulp (2.7.0+dfsg-4) unstable; urgency=medium . * Copy examples dir before tests and cleanup to get tests passing (Closes: #1080235) * Bump Standards-Version to 4.7.0 (no changes needed) Checksums-Sha1: 8daa1432b11941d05a13c98cff4bf008cd0730a5 6312 python-pulp_2.7.0+dfsg-4_arm64.buildinfo 13d51602345dd843a0cfd3af0e334c9a5a1642d6 72400 python3-pulp_2.7.0+dfsg-4_all.deb Checksums-Sha256: 62963fcac5c7fcd3d0f1181157ee71730dc8ef330012f514d65f537f6772e612 6312 python-pulp_2.7.0+dfsg-4_arm64.buildinfo 48f34910ec2a49a2a076b88028639b1607a29bfd20728974800d1dc76266a0a3 72400 python3-pulp_2.7.0+dfsg-4_all.deb Files: 928af33fea42b63d3de81a36a4e2b4dd 6312 python optional python-pulp_2.7.0+dfsg-4_arm64.buildinfo dbfa2dd107c45f4be40fcfc8d2553c34 72400 python optional python3-pulp_2.7.0+dfsg-4_all.deb removed '/var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/arm64/python-pulp_2.7.0+dfsg-4.rbuild.log' removed '/var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/arm64/python-pulp_2.7.0+dfsg-4.rbuild.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/logs/unstable/arm64/python-pulp_2.7.0+dfsg-4.build1.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/logs/unstable/arm64/python-pulp_2.7.0+dfsg-4.build2.log.gz' removed '/var/lib/jenkins/userContent/reproducible/debian/buildinfo/unstable/arm64/python-pulp_2.7.0+dfsg-4_arm64.buildinfo' removed '/var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/arm64/python-pulp_2.7.0+dfsg-4.diff.gz' Diff of the two buildlogs: -- --- b1/build.log 2024-11-22 03:47:41.372840750 +0000 +++ b2/build.log 2024-11-22 03:49:29.971933481 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Thu Nov 21 15:45:52 -12 2024 -I: pbuilder-time-stamp: 1732247152 +I: Current time: Fri Dec 26 00:10:44 +14 2025 +I: pbuilder-time-stamp: 1766657444 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration @@ -30,52 +30,84 @@ dpkg-source: info: applying skip_test_on_armel.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/2878175/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/4109425/tmp/hooks/D01_modify_environment starting +debug: Running on codethink03-arm64. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Dec 25 10:10 /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/4109425/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/4109425/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='arm64' - DEBIAN_FRONTEND='noninteractive' + 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]="aarch64-unknown-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=arm64 + DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' - DISTRIBUTION='unstable' - HOME='/root' - HOST_ARCH='arm64' + DIRSTACK=() + DISTRIBUTION=unstable + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=aarch64 + HOST_ARCH=arm64 IFS=' ' - INVOCATION_ID='21c0219a68b24a86a54eea250ad6f401' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='2878175' - PS1='# ' - PS2='> ' + INVOCATION_ID=355203635c5141e7b9dd3801829b1ed7 + LANG=C + LANGUAGE=nl_BE:nl + LC_ALL=C + MACHTYPE=aarch64-unknown-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=4109425 PS4='+ ' - PWD='/' - SHELL='/bin/bash' - SHLVL='2' - SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/pbuilderrc_kljq --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1 --logfile b1/build.log python-pulp_2.7.0+dfsg-4.dsc' - SUDO_GID='109' - SUDO_UID='104' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' - http_proxy='http://192.168.101.4:3128' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/pbuilderrc_J1ON --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.f7vAQdqV/b2 --logfile b2/build.log python-pulp_2.7.0+dfsg-4.dsc' + SUDO_GID=109 + SUDO_UID=104 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' + http_proxy=http://192.168.101.4:3128 I: uname -a - Linux codethink04-arm64 6.1.0-27-cloud-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux + Linux i-capture-the-hostname 6.1.0-27-cloud-arm64 #1 SMP Debian 6.1.115-1 (2024-11-01) aarch64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Aug 4 21:30 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/2878175/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Aug 4 2024 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/4109425/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -199,7 +231,7 @@ Get: 76 http://deb.debian.org/debian unstable/main arm64 python3.13 arm64 3.13.0-2 [730 kB] Get: 77 http://deb.debian.org/debian unstable/main arm64 python3-all arm64 3.12.7-1 [1052 B] Get: 78 http://deb.debian.org/debian unstable/main arm64 python3-pyparsing all 3.1.2-1 [146 kB] -Fetched 37.6 MB in 0s (131 MB/s) +Fetched 37.6 MB in 0s (155 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libpython3.12-minimal:arm64. (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 ... 20084 files and directories currently installed.) @@ -467,8 +499,8 @@ Setting up tzdata (2024b-3) ... Current default time zone: 'Etc/UTC' -Local time is now: Fri Nov 22 03:46:17 UTC 2024. -Universal Time is now: Fri Nov 22 03:46:17 UTC 2024. +Local time is now: Thu Dec 25 10:11:04 UTC 2025. +Universal Time is now: Thu Dec 25 10:11:04 UTC 2025. Run 'dpkg-reconfigure tzdata' if you wish to change it. Setting up libpython3.13-minimal:arm64 (3.13.0-2) ... @@ -542,7 +574,11 @@ Building tag database... -> Finished parsing the build-deps I: Building the package -I: Running cd /build/reproducible-path/python-pulp-2.7.0+dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../python-pulp_2.7.0+dfsg-4_source.changes +I: user script /srv/workspace/pbuilder/4109425/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for unstable +I: user script /srv/workspace/pbuilder/4109425/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 @@ -965,7 +1001,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3b7024752a3542b69e68f0e0b17993db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3b7024752a3542b69e68f0e0b17993db-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1f8cf16f857d437e949de041bb29927c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1f8cf16f857d437e949de041bb29927c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -988,7 +1024,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/779f914e57bc460d92c517831de40e13-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/779f914e57bc460d92c517831de40e13-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/385414f0e85346f89aac0e9befe371e9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/385414f0e85346f89aac0e9befe371e9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -1074,10 +1110,10 @@ Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 14 columns Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.03 seconds Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns -Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.04 seconds) +Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) Cbc0031I 1 added rows had average density of 15 Cbc0013I At root node, 1 cuts changed objective from 4194303.5 to 4190215 in 2 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -1086,7 +1122,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.04 seconds) +Cbc0001I Search completed - best objective 4190215, took 9 iterations and 0 nodes (0.05 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) @@ -1113,7 +1149,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7624dfc79f8b424596919d392d920b35-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7624dfc79f8b424596919d392d920b35-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/63122a6ef6e8494bb0410e4035f211a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/63122a6ef6e8494bb0410e4035f211a4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -1158,7 +1194,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.12 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -1193,33 +1229,33 @@ 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.15 seconds) -Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds +Cbc0038I Mini branch and bound did not improve solution (0.16 seconds) +Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.15 seconds Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes Cbc0014I Cut generator 0 (Probing) - 45 row cuts average 2.1 elements, 1 column cuts (1 active) in 0.018 seconds - new frequency is -100 Cbc0014I Cut generator 1 (Gomory) - 1114 row cuts average 78.1 elements, 0 column cuts (0 active) in 0.034 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.009 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.001 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.82 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.80 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 Probing was tried 100 times and created 46 cuts of which 0 were active after adding rounds of cuts (0.018 seconds) -Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.058 seconds) -Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.009 seconds) +Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) +Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.024 seconds) +FlowCover was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) +TwoMirCuts was tried 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) ImplicationCuts was tried 280 times and created 23 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) @@ -1229,254 +1265,290 @@ Enumerated nodes: 130 Total iterations: 5337 Time (CPU seconds): 0.80 -Time (Wallclock seconds): 0.83 +Time (Wallclock seconds): 0.81 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.80 (Wallclock seconds): 0.83 +Total time (CPU seconds): 0.81 (Wallclock seconds): 0.81 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/361cfdf8c5814efea770c3cca90dfa02-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/30bd6521306041fea690672ced149bd3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30bd6521306041fea690672ced149bd3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1635 RHS -At line 1856 BOUNDS -At line 2067 ENDATA -Problem MODEL has 220 rows, 210 columns and 780 elements +At line 1654 RHS +At line 1875 BOUNDS +At line 2086 ENDATA +Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -134.966 - 0.00 seconds -Cgl0003I 0 fixed, 0 tightened bounds, 1 strengthened rows, 0 substitutions -Cgl0004I processed model has 220 rows, 210 columns (210 integer (210 of which binary)) and 781 elements -Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 22 integers unsatisfied sum - 6.42583 -Cbc0038I Pass 1: suminf. 0.83366 (3) obj. -133.251 iterations 89 -Cbc0038I Pass 2: suminf. 0.48842 (2) obj. -131.836 iterations 1 -Cbc0038I Solution found of -127.15 -Cbc0038I Before mini branch and bound, 186 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 7 columns -Cbc0038I Mini branch and bound improved solution from -127.15 to -132.45 (0.03 seconds) -Cbc0038I Round again with cutoff of -132.75 -Cbc0038I Reduced cost fixing fixed 19 variables on major pass 2 -Cbc0038I Pass 3: suminf. 0.83366 (3) obj. -133.251 iterations 0 -Cbc0038I Pass 4: suminf. 0.60514 (3) obj. -132.75 iterations 4 -Cbc0038I Pass 5: suminf. 0.63773 (3) obj. -132.75 iterations 30 -Cbc0038I Pass 6: suminf. 0.61397 (3) obj. -132.75 iterations 4 -Cbc0038I Pass 7: suminf. 0.44383 (2) obj. -132.81 iterations 34 -Cbc0038I Pass 8: suminf. 0.42821 (2) obj. -132.75 iterations 5 -Cbc0038I Pass 9: suminf. 0.61166 (2) obj. -132.75 iterations 30 -Cbc0038I Pass 10: suminf. 0.09859 (1) obj. -133.194 iterations 31 -Cbc0038I Pass 11: suminf. 0.24194 (1) obj. -132.75 iterations 11 -Cbc0038I Pass 12: suminf. 1.04715 (4) obj. -132.75 iterations 72 -Cbc0038I Pass 13: suminf. 0.78445 (3) obj. -132.75 iterations 84 -Cbc0038I Pass 14: suminf. 0.92284 (3) obj. -132.75 iterations 63 -Cbc0038I Pass 15: suminf. 0.92284 (3) obj. -132.75 iterations 2 -Cbc0038I Pass 16: suminf. 0.91711 (3) obj. -132.75 iterations 65 -Cbc0038I Pass 17: suminf. 1.24080 (4) obj. -132.75 iterations 58 -Cbc0038I Pass 18: suminf. 0.66611 (3) obj. -132.75 iterations 78 -Cbc0038I Pass 19: suminf. 0.75401 (3) obj. -132.75 iterations 30 -Cbc0038I Pass 20: suminf. 0.73025 (3) obj. -132.75 iterations 4 -Cbc0038I Pass 21: suminf. 0.74552 (3) obj. -132.75 iterations 28 -Cbc0038I Pass 22: suminf. 0.53527 (3) obj. -132.75 iterations 94 -Cbc0038I Pass 23: suminf. 0.73025 (3) obj. -132.75 iterations 63 -Cbc0038I Pass 24: suminf. 0.95457 (4) obj. -132.75 iterations 44 -Cbc0038I Pass 25: suminf. 0.93934 (4) obj. -132.75 iterations 8 -Cbc0038I Pass 26: suminf. 0.90755 (3) obj. -132.75 iterations 101 -Cbc0038I Pass 27: suminf. 0.90755 (3) obj. -132.75 iterations 4 -Cbc0038I Pass 28: suminf. 0.33121 (3) obj. -132.75 iterations 76 -Cbc0038I Pass 29: suminf. 0.33121 (3) obj. -132.75 iterations 2 -Cbc0038I Pass 30: suminf. 1.03450 (3) obj. -132.75 iterations 64 -Cbc0038I Pass 31: suminf. 0.48626 (3) obj. -132.75 iterations 33 -Cbc0038I Pass 32: suminf. 0.57265 (3) obj. -132.75 iterations 27 +Continuous objective value is -130.848 - 0.00 seconds +Cgl0004I processed model has 164 rows, 159 columns (159 integer (159 of which binary)) and 597 elements +Cbc0038I Initial state - 16 integers unsatisfied sum - 0.179775 +Cbc0038I Pass 1: suminf. 0.01316 (1) obj. -130.801 iterations 60 +Cbc0038I Solution found of -127.1 +Cbc0038I Before mini branch and bound, 142 integers at bound fixed and 0 continuous +Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 3 columns +Cbc0038I Mini branch and bound improved solution from -127.1 to -130.65 (0.02 seconds) +Cbc0038I Round again with cutoff of -130.67 +Cbc0038I Reduced cost fixing fixed 79 variables on major pass 2 +Cbc0038I Pass 2: suminf. 0.01316 (1) obj. -130.801 iterations 0 +Cbc0038I Pass 3: suminf. 0.04806 (1) obj. -130.67 iterations 6 +Cbc0038I Pass 4: suminf. 0.25084 (2) obj. -130.67 iterations 44 +Cbc0038I Pass 5: suminf. 0.10312 (2) obj. -130.67 iterations 26 +Cbc0038I Pass 6: suminf. 0.11579 (2) obj. -130.67 iterations 41 +Cbc0038I Pass 7: suminf. 0.09495 (2) obj. -130.67 iterations 23 +Cbc0038I Pass 8: suminf. 0.11579 (2) obj. -130.67 iterations 32 +Cbc0038I Pass 9: suminf. 0.20357 (2) obj. -130.67 iterations 34 +Cbc0038I Pass 10: suminf. 0.44543 (16) obj. -130.67 iterations 5 +Cbc0038I Pass 11: suminf. 0.44725 (2) obj. -130.67 iterations 3 +Cbc0038I Pass 12: suminf. 0.06801 (1) obj. -130.67 iterations 69 +Cbc0038I Pass 13: suminf. 0.09763 (2) obj. -130.67 iterations 25 +Cbc0038I Pass 14: suminf. 0.10312 (2) obj. -130.67 iterations 9 +Cbc0038I Pass 15: suminf. 0.25084 (2) obj. -130.67 iterations 16 +Cbc0038I Pass 16: suminf. 0.20357 (2) obj. -130.67 iterations 47 +Cbc0038I Pass 17: suminf. 0.11579 (2) obj. -130.67 iterations 28 +Cbc0038I Pass 18: suminf. 0.44543 (16) obj. -130.67 iterations 19 +Cbc0038I Pass 19: suminf. 0.44543 (16) obj. -130.67 iterations 0 +Cbc0038I Pass 20: suminf. 0.11579 (2) obj. -130.67 iterations 35 +Cbc0038I Pass 21: suminf. 0.10903 (2) obj. -130.67 iterations 33 +Cbc0038I Pass 22: suminf. 0.47639 (16) obj. -130.67 iterations 18 +Cbc0038I Pass 23: suminf. 0.25084 (2) obj. -130.67 iterations 3 +Cbc0038I Pass 24: suminf. 0.25084 (2) obj. -130.67 iterations 0 +Cbc0038I Pass 25: suminf. 0.08722 (2) obj. -130.67 iterations 46 +Cbc0038I Pass 26: suminf. 0.57526 (16) obj. -130.67 iterations 22 +Cbc0038I Pass 27: suminf. 0.25084 (2) obj. -130.67 iterations 15 +Cbc0038I Pass 28: suminf. 0.44543 (16) obj. -130.67 iterations 15 +Cbc0038I Pass 29: suminf. 0.44543 (16) obj. -130.67 iterations 0 +Cbc0038I Pass 30: suminf. 0.06024 (2) obj. -130.67 iterations 34 +Cbc0038I Pass 31: suminf. 0.44543 (16) obj. -130.67 iterations 45 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 175 integers at bound fixed and 0 continuous -Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 12 columns -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) -Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -132.45 - took 0.04 seconds -Cbc0012I Integer solution of -132.45 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) -Cbc0038I Full problem 220 rows 210 columns, reduced to 6 rows 5 columns -Cbc0012I Integer solution of -132.7 found by DiveCoefficient after 9 iterations and 0 nodes (0.07 seconds) -Cbc0031I 4 added rows had average density of 7 -Cbc0013I At root node, 4 cuts changed objective from -134.96566 to -132.7 in 3 passes -Cbc0014I Cut generator 0 (Probing) - 2 row cuts average 10.0 elements, 7 column cuts (7 active) in 0.000 seconds - new frequency is 1 +Cbc0038I Before mini branch and bound, 138 integers at bound fixed and 0 continuous +Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 2 columns +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of -130.65 - took 0.03 seconds +Cbc0012I Integer solution of -130.65 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Full problem 164 rows 159 columns, reduced to 2 rows 2 columns +Cbc0006I The LP relaxation is infeasible or too expensive +Cbc0013I At root node, 0 cuts changed objective from -130.84775 to -130.84775 in 1 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 8 column cuts (8 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) - 3 row cuts average 6.7 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) - 6 row cuts average 7.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0014I Cut generator 7 (ZeroHalf) - 2 row cuts average 19.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -132.7, took 9 iterations and 0 nodes (0.07 seconds) -Cbc0035I Maximum depth 0, 20 variables fixed on reduced cost -Cuts at root node changed objective from -134.966 to -132.7 -Probing was tried 3 times and created 9 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Gomory was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -Knapsack was tried 3 times and created 3 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 6 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 3 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +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 -130.6499999999999, took 0 iterations and 0 nodes (0.05 seconds) +Cbc0035I Maximum depth 0, 79 variables fixed on reduced cost +Cuts at root node changed objective from -130.848 to -130.848 +Probing was tried 1 times and created 9 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: -132.70000000 +Objective value: -130.65000000 Enumerated nodes: 0 -Total iterations: 9 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +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.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bcd86eb39bd04cd68ce02f08b049e09d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bcd86eb39bd04cd68ce02f08b049e09d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ef5d895a076a4194ac9ccaf76dbaa1b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ef5d895a076a4194ac9ccaf76dbaa1b0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS -At line 121 RHS -At line 125 BOUNDS -At line 146 ENDATA -Problem MODEL has 3 rows, 26 columns and 66 elements +At line 120 RHS +At line 124 BOUNDS +At line 145 ENDATA +Problem MODEL has 3 rows, 26 columns and 65 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds -Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 66 elements -Cbc0038I Initial state - 3 integers unsatisfied sum - 1.13548 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 73.5 iterations 3 -Cbc0038I Solution found of 73.5 -Cbc0038I Relaxing continuous gives 73.5 +Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.973708 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 60 iterations 3 +Cbc0038I Solution found of 60 +Cbc0038I Relaxing continuous gives 60 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 5 columns -Cbc0038I Mini branch and bound improved solution from 73.5 to 60.5 (0.01 seconds) -Cbc0038I Round again with cutoff of 54.45 -Cbc0038I Pass 2: suminf. 0.11272 (1) obj. 54.45 iterations 1 -Cbc0038I Pass 3: suminf. 0.37992 (2) obj. 54.45 iterations 4 -Cbc0038I Pass 4: suminf. 0.37331 (3) obj. 54.45 iterations 4 -Cbc0038I Pass 5: suminf. 0.29454 (1) obj. 54.45 iterations 4 -Cbc0038I Pass 6: suminf. 0.39345 (1) obj. 54.45 iterations 3 -Cbc0038I Pass 7: suminf. 0.25035 (1) obj. 54.45 iterations 2 -Cbc0038I Pass 8: suminf. 0.23625 (2) obj. 54.45 iterations 6 -Cbc0038I Pass 9: suminf. 0.34502 (2) obj. 54.45 iterations 3 -Cbc0038I Pass 10: suminf. 0.23625 (2) obj. 54.45 iterations 2 -Cbc0038I Pass 11: suminf. 1.05750 (3) obj. 54.45 iterations 7 -Cbc0038I Pass 12: suminf. 0.52585 (2) obj. 54.45 iterations 2 -Cbc0038I Pass 13: suminf. 0.03237 (1) obj. 54.45 iterations 4 -Cbc0038I Pass 14: suminf. 0.50626 (2) obj. 54.45 iterations 4 -Cbc0038I Pass 15: suminf. 0.46754 (2) obj. 54.45 iterations 5 -Cbc0038I Pass 16: suminf. 0.22550 (1) obj. 54.45 iterations 4 -Cbc0038I Pass 17: suminf. 0.22562 (2) obj. 54.45 iterations 4 -Cbc0038I Pass 18: suminf. 0.42671 (2) obj. 54.45 iterations 3 -Cbc0038I Pass 19: suminf. 0.14661 (1) obj. 54.45 iterations 2 -Cbc0038I Pass 20: suminf. 0.46446 (1) obj. 54.45 iterations 3 -Cbc0038I Pass 21: suminf. 0.46394 (2) obj. 54.45 iterations 3 -Cbc0038I Pass 22: suminf. 0.31979 (1) obj. 54.45 iterations 3 -Cbc0038I Pass 23: suminf. 0.46141 (1) obj. 54.45 iterations 2 -Cbc0038I Pass 24: suminf. 0.46159 (2) obj. 54.45 iterations 9 -Cbc0038I Pass 25: suminf. 0.64270 (3) obj. 54.45 iterations 3 -Cbc0038I Pass 26: suminf. 0.65055 (2) obj. 54.45 iterations 6 -Cbc0038I Pass 27: suminf. 0.00000 (0) obj. 54.45 iterations 2 -Cbc0038I Solution found of 54.45 -Cbc0038I Relaxing continuous gives 49.5 -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 49.5 to 8.5 (0.02 seconds) -Cbc0038I Round again with cutoff of 6.79999 -Cbc0038I Pass 28: suminf. 0.55893 (2) obj. 6.79999 iterations 1 -Cbc0038I Pass 29: suminf. 0.72720 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 30: suminf. 0.65402 (2) obj. 6.79999 iterations 4 -Cbc0038I Pass 31: suminf. 0.96879 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 32: suminf. 0.56864 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 33: suminf. 1.02816 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 34: suminf. 0.72462 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 35: suminf. 0.39468 (2) obj. 6.79999 iterations 6 -Cbc0038I Pass 36: suminf. 0.69176 (2) obj. 6.79999 iterations 5 -Cbc0038I Pass 37: suminf. 0.64807 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 38: suminf. 0.64657 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 39: suminf. 0.64657 (3) obj. 6.79999 iterations 0 -Cbc0038I Pass 40: suminf. 0.85388 (3) obj. 6.79999 iterations 5 -Cbc0038I Pass 41: suminf. 0.69811 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 42: suminf. 1.12985 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 43: suminf. 0.52410 (2) obj. 6.79999 iterations 4 -Cbc0038I Pass 44: suminf. 0.21566 (2) obj. 6.79999 iterations 3 -Cbc0038I Pass 45: suminf. 0.85968 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 46: suminf. 0.41789 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 47: suminf. 0.65140 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 48: suminf. 0.54313 (3) obj. 6.79999 iterations 1 -Cbc0038I Pass 49: suminf. 1.13535 (3) obj. 6.79999 iterations 4 -Cbc0038I Pass 50: suminf. 0.59074 (3) obj. 6.79999 iterations 5 -Cbc0038I Pass 51: suminf. 0.76947 (2) obj. 6.79999 iterations 2 -Cbc0038I Pass 52: suminf. 0.87409 (3) obj. 6.79999 iterations 5 -Cbc0038I Pass 53: suminf. 0.77689 (2) obj. 6.79999 iterations 4 -Cbc0038I Pass 54: suminf. 0.87409 (3) obj. 6.79999 iterations 2 -Cbc0038I Pass 55: suminf. 0.67975 (3) obj. 6.79999 iterations 6 -Cbc0038I Pass 56: suminf. 0.67975 (3) obj. 6.79999 iterations 0 -Cbc0038I Pass 57: suminf. 0.94944 (3) obj. 6.79999 iterations 6 +Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns +Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) +Cbc0038I Round again with cutoff of 54 +Cbc0038I Pass 2: suminf. 0.05172 (1) obj. 54 iterations 1 +Cbc0038I Pass 3: suminf. 0.46087 (1) obj. 54 iterations 3 +Cbc0038I Pass 4: suminf. 0.00877 (1) obj. 54 iterations 3 +Cbc0038I Pass 5: suminf. 0.27184 (1) obj. 54 iterations 3 +Cbc0038I Pass 6: suminf. 0.19984 (2) obj. 54 iterations 3 +Cbc0038I Pass 7: suminf. 0.27184 (1) obj. 54 iterations 3 +Cbc0038I Pass 8: suminf. 0.59640 (3) obj. 54 iterations 12 +Cbc0038I Pass 9: suminf. 0.46602 (1) obj. 54 iterations 5 +Cbc0038I Pass 10: suminf. 0.18243 (1) obj. 54 iterations 5 +Cbc0038I Pass 11: suminf. 0.50355 (2) obj. 54 iterations 3 +Cbc0038I Pass 12: suminf. 0.75769 (3) obj. 54 iterations 11 +Cbc0038I Pass 13: suminf. 0.39742 (3) obj. 54 iterations 2 +Cbc0038I Pass 14: suminf. 0.29734 (2) obj. 54 iterations 2 +Cbc0038I Pass 15: suminf. 0.13592 (1) obj. 54 iterations 5 +Cbc0038I Pass 16: suminf. 0.29915 (1) obj. 54 iterations 4 +Cbc0038I Pass 17: suminf. 0.25446 (2) obj. 54 iterations 4 +Cbc0038I Pass 18: suminf. 0.39646 (2) obj. 54 iterations 7 +Cbc0038I Pass 19: suminf. 0.00855 (1) obj. 54 iterations 2 +Cbc0038I Pass 20: suminf. 0.47009 (1) obj. 54 iterations 3 +Cbc0038I Pass 21: suminf. 0.36283 (1) obj. 54 iterations 3 +Cbc0038I Pass 22: suminf. 0.30955 (2) obj. 54 iterations 8 +Cbc0038I Pass 23: suminf. 0.27438 (2) obj. 54 iterations 4 +Cbc0038I Pass 24: suminf. 0.87326 (2) obj. 54 iterations 7 +Cbc0038I Pass 25: suminf. 0.29054 (1) obj. 54 iterations 3 +Cbc0038I Pass 26: suminf. 0.32479 (1) obj. 54 iterations 2 +Cbc0038I Pass 27: suminf. 0.37018 (2) obj. 54 iterations 8 +Cbc0038I Pass 28: suminf. 0.37018 (2) obj. 54 iterations 0 +Cbc0038I Pass 29: suminf. 0.06725 (2) obj. 54 iterations 5 +Cbc0038I Pass 30: suminf. 0.06725 (2) obj. 54 iterations 0 +Cbc0038I Pass 31: suminf. 0.18145 (3) obj. 54 iterations 3 +Cbc0038I Rounding solution of 56 is better than previous of 60 + +Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 22 columns +Cbc0038I Mini branch and bound improved solution from 56 to 9 (0.02 seconds) +Cbc0038I Round again with cutoff of 7.19999 +Cbc0038I Pass 31: suminf. 0.66252 (3) obj. 7.19999 iterations 3 +Cbc0038I Pass 32: suminf. 0.97808 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 33: suminf. 0.97808 (3) obj. 7.19999 iterations 0 +Cbc0038I Pass 34: suminf. 0.66252 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 35: suminf. 0.64103 (3) obj. 7.19999 iterations 5 +Cbc0038I Pass 36: suminf. 0.26166 (3) obj. 7.19999 iterations 4 +Cbc0038I Pass 37: suminf. 1.14189 (3) obj. 7.19999 iterations 4 +Cbc0038I Pass 38: suminf. 0.44329 (2) obj. 7.19999 iterations 3 +Cbc0038I Pass 39: suminf. 0.26166 (3) obj. 7.19999 iterations 3 +Cbc0038I Pass 40: suminf. 0.64192 (3) obj. 7.19999 iterations 7 +Cbc0038I Pass 41: suminf. 0.49758 (2) obj. 7.19999 iterations 3 +Cbc0038I Pass 42: suminf. 0.86088 (3) obj. 7.19999 iterations 3 +Cbc0038I Pass 43: suminf. 0.57305 (3) obj. 7.19999 iterations 15 +Cbc0038I Pass 44: suminf. 0.34310 (1) obj. 7.19999 iterations 3 +Cbc0038I Pass 45: suminf. 0.58157 (2) obj. 7.19999 iterations 4 +Cbc0038I Pass 46: suminf. 0.40135 (2) obj. 7.19999 iterations 2 +Cbc0038I Pass 47: suminf. 0.43320 (3) obj. 7.19999 iterations 9 +Cbc0038I Pass 48: suminf. 1.23824 (3) obj. 7.19999 iterations 4 +Cbc0038I Pass 49: suminf. 1.23824 (3) obj. 7.19999 iterations 0 +Cbc0038I Pass 50: suminf. 0.31737 (3) obj. 7.19999 iterations 3 +Cbc0038I Pass 51: suminf. 0.31737 (3) obj. 7.19999 iterations 0 +Cbc0038I Pass 52: suminf. 1.10317 (3) obj. 7.19999 iterations 4 +Cbc0038I Pass 53: suminf. 0.56045 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 54: suminf. 0.42889 (3) obj. 7.19999 iterations 1 +Cbc0038I Pass 55: suminf. 0.93104 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 56: suminf. 0.31737 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 57: suminf. 1.10317 (3) obj. 7.19999 iterations 4 +Cbc0038I Pass 58: suminf. 0.56045 (3) obj. 7.19999 iterations 2 +Cbc0038I Pass 59: suminf. 0.42889 (3) obj. 7.19999 iterations 1 +Cbc0038I Pass 60: suminf. 0.93104 (3) obj. 7.19999 iterations 2 Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 5 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 8.5 - took 0.03 seconds -Cbc0012I Integer solution of 8.5 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0031I 5 added rows had average density of 15.8 -Cbc0013I At root node, 5 cuts changed objective from 0 to 0.5 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (6 active) in 0.003 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 615 row cuts average 25.7 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is 1 -Cbc0014I Cut generator 2 (Knapsack) - 395 row cuts average 11.9 elements, 0 column cuts (0 active) in 0.017 seconds - new frequency is 1 +Cbc0038I Before mini branch and bound, 4 integers at bound fixed and 0 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 22 columns +Cbc0038I Mini branch and bound improved solution from 9 to 7 (0.04 seconds) +Cbc0038I Round again with cutoff of 4.89999 +Cbc0038I Pass 60: suminf. 0.70980 (3) obj. 4.89999 iterations 0 +Cbc0038I Pass 61: suminf. 1.02408 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 62: suminf. 1.02408 (3) obj. 4.89999 iterations 0 +Cbc0038I Pass 63: suminf. 0.70980 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 64: suminf. 1.07450 (3) obj. 4.89999 iterations 11 +Cbc0038I Pass 65: suminf. 0.85986 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 66: suminf. 1.03180 (3) obj. 4.89999 iterations 1 +Cbc0038I Pass 67: suminf. 0.56111 (3) obj. 4.89999 iterations 13 +Cbc0038I Pass 68: suminf. 0.29502 (2) obj. 4.89999 iterations 4 +Cbc0038I Pass 69: suminf. 0.39391 (3) obj. 4.89999 iterations 3 +Cbc0038I Pass 70: suminf. 0.35363 (2) obj. 4.89999 iterations 3 +Cbc0038I Pass 71: suminf. 0.66383 (3) obj. 4.89999 iterations 3 +Cbc0038I Pass 72: suminf. 0.51683 (3) obj. 4.89999 iterations 6 +Cbc0038I Pass 73: suminf. 0.65475 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 74: suminf. 1.03902 (3) obj. 4.89999 iterations 8 +Cbc0038I Pass 75: suminf. 0.71511 (3) obj. 4.89999 iterations 3 +Cbc0038I Pass 76: suminf. 0.55199 (3) obj. 4.89999 iterations 3 +Cbc0038I Pass 77: suminf. 0.65550 (3) obj. 4.89999 iterations 1 +Cbc0038I Pass 78: suminf. 0.96025 (3) obj. 4.89999 iterations 6 +Cbc0038I Pass 79: suminf. 0.83583 (2) obj. 4.89999 iterations 4 +Cbc0038I Pass 80: suminf. 0.87447 (3) obj. 4.89999 iterations 3 +Cbc0038I Pass 81: suminf. 0.83375 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 82: suminf. 0.47035 (2) obj. 4.89999 iterations 3 +Cbc0038I Pass 83: suminf. 0.38513 (2) obj. 4.89999 iterations 4 +Cbc0038I Pass 84: suminf. 0.51771 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 85: suminf. 0.92162 (3) obj. 4.89999 iterations 4 +Cbc0038I Pass 86: suminf. 0.48953 (3) obj. 4.89999 iterations 4 +Cbc0038I Pass 87: suminf. 0.89090 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 88: suminf. 0.61455 (3) obj. 4.89999 iterations 2 +Cbc0038I Pass 89: suminf. 0.78014 (3) obj. 4.89999 iterations 3 +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 did not improve solution (0.05 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 7 - took 0.05 seconds +Cbc0012I Integer solution of 7 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0031I 3 added rows had average density of 22.666667 +Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.002 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 542 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.013 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 207 row cuts average 10.2 elements, 0 column cuts (0 active) in 0.008 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) - 569 row cuts average 18.0 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is 1 -Cbc0014I Cut generator 5 (FlowCover) - 69 row cuts average 8.7 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 502 row cuts average 18.9 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 8.5 best solution, best possible 0.5 (0.14 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 19 columns -Cbc0004I Integer solution of 6.5 found after 7147 iterations and 159 nodes (0.38 seconds) -Cbc0004I Integer solution of 4.5 found after 7621 iterations and 169 nodes (0.39 seconds) +Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 507 row cuts average 17.8 elements, 0 column cuts (0 active) in 0.005 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 36 row cuts average 8.1 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 356 row cuts average 18.6 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 7 best solution, best possible 0 (0.13 seconds) +Cbc0016I Integer solution of 4 found by strong branching after 973 iterations and 41 nodes (0.15 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0016I Integer solution of 3 found by strong branching after 2874 iterations and 370 nodes (0.24 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0004I Integer solution of 1 found after 3989 iterations and 587 nodes (0.31 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0012I Integer solution of 3.5 found by DiveCoefficient after 25261 iterations and 523 nodes (0.93 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 21 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0010I After 1000 nodes, 9 on tree, 1 best solution, best possible 0 (0.42 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0010I After 1000 nodes, 3 on tree, 3.5 best solution, best possible 0.5 (1.59 seconds) -Cbc0001I Search completed - best objective 3.5, took 104343 iterations and 6110 nodes (2.91 seconds) -Cbc0032I Strong branching done 13820 times (70997 iterations), fathomed 74 nodes and fixed 504 variables -Cbc0041I Maximum depth 12, 1194 variables fixed on reduced cost (complete fathoming 347 times, 4212 nodes taking 15962 iterations) -Cuts at root node changed objective from 0 to 0.5 -Probing was tried 100 times and created 2 cuts of which 5 were active after adding rounds of cuts (0.003 seconds) -Gomory was tried 5453 times and created 21098 cuts of which 0 were active after adding rounds of cuts (0.278 seconds) -Knapsack was tried 5456 times and created 12707 cuts of which 0 were active after adding rounds of cuts (0.484 seconds) +Cbc0001I Search completed - best objective 1, took 14816 iterations and 4531 nodes (0.56 seconds) +Cbc0032I Strong branching done 7050 times (18905 iterations), fathomed 452 nodes and fixed 363 variables +Cbc0041I Maximum depth 12, 515 variables fixed on reduced cost (complete fathoming 238 times, 3013 nodes taking 6760 iterations) +Cuts at root node changed objective from 0 to 0 +Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.002 seconds) +Gomory was tried 100 times and created 542 cuts of which 0 were active after adding rounds of cuts (0.013 seconds) +Knapsack was tried 100 times and created 207 cuts of which 0 were active after adding rounds of cuts (0.008 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 5456 times and created 26211 cuts of which 0 were active after adding rounds of cuts (0.308 seconds) -FlowCover was tried 100 times and created 69 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -TwoMirCuts was tried 5453 times and created 16424 cuts of which 0 were active after adding rounds of cuts (0.169 seconds) +MixedIntegerRounding2 was tried 100 times and created 507 cuts of which 0 were active after adding rounds of cuts (0.005 seconds) +FlowCover was tried 100 times and created 36 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +TwoMirCuts was tried 100 times and created 356 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 3.50000000 -Enumerated nodes: 6110 -Total iterations: 104343 -Time (CPU seconds): 2.84 -Time (Wallclock seconds): 2.92 +Objective value: 1.00000000 +Enumerated nodes: 4531 +Total iterations: 14816 +Time (CPU seconds): 0.46 +Time (Wallclock seconds): 0.57 Option for printingOptions changed from normal to all -Total time (CPU seconds): 2.84 (Wallclock seconds): 2.92 +Total time (CPU seconds): 0.46 (Wallclock seconds): 0.57 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/90061b971f6d40f095d6e45caa07ac21-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90061b971f6d40f095d6e45caa07ac21-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6914997a5dc84c73b7f0cd3c9aec64cd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6914997a5dc84c73b7f0cd3c9aec64cd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1499,7 +1571,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ffabd6ea41824531bb89b88ed6677f75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ffabd6ea41824531bb89b88ed6677f75-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/bdce000063374b6a9f43f8a473926cd7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bdce000063374b6a9f43f8a473926cd7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1526,7 +1598,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/659b82c0bb4c4530aedfee54e0707d91-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7f85000352454eb08160c0b6a3f00585-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7f85000352454eb08160c0b6a3f00585-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -1567,7 +1639,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2530a16774fc408ea70f8ab62a84f5f7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2530a16774fc408ea70f8ab62a84f5f7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/be03dbcf581440069b62f88cc5e4ad7c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/be03dbcf581440069b62f88cc5e4ad7c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -1581,7 +1653,7 @@ 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 14 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 228100 found by DiveCoefficient after 14 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 @@ -1591,7 +1663,7 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 4 row cuts average 4.5 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective 228100, took 14 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective 228100, took 14 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) @@ -1608,7 +1680,7 @@ Objective value: 228100.00000000 Enumerated nodes: 0 Total iterations: 14 -Time (CPU seconds): 0.01 +Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all @@ -1618,7 +1690,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/aada24fce3294bf8a3a79cd98467c267-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aada24fce3294bf8a3a79cd98467c267-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/644dbe50d8d04aec8dc30136555edcc5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/644dbe50d8d04aec8dc30136555edcc5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -1671,7 +1743,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3345af0068634c889fcfd510a7e5f877-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3345af0068634c889fcfd510a7e5f877-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/640c1968cea340228072e3773a5ccd5b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/640c1968cea340228072e3773a5ccd5b-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -1709,16 +1781,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.03 -Time (Wallclock seconds): 0.04 +Time (Wallclock seconds): 0.03 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9fc426b2d4742e2a05bb72f5a8c2a00-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/91cf9424f70b468cab03d4026e3fbbe5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91cf9424f70b468cab03d4026e3fbbe5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -1743,9 +1815,9 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 28 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 @@ -1767,13 +1839,13 @@ Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cf23d7698d904c179ffd6315b0f714c9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cf23d7698d904c179ffd6315b0f714c9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f09a0623380b4494806e364938f38bfe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f09a0623380b4494806e364938f38bfe-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -1798,10 +1870,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 26 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) +Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) 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) @@ -1818,17 +1890,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 +Time (CPU seconds): 0.08 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/328392d437484d6d902feefba39c660f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/328392d437484d6d902feefba39c660f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5e8d9d67dab04c93a74d89eab713842c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5e8d9d67dab04c93a74d89eab713842c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -1852,9 +1924,9 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 @@ -1882,7 +1954,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/907c223330a64878a7fc58750b0ae5fa-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/907c223330a64878a7fc58750b0ae5fa-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c36708bd546c46a3bc42337a30b71932-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c36708bd546c46a3bc42337a30b71932-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -1923,17 +1995,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 +Time (CPU seconds): 0.05 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d7fff2cf58be4117a59c69097a44205e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d7fff2cf58be4117a59c69097a44205e-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/951feb97a37049528b46b021ebb85a9d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/951feb97a37049528b46b021ebb85a9d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -1975,17 +2047,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.04 -Time (Wallclock seconds): 0.05 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/90bb325226b74ac4b36d69f0564cb4c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/90bb325226b74ac4b36d69f0564cb4c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/17e4c10f556e4787bfb22bd1ddc0711d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/17e4c10f556e4787bfb22bd1ddc0711d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -2026,17 +2098,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 +Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dc6383586fb0462f90165f0c45839b7a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dc6383586fb0462f90165f0c45839b7a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6f1fc3900a784e14aba03a1d3ae2862c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6f1fc3900a784e14aba03a1d3ae2862c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -2078,17 +2150,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 +Time (CPU seconds): 0.07 Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2974c407efd744d6b9205bab6b9c1014-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2974c407efd744d6b9205bab6b9c1014-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5c7a9c5768a841379ef79b42fc18bf25-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5c7a9c5768a841379ef79b42fc18bf25-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -2108,10 +2180,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) +Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) 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) @@ -2129,16 +2201,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ac34bc61df914f93b6fe82df2a183b0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ac34bc61df914f93b6fe82df2a183b0f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4a2353f2a5d44d129d8f0d3d0082e710-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a2353f2a5d44d129d8f0d3d0082e710-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -2182,13 +2254,13 @@ Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f25457a716bc4d7290391e764dcf16fb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f25457a716bc4d7290391e764dcf16fb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d0c1f5c828aa423ba6684a9a13025bd3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d0c1f5c828aa423ba6684a9a13025bd3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -2220,17 +2292,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/96a1bc0102cc445da6fa0ff9d0d85344-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96a1bc0102cc445da6fa0ff9d0d85344-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b7cb3be160be4dbbbe57ccf127a5146f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b7cb3be160be4dbbbe57ccf127a5146f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -2261,17 +2333,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.09 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.09 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c2fe0db21d624b19b22ec277d257c4f4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c2fe0db21d624b19b22ec277d257c4f4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ed271a6b1ca24ab8b34cd4fe1c3e8135-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed271a6b1ca24ab8b34cd4fe1c3e8135-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -2348,17 +2420,17 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 +Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/91431b97b29541c0a5e3ae4d4a3a3b39-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c0b461eadf224598a4836f587a6d8387-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0b461eadf224598a4836f587a6d8387-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS @@ -2396,7 +2468,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0d6a00304d9845fcb7a03c5495fa5aca-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3a4512addc49405297144b068e358e99-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a4512addc49405297144b068e358e99-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -2434,7 +2506,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2df9f0e92a0c4fee81a6146d69b2f3c4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/14911ef3b4b84feb910a1488133b2c3e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/14911ef3b4b84feb910a1488133b2c3e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -2476,7 +2548,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d76e592f967c45ee96d3bca6ed62fb10-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d76e592f967c45ee96d3bca6ed62fb10-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/af594aa5f9594e20a08866a61c602f4e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/af594aa5f9594e20a08866a61c602f4e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2517,7 +2589,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/07c29f963c0e4a08b0f02ee0432d3992-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/07c29f963c0e4a08b0f02ee0432d3992-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fa44296842034813a58db74b9d3019dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa44296842034813a58db74b9d3019dc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2552,13 +2624,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/96720283dbe44999bfaea0141823ce97-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/96720283dbe44999bfaea0141823ce97-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/08c11cd540bf4eb7957094958f5c3773-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/08c11cd540bf4eb7957094958f5c3773-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2593,13 +2665,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/036bec5ca2754ed6bf6108c533de14a8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/036bec5ca2754ed6bf6108c533de14a8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/27419fa113fd4b4c91b51e82b4283f54-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/27419fa113fd4b4c91b51e82b4283f54-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2640,7 +2712,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/46246ce0d7074b31b084ec2f1d4144bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46246ce0d7074b31b084ec2f1d4144bd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c07eaf6d48de4951893dd4f199218f0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c07eaf6d48de4951893dd4f199218f0a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2681,7 +2753,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a4508484106f493d9480033817768d26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a4508484106f493d9480033817768d26-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/627a879978804a9ab0cdb502515dc05d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/627a879978804a9ab0cdb502515dc05d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2716,13 +2788,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6be8a1e460484c1098fbde8719d7abbb-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6be8a1e460484c1098fbde8719d7abbb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/65eb9a4817754388b81e2e9c523ab154-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65eb9a4817754388b81e2e9c523ab154-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2757,13 +2829,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e21c301d2c694a16aedbec2dbf4cfd4c-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a218483e1b0146aaacb2413d6ea17873-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a218483e1b0146aaacb2413d6ea17873-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2798,13 +2870,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3090527010f14b39889274948f058787-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3090527010f14b39889274948f058787-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/506b11ce6fa84393858b749bf93083c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/506b11ce6fa84393858b749bf93083c1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2845,7 +2917,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/dd873f00868f4148bb023f25a19525e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd873f00868f4148bb023f25a19525e4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/65a1da7f563f4da180b2e1108a458ed5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65a1da7f563f4da180b2e1108a458ed5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2886,7 +2958,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fe0bb2cba32d4521aa461b3593614957-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fe0bb2cba32d4521aa461b3593614957-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f341fa52bee04e3ab7c341e4cb6d2814-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f341fa52bee04e3ab7c341e4cb6d2814-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -2927,7 +2999,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9aaf392989174166a2532bfe1297a3c1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9aaf392989174166a2532bfe1297a3c1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/85b7ac7f0b794108bccada2baaa4f242-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/85b7ac7f0b794108bccada2baaa4f242-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -3000,44 +3072,44 @@ 19.4 9.4 4.4 0.0 - * 0.0 - * 0.0 - * 15.0 + 0.0 - 125.0 5.0 5.0 30.0 + 30.0 + 30.0 + 30.0 + 0.0 - 56.1 0.0 0.0 30.0 + 26.1 + 0.0 - 0.0 - 0.0 - -x_0 = 1.0 -x_1 = 1.0 +x_0 = 0.0 +x_1 = 0.0 x_2 = 1.0 x_3 = 1.0 -x_4 = 0.0 -x_5 = 0.0 -x_6 = 1.0 +x_4 = 1.0 +x_5 = 1.0 +x_6 = 0.0 x_7 = 1.0 -x_8 = 1.0 -x_9 = 0.0 +x_8 = 0.0 +x_9 = 1.0 Status: Optimal -s_0 = 1.0 -s_1 = 0.0 +s_0 = 0.0 +s_1 = 0.5 s_2 = 0.0 w_0 = 0.0 -w_1 = 1.0 -w_2 = 1.5 +w_1 = 0.0 +w_2 = 0.5 x_0 = 1.0 x_1 = 0.0 x_10 = 0.0 x_11 = 0.0 -x_12 = 0.0 -x_13 = 1.0 -x_14 = 1.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 = 0.0 -x_19 = 0.0 +x_19 = 1.0 x_2 = 1.0 x_3 = 1.0 -x_4 = 1.0 +x_4 = 0.0 x_5 = 0.0 -x_6 = 0.0 +x_6 = 1.0 x_7 = 0.0 x_8 = 0.0 x_9 = 0.0 -objective= 3.5 +objective= 1.0 Status: Optimal x = 4.0 y = -1.0 @@ -3403,7 +3475,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/482b986519254a999b5623cd11b4a9cd-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/482b986519254a999b5623cd11b4a9cd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d6840e8fd8e74ac28e7c4f2e73540fc6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/d6840e8fd8e74ac28e7c4f2e73540fc6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS @@ -3426,7 +3498,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/93d15466fe2041c2984ed86e356778be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/93d15466fe2041c2984ed86e356778be-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dd11293a07874c4a9514f40cd15ababd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/dd11293a07874c4a9514f40cd15ababd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -3467,7 +3539,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/26d2d82d4cda4d87ba307aed0164a8a4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26d2d82d4cda4d87ba307aed0164a8a4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0013d0a345e64e5189fa522b4d3b05ff-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0013d0a345e64e5189fa522b4d3b05ff-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3510,7 +3582,7 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all @@ -3520,7 +3592,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ec55399cfb14764b5e79734e88b6467-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ca18a3c656dd4a6d9b0add0e8df9fa26-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ca18a3c656dd4a6d9b0add0e8df9fa26-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS @@ -3566,7 +3638,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7e4cdf1f36864268ab24f1d3f318ec15-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7e4cdf1f36864268ab24f1d3f318ec15-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8dd4463f23b44b5081cb14e4986b09e5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8dd4463f23b44b5081cb14e4986b09e5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -3601,13 +3673,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/17328d62811c41c083026fddb76921b5-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/17328d62811c41c083026fddb76921b5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/87e9f90aa4cc4ff598b38755611851b7-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/87e9f90aa4cc4ff598b38755611851b7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS @@ -3630,7 +3702,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/26f56717543e4c45b2e1629b1b3efa1b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9846b1828404456f9b6ab14d2a92eeab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9846b1828404456f9b6ab14d2a92eeab-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3672,7 +3744,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5750027555e046e3b5f589a5d988186d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5750027555e046e3b5f589a5d988186d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/193204097c6845309575d2866bbc916d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/193204097c6845309575d2866bbc916d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS @@ -3694,7 +3766,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cddc010603f443d3a37b8cc953e220d5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/434bdaad6e4c4ad484882b6250148006-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/434bdaad6e4c4ad484882b6250148006-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3716,7 +3788,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fee62606b4b34819ae20703d380b5e4a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c0672eb96e5a4b15b9cadc1f363df2fe-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c0672eb96e5a4b15b9cadc1f363df2fe-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3757,7 +3829,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/44f7d420fbdc4e6981b71d6dad6b3234-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/de1a2b941786485481a557757d7cbc75-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/de1a2b941786485481a557757d7cbc75-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3779,7 +3851,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/73b70b1a3cb74b9b8f4a23be8fafa92d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c9f1a01f693643e7b9c36a7e475f99d2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9f1a01f693643e7b9c36a7e475f99d2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3829,7 +3901,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/53ef67ce115448cea35026c9a046fff6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/53ef67ce115448cea35026c9a046fff6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ec2fc99aaf814b9d9b92f9c810056e67-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec2fc99aaf814b9d9b92f9c810056e67-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3853,7 +3925,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ec1fcf4b73f54ea09b7a95a6e1576db3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/282597bfb5bc4197bd6f873cede3944d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/282597bfb5bc4197bd6f873cede3944d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3894,7 +3966,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c9bbf0c0815c4ebeb47d75b4d9f6ca18-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/80b1d8a3cf1e42658897230a90b8285d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/80b1d8a3cf1e42658897230a90b8285d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -3918,7 +3990,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea128859bb284c61b01349ca7fbcd313-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e2ef669530834f67af33e113167f4696-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ef669530834f67af33e113167f4696-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -3957,17 +4029,17 @@ Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 -Time (CPU seconds): 0.01 +Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c14459c8cd614fdab0e7ab7a799534da-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c14459c8cd614fdab0e7ab7a799534da-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/534e4e251ab540c78687fbfe6c69ca37-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/534e4e251ab540c78687fbfe6c69ca37-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4020,7 +4092,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/d078ed130019448ea3e206d582be46d7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d078ed130019448ea3e206d582be46d7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/87213a9ad8c74fc3ac9b16001858e9f1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/87213a9ad8c74fc3ac9b16001858e9f1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4042,7 +4114,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6d2ce629d8d14e2a94c83d4321784454-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6d2ce629d8d14e2a94c83d4321784454-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/956a9c5bffcb4c499230879c8de7d669-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/956a9c5bffcb4c499230879c8de7d669-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -4086,13 +4158,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/34a90b9d931647e3ae69c46da1c04bf2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a41c163c168e437c8071645db3b3797a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a41c163c168e437c8071645db3b3797a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4116,7 +4188,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6022757925a14eb9bb5e8bc6def525c3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6972e3a35e184eba915d60f228a94a89-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6972e3a35e184eba915d60f228a94a89-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -4155,17 +4227,17 @@ Objective value: -1.00000000 Enumerated nodes: 0 Total iterations: 6 -Time (CPU seconds): 0.00 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4a895427f0ea49a4a7bc3c272de404f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a895427f0ea49a4a7bc3c272de404f8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c6b3fb9f680c433dbe4db8b06a2491f0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6b3fb9f680c433dbe4db8b06a2491f0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -4208,17 +4280,17 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.01 +Time (CPU seconds): 0.00 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4da9a00ff06948909aa181d99921d415-pulp.mps mips /tmp/4da9a00ff06948909aa181d99921d415-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/4da9a00ff06948909aa181d99921d415-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.mps mips /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS @@ -4227,7 +4299,7 @@ At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/4da9a00ff06948909aa181d99921d415-pulp.mst. +opening mipstart file /tmp/dfd57628d9294dfc9779bb593855d90a-pulp.mst. MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed Continuous objective value is 12 - 0.01 seconds @@ -5594,7 +5666,7 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 27.113s +Ran 1005 tests in 27.034s OK (skipped=885) @@ -5875,7 +5947,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b9c404466b2f419386657fb4dbf8dfc4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b9c404466b2f419386657fb4dbf8dfc4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fd45f015c5cd4cfe8063a81d5699256f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd45f015c5cd4cfe8063a81d5699256f-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -5898,7 +5970,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7453983c13644fa8be8f6dbd3e043f87-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7453983c13644fa8be8f6dbd3e043f87-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8846dae6274241aeafd7b547a89acfe9-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/8846dae6274241aeafd7b547a89acfe9-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -5983,9 +6055,9 @@ Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 14 columns -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds -Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 4.17588e+06 - took 0.04 seconds +Cbc0012I Integer solution of 4175879 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) Cbc0038I Full problem 1 rows 15 columns, reduced to 1 rows 8 columns Cbc0012I Integer solution of 4190215 found by DiveCoefficient after 9 iterations and 0 nodes (0.05 seconds) Cbc0031I 1 added rows had average density of 15 @@ -6013,17 +6085,17 @@ Objective value: 4190215.00000000 Enumerated nodes: 0 Total iterations: 9 -Time (CPU seconds): 0.05 +Time (CPU seconds): 0.04 Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f52d7582d5174f82a139dc382cb634c7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f52d7582d5174f82a139dc382cb634c7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fa1489f100534e04b1f69f29c8e439b7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fa1489f100534e04b1f69f29c8e439b7-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 167 COLUMNS @@ -6068,7 +6140,7 @@ Cbc0038I Relaxing continuous gives 3371.83 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 32 continuous Cbc0038I Full problem 138 rows 130 columns, reduced to 95 rows 82 columns -Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.11 seconds) +Cbc0038I Mini branch and bound improved solution from 3371.83 to 3208.96 (0.10 seconds) Cbc0038I Round again with cutoff of 3076.56 Cbc0038I Pass 23: suminf. 0.21132 (2) obj. 2712.05 iterations 0 Cbc0038I Pass 24: suminf. 0.15579 (2) obj. 3076.56 iterations 13 @@ -6103,9 +6175,9 @@ 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.16 seconds) -Cbc0038I After 0.16 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.15 seconds -Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.16 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.15 seconds) +Cbc0038I After 0.15 seconds - Feasibility pump exiting with objective of 3208.96 - took 0.14 seconds +Cbc0012I Integer solution of 3208.957 found by feasibility pump after 0 iterations and 0 nodes (0.15 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 40 rows 52 columns Cbc0031I 16 added rows had average density of 46.625 Cbc0013I At root node, 16 cuts changed objective from 2546.9589 to 2700.7923 in 100 passes @@ -6116,10 +6188,10 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 98 row cuts average 8.2 elements, 0 column cuts (0 active) in 0.017 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) - 90 row cuts average 34.2 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is 1 -Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.41 seconds) +Cbc0010I After 0 nodes, 1 on tree, 3208.957 best solution, best possible 2700.7923 (0.40 seconds) Cbc0038I Full problem 138 rows 130 columns, reduced to 57 rows 66 columns Cbc0038I Full problem 138 rows 130 columns, reduced to 21 rows 38 columns -Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.81 seconds) +Cbc0001I Search completed - best objective 3208.95704688445, took 5337 iterations and 130 nodes (0.80 seconds) Cbc0032I Strong branching done 1216 times (9076 iterations), fathomed 30 nodes and fixed 65 variables Cbc0035I Maximum depth 13, 217 variables fixed on reduced cost Cuts at root node changed objective from 2546.96 to 2700.79 @@ -6127,7 +6199,7 @@ Gomory was tried 337 times and created 1816 cuts of which 0 were active after adding rounds of cuts (0.056 seconds) Knapsack was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.008 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 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.036 seconds) +MixedIntegerRounding2 was tried 337 times and created 301 cuts of which 0 were active after adding rounds of cuts (0.037 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 337 times and created 198 cuts of which 0 were active after adding rounds of cuts (0.023 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6138,110 +6210,63 @@ Objective value: 3208.95704688 Enumerated nodes: 130 Total iterations: 5337 -Time (CPU seconds): 0.80 -Time (Wallclock seconds): 0.82 +Time (CPU seconds): 0.79 +Time (Wallclock seconds): 0.80 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.80 (Wallclock seconds): 0.82 +Total time (CPU seconds): 0.80 (Wallclock seconds): 0.80 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/81fca50d88cc45d983346b4bdd8a72c5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5ac3756b82c742e68917a24526ca17a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ac3756b82c742e68917a24526ca17a2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 225 COLUMNS -At line 1653 RHS -At line 1874 BOUNDS -At line 2085 ENDATA +At line 1655 RHS +At line 1876 BOUNDS +At line 2087 ENDATA Problem MODEL has 220 rows, 210 columns and 799 elements Coin0008I MODEL read with 0 errors Option for timeMode changed from cpu to elapsed -Continuous objective value is -140.072 - 0.00 seconds -Cgl0004I processed model has 185 rows, 178 columns (178 integer (178 of which binary)) and 674 elements +Continuous objective value is -60.6 - 0.00 seconds +Cgl0004I processed model has 219 rows, 209 columns (209 integer (209 of which binary)) and 797 elements Cutoff increment increased from 1e-05 to 0.04995 -Cbc0038I Initial state - 21 integers unsatisfied sum - 6.87096 -Cbc0038I Solution found of -137.95 -Cbc0038I Before mini branch and bound, 157 integers at bound fixed and 0 continuous -Cbc0038I Full problem 185 rows 178 columns, reduced to 0 rows 0 columns -Cbc0038I Mini branch and bound improved solution from -137.95 to -139.2 (0.02 seconds) -Cbc0038I Round again with cutoff of -139.35 -Cbc0038I Reduced cost fixing fixed 48 variables on major pass 2 -Cbc0038I Pass 1: suminf. 0.45672 (2) obj. -139.35 iterations 96 -Cbc0038I Pass 2: suminf. 0.06818 (1) obj. -139.35 iterations 38 -Cbc0038I Pass 3: suminf. 0.20896 (1) obj. -139.66 iterations 12 -Cbc0038I Pass 4: suminf. 0.81382 (3) obj. -139.35 iterations 48 -Cbc0038I Pass 5: suminf. 0.51000 (2) obj. -139.35 iterations 88 -Cbc0038I Pass 6: suminf. 0.81947 (2) obj. -139.35 iterations 52 -Cbc0038I Pass 7: suminf. 0.77692 (3) obj. -139.35 iterations 26 -Cbc0038I Pass 8: suminf. 0.79808 (2) obj. -139.35 iterations 20 -Cbc0038I Pass 9: suminf. 0.79808 (2) obj. -139.35 iterations 2 -Cbc0038I Pass 10: suminf. 0.73123 (3) obj. -139.35 iterations 28 -Cbc0038I Pass 11: suminf. 0.52119 (2) obj. -139.35 iterations 22 -Cbc0038I Pass 12: suminf. 0.85382 (3) obj. -139.35 iterations 18 -Cbc0038I Pass 13: suminf. 0.85382 (3) obj. -139.35 iterations 1 -Cbc0038I Pass 14: suminf. 0.21393 (2) obj. -139.35 iterations 68 -Cbc0038I Pass 15: suminf. 0.20455 (1) obj. -139.35 iterations 26 -Cbc0038I Pass 16: suminf. 0.20896 (1) obj. -139.36 iterations 15 -Cbc0038I Pass 17: suminf. 0.51234 (3) obj. -139.35 iterations 43 -Cbc0038I Pass 18: suminf. 0.72046 (3) obj. -139.35 iterations 5 -Cbc0038I Pass 19: suminf. 0.20455 (1) obj. -139.35 iterations 69 -Cbc0038I Pass 20: suminf. 0.20896 (1) obj. -139.36 iterations 25 -Cbc0038I Pass 21: suminf. 1.26878 (20) obj. -139.35 iterations 55 -Cbc0038I Pass 22: suminf. 0.66525 (3) obj. -139.35 iterations 1 -Cbc0038I Pass 23: suminf. 0.86629 (3) obj. -139.35 iterations 2 -Cbc0038I Pass 24: suminf. 0.59248 (2) obj. -139.35 iterations 77 -Cbc0038I Pass 25: suminf. 0.61424 (2) obj. -139.35 iterations 33 -Cbc0038I Pass 26: suminf. 0.61424 (2) obj. -139.35 iterations 1 -Cbc0038I Pass 27: suminf. 0.64646 (2) obj. -139.416 iterations 25 -Cbc0038I Pass 28: suminf. 1.02759 (3) obj. -139.35 iterations 48 -Cbc0038I Pass 29: suminf. 0.73974 (3) obj. -139.35 iterations 9 -Cbc0038I Pass 30: suminf. 0.73974 (3) obj. -139.35 iterations 1 -Cbc0038I No solution found this major pass -Cbc0038I Before mini branch and bound, 146 integers at bound fixed and 0 continuous -Cbc0038I Full problem 185 rows 178 columns, reduced to 2 rows 6 columns -Cbc0038I Mini branch and bound did not improve solution (0.05 seconds) -Cbc0038I After 0.05 seconds - Feasibility pump exiting with objective of -139.2 - took 0.04 seconds -Cbc0012I Integer solution of -139.2 found by feasibility pump after 0 iterations and 0 nodes (0.05 seconds) -Cbc0031I 9 added rows had average density of 8.7777778 -Cbc0013I At root node, 13 cuts changed objective from -140.07186 to -139.2 in 2 passes -Cbc0014I Cut generator 0 (Probing) - 10 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -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) - 9 row cuts average 7.4 elements, 0 column cuts (0 active) in 0.001 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) - 17 row cuts average 17.7 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0014I Cut generator 7 (ZeroHalf) - 4 row cuts average 20.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 -Cbc0001I Search completed - best objective -139.2, took 21 iterations and 0 nodes (0.06 seconds) -Cbc0035I Maximum depth 0, 64 variables fixed on reduced cost -Cuts at root node changed objective from -140.072 to -139.2 -Probing was tried 2 times and created 10 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 9 cuts of which 0 were active after adding rounds of cuts (0.001 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 2 times and created 17 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) -ZeroHalf was tried 2 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +Cbc0038I Initial state - 0 integers unsatisfied sum - 7.43849e-15 +Cbc0038I Solution found of -60.6 +Cbc0038I Before mini branch and bound, 209 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 -60.6 - took 0.00 seconds +Cbc0012I Integer solution of -60.6 found by feasibility pump after 0 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -60.60000000000001, took 0 iterations and 0 nodes (0.02 seconds) +Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost +Cuts at root node changed objective from -60.6 to -60.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: -139.20000000 +Objective value: -60.60000000 Enumerated nodes: 0 -Total iterations: 21 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +Total iterations: 0 +Time (CPU seconds): 0.01 +Time (Wallclock seconds): 0.02 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.02 (Wallclock seconds): 0.02 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4e102e63c00f4c919432840ac657f534-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4e102e63c00f4c919432840ac657f534-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e4387185f89b4dad8d7445f0a47b9845-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e4387185f89b4dad8d7445f0a47b9845-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6253,158 +6278,177 @@ Option for timeMode changed from cpu to elapsed Continuous objective value is 0 - 0.00 seconds Cgl0004I processed model has 3 rows, 26 columns (20 integer (20 of which binary)) and 65 elements -Cutoff increment increased from 1e-05 to 0.9999 -Cbc0038I Initial state - 3 integers unsatisfied sum - 0.973263 -Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 153 iterations 3 -Cbc0038I Solution found of 153 -Cbc0038I Relaxing continuous gives 153 +Cbc0038I Initial state - 3 integers unsatisfied sum - 0.451927 +Cbc0038I Pass 1: suminf. 0.00000 (0) obj. 26.5 iterations 3 +Cbc0038I Solution found of 26.5 +Cbc0038I Relaxing continuous gives 26.5 Cbc0038I Before mini branch and bound, 17 integers at bound fixed and 3 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 0 rows 0 columns Cbc0038I Mini branch and bound did not improve solution (0.00 seconds) -Cbc0038I Round again with cutoff of 136.8 -Cbc0038I Pass 2: suminf. 0.07232 (1) obj. 136.8 iterations 1 -Cbc0038I Pass 3: suminf. 0.00000 (0) obj. 136.8 iterations 3 -Cbc0038I Solution found of 136.8 -Cbc0038I Relaxing continuous gives 71 -Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 10 columns -Cbc0038I Mini branch and bound improved solution from 71 to 52 (0.01 seconds) -Cbc0038I Round again with cutoff of 40.8001 -Cbc0038I Pass 4: suminf. 0.50970 (2) obj. 40.8001 iterations 1 -Cbc0038I Pass 5: suminf. 0.61767 (2) obj. 40.8001 iterations 3 -Cbc0038I Pass 6: suminf. 0.24695 (2) obj. 40.8001 iterations 2 -Cbc0038I Pass 7: suminf. 0.76286 (2) obj. 40.8001 iterations 3 -Cbc0038I Pass 8: suminf. 0.40951 (2) obj. 40.8001 iterations 3 -Cbc0038I Pass 9: suminf. 0.81284 (2) obj. 40.8001 iterations 6 -Cbc0038I Pass 10: suminf. 0.00000 (0) obj. 40.8001 iterations 2 -Cbc0038I Solution found of 40.8001 -Cbc0038I Relaxing continuous gives 27 -Cbc0038I Before mini branch and bound, 12 integers at bound fixed and 0 continuous -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 14 columns -Cbc0038I Mini branch and bound improved solution from 27 to 23 (0.01 seconds) -Cbc0038I Round again with cutoff of 15.4001 -Cbc0038I Pass 11: suminf. 0.63835 (2) obj. 15.4001 iterations 0 -Cbc0038I Pass 12: suminf. 1.07479 (3) obj. 15.4001 iterations 3 -Cbc0038I Pass 13: suminf. 0.35410 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 14: suminf. 0.84974 (3) obj. 15.4001 iterations 4 -Cbc0038I Pass 15: suminf. 0.37676 (3) obj. 15.4001 iterations 2 -Cbc0038I Pass 16: suminf. 0.28454 (1) obj. 15.4001 iterations 3 -Cbc0038I Pass 17: suminf. 0.28454 (1) obj. 15.4001 iterations 0 -Cbc0038I Pass 18: suminf. 0.50016 (2) obj. 15.4001 iterations 10 -Cbc0038I Pass 19: suminf. 0.03378 (1) obj. 15.4001 iterations 2 -Cbc0038I Pass 20: suminf. 0.17067 (1) obj. 15.4001 iterations 3 -Cbc0038I Pass 21: suminf. 1.01300 (3) obj. 15.4001 iterations 10 -Cbc0038I Pass 22: suminf. 1.01300 (3) obj. 15.4001 iterations 0 -Cbc0038I Pass 23: suminf. 0.55390 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 24: suminf. 0.22133 (2) obj. 15.4001 iterations 4 -Cbc0038I Pass 25: suminf. 0.39196 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 26: suminf. 0.53592 (3) obj. 15.4001 iterations 6 -Cbc0038I Pass 27: suminf. 0.41061 (3) obj. 15.4001 iterations 3 -Cbc0038I Pass 28: suminf. 0.16808 (1) obj. 15.4001 iterations 3 -Cbc0038I Pass 29: suminf. 0.48799 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 30: suminf. 0.75659 (3) obj. 15.4001 iterations 7 -Cbc0038I Pass 31: suminf. 0.62667 (2) obj. 15.4001 iterations 2 -Cbc0038I Pass 32: suminf. 0.64381 (2) obj. 15.4001 iterations 2 -Cbc0038I Pass 33: suminf. 0.32040 (3) obj. 15.4001 iterations 4 -Cbc0038I Pass 34: suminf. 0.75330 (3) obj. 15.4001 iterations 4 -Cbc0038I Pass 35: suminf. 0.42295 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 36: suminf. 0.63247 (2) obj. 15.4001 iterations 2 -Cbc0038I Pass 37: suminf. 0.96282 (3) obj. 15.4001 iterations 7 -Cbc0038I Pass 38: suminf. 0.23075 (2) obj. 15.4001 iterations 3 -Cbc0038I Pass 39: suminf. 0.83585 (3) obj. 15.4001 iterations 3 -Cbc0038I Pass 40: suminf. 0.70075 (3) obj. 15.4001 iterations 5 +Cbc0038I Round again with cutoff of 23.85 +Cbc0038I Pass 2: suminf. 0.01906 (1) obj. 23.85 iterations 1 +Cbc0038I Pass 3: suminf. 0.73716 (2) obj. 23.85 iterations 4 +Cbc0038I Pass 4: suminf. 0.72682 (2) obj. 23.85 iterations 2 +Cbc0038I Pass 5: suminf. 0.25284 (2) obj. 23.85 iterations 2 +Cbc0038I Pass 6: suminf. 0.88960 (2) obj. 23.85 iterations 4 +Cbc0038I Pass 7: suminf. 0.63923 (2) obj. 23.85 iterations 11 +Cbc0038I Pass 8: suminf. 0.05691 (1) obj. 23.85 iterations 9 +Cbc0038I Pass 9: suminf. 0.55659 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 10: suminf. 0.97429 (3) obj. 23.85 iterations 8 +Cbc0038I Pass 11: suminf. 0.46747 (3) obj. 23.85 iterations 2 +Cbc0038I Pass 12: suminf. 1.21917 (3) obj. 23.85 iterations 4 +Cbc0038I Pass 13: suminf. 0.93479 (3) obj. 23.85 iterations 1 +Cbc0038I Pass 14: suminf. 0.47608 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 15: suminf. 0.21431 (1) obj. 23.85 iterations 3 +Cbc0038I Pass 16: suminf. 0.45805 (2) obj. 23.85 iterations 4 +Cbc0038I Pass 17: suminf. 0.58833 (3) obj. 23.85 iterations 5 +Cbc0038I Pass 18: suminf. 0.26490 (2) obj. 23.85 iterations 2 +Cbc0038I Pass 19: suminf. 0.90221 (3) obj. 23.85 iterations 5 +Cbc0038I Pass 20: suminf. 0.82802 (3) obj. 23.85 iterations 9 +Cbc0038I Pass 21: suminf. 0.82802 (3) obj. 23.85 iterations 0 +Cbc0038I Pass 22: suminf. 0.43826 (2) obj. 23.85 iterations 4 +Cbc0038I Pass 23: suminf. 0.25205 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 24: suminf. 0.63508 (2) obj. 23.85 iterations 6 +Cbc0038I Pass 25: suminf. 0.40566 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 26: suminf. 0.25943 (2) obj. 23.85 iterations 5 +Cbc0038I Pass 27: suminf. 0.25943 (2) obj. 23.85 iterations 0 +Cbc0038I Pass 28: suminf. 0.67295 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 29: suminf. 0.36758 (1) obj. 23.85 iterations 2 +Cbc0038I Pass 30: suminf. 0.46783 (2) obj. 23.85 iterations 3 +Cbc0038I Pass 31: suminf. 0.51904 (3) obj. 23.85 iterations 9 +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 26.5 to 8.5 (0.03 seconds) +Cbc0038I Round again with cutoff of 6.79999 +Cbc0038I Pass 31: suminf. 0.30588 (3) obj. 6.79999 iterations 4 +Cbc0038I Pass 32: suminf. 0.42356 (3) obj. 6.79999 iterations 6 +Cbc0038I Pass 33: suminf. 0.29359 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 34: suminf. 0.55512 (3) obj. 6.79999 iterations 4 +Cbc0038I Pass 35: suminf. 0.55512 (3) obj. 6.79999 iterations 0 +Cbc0038I Pass 36: suminf. 0.80386 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 37: suminf. 0.51810 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 38: suminf. 0.89901 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 39: suminf. 0.56754 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 40: suminf. 1.01302 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 41: suminf. 0.69299 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 42: suminf. 0.89257 (3) obj. 6.79999 iterations 1 +Cbc0038I Pass 43: suminf. 0.30588 (3) obj. 6.79999 iterations 9 +Cbc0038I Pass 44: suminf. 0.30588 (3) obj. 6.79999 iterations 0 +Cbc0038I Pass 45: suminf. 0.42356 (3) obj. 6.79999 iterations 6 +Cbc0038I Pass 46: suminf. 0.29359 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 47: suminf. 0.55512 (3) obj. 6.79999 iterations 4 +Cbc0038I Pass 48: suminf. 0.55512 (3) obj. 6.79999 iterations 0 +Cbc0038I Pass 49: suminf. 0.80386 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 50: suminf. 0.51810 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 51: suminf. 0.89901 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 52: suminf. 0.56754 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 53: suminf. 1.01302 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 54: suminf. 0.69299 (3) obj. 6.79999 iterations 3 +Cbc0038I Pass 55: suminf. 0.89257 (3) obj. 6.79999 iterations 1 +Cbc0038I Pass 56: suminf. 1.09495 (3) obj. 6.79999 iterations 10 +Cbc0038I Pass 57: suminf. 0.67442 (3) obj. 6.79999 iterations 2 +Cbc0038I Pass 58: suminf. 0.71360 (3) obj. 6.79999 iterations 1 +Cbc0038I Pass 59: suminf. 0.43750 (2) obj. 6.79999 iterations 4 +Cbc0038I Pass 60: suminf. 0.30579 (3) obj. 6.79999 iterations 4 +Cbc0038I No solution found this major pass +Cbc0038I Before mini branch and bound, 6 integers at bound fixed and 1 continuous +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns +Cbc0038I Mini branch and bound improved solution from 8.5 to 7.5 (0.05 seconds) +Cbc0038I Round again with cutoff of 4.75999 +Cbc0038I Pass 60: suminf. 0.34675 (3) obj. 4.75999 iterations 0 +Cbc0038I Pass 61: suminf. 0.40842 (3) obj. 4.75999 iterations 6 +Cbc0038I Pass 62: suminf. 0.33184 (3) obj. 4.75999 iterations 2 +Cbc0038I Pass 63: suminf. 0.56744 (3) obj. 4.75999 iterations 4 +Cbc0038I Pass 64: suminf. 0.56744 (3) obj. 4.75999 iterations 0 +Cbc0038I Pass 65: suminf. 0.78808 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 66: suminf. 0.55500 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 67: suminf. 0.87809 (3) obj. 4.75999 iterations 2 +Cbc0038I Pass 68: suminf. 0.58035 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 69: suminf. 0.95916 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 70: suminf. 0.85008 (3) obj. 4.75999 iterations 4 +Cbc0038I Pass 71: suminf. 0.84740 (3) obj. 4.75999 iterations 6 +Cbc0038I Pass 72: suminf. 0.84740 (3) obj. 4.75999 iterations 0 +Cbc0038I Pass 73: suminf. 0.53190 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 74: suminf. 0.15888 (1) obj. 4.75999 iterations 4 +Cbc0038I Pass 75: suminf. 0.19428 (1) obj. 4.75999 iterations 3 +Cbc0038I Pass 76: suminf. 0.92790 (2) obj. 4.75999 iterations 13 +Cbc0038I Pass 77: suminf. 0.92716 (2) obj. 4.75999 iterations 2 +Cbc0038I Pass 78: suminf. 0.83261 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 79: suminf. 0.82619 (3) obj. 4.75999 iterations 2 +Cbc0038I Pass 80: suminf. 0.36219 (3) obj. 4.75999 iterations 5 +Cbc0038I Pass 81: suminf. 0.51000 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 82: suminf. 0.94371 (3) obj. 4.75999 iterations 13 +Cbc0038I Pass 83: suminf. 0.83682 (2) obj. 4.75999 iterations 3 +Cbc0038I Pass 84: suminf. 0.47862 (3) obj. 4.75999 iterations 5 +Cbc0038I Pass 85: suminf. 0.34098 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 86: suminf. 1.08496 (3) obj. 4.75999 iterations 3 +Cbc0038I Pass 87: suminf. 0.72364 (3) obj. 4.75999 iterations 1 +Cbc0038I Pass 88: suminf. 1.00904 (3) obj. 4.75999 iterations 2 +Cbc0038I Pass 89: suminf. 0.40341 (2) obj. 4.75999 iterations 5 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 1 integers at bound fixed and 0 continuous Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 25 columns -Cbc0038I Mini branch and bound improved solution from 23 to 5 (0.03 seconds) -Cbc0038I Round again with cutoff of 2.80007 -Cbc0038I Pass 40: suminf. 0.72303 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 41: suminf. 0.40721 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 42: suminf. 0.18115 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 43: suminf. 0.70597 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 44: suminf. 0.45692 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 45: suminf. 0.97612 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 46: suminf. 0.59208 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 47: suminf. 0.87356 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 48: suminf. 0.76850 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 49: suminf. 0.87136 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 50: suminf. 0.26915 (2) obj. 2.80007 iterations 8 -Cbc0038I Pass 51: suminf. 0.13346 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 52: suminf. 0.24341 (3) obj. 2.80007 iterations 2 -Cbc0038I Pass 53: suminf. 0.64162 (3) obj. 2.80007 iterations 8 -Cbc0038I Pass 54: suminf. 0.64162 (3) obj. 2.80007 iterations 0 -Cbc0038I Pass 55: suminf. 0.75064 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 56: suminf. 0.35312 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 57: suminf. 0.90927 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 58: suminf. 0.74218 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 59: suminf. 1.09430 (3) obj. 2.80007 iterations 5 -Cbc0038I Pass 60: suminf. 1.09430 (3) obj. 2.80007 iterations 0 -Cbc0038I Pass 61: suminf. 1.02717 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 62: suminf. 0.72162 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 63: suminf. 0.73585 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 64: suminf. 0.63751 (3) obj. 2.80007 iterations 3 -Cbc0038I Pass 65: suminf. 0.27083 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 66: suminf. 0.07790 (2) obj. 2.80007 iterations 4 -Cbc0038I Pass 67: suminf. 0.81315 (3) obj. 2.80007 iterations 4 -Cbc0038I Pass 68: suminf. 0.81315 (3) obj. 2.80007 iterations 0 -Cbc0038I Pass 69: suminf. 0.08820 (3) obj. 2.80007 iterations 4 -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 did not improve solution (0.05 seconds) -Cbc0038I After 0.05 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.05 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns -Cbc0031I 5 added rows had average density of 20 -Cbc0013I At root node, 5 cuts changed objective from 0 to 0 in 100 passes -Cbc0014I Cut generator 0 (Probing) - 3 row cuts average 26.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 -Cbc0014I Cut generator 1 (Gomory) - 575 row cuts average 25.8 elements, 0 column cuts (0 active) in 0.016 seconds - new frequency is -100 -Cbc0014I Cut generator 2 (Knapsack) - 697 row cuts average 11.2 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) - 508 row cuts average 19.1 elements, 0 column cuts (0 active) in 0.008 seconds - new frequency is -100 -Cbc0014I Cut generator 5 (FlowCover) - 124 row cuts average 8.4 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 -Cbc0014I Cut generator 6 (TwoMirCuts) - 333 row cuts average 18.8 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.16 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns -Cbc0004I Integer solution of 1 found after 1594 iterations and 118 nodes (0.20 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 7.5 - took 0.06 seconds +Cbc0012I Integer solution of 7.5 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0031I 3 added rows had average density of 16.666667 +Cbc0013I At root node, 3 cuts changed objective from 0 to 0 in 100 passes +Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 17.0 elements, 1 column cuts (1 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 1 (Gomory) - 570 row cuts average 25.9 elements, 0 column cuts (0 active) in 0.015 seconds - new frequency is -100 +Cbc0014I Cut generator 2 (Knapsack) - 409 row cuts average 10.6 elements, 0 column cuts (0 active) in 0.015 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) - 520 row cuts average 18.5 elements, 0 column cuts (0 active) in 0.006 seconds - new frequency is -100 +Cbc0014I Cut generator 5 (FlowCover) - 65 row cuts average 8.3 elements, 0 column cuts (0 active) in 0.003 seconds - new frequency is -100 +Cbc0014I Cut generator 6 (TwoMirCuts) - 369 row cuts average 18.2 elements, 0 column cuts (0 active) in 0.004 seconds - new frequency is -100 +Cbc0010I After 0 nodes, 1 on tree, 7.5 best solution, best possible 0 (0.15 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0016I Integer solution of 6.5 found by strong branching after 1692 iterations and 170 nodes (0.19 seconds) +Cbc0016I Integer solution of 5.5 found by strong branching after 2146 iterations and 255 nodes (0.21 seconds) Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns -Cbc0010I After 1000 nodes, 5 on tree, 1 best solution, best possible 0 (0.43 seconds) -Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 18 columns +Cbc0016I Integer solution of 4.5 found by strong branching after 2658 iterations and 346 nodes (0.24 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 15 columns +Cbc0016I Integer solution of 3.5 found by strong branching after 3016 iterations and 415 nodes (0.26 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 17 columns Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 19 columns -Cbc0001I Search completed - best objective 1, took 19173 iterations and 6290 nodes (0.67 seconds) -Cbc0032I Strong branching done 9294 times (23648 iterations), fathomed 475 nodes and fixed 549 variables -Cbc0041I Maximum depth 13, 64 variables fixed on reduced cost (complete fathoming 370 times, 4420 nodes taking 9476 iterations) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0010I After 1000 nodes, 7 on tree, 3.5 best solution, best possible 0 (0.41 seconds) +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 20 columns +Cbc0038I Full problem 3 rows 26 columns, reduced to 3 rows 16 columns +Cbc0010I After 2000 nodes, 5 on tree, 3.5 best solution, best possible 0 (0.66 seconds) +Cbc0001I Search completed - best objective 3.5, took 27797 iterations and 9433 nodes (0.76 seconds) +Cbc0032I Strong branching done 11122 times (30556 iterations), fathomed 482 nodes and fixed 525 variables +Cbc0041I Maximum depth 14, 789 variables fixed on reduced cost (complete fathoming 596 times, 7071 nodes taking 16911 iterations) Cuts at root node changed objective from 0 to 0 -Probing was tried 100 times and created 4 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) -Gomory was tried 100 times and created 575 cuts of which 0 were active after adding rounds of cuts (0.016 seconds) -Knapsack was tried 100 times and created 697 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 508 cuts of which 0 were active after adding rounds of cuts (0.008 seconds) -FlowCover was tried 100 times and created 124 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) -TwoMirCuts was tried 100 times and created 333 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) +Probing was tried 100 times and created 2 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +Gomory was tried 100 times and created 570 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) +Knapsack was tried 100 times and created 409 cuts of which 0 were active after adding rounds of cuts (0.015 seconds) +Clique was tried 100 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) +MixedIntegerRounding2 was tried 100 times and created 520 cuts of which 0 were active after adding rounds of cuts (0.006 seconds) +FlowCover was tried 100 times and created 65 cuts of which 0 were active after adding rounds of cuts (0.003 seconds) +TwoMirCuts was tried 100 times and created 369 cuts of which 0 were active after adding rounds of cuts (0.004 seconds) ZeroHalf was tried 1 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) Result - Optimal solution found -Objective value: 1.00000000 -Enumerated nodes: 6290 -Total iterations: 19173 -Time (CPU seconds): 0.66 -Time (Wallclock seconds): 0.68 +Objective value: 3.50000000 +Enumerated nodes: 9433 +Total iterations: 27797 +Time (CPU seconds): 0.68 +Time (Wallclock seconds): 0.76 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.66 (Wallclock seconds): 0.68 +Total time (CPU seconds): 0.68 (Wallclock seconds): 0.76 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b29f1c439cb242bbbfe82217ba7af284-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b29f1c439cb242bbbfe82217ba7af284-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a7eb96c6fc244ea89f01e0007ac320fc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a7eb96c6fc244ea89f01e0007ac320fc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6427,7 +6471,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/aaaaf5c1006446f7b8111958c6801b64-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/aaaaf5c1006446f7b8111958c6801b64-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0dc451a288304b68b84d074b26d74bca-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0dc451a288304b68b84d074b26d74bca-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6454,7 +6498,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/040ee8ab8b9b46328f12f725a8032599-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/42de0809e60a427ba2ac1908b0052a4c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/42de0809e60a427ba2ac1908b0052a4c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -6495,7 +6539,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/955983a23f3546f6b944872d7ed48449-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/955983a23f3546f6b944872d7ed48449-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a3db483a0efe4e1babf620d494c807dc-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3db483a0efe4e1babf620d494c807dc-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -6546,7 +6590,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c8e8e421d72c46989512d750b8db77e1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c8e8e421d72c46989512d750b8db77e1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/56cc40d3c84d422c8c1ce4b7bbb80a9a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56cc40d3c84d422c8c1ce4b7bbb80a9a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -6599,7 +6643,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/eb85efe495d54e58a48f2886726abc0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/eb85efe495d54e58a48f2886726abc0f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ba6f32e6541f46a5ad76bb37e4441f50-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ba6f32e6541f46a5ad76bb37e4441f50-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 355 COLUMNS @@ -6636,17 +6680,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.02 +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 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/39e4c772623443619718cf6d3215e0f8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/39e4c772623443619718cf6d3215e0f8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f04d9288bfac462784b3e34eddd483a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f04d9288bfac462784b3e34eddd483a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 356 COLUMNS @@ -6671,10 +6715,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 28 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.08 seconds) -Cbc0038I After 0.08 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.08 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.08 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -6691,17 +6735,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.09 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0ec3036276fc4213a3a5070e20c8b2f9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0ec3036276fc4213a3a5070e20c8b2f9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/738236103e9746b8be376ae1afd28fae-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/738236103e9746b8be376ae1afd28fae-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 357 COLUMNS @@ -6746,17 +6790,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.08 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.07 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3da5882cb7f84ce1836312daca4625d3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3da5882cb7f84ce1836312daca4625d3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1021d492aa544036bf267dfc11eb14be-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1021d492aa544036bf267dfc11eb14be-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -6766,7 +6810,7 @@ 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.01 seconds +Continuous objective value is 0 - 0.00 seconds Cgl0003I 9 fixed, 0 tightened bounds, 3 strengthened rows, 28 substitutions Cgl0003I 1 fixed, 0 tightened bounds, 1 strengthened rows, 2 substitutions Cgl0003I 0 fixed, 0 tightened bounds, 0 strengthened rows, 2 substitutions @@ -6780,10 +6824,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 22 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6800,17 +6844,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5f17a00eedfa4c74a726f773d1cce9cf-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5f17a00eedfa4c74a726f773d1cce9cf-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c6f158937c8441958544f226d9a12389-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c6f158937c8441958544f226d9a12389-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 359 COLUMNS @@ -6831,10 +6875,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 16 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds +Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) +Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -6851,17 +6895,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 +Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b3d92acbd4884226902fa1dc0275112f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3d92acbd4884226902fa1dc0275112f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/5741012eb6d94f7899dde436957164d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5741012eb6d94f7899dde436957164d1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 360 COLUMNS @@ -6883,10 +6927,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 4.44089e-16 Cbc0038I Solution found of 0 Cbc0038I Before mini branch and bound, 11 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) -Cbc0038I After 0.04 seconds - Feasibility pump exiting with objective of 0 - took 0.00 seconds -Cbc0012I Integer solution of 0 found by feasibility pump after 0 iterations and 0 nodes (0.04 seconds) -Cbc0001I Search completed - best objective 0, took 0 iterations and 0 nodes (0.04 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.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) @@ -6907,13 +6951,13 @@ Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.03 (Wallclock seconds): 0.05 +Total time (CPU seconds): 0.04 (Wallclock seconds): 0.04 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/bd9175baddcd42a180b4878784c84b04-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/bd9175baddcd42a180b4878784c84b04-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3a927550f34a4394846f6487e003b99e-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3a927550f34a4394846f6487e003b99e-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 361 COLUMNS @@ -6955,16 +6999,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/03496577738547dba976c10fd63697d1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/03496577738547dba976c10fd63697d1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fd24b9596b5a4b5aab1f81d114f67eb3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fd24b9596b5a4b5aab1f81d114f67eb3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 362 COLUMNS @@ -7006,17 +7050,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.06 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.06 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/0cd4c06c8a7342639cead5790e5455a2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0cd4c06c8a7342639cead5790e5455a2-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/7242ed76d2154f038dbf1247edd39e1d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/7242ed76d2154f038dbf1247edd39e1d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 363 COLUMNS @@ -7056,17 +7100,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 +Time (CPU seconds): 0.06 Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/372cfbb20fca44b399fa838208922e93-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/372cfbb20fca44b399fa838208922e93-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/454baf9d3b9b4b828130240a1e2138b8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/454baf9d3b9b4b828130240a1e2138b8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 364 COLUMNS @@ -7086,10 +7130,10 @@ Cbc0038I Initial state - 0 integers unsatisfied sum - 0 Cbc0038I Solution found of -0 Cbc0038I Before mini branch and bound, 3 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds -Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) -Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.07 seconds) +Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) +Cbc0038I After 0.06 seconds - Feasibility pump exiting with objective of -0 - took 0.00 seconds +Cbc0012I Integer solution of -0 found by feasibility pump after 0 iterations and 0 nodes (0.06 seconds) +Cbc0001I Search completed - best objective -0, took 0 iterations and 0 nodes (0.06 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 0 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7106,17 +7150,17 @@ Objective value: -0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.06 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/40da0198cbcc4509b3d453fe113b4e87-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/40da0198cbcc4509b3d453fe113b4e87-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8bc61f39831f48e4b21105ad8817fb14-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8bc61f39831f48e4b21105ad8817fb14-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 365 COLUMNS @@ -7148,17 +7192,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.07 +Time (CPU seconds): 0.08 +Time (Wallclock seconds): 0.08 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.08 (Wallclock seconds): 0.08 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8ddf88c2252a405ab57536adba9378ea-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8ddf88c2252a405ab57536adba9378ea-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f561013693674b61b5750b945872ea0a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f561013693674b61b5750b945872ea0a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 366 COLUMNS @@ -7189,17 +7233,17 @@ Objective value: 0.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (CPU seconds): 0.03 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.08 +Total time (CPU seconds): 0.03 (Wallclock seconds): 0.06 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4ffcab2d7f19486aababb5d3b0f13791-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4ffcab2d7f19486aababb5d3b0f13791-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/f43dccfffe9e4d8b83662bb5564d4e91-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f43dccfffe9e4d8b83662bb5564d4e91-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 367 COLUMNS @@ -7247,8 +7291,8 @@ Cbc0038I Pass 30: suminf. 0.28571 (2) obj. 0 iterations 0 Cbc0038I No solution found this major pass Cbc0038I Before mini branch and bound, 0 integers at bound fixed and 0 continuous -Cbc0038I Mini branch and bound did not improve solution (0.06 seconds) -Cbc0038I After 0.06 seconds - Feasibility pump exiting - took 0.00 seconds +Cbc0038I Mini branch and bound did not improve solution (0.04 seconds) +Cbc0038I After 0.05 seconds - Feasibility pump exiting - took 0.00 seconds Cbc0006I The LP relaxation is infeasible or too expensive Cbc0013I At root node, 0 cuts changed objective from 0 to 0 in 1 passes Cbc0014I Cut generator 0 (Probing) - 1 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 @@ -7259,7 +7303,7 @@ Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 7 (ZeroHalf) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.06 seconds) +Cbc0001I Search completed - best objective 1e+50, took 0 iterations and 0 nodes (0.05 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 0 to 0 Probing was tried 1 times and created 1 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -7276,17 +7320,17 @@ No feasible solution found Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.06 -Time (Wallclock seconds): 0.06 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.05 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.07 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e3b478b6856a40948324f89156e93b8a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e3b478b6856a40948324f89156e93b8a-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/c632f54b244949849db5fbb4669911b1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c632f54b244949849db5fbb4669911b1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS @@ -7324,7 +7368,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/84f427ba96504f3094f5829060cd2165-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/84f427ba96504f3094f5829060cd2165-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/65b7b2669e674c599458b84062d9aad3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/65b7b2669e674c599458b84062d9aad3-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 358 COLUMNS @@ -7362,7 +7406,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b353139065224feeb04d0e9b03339825-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b353139065224feeb04d0e9b03339825-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/e44ec505c3e4405189b3c44edb9a22ac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e44ec505c3e4405189b3c44edb9a22ac-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -7404,7 +7448,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/12b2291772494428a29bc32cfa56ea4d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/12b2291772494428a29bc32cfa56ea4d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/001adbcd039344f0be76b9acf1db43c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/001adbcd039344f0be76b9acf1db43c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7439,13 +7483,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/3f74ff23371a4859a9aa01d186672cec-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f74ff23371a4859a9aa01d186672cec-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/41a16d3a1827418fa0a72fee78c751b0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41a16d3a1827418fa0a72fee78c751b0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7486,7 +7530,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e9fbf70c152244c881136905f984c0a3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e9fbf70c152244c881136905f984c0a3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b3ba396fdc6445168bdb375d9ae6431a-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b3ba396fdc6445168bdb375d9ae6431a-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7521,13 +7565,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8576fcf378fd47b99f206a72b5649fc3-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/070fc36648b54adca11ff54639a474c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/070fc36648b54adca11ff54639a474c4-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7562,13 +7606,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/30ad2dce94254e4ba4cb4720362864e8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/30ad2dce94254e4ba4cb4720362864e8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/46d04174eda841b7ab1a2c55a2755d71-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/46d04174eda841b7ab1a2c55a2755d71-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7603,13 +7647,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a454510deaf5456083df70aeb8c3a349-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a454510deaf5456083df70aeb8c3a349-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/701e6fbb1580419aa20be6dd881dcffd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/701e6fbb1580419aa20be6dd881dcffd-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7644,13 +7688,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/18578bf2ebe74786bcc2523b6e247ec0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/18578bf2ebe74786bcc2523b6e247ec0-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/739166f934294e2698814760aaa778ef-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/739166f934294e2698814760aaa778ef-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7685,13 +7729,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2912eae5fcd044d58d22aecc5ec04627-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2912eae5fcd044d58d22aecc5ec04627-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/75ad73a5cf0844d38dc8056170708cb1-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75ad73a5cf0844d38dc8056170708cb1-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7732,7 +7776,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fb57ad9fade64a6692fbdfde12688da8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb57ad9fade64a6692fbdfde12688da8-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/fb91f0b38285446bafae24c1a314292c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/fb91f0b38285446bafae24c1a314292c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7763,8 +7807,8 @@ Objective value: 8840.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 @@ -7773,7 +7817,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/82210abdfec04e99a572af17c2f3e01b-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/82210abdfec04e99a572af17c2f3e01b-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/0465f27c530746a48b0089488b8d591c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/0465f27c530746a48b0089488b8d591c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7814,7 +7858,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/88e4853b8b1f471bb4e29d5408f02798-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/88e4853b8b1f471bb4e29d5408f02798-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4a19c1f5b21f41929defa342728b0cab-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4a19c1f5b21f41929defa342728b0cab-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -7855,7 +7899,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6eeed9bc8564f4cbdd7ecad68e1a723-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/41f11c03106b4e9980fd39181eaeb03d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/41f11c03106b4e9980fd39181eaeb03d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 14 COLUMNS @@ -7888,10 +7932,10 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.00 +Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 /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' """ @@ -7931,41 +7975,41 @@ x_0 = 1.0 x_1 = 1.0 x_2 = 1.0 -x_3 = 1.0 -x_4 = 1.0 -x_5 = 1.0 +x_3 = 0.0 +x_4 = 0.0 +x_5 = 0.0 x_6 = 1.0 x_7 = 1.0 x_8 = 0.0 -x_9 = 0.0 +x_9 = 1.0 Status: Optimal -s_0 = 0.0 +s_0 = 1.0 s_1 = 0.0 -s_2 = 0.0 +s_2 = 1.5 w_0 = 0.0 w_1 = 1.0 w_2 = 0.0 x_0 = 1.0 x_1 = 1.0 -x_10 = 1.0 -x_11 = 1.0 -x_12 = 1.0 -x_13 = 0.0 -x_14 = 1.0 +x_10 = 0.0 +x_11 = 0.0 +x_12 = 0.0 +x_13 = 1.0 +x_14 = 0.0 x_15 = 1.0 -x_16 = 0.0 +x_16 = 1.0 x_17 = 0.0 x_18 = 1.0 x_19 = 1.0 x_2 = 0.0 -x_3 = 0.0 +x_3 = 1.0 x_4 = 0.0 -x_5 = 0.0 +x_5 = 1.0 x_6 = 0.0 x_7 = 0.0 x_8 = 1.0 x_9 = 0.0 -objective= 1.0 +objective= 3.5 Status: Optimal x = 4.0 y = -1.0 @@ -8331,7 +8375,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/a7e6a293f5e5466d9c6a2acefa585a78-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/00c53daf6b18484d85ec86e8b4e3cee0-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/00c53daf6b18484d85ec86e8b4e3cee0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 25 COLUMNS @@ -8354,7 +8398,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c202a6d9cb8d403a858f2c868192fdfd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c202a6d9cb8d403a858f2c868192fdfd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/6182717e91f24fc1973a513b3de137a0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6182717e91f24fc1973a513b3de137a0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 13 COLUMNS @@ -8368,7 +8412,7 @@ 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.01 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) @@ -8385,17 +8429,17 @@ Objective value: 8600.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/2f7f7fa204534309a8612b2af81fe6c5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/2f7f7fa204534309a8612b2af81fe6c5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/934e2f6651964ab381452f74f1283e78-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/934e2f6651964ab381452f74f1283e78-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8438,17 +8482,17 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/916e286e61b84a3a857d4d0af80012a7-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/a3147c2fbcd54bc4960abfb70ebf4c39-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a3147c2fbcd54bc4960abfb70ebf4c39-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS @@ -8464,9 +8508,9 @@ 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.07 seconds) -Cbc0038I After 0.07 seconds - Feasibility pump exiting with objective of 12 - took 0.01 seconds -Cbc0012I Integer solution of 12 found by feasibility pump after 0 iterations and 0 nodes (0.07 seconds) +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.01 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.07 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from 12 to 12 @@ -8485,16 +8529,16 @@ Enumerated nodes: 0 Total iterations: 0 Time (CPU seconds): 0.07 -Time (Wallclock seconds): 0.08 +Time (Wallclock seconds): 0.07 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.10 (Wallclock seconds): 0.10 +Total time (CPU seconds): 0.09 (Wallclock seconds): 0.10 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/97b414047073428490114d7a88cf72db-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/97b414047073428490114d7a88cf72db-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/9419cbd661e14dfeabf51b87b219778c-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9419cbd661e14dfeabf51b87b219778c-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 12 COLUMNS @@ -8529,13 +8573,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/7d6f7118d3ad4a34b606341d0760d9f1-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ee0f668665d5411c8084efa37c8ce0a6-pulp.mps max timeMode elapsed branch printingOptions all solution /tmp/ee0f668665d5411c8084efa37c8ce0a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 7 COLUMNS @@ -8558,7 +8602,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ad840859c4f6474cb73cab65b7712e0f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4df1939b6a534de9b55560751c7e2189-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4df1939b6a534de9b55560751c7e2189-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8600,7 +8644,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/9cc37be4b56540cc851847b2bd0e33b6-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/b108fe45995e488ba088f81ee11977a6-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b108fe45995e488ba088f81ee11977a6-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 10 COLUMNS @@ -8622,7 +8666,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4bd34933846b44c8bc33dddc25d9e73f-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4cd9ada53aa34580a473d8b1bc34ce01-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4cd9ada53aa34580a473d8b1bc34ce01-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8644,7 +8688,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/6e613344ba1f4e2e84aa8f2608e65700-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1252ffa1f108467688839716b5237398-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1252ffa1f108467688839716b5237398-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8685,7 +8729,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ea6ff186d5ab4ed5ae771a0e01351131-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/22feef4fe4a2473d8e20eac0d8bff8f2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/22feef4fe4a2473d8e20eac0d8bff8f2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8707,7 +8751,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/b39c5a8f495d403786b8ae9efeb45586-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/3f40de4a2f8e4327bd8fe8a701a738d0-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/3f40de4a2f8e4327bd8fe8a701a738d0-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8720,8 +8764,8 @@ Continuous objective value is -1.37143 - 0.00 seconds Cgl0004I processed model has 1 rows, 4 columns (4 integer (0 of which binary)) and 4 elements Cutoff increment increased from 1e-05 to 0.00999 -Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.01 seconds) -Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of -1.1 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) +Cbc0012I Integer solution of -1.25 found by DiveCoefficient after 2 iterations and 0 nodes (0.00 seconds) Cbc0031I 2 added rows had average density of 3 Cbc0013I At root node, 2 cuts changed objective from -1.3333333 to -1.25 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 @@ -8730,7 +8774,7 @@ Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is 1 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.01 seconds) +Cbc0001I Search completed - best objective -1.25, took 2 iterations and 0 nodes (0.00 seconds) Cbc0035I Maximum depth 0, 0 variables fixed on reduced cost Cuts at root node changed objective from -1.33333 to -1.25 Probing was tried 3 times and created 0 cuts of which 0 were active after adding rounds of cuts (0.000 seconds) @@ -8747,17 +8791,17 @@ Objective value: -1.25000000 Enumerated nodes: 0 Total iterations: 2 -Time (CPU seconds): 0.01 -Time (Wallclock seconds): 0.01 +Time (CPU seconds): 0.00 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ff1b869af34f48708b97635ad33916d9-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ff1b869af34f48708b97635ad33916d9-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/56081d35732c4c4582691c3888192fac-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/56081d35732c4c4582691c3888192fac-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8781,7 +8825,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/c06e6b0833ab42038de57e563dae7c23-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/8008c818b6b84f64b7b59f96c436a78d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/8008c818b6b84f64b7b59f96c436a78d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8822,7 +8866,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ce45555911b04c67bbb0475a7985b7e4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/151344e3bee84653bf8e4acd5c018788-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/151344e3bee84653bf8e4acd5c018788-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8846,7 +8890,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5ea0e0b9cf9c4771ad79c7664790d4c4-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/75e7368a772e44b5be00f3eb3315e432-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/75e7368a772e44b5be00f3eb3315e432-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -8895,7 +8939,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/5bf3ef66608943e892553b41536064bd-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/5bf3ef66608943e892553b41536064bd-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/1655637f1c5d4ff2a770514f00627ea5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/1655637f1c5d4ff2a770514f00627ea5-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8938,17 +8982,17 @@ Objective value: 246.50000000 Enumerated nodes: 0 Total iterations: 1 -Time (CPU seconds): 0.00 +Time (CPU seconds): 0.01 Time (Wallclock seconds): 0.01 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/cdb860c0da454c88a60f0fe935950792-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdb860c0da454c88a60f0fe935950792-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/cdaa98c2ab70474aba2c0a798a0621d8-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/cdaa98c2ab70474aba2c0a798a0621d8-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -8970,7 +9014,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/a6ec013fb03a4bc690594407fc2976d5-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/a6ec013fb03a4bc690594407fc2976d5-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/4f05953337ff433a817015f9992c79af-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/4f05953337ff433a817015f9992c79af-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -9014,13 +9058,13 @@ Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.00 (Wallclock seconds): 0.00 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/e2ce1639423a4648aa8855c52229c70d-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/ed3a33dd93fe4ecd89de272d0a226434-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/ed3a33dd93fe4ecd89de272d0a226434-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -9044,7 +9088,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/f705970abe884a9eb9b86f3ed8cca733-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/94986f6c2a8a4853a2b126bdd31053b2-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/94986f6c2a8a4853a2b126bdd31053b2-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 6 COLUMNS @@ -9084,16 +9128,16 @@ Enumerated nodes: 0 Total iterations: 6 Time (CPU seconds): 0.00 -Time (Wallclock seconds): 0.01 +Time (Wallclock seconds): 0.00 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.00 (Wallclock seconds): 0.01 +Total time (CPU seconds): 0.01 (Wallclock seconds): 0.01 Welcome to the CBC MILP Solver Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/925f730714764a1b9e166853af805853-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/925f730714764a1b9e166853af805853-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/d1cf38fccba14acdab316bcc89a94e3d-pulp.mps timeMode elapsed branch printingOptions all solution /tmp/d1cf38fccba14acdab316bcc89a94e3d-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 8 COLUMNS @@ -9109,7 +9153,7 @@ Cutoff increment increased from 1e-05 to 0.00999 Cbc0012I Integer solution of 247 found by DiveCoefficient after 0 iterations and 0 nodes (0.00 seconds) Cbc0038I Full problem 3 rows 7 columns, reduced to 0 rows 0 columns -Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.01 seconds) +Cbc0012I Integer solution of 246.5 found by DiveCoefficient after 1 iterations and 0 nodes (0.00 seconds) Cbc0031I 1 added rows had average density of 3 Cbc0013I At root node, 1 cuts changed objective from 246.5 to 246.5 in 3 passes Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements, 2 column cuts (2 active) in 0.000 seconds - new frequency is -100 @@ -9119,7 +9163,7 @@ Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 Cbc0014I Cut generator 6 (TwoMirCuts) - 1 row cuts average 3.0 elements, 0 column cuts (0 active) in 0.000 seconds - new frequency is -100 -Cbc0001I Search completed - best objective 246.5, took 1 iterations and 0 nodes (0.01 seconds) +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) @@ -9146,7 +9190,7 @@ Version: 2.10.12 Build Date: Sep 17 2024 -command line - /usr/bin/cbc /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mps mips /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.sol (default strategy 1) +command line - /usr/bin/cbc /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.mps mips /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.mst timeMode elapsed branch printingOptions all solution /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.sol (default strategy 1) At line 2 NAME MODEL At line 3 ROWS At line 23 COLUMNS @@ -9155,14 +9199,14 @@ At line 27941 ENDATA Problem MODEL has 18 rows, 3213 columns and 15062 elements Coin0008I MODEL read with 0 errors -opening mipstart file /tmp/fbc4b6c8b4944ac586730fc7abdb4fcb-pulp.mst. +opening mipstart file /tmp/698df1c6a166472f9d7e58c0afe7bf09-pulp.mst. MIPStart values read for 3213 variables. Option for timeMode changed from cpu to elapsed -Continuous objective value is 12 - 0.01 seconds +Continuous objective value is 12 - 0.00 seconds Cgl0004I processed model has 18 rows, 3213 columns (3213 integer (3213 of which binary)) and 15062 elements Cutoff increment increased from 1e-05 to 0.9999 Cbc0045I MIPStart provided solution with cost 12 -Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.05 seconds) +Cbc0012I Integer solution of 12 found by Reduced search after 0 iterations and 0 nodes (0.03 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 @@ -9180,11 +9224,11 @@ Objective value: 12.00000000 Enumerated nodes: 0 Total iterations: 0 -Time (CPU seconds): 0.05 -Time (Wallclock seconds): 0.06 +Time (CPU seconds): 0.04 +Time (Wallclock seconds): 0.04 Option for printingOptions changed from normal to all -Total time (CPU seconds): 0.06 (Wallclock seconds): 0.07 +Total time (CPU seconds): 0.05 (Wallclock seconds): 0.05 ok test_LpVariable_indexs_deprecation_logic (pulp.tests.test_pulp.CHOCO_CMDTest.test_LpVariable_indexs_deprecation_logic) @@ -10522,7 +10566,7 @@ Given a valid problem that does not converge, ... skipped "solver not available" ---------------------------------------------------------------------- -Ran 1005 tests in 27.404s +Ran 1005 tests in 26.861s OK (skipped=885) @@ -11280,12 +11324,14 @@ dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: not including original source code in upload I: copying local configuration +I: user script /srv/workspace/pbuilder/4109425/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/4109425/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/2878175 and its subdirectories -I: Current time: Thu Nov 21 15:47:40 -12 2024 -I: pbuilder-time-stamp: 1732247260 +I: removing directory /srv/workspace/pbuilder/4109425 and its subdirectories +I: Current time: Fri Dec 26 00:12:28 +14 2025 +I: pbuilder-time-stamp: 1766657548 Compressing the 2nd log... /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/arm64/python-pulp_2.7.0+dfsg-4.diff: 86.8% -- replaced with /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/arm64/python-pulp_2.7.0+dfsg-4.diff.gz b2/build.log: 92.3% -- replaced with stdout Compressing the 1st log... b1/build.log: 92.3% -- replaced with stdout Fri Nov 22 03:49:32 UTC 2024 I: diffoscope 283 will be used to compare the two builds: ++ date -u +%s + DIFFOSCOPE_STAMP=/var/log/reproducible-builds/diffoscope_stamp_python-pulp_unstable_arm64_1732247372 + touch /var/log/reproducible-builds/diffoscope_stamp_python-pulp_unstable_arm64_1732247372 + RESULT=0 + systemd-run '--description=diffoscope on python-pulp/2.7.0+dfsg-4 in unstable/arm64' --slice=rb-build-diffoscope.slice -u rb-diffoscope-arm64_12-69671 '--property=SuccessExitStatus=1 124' --user --send-sighup --pipe --wait -E TMPDIR timeout 155m nice schroot --directory /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV --run-session -c jenkins-reproducible-unstable-diffoscope-524bfab7-47d1-412d-978a-798e481d3ee0 -- sh -c 'export TMPDIR=/srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/dbd-tmp-gMmWFEL ; timeout 150m diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1/python-pulp_2.7.0+dfsg-4_arm64.changes /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b2/python-pulp_2.7.0+dfsg-4_arm64.changes' + false + set +x Running as unit: rb-diffoscope-arm64_12-69671.service # Profiling output for: /usr/bin/diffoscope --timeout 7200 --html /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.html --text /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.txt --json /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/python-pulp_2.7.0+dfsg-4.diffoscope.json --profile=- /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b1/python-pulp_2.7.0+dfsg-4_arm64.changes /srv/reproducible-results/rbuild-debian/r-b-build.f7vAQdqV/b2/python-pulp_2.7.0+dfsg-4_arm64.changes ## command (total time: 0.000s) 0.000s 1 call cmp (internal) ## has_same_content_as (total time: 0.000s) 0.000s 1 call abc.DotChangesFile ## main (total time: 0.356s) 0.356s 2 calls outputs 0.000s 1 call cleanup ## recognizes (total time: 0.016s) 0.016s 12 calls diffoscope.comparators.binary.FilesystemFile ## specialize (total time: 0.000s) 0.000s 1 call specialize Finished with result: success Main processes terminated with: code=exited/status=0 Service runtime: 709ms CPU time consumed: 709ms _ _ _ _ __ _ _| |_| |__ ___ _ __ _ __ _ _| |_ __ | '_ \| | | | __| '_ \ / _ \| '_ \ _____| '_ \| | | | | '_ \ | |_) | |_| | |_| | | | (_) | | | |_____| |_) | |_| | | |_) | | .__/ \__, |\__|_| |_|\___/|_| |_| | .__/ \__,_|_| .__/ |_| |___/ |_| |_| Fri Nov 22 03:49:33 UTC 2024 I: diffoscope 283 found no differences in the changes files, and a .buildinfo file also exists. Fri Nov 22 03:49:33 UTC 2024 I: python-pulp from unstable built successfully and reproducibly on arm64. INSERT 0 1 INSERT 0 1 DELETE 1 [2024-11-22 03:49:33] INFO: Starting at 2024-11-22 03:49:33.746195 [2024-11-22 03:49:33] INFO: Generating the pages of 1 package(s) [2024-11-22 03:49:34] CRITICAL: https://tests.reproducible-builds.org/debian/unstable/arm64/python-pulp didn't produce a buildlog, even though it has been built. [2024-11-22 03:49:34] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/armhf/python-pulp_2.7.0+dfsg-4.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/armhf/python-pulp_2.7.0+dfsg-4.diff.gz is missing [2024-11-22 03:49:34] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/armhf/python-pulp_2.6.0+dfsg-1.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/armhf/python-pulp_2.6.0+dfsg-1.diff.gz is missing [2024-11-22 03:49:34] INFO: Finished at 2024-11-22 03:49:34.186469, took: 0:00:00.440279 Fri Nov 22 03:49:34 UTC 2024 - successfully updated the database and updated https://tests.reproducible-builds.org/debian/rb-pkg/unstable/arm64/python-pulp.html Fri Nov 22 03:49:34 UTC 2024 I: Submitting .buildinfo files to external archives: Fri Nov 22 03:49:34 UTC 2024 I: Submitting 8.0K b1/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc https://buildinfo.debian.net/8daa1432b11941d05a13c98cff4bf008cd0730a5/python-pulp_2.7.0+dfsg-4_all Fri Nov 22 03:49:34 UTC 2024 I: Submitting 8.0K b2/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc https://buildinfo.debian.net/9c7409816d97e6c08cb858c14dcd3b4f8c37e662/python-pulp_2.7.0+dfsg-4_all Fri Nov 22 03:49:35 UTC 2024 I: Done submitting .buildinfo files to http://buildinfo.debian.net/api/submit. Fri Nov 22 03:49:35 UTC 2024 I: Done submitting .buildinfo files. Fri Nov 22 03:49:35 UTC 2024 I: Removing signed python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc files: removed './b1/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc' removed './b2/python-pulp_2.7.0+dfsg-4_arm64.buildinfo.asc' 1732247375 arm64 unstable python-pulp Starting cleanup. /var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/arm64/python-pulp_2.7.0+dfsg-4.rbuild.log: 92.1% -- replaced with /var/lib/jenkins/userContent/reproducible/debian/rbuild/unstable/arm64/python-pulp_2.7.0+dfsg-4.rbuild.log.gz [2024-11-22 03:49:36] INFO: Starting at 2024-11-22 03:49:36.060432 [2024-11-22 03:49:36] INFO: Generating the pages of 1 package(s) [2024-11-22 03:49:36] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/unstable/armhf/python-pulp_2.7.0+dfsg-4.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/unstable/armhf/python-pulp_2.7.0+dfsg-4.diff.gz is missing [2024-11-22 03:49:36] ERROR: Either /var/lib/jenkins/userContent/reproducible/debian/logs/bookworm/armhf/python-pulp_2.6.0+dfsg-1.build2.log.gz or /var/lib/jenkins/userContent/reproducible/debian/logdiffs/bookworm/armhf/python-pulp_2.6.0+dfsg-1.diff.gz is missing [2024-11-22 03:49:36] INFO: Finished at 2024-11-22 03:49:36.539163, took: 0:00:00.478738 All cleanup done. Fri Nov 22 03:49:36 UTC 2024 - total duration: 0h 4m 5s. Fri Nov 22 03:49:36 UTC 2024 - reproducible_build.sh stopped running as /tmp/jenkins-script-Gf82dl6e, removing. Finished with result: success Main processes terminated with: code=exited/status=0 Service runtime: 4min 8.494s CPU time consumed: 7.732s