ok    1  the woodshop block: 5 benches, 2 stools
ok    2  profit = 205 lands in the objective variable
ok    3  uses 29 boards, 22 hours
ok    4  are decimal: the fractional plan 51/13, 61/13
ok    22  the decimal plan re-checks exactly: 5 * benches + 2 * stools = 29, benches is the fraction 51/13
ok    5  named constants / variables as coefficients, a >= row, comments and a blank line inside: 5 / 2
ok    6  the objective keeps its constant term: 205 - 100 = 105
ok    7  minimize block: staffing 4 days, 3 nights
ok    8  cost 76
ok    9  an = row (two rows inside): 3x + 5y = 47, the largest x -> 14, 1
ok    10  mixed: benches whole (5), finish decimal (8 litres: 29 - 25 = 4 boards -> 8)
ok    11  value 207
ok    12  the 0/1 knapsack as a block: worth 60 with three items
ok    13  both sides carry unknowns, a / 2, parentheses, -(-q): 1.5, 7 -> 26.75 (exact)
ok    14  a block whose constraints cannot be met raises INFEASIBLE
ok    23  INFEASIBLE names the constraints themselves when no decimal plan exists either
ok    24  INFEASIBLE names the whole-number requirement when a decimal plan exists, and pluralizes
ok    25  after INFEASIBLE the unknowns and the goal variable keep their previous values
ok    15  earlier blocks answers untouched (each block has its own hidden arrays)
ok    16  a block inside a routine
ok    17  then: maximize profit, then minimize steel -> 24 brackets, 4 hinges
ok    18  both goal variables are set: profit 600, steel 32
ok    19  three goals: the third is ranked below the second (still 24 / 4)
ok    20  then on decimals: the tie among x + y = 10 goes to the largest x
ok    21  a later goal with no limit raises UNBOUNDED
passed =  25   failed =  0 
