solveP

Solve the network flow problem - basic version

Matching algorithm based on network-flow structure.
Users are able to modify the emphasis on three different
optimization goals: two different distance measures and
the number of treated units left unmatched. The method is proposed by Pimentel
and Kelz (2019) <doi:10.1080/01621459.2020.1720693>.
The 'rrelaxiv' package, which provides an alternative solver for
the underlying network flow problems, carries an
academic license and is not available on CRAN, but
may be downloaded from Github at
<https://github.com/josherrickson/rrelaxiv/>.

Shichao Han

MultiObjMatch

Multi-Objective Matching Algorithm

Samuel D. Pimentel

solveP function

<dl><dt>net</dt>
<dd>the network representation</dd>
<dt>f1.list</dt>
<dd>the list of the first objective functions values for each node</dd>
<dt>f2.list</dt>
<dd>the list of the second objective functions values for each
node</dd>
<dt>rho</dt>
<dd>the penalty coefficient</dd>
<dt>tol</dt>
<dd>the tolerance value for precision</dd></dl>

Arguments

Solve the network flow problem - basic version — solveP

<dl>

<dt>net</dt>
<dd>the network representation</dd>


<dt>f1.list</dt>
<dd>the list of the first objective functions values for each node</dd>


<dt>f2.list</dt>
<dd>the list of the second objective functions values for each
node</dd>


<dt>rho</dt>
<dd>the penalty coefficient</dd>


<dt>tol</dt>
<dd>the tolerance value for precision</dd>

</dl>

solveP: Solve the network flow problem - basic version

Description

Usage

Value

Arguments