|
|
 |
| found 24 articles for 0.302 sec |
  |
Group: comp.softsys.sas · Group Profile · Search for Sigma0 in comp.softsys.sas
Author: Dale McLerran
Date: Jun 21, 2008 22:39
I actually suspect that your "supremum" and "infimum" functions are the problem here -- they look like they might be accumulating thunks and blowing your stack. But beyond this, they're also o(n) for what could be effectively an o(log n) operation at the least, if you used ordered sets. I'd start improving performance here with some profiling, and then some strictness annotations, and then go
|
| Show full article (2.32Kb) |
Group: comp.softsys.sas · Group Profile · Search for Sigma0 in comp.softsys.sas
Author: "Ingrid K. Friberg"
Date: Jun 21, 2008 13:02
hi, all: i use linprog solving a linear problem. however, looking into the solution, it seems like the linprog algorithm ignored the equality constraints. a part code of the problem is as following: [p,N] = size(Y); ue = eye(p,p); A = kron(Y',ue); sigma = -ones(p*N,1); A = [A,sigma]; sigma1 = zeros(1,p*p); sigma1 = [sigma1,1]; A = -[A;sigma1]; b = zeros(p*N+1,1); u1 = ones(1
|
| Show full article (2.60Kb) |
|
 |
|
1 ·
2 ·
3 ·
next |
|
|