similar to: Problems with lpSolve/Memory ? R crashes

Hi. I am trying to use the linear optimizer from package lpSolve in R 2.4.1 on Windows XP (Version 5.1). The problem I am trying to solve has 2843 variables (2841 integer, 2 continuous) and 8524 constraints, and I have 2 Gb of memory. After I load the input data into R, I have at most 1.5 Gb of memory available. If I start the lp with significantly less memory available (say 1 Gb), I get

Hello all, I would like to use the lp function (lpSolve package) on a linux system. Using sample code from the lp function help, I can solve the linear program with no errors or problems. However, when I copy the exact same code to R in linux (after loading the lpSolve package), I get the following error: *** caught segfault *** address 0x3, cause 'memory not mapped' Traceback: 1:

Hi I have just dwonloaded QCA3 onto this machine (ubuntu, karmic, amd64) and a mac. The examples run fine on teh mac, but crashed R on ubuntu. Any help much apprecia\ted. Thanks Richard ------------------------------------------------------------------------------ Terminal log: > conditions <- >

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

Hi, I am working with lpSolve "R" package by Sam Buttrey, buttrey at nps.navy.mil , which is interface to lp_solve linear/integer programming system. You can find information about lp_solve at http://groups.yahoo.com/group/lp_solve/ (free registration required). lpSolve (R package) supports linear and integer programming but it does not support semi-continuous variables

Dear R users, I would like to optimize a linear approximation of a quadratic function using lpSolve. My code runs without any error or warning message but the constraints that I set don't seem to work properly. Nevertheless, I am certain that my code is somewhere wrong. I would like to solve the following problem: max 2x-x^2+y subject to 2x^2 + 3y^2 <= 6 2>= x,y >= 0 I would

How to define bounds for a semi continous variable in lp_solve. Min 5x1 +9x2 +7.15x3 +0.1x4 subject to x1+x2+x3+x4=6.7 x1+x4 <= 6.5 And x3 can be 0 or greater than 3.6 hence x3 is a semi continous variable how to define bounds as well as semicontinous function because using set.semicont and set. bound simantaneously doesn't seem to work.Thanks in advance for the help -- View this

Under freebsd 6.2-p7 i386, R 2.5.1,gcc-4.2.2 I'm unable to compile package lpSolve because: hpbsd# R CMD INSTALL lpSolve_5.5.8.tar.gz * Installing to library '/usr/local/lib/R/library' * Installing *source* package 'lpSolve' ... ** libs cc -std=gnu99 -I/usr/local/lib/R/include -I/usr/local/lib/R/include -I . -DINTEGERTIME -DPARSER_LP -DBUILDING_FOR_R -DYY_NEVER_INTERACTIVE

Hey, Anyone who knows what the following error report when calling lp() in package lpSolve means? Error: status 3 JT -- View this message in context: http://n4.nabble.com/lpSolve-tp1599380p1599380.html Sent from the R help mailing list archive at Nabble.com.

Hello R users, I have two quick questions while using "lpSolve" package for linear programming. (1) the result contains both characters and numbers, e.g., Success: the objective function is 40.5, but I only need the number, can I only store the number? (2) How to set boundaries for variables? e.g., all variable are positive. Thanks a lot! Xiaoxi

Hi, Using the package lpSolve API, I need to build a 2000*100000 constraint matrix. I wonder which method is faster: (a) model = make.lp(0,0) add.constraint(model, ...) or (b) model = make.lp(2000,100000) set.constraint(model,...) Thanks ------------ KC

Hi. I've tried to execute &#34;example(lp.assign)&#34; in lpSolve package. However, this solution seemed not to return correct answer, all matrix elements were zeros. Could you give me any &#34;solution&#34; about this? Regards.

Dear all, I'm working on a very complex linear optimization problem using the lp.transport function in lpSolve. My PC has 10 cores, but by default R uses only one of them. Is there a straightforward way to make lp.transport use all cores available? I had a look at "High-performance and parallel computing in R" ( http://cran.r-project.org/web/views/HighPerformanceComputing.html),

Hi. In the help page for "lp" in package lpSolve, regarding "const.dir" it says: const.dir: Vector of character strings giving the direction of the constraint: each value should be one of "<," "<=," "=," "==," ">," or ">=". (In each pair the two values are identical.) I am having trouble understanding

Dear all, I am a beginner with lpSolve package (and not an expert in the others). I can not understand why I am doing wrong, and I would be very grateful if anyone could please help me on this. I am trying to optimize ("min") the sum of columns/variables, constrained to >=1. Each column/variables has its weight - given by values at f.obj. The matrix for numeric constraint

Dear all, I am interested in solving a MIP problem with binary outcomes and continuous variables, which ARE NOT RESTRICTED TO BE NEGATIVE. In particular, Max {z1,z2,z3,b1} z1 + z2 + z3 (s.t.) # 7 z1 + 0 z2 + 0 z3 + b1 <= 5 # 0 z1 + 8 z2 + 0 z3 - b1 <= 5 # 0 z1 + 0 z2 + 6 z3 + b1 <= 7 # z1, z2, z3 BINARY {0,1} # -5<= b1 <=5 (i.e. b1 <= 5; -b1 <= 5 ) Using

Hi R People: If you have a linear programming problem in which some of the constraints have the "<=", some have ">=" and some have "=", all in the same problem, should the solver work? I'm having trouble with that. Any help much appreciated! Sincerely, Erin Hodgess mailto: hodgess at gator.uhd.eud whoops! mailto: hodgess at gator.uhd.edu

Dear Friends, I am trying to install a few packages in R and am receiving error messages. Since the error messages are different, I am posting them separately. The second error is with the installation of lpSolve. The core error message is: ======================================================================== In file included from /usr/include/bits/posix1_lim.h:153, from

Dear all, I am trying to find a solution satisfying the below equations in R. Set up the problem 9 X1+ X2 + X3 = 2 X1+ X2 + X3 = 1 which is subjected to 0 < X1 < X2 < X3 < 2. I have downloaded the packages \'linprog\' and \'lpSolve\' but can not see how to solve the question. Thank you for your help. With

I am using mice package for multiple imputation. For one data (attached), mice doesn't impute all missing values. Specifically, some variables were not imputed at all. the reproducible code library(mice) test.df<-read.table(c:\\test.txt',header=T,sep=',') mi<-mice(test.df,maxit=10,m=5) sum(is.na(complete(mi,1))) >129 and x41, x50... were not imputed at all. Any