Skip to main content
This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (
Help us improve Python packaging - Donate today!

A python package to find optimal number of transactions betweeen friends

Project Description

# iou

A python module using networkx, pyomo and ipopt to solve for the optimally minimum number of transactions to settle debts/expenses between friends.

<p align=”center”> <img src=”” width=”400” > </p>

## Install

pip install py-iou pip install py-iou –upgrade

### Dependencies

If you have [Anaconda]( or [Miniconda](, you can install it using the following command.

`bash conda install -c conda-forge ipopt `

## Run

  • Run the following to find the optimal transactions using input from transactions.csv

    iou –data iou/data/transactions.csv


    iou –data iou/data/transactions.csv –verbose

<p align=”center”> <img src=”” align=”center” width=”400” > </p>

Use help

iou –help

A transactions.csv file is required to find the optimal order

## Contribution

Feel free to submit a pull request.

Release History

This version
History Node


History Node


History Node


History Node


History Node


Download Files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

File Name & Hash SHA256 Hash Help Version File Type Upload Date
(6.6 kB) Copy SHA256 Hash SHA256
Source Jul 11, 2017

Supported By

WebFaction WebFaction Technical Writing Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Heroku Heroku PaaS Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Rackspace Rackspace Cloud Servers DreamHost DreamHost Log Hosting