Analytic / CONCEPT
Finite Farkas Alternatives
The finite Bartl recursion supplies Farkas alternatives over ordered scalars.
Closed
DIRECT PREREQUISITES0
DIRECT CONSEQUENCES2
PROOF DEPTH0
DOCUMENT LINKS1
Finite Bartl alternative
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
None recorded in this release.
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- Extended Farkas Alternativestructural-affinity · Closed
- Finite Attainment for Extended Linear Programsstructural-affinity · Closed
- Finite occurrence cycles yield a natural epoch potentialstructural-affinity · Closed
- General cost probability transportstructural-affinity · Closed
- LayeredFlowstructural-affinity · Closed
- PositiveCircuitSupplierstructural-affinity · Closed
- SupplierDualstructural-affinity · Closed
- SupplierGraphstructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance