starting_solutions: Compute starting solution for the transportation problem

In transport: Computation of Optimal Transport Plans and Wasserstein Distances

Compute starting solution for the transportation problem

Description

Compute a feasible transference plan between two mass vectors.

Usage

northwestcorner(a, b)
russell(a, b, costm)

Arguments

a, b	Two numeric vectors (typically containing natural numbers) of length m and n, describing mass distributions.
costm	A m by n matrix of costs for moving one unit of mass.

Value

A list whose components are m by n matrices, viz.

assignment	containing as (i,j)-th entry the mass assigned from origin i to destination j;
basis	containing as (i,j)-th entry a 1 if it is a basic entry and a 0 otherwise.

Warnings

The current implementations are in R. Computations may be slow for larger vectors a and b.
The computed starting solution may be degenerate, i.e. there may be basic entries where zero mass is assigned.

Author(s)

Dominic Schuhmacher [e-mail]

See Also

transport

transport documentation built on Sept. 17, 2024, 1:08 a.m.