stzOptimModel

(no comment in the source: the name reads as a sentence) initno extension

[ :x = [0, 40], :y = [0, :integer] ] -- a spec is [lb], [lb, ub], [lb, :integer] or [lb, ub, :integer]. An omitted upper bound means UNBOUNDED ABOVE, which the engine models exactly rather than by a large number standing in for infinity. 3 examples run

oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()
#--> infeasible

library testQCSXTZZZIBWU

(no comment in the source: the name reads as a sentence) add varno extension

(no comment in the source: the name reads as a sentence) has varno extension

(no comment in the source: the name reads as a sentence) number of varsno extension

(no comment in the source: the name reads as a sentence) var namesno extension

(no comment in the source: the name reads as a sentence) bounds ofno extension

2. THE OBJECTIVE 3 examples run

oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()
#--> infeasible

library testQCSXTZZZIBWU

(no comment in the source: the name reads as a sentence) minimizeQCSXTZZZIBWU

(no comment in the source: the name reads as a sentence) senseno extension

(no comment in the source: the name reads as a sentence) objective coefficientsno extension

3. THE CONSTRAINTS 3 examples run

oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()
#--> infeasible

library testQCSXTZZZIBWU

(no comment in the source: the name reads as a sentence) add constraintno extension

(no comment in the source: the name reads as a sentence) add named constraintno extension

(no comment in the source: the name reads as a sentence) number of constraintsno extension

(no comment in the source: the name reads as a sentence) constraint atno extension

The comparable form. Two surfaces agree when THIS is equal -- never when their answers are, because two different wrong models can produce the same number and one guard would pass both.no extension

the same, with the constraint NAMES dropped -- for comparing two surfaces that agree on the mathematics and label it differentlyno extension

THE AST AS ONE CANONICAL STRING, and it exists because Haro's `=` does not compare two nested lists structurally -- two ASTs whose every field printed identically still answered "not equal", so a guard written the obvious way would have failed while the surfaces agreed. A signature compares exactly, and when it differs it can be PRINTED side by side, which a list comparison never could.no extension

the model as it reads, for a human and for a narrationno extension

(no comment in the source: the name reads as a sentence) showno extension

4. SOLVING ------------------------------------------------------ :auto picks the tier; :floor forces the Zig simplex+B&B; :highs is the upgrade tier and is REFUSED while it is not vendored, because answering with the floor would make the two-tier claim untrue. 1 examples runQCSXTZZZIBWU

Same as SolveWith: 4. SOLVING ------------------------------------------------------ :auto picks the tier; :floor forces the Zig simplex+B&B; :highs is the upgrade tier and is REFUSED while it is not vendored, because answering with the floor would make the two-tier claim untrue. 2 examples run

oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()
#--> infeasible

library testno extension

5. READING THE ANSWERno extension

(no comment in the source: the name reads as a sentence) statusno extension

(no comment in the source: the name reads as a sentence) status word 2 examples run

oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()
#--> infeasible

library testno extension

(no comment in the source: the name reads as a sentence) is optimalno extension

(no comment in the source: the name reads as a sentence) objective 2 examples runno extension

(no comment in the source: the name reads as a sentence) solution 2 examples runno extension

(no comment in the source: the name reads as a sentence) value ofno extension

(no comment in the source: the name reads as a sentence) nodesno extension

(no comment in the source: the name reads as a sentence) iterationsno extension

(no comment in the source: the name reads as a sentence) branched 1 examples runno extension

(no comment in the source: the name reads as a sentence) engineno extension

LAW 3: the verdict explains itself, and NAMES THE TIER THAT RANno extension

(no comment in the source: the name reads as a sentence) show whyno extension

Does the reported point actually satisfy the model? A solver that returns a confident wrong answer is the failure this catches, and it costs one pass over the rows.no extension

(no comment in the source: the name reads as a sentence) is feasible answerno extension