Displaying 5 results from an estimated 5 matches for "objval".
Did you mean:
byval
2007 Jul 10
1
error using lp function in linux
...back:
1: .C("lpslink", direction = as.integer(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...
2005 Mar 30
1
Problems with lpSolve/Memory ? R crashes
...quot;,"=","=","=")
f.rhs <- c(-52,0,54,0,2,0,0,0,0,0,0,0,0,0)
lp.out <- matrix( ncol = 2, nrow = 13 )
for(ii in 1:amount){ # - simple iterate the same
for( i in 1:13 ){
f.obj[ w[i] ] <- 1
lp.out[ i, 1 ] <- lp("min", f.obj, m, f.dir, f.rhs)$objval
lp.out[ i, 2 ] <- lp("max", f.obj, m, f.dir, f.rhs)$objval
f.obj <- rep( 0, 33 )
}
}
lp.out
}
2010 Apr 20
2
QCA3 segfault
...e = 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), 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 =...
2007 Mar 09
1
lpSolve space problem in R 2.4.1 on Windows XP
...upper.tri(matrix(nrow=Nm1,ncol=Nm1)))
>lb.dir=rep(">=",Nm1)
>lb.rhs=ub.rhs
>f.con=rbind(bin.con,gp.con,ub.con,lb.con)
>f.dir=c(bin.dir,gp.dir,ub.dir,lb.dir)
>f.rhs=c(bin.rhs,gp.rhs,ub.rhs,lb.rhs)
>lglp=lp("min",f.obj,f.con,f.dir,f.rhs,int.vec=f.int)
>lglp$objval
[1] 0.9166667
>lglp$solution
[1] 0.0000000 0.9166667 0.0000000 1.0000000 0.0000000 1.0000000 0.0000000
[8] 0.0000000 0.0000000
>
What this is doing is taking the points of v1 and dividing them into
contiguous groups (the variable ngp is the number of groups) such that the
sums of the v1 va...
2011 Sep 19
1
Binary optimization problem in R
Dear all,
I would like to solve a problem similar to a multiple knapsack problem and
am looking for a function in R that can help me.
Specifically, my situation is as follows: I have a list of n items which I
would like to allocate to m groups with fixed size. Each item has a certain
profit value and this profit depends on the type of group the item is in. My
problem is to allocate the items