num_eligible_matches

num_eligible_matches.optmatch.dlist

num_eligible_matches.matrix

num_eligible_matches.InfinitySparseMatrix

num_eligible_matches.BlockedInfinitySparseMatrix

<p>This will return a list of the number of finite entries in a distance
matrix. If the distance has no subgroups, it will be a list of length 1. If
the distance has subgroups (i.e. <code>x</code> is an
<code>BlockedInfinitySparseMatrix</code>, it will be a named list.)</p>

Distance based bipartite matching using the RELAX-IV minimum cost flow solver,
oriented to matching of treatment and control groups in observational
studies. Routines are provided to generate distances from generalised linear models (propensity
score matching), formulas giving variables on which to limit matched distances, stratified or
exact matching directives, or calipers, alone or in combination.

Mark Fredrickson

optmatch

Functions for Optimal Matching

num_eligible_matches function

Returns the number of eligible matches for the distance. — num_eligible_matches

Returns the number of eligible matches for the distance.

num_eligible_matches: Returns the number of eligible matches for the distance.

Description

Usage

Arguments

Value