Named Linear FeasibilityΒΆ
Generic named-linear interval problems. This layer is useful when the object to audit is already a linear feasibility problem over scalar variables, rather than a public/hidden cell recomposition problem.
|
|
|
Evaluate all target intervals under all named linear scenarios. |
|
|
|
|
|
|
|
|
|
|
|
|
|
Audit whether a named-linear interval report supports a bound claim. |
|
Rank active constraints by how much they narrow one target interval. |
|
Check all active constraints and variable bounds, including unused variables. |
|
Find an irreducible infeasible subset, including variable-bound sides. |
|
Residual of one constraint or variable-bound side in original units. |
|
A deletion-filter conflict, not necessarily the smallest conflict. |
|
Linear feasibility problem with named variables, targets, and scenarios. |
|
Interval report for a named linear feasibility problem. |
|
Bound claim about a target interval under one named scenario. |
|
Review artifact for a named-linear interval claim. |
|
Feasible target interval under one named scenario. |
|
One endpoint solve for a target under a scenario. |
|
Effect of relaxing one active constraint group for one interval. |
|
Leave-one-group-out interval attribution for a named linear report. |
|
One endpoint-side diagnostic for an active linear constraint. |
|
One named scalar variable in a linear feasibility problem. |
|
Linear expression |
|
Linear interval constraint |
|
Named linear target expression optimized over a feasibility set. |
|
Named active-constraint scenario for interval evaluation. |