ok  1 : the woodshop plan is unchanged
ok  2 : oak: the slack of a tight <= row is 0
ok  3 : hours: 36 - 22 = 14 to spare
ok  4 : a = 8, b = 2, made 28
ok  5 : room: 0 left; atleast: a >= 2 has a surplus of 6 (used minus limit)
ok  6 : an = row has slack 0; a sigil label holds it as an integer
ok  7 : the machine shop plan is unchanged
ok  8 : slack from the final plan: machine 0, steel 50 - 32 = 18
ok  9 : order: hinges >= 4 met exactly, surplus 0
ok  10 : oak3_worth = 90/13 exactly (one more board is worth 6.92 of profit)
ok  11 : hours3_worth = 5/26 (an hour is worth 19 cents)
ok  12 : the worths times the limits = the profit (strong duality), exactly
ok  13 : both rows tight: slack 0 and 0
ok  14 : decimal shifts: 4 days, 2.5 nights, cost 70
ok  15 : coverage_worth = 6: one more point costs 6 (half a night shift)
ok  16 : daycap_worth = -8: one more day shift allowed saves 8
ok  17 : the loose row is worth 0 and has 3.5 of slack; the tight rows have none
ok  18 : marginal(c, a, b): one value per row, exact
ok  19 : worth . limits = the optimum
ok  20 : exact: false agrees within 1e-12
ok  21 : minimum: true -- per unit added to each limit AS WRITTEN (the >= row negated): -6, -8, 0
ok  22 : a scalar-context marginal() raises ARRAYRESULT
ok  23 : marginal() of an infeasible program raises INFEASIBLE
ok  24 : the binding row is worth 3 (the better product), the loose cap 0 with 90 of slack
r_lp_worth: passed 24 failed 0 
