subproblemSuccess

The result of <code><a rd-options="" href="/link/fullmatch?package=optmatch&version=0.9-17" data-mini-rdoc="optmatch::fullmatch">fullmatch</a></code> or <code><a rd-options="" href="/link/pairmatch?package=optmatch&version=0.9-17" data-mini-rdoc="optmatch::pairmatch">pairmatch</a></code>.

<code><a rd-options="" href="/link/fullmatch?package=optmatch&version=0.9-17" data-mini-rdoc="optmatch::fullmatch">fullmatch</a></code> can break up a large matching problem into smaller
subproblems (for example, using strata defined by <code><a rd-options="" href="/link/exactMatch?package=optmatch&version=0.9-17" data-mini-rdoc="optmatch::exactMatch">exactMatch</a></code>).
This function lists the subproblems in a match and list whether at least on
treated unit was matched in subproblem. Subproblems that have no matched
treated units are said to have "failed."

internal

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

subproblemSuccess function

The result of <code><a rd-options='' href='fullmatch'>fullmatch</a></code> or <code><a rd-options='' href='pairmatch'>pairmatch</a></code>.

<code><a rd-options='' href='fullmatch'>fullmatch</a></code> can break up a large matching problem into smaller
subproblems (for example, using strata defined by <code><a rd-options='' href='exactMatch'>exactMatch</a></code>).
This function lists the subproblems in a match and list whether at least on
treated unit was matched in subproblem. Subproblems that have no matched
treated units are said to have "failed."

subproblemSuccess: (Internal) Report successful subproblems.

Description

Usage

Arguments

Value