Timeline for Existence/Uniqueness of Nonnegative Solutions of Linear Systems of Equations
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 2, 2010 at 16:04 | comment | added | Noah Stein | I checked the jstor article you mentioned and it does not contain any terribly useful information for this question. It does not address uniqueness, only feasibility. It gives a procedure for checking feasibility, but it is not a simple criterion anyway. The paper is old (1926) and much work has been done on LP since then. So if you just wanted to check feasibility, you'd be better off with modern methods, anyway. | |
| Jul 1, 2010 at 3:59 | answer | added | Guilherme | timeline score: 5 | |
| Jun 30, 2010 at 19:12 | answer | added | Noah Stein | timeline score: 5 | |
| Jun 30, 2010 at 19:10 | comment | added | Adam Clarridge | Also, if rank($A$)$=m$, then since we have the constraint on $x$ I don't think we are guaranteed any solutions (in the unconstrained case we are guaranteed infinitely many). | |
| Jun 30, 2010 at 18:52 | comment | added | Adam Clarridge | I think it may be different - I put no constraints on $b$, and I am not interested in integer solutions. | |
| Jun 30, 2010 at 14:29 | comment | added | Wadim Zudilin | And I can't understand the meaning of "uniqueness" in this case: you simply hav to check whether $\operatorname{rank}(A)=m$. | |
| Jun 30, 2010 at 14:24 | comment | added | Wadim Zudilin | I guess that the examples discussed in mathoverflow.net/questions/23990 perfectly match your question. | |
| Jun 30, 2010 at 14:01 | history | asked | Adam Clarridge | CC BY-SA 2.5 |