search for: presolv

...] 30 20 60 40 66 90 [2] 20 30 60 40 66 90 [3] 25 31 60 40 66 90 [4] 27 26 60 40 66 90 row.signs <- rep ("=", 4) row.rhs <- c(15,10,5,30) col.signs <- rep ("=", 6) col.rhs <- c(1,1,1,1,1,1) lp.transport (costs, "min", row.signs, row.rhs, col.signs, col.rhs, presolve=0, compute.sens=0) lp.transport (costs, "min", row.signs, row.rhs, col.signs, col.rhs, presolve=0, compute.sens=0)$solution Outcome: Error in lp.transport(costs, "min", row.signs, row.rhs, col.signs, col.rhs, : Error: We have 6 signs, but 7 columns Does anyone know where...

...direction), x.count = as.integer(x.count), objective = as.double(objective), const.count = as.integer(const.count), constraints = as.double(constraints), int.count = as.integer(int.count), int.vec = as.integer(int.vec), objval = as.double(objval), solution = as.double(solution), presolve = as.integer(presolve), compute.sens = as.integer(compute.sens), sens.coef.from = as.double(sens.coef.from), sens.coef.to = as.double(sens.coef.to), duals = as.double(duals), duals.from = as.double(duals.from), duals.to = as.double(duals.to), status = as.integer(status), PACKA...

...constraints = as.double(constraints), int.count = as.integer(int.count), int.vec = as.integer(int.vec), bin.count = as.integer(bin.count), binary.vec = as.integer(binary.vec), num.bin.solns = as.integer(num.bin.solns), objval = as.double(objval), solution = as.double(solution), presolve = as.integer(presolve), compute.sens = as.integer(compute.sens), sens.coef.from = as.double(sens.coef.from), sens.coef.to = as.double(sens.coef.to), duals = as.double(duals), duals.from = as.double(duals.from), duals.to = as.double(duals.to), scale = as.integer(scale), use.dense =...

...MayUse. > (I think the BitVector must be sparse, otherwise the alias-analysis module need too much memory to allocate for all BitVectors.) Well, actually, this is what led to bdd representations. GCC uses sparse bitmaps, which work fine for intraprocedural use. We do a large amount of presolving to discover equivalences before ever filling in points-to sets. I'm not sure your mechanism of solving, but if you are constraint solving, you should special case ALL_MEMORY (and a few others). There is never a reason to add anything to a points-to set that contains ALL_MEMORY. >...

...ctor must be sparse, otherwise the alias-analysis > module need too much memory to allocate for all > BitVectors.) > > Well, actually, this is what led to bdd representations. > > GCC uses sparse bitmaps, which work fine for intraprocedural > use. > We do a large amount of presolving to discover equivalences > before > ever filling in points-to sets. > > I'm not sure your mechanism of solving, but if you are > constraint > solving, you should special case ALL_MEMORY (and a few > others). > There is never a reason to add anything to a points-to se...

...1.txt",he ad=T) > DadosM=as.matrix(Dados) > f.obj<-c(1,2,2,2,2,2,2,2,4,4,4,4,4,4,4,4,6,6,6,6,8,8,8) > f.dir<-array(c(">="),dim=c(1,379)) > > f.rhs<-array(1,dim=c(1,23)) > lp ("min", f.obj, DadosM, f.dir, f.rhs, transpose.constraints = TRUE, presolve=0, compute.sens=0) Error: no feasible solution found Mensagem de aviso: number of columns of result not a multiple of vector length (arg 2) in: rbind(const.mat, const.dir.num, const.rhs) I imagine that there are some arguments I am not defining properly. Is it? Which one(s)? I really could not...

Hi, John I am building a flow sensitive intra-procedural alias analysis(without interprocedural info). So, the first thing I have to consider is where a parameter-pointer or a global-pointer might point to. Then I defined several special Virtual Memory Locations: ALL_MEMORY, GLOBAL_MEMORY, STACK_MEMORY, HEAP_MEMORY. ALL_MEMORY contains GLOBAL_MEMORY, STACK_MEMORY, HEAP_MEMORY. e.g1:

...the alias-analysis >> module need too much memory to allocate for all >> BitVectors.) >> >> Well, actually, this is what led to bdd representations. >> >> GCC uses sparse bitmaps, which work fine for intraprocedural >> use. >> We do a large amount of presolving to discover equivalences >> before >> ever filling in points-to sets. >> >> I'm not sure your mechanism of solving, but if you are >> constraint >> solving, you should special case ALL_MEMORY (and a few >> others). >> There is never a reason to...

...m to overdefined. IPCP also works much the same way by pre-solving arguments constants This is precisely because this stuff is non-trivial to reason about, and unclear to me that it's really worth it. If *it* is worth it, we can do better than we do now (and contain the mess *entirely* to the presolver), and if it's not, we shouldn't have complicated reasoning to try to make it work well. Right now we have the worst of all worlds. We have a mess in both places (the resolver and the solver both step on each other and differ in behavior), it's hard to reason about (though provably n...

Hi Daniel, On Fri, Dec 30, 2016 at 10:55 PM, Daniel Berlin <dberlin at dberlin.org> wrote: >> Right, but we are talking about "when, in the intermediate state, can i >> transform an undef to a different value". >> >> Remember you can only go down the lattice. So you can't make undef >> constant, and then discover it's wrong, and go back up :)

...lso works much the > same way by pre-solving arguments constants > > This is precisely because this stuff is non-trivial to reason about, and > unclear to me that it's really worth it. If *it* is worth it, we can do > better than we do now (and contain the mess *entirely* to the presolver), > and if it's not, we shouldn't have complicated reasoning to try to make it > work well. > > Right now we have the worst of all worlds. We have a mess in both places > (the resolver and the solver both step on each other and differ in > behavior), it's hard to re...