simplex_running

std.optim.simplex_running · Level L1

Whether the simplex method is still pivoting: status 2, as 1 or 0. It becomes 1 at an optimum and 0 when the problem is unbounded. The condition simplex_max loops on.

[status = 2]

Signature

simplex_running(T: i64[m+1, n+m+1], basis: i64[m], D: i64[], status: i64[]) → f64[]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

input
operation
constant
call
output

Verification

Signature proven by NOVA’s shape solver, for every size.
Equal to the reference float(status == 2) in exact rational arithmetic, on all 40 test cases.
All 40 float64 results are exact: the error is zero.
Interpreter and NumPy backend return bit-identical results.
At float32 too: the 40 test cases rounded to float32, and 40 of them exact, with zero error.

Accuracy in detail

correctly rounded (the float64 nearest the exact value): 100%
bit-equal to the NumPy formula in float64: 100%
largest error, in units in the last place: 0

Identity

Calls

—

Called by

simplex_max

sha256:5055082292c7ea39978e7fbd223545283d270b059a06fa2799e9ee490e9cd95b

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.

Control handle

Symbol: Ω:std.optim.simplex_running · Ω:simplex_running
Pins: sha256:56b136a411b920746ec7eb234492ffd1fb1870bf17fde7d91895aa1184158752this graph alone
Evidence: sha256:7fb439dc8bccedde31a251eb7562f451a17faad3ccba68460aa56035b676199fthe hash of its verification record
Needs: no capability: a pure function

Through NOVA’s control layer, the symbol launches this function only while the program still matches what it pins: a change to this graph, or to any graph it reaches, needs a migration first.