arXiv (All)
open access
On the 100% Rule of Linear Programming
The so-called ``100% rule'' is a somewhat classical and yet somehow obscure rule that gives some local sensitivity-analysis information based on the very limited local sensitivity-analysis information that is often made available by linear-programming software, derived from an optimal basis that is
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Policy evaluation and learning with partially identified utility under truncation by death#1143384
- Where Sensitivity Don't Work#716694
- Geometry-Dependent Approximation for Non-Monotone $k$-Submodular Maximization#1199323
- Optimization#209941
- B205 Technical Section on Optimization of Nuclear Safety Regulation : (5) Corrective Action Program (CAP) in United States#69860
Record · ID 1296672
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive