Solve()
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.
Basic examples (2)
oF = new stzOptimModel()
oF.Vars([ :x = [ 0, 10 ] ])
oF.Maximize("x")
oF.SubjectTo([ "x >= 20" ])
oF.Solve()
? oF.StatusWord()infeasible
run on 2026-10-02 04:25 inside the library at commit 0e72e2e2c; taken from 12-an-optimisation-model.en.md(opens in a new tab)
oN = new stzOptimModel()
oN.Vars([ :chairs = [ 0, :integer ], :tables = [ 0, :integer ] ])
oN.Maximize("30*chairs + 45*tables")
oN.SubjectTo([ "2*chairs + 5*tables <= 250", "chairs <= 60", "tables <= 60" ])
oN.Solve()
? @@( oN.Solution() )
? oN.Objective()
? oN.Branched()[ [ "chairs", 60 ], [ "tables", 26 ] ] 2970 1
run on 2026-10-02 04:25 inside the library at commit 0e72e2e2c; taken from 12-an-optimisation-model.en.md(opens in a new tab)
The extensions of this method
Each extension, and whether it exists for this method; an extension that exists combines with the others (FindSTCS).
Every example is a test file of the library, run inside the library for this page; only those whose output kept every promise their file wrote are shown.

