ok    1  the woodshop: whole: true -> 5 benches, 2 stools
ok    2  profit 205 (the fractional plan was 207.69, its roundings infeasible or 165)
ok    3  uses exactly 29 boards and 22 hours
ok    4  _integer = the linear programs solved (a handful)
ok    5  without whole: the fractional plan 51/13, 61/13 (as 16-place decimals), value 207.69
ok    6  whole: true with exact: false: the same 5 / 2 (snapped whole)
ok    7  whole: false is the plain linear program
ok    8  max 7x + 6y: 5x + 4y <= 45, 2x + 3y <= 29 -> (5, 5) = 65 (LP 2.71 / 7.86 rounds infeasible)
ok    9  max 29x + 34y -> (14, 1) = 440
ok    10  max 20x + 33y -> (13, 8) = 524
ok    11  0/1 knapsack (x_j <= 1 rows): value 60, whole, within every limit
ok    12  an equality as two rows: 3x + 5y = 47, the largest x -> (14, 1)
ok    13  minimize whole (a >= row, phase 1): staffing (4, 3) = 76
ok    14  fractional profits 0.5 / 1.5: whole-number value 5
ok    15  the cafe in whole cups: (8, 4) = 31
ok    16  three unknowns: value 196 (brute force agrees)
ok    17  8 variables, 5 rows: value 84, whole, feasible
ok    18  only x = 1/2 satisfies the rows: INFEASIBLE naming whole-number
ok    19  x + y <= 1 and x + y >= 3: INFEASIBLE
ok    20  x - y <= 1 alone: UNBOUNDED, the detail says even before whole numbers are required
ok    21  whole: from a boolean variable
ok    22  composes: stats$sum(maximize(..., whole: true)) = 7, dot(...) = 205
ok    23  scalar context with whole: -- parses, raises ARRAYRESULT
ok    24  minimize whole under the double kernel: (4, 3)
ok    25  whole: mask (1, 0): benches whole 5, finish decimal 8 -> 207
ok    26  whole: mask (0, 1): the other unknown whole -- 4.7, 11 -> 208.5 (the oracle)
ok    27  a 3-element mask for 2 variables: ARRAYSHAPE naming the counts
ok    28  a 2 in the mask: NOT0OR1
ok    29  an all-zero mask is the plain program: 4.64, 11.6 -> 208.8
passed =  29   failed =  0 
