rho_proposition

An internal helper function used for automatically generating
the set of rho values used for grid search in exploring the Pareto optimal
set of solutions.

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

rho_proposition function

<dl><dt>paircosts.list</dt>
<dd>a vector of pair-wise distance.</dd>
<dt>rho.max.factor</dt>
<dd>a numeric value indicating the maximal rho values.</dd>
<dt>rho1old</dt>
<dd>a vector of numeric values of rho1 used before.</dd>
<dt>rho2old</dt>
<dd>a vector of numeric values of rho2 used before.</dd>
<dt>rho.min</dt>
<dd>smallest rho value to consider.</dd></dl>

Arguments

Generate penalty coefficient pairs — rho_proposition

<dl>

<dt>paircosts.list</dt>
<dd>a vector of pair-wise distance.</dd>


<dt>rho.max.factor</dt>
<dd>a numeric value indicating the maximal rho values.</dd>


<dt>rho1old</dt>
<dd>a vector of numeric values of rho1 used before.</dd>


<dt>rho2old</dt>
<dd>a vector of numeric values of rho2 used before.</dd>


<dt>rho.min</dt>
<dd>smallest rho value to consider.</dd>

</dl>

rho_proposition: Generate penalty coefficient pairs

Description

Usage

Value

Arguments