getMaxProblemSize

<p>To prevent users from starting excessively large matching problems, the
maximum problem size is limited by <code>options("optmatch_max_problem_size")</code>.
This function a quick helper to assist fetching this value as a scalar. If the
option isn't set, the function falls back to the default value, hard coded in
the <code>optmatch</code> package.</p>

Distance based bipartite matching using minimum cost flow, oriented
to matching of treatment and control groups in observational studies ('Hansen'
and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). 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.

Josh Errickson

optmatch

Functions for Optimal Matching

Ben Hansen

Mark Fredrickson

Josh Buckner

Adam Rauh

getMaxProblemSize function

What is the maximum allowed problem size? — getMaxProblemSize

What is the maximum allowed problem size?

getMaxProblemSize: What is the maximum allowed problem size?

Description

Usage

Arguments

Value

See Also

Examples