regarding the discussion question, my guess is that the only cases where the answer becomes unique are those 'trivial' single-vector or equivalent cases. More precisely those cases where min(nnz(row_sums),nnz(col_sums))<=1. The reasons is that if one solution exist where x(a,b)>0 and x(c,d)>0 (and a~=c and b~=d; i.e. they are not in the same row or column), then you could simply subtract one from x(a,b) and x(c,d), and add one to x(c,b) and x(a,d), and the result will also be a valid solution... thoughts?
I confess, I found the results using intlinprog.
I would love to know how you came up with that.
Find all elements less than 0 or greater than 10 and replace them with NaN
Return the 3n+1 sequence for n
Remove all the words that end with "ain"
Find a Pythagorean triple
Encoding Google Maps Polylines
Determine the Result of a Move in Reversi
Balanced Ternary Numbers: Easy as |, |-, |o
Frobenius McNugget Factorization
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office