solve_min_TX: Minimize number of payments using linear programming

In miguelbiron/minTX: Minimize the Number of Transactions between Counterparties Needed to Settle Debts

Description

Minimize number of payments using linear programming

Usage

solve_min_TX(D = NULL, b = NULL)

Arguments

D	matrix of payments between members of size n \times n with nonnegative entries
b	vector of size n with net income of each member (positive or negative). Entries of b must add up to 0. If both b and D are present, b is used

Value

Matrix of payments of size n \times n with the least number of nonzero entries

Examples

solve_min_TX(D = matrix(rexp(5*5, 1/10), nrow = 5))

miguelbiron/minTX documentation built on May 7, 2019, 10:53 p.m.