Turns a completed search into the object callers read: the matched sample's size, the largest size the bound admits, the gap between them, and the state of every constraint the match was asked to meet.
Value
An object of class cardinality_report, a list with elements:
n_matched,n_left_matched- matched pairs, and the left units they use.best_possible- the largest matched sample the bound admits.gap,gap_fraction-best_possible - n_matched, in matched units and as a share ofbest_possible.certified-TRUEonly when the search settled, every solve its bound rests on was certified, the incumbent's own solve was certified and audited, andgapis zero.objective,bound- the incumbent's value of the network objective and the global lower bound on it.best_possibleis read frombound.stopped_on,n_nodes,engine,status.stages- one row per stage of a search over unit selections, in the order the objective ranks them ("size", an"imbalance"row per refined level,"distance"): whether it closed, what stopped it, its nodes and seconds, and its value and bound in its own units (matched units, units of imbalance, total distance). No rows when one network solve answered the call.constraints- one row per stated constraint, with what it asked for and what the matched sample achieved.balance- matched counts and imbalance per category at every level.tiers,precision_headroom,shift- the weights that order the objective, how many times its range fits inside the range a double orders exactly, and the constant taken off every distance.total_distance,pairs- the matched set itself.potentials- the pair potentials of the solve the matched set came from, as.cardinality_pair_duals()reads them, orNULLwhen that solve was not certified.
Invisibly returns x.
summary() returns a summary.cardinality_report containing the
original report; printing it displays the size bound, constraints,
category counts, and optimization stages where available.