Determining the right-hand vectors of an irredundant linear inequality system
From MaRDI portal
Publication:2466585
DOI10.1016/j.orl.2005.08.004zbMath1133.90370OpenAlexW2053620867MaRDI QIDQ2466585
Ramprasad Potluri, Lawrence E. Holloway
Publication date: 15 January 2008
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2005.08.004
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Redundancy in mathematical programming. A state-of-the-art survey
- Consistency, redundancy, and implied equalities in linear systems
- On the Algorithmic Complexity of Minkowski's Reconstruction Theorem
- On a Correspondence between t and F Values in Multiple Regressions
- Lectures on Polytopes