similar to: non-linear integer optimization?

Dear List, My student and I are looking for an optimizer for a nonlinear optimization problem we are working on. The problem we are working on is to try to pick a set of islands on which to eradicate rats for seabird conservation. We have about 50 islands, each of which has some subset of 17 seabird species. Rats are present on all islands, and will cause the seabirds to go extinct unless they

I'll appreciate the help on the following problem: I solved many Nonlinear programming problems with nonlinear constraints....Rdonlp is working well but i am unable to get INTEGER data with nonlinear constraints in Rdonlp. Is it possible to get Integer Values of parameters in any package of R with nonlinear constraints. Rahul [[alternative HTML version deleted]]

Hi. I am aware of three different R packages for linear programming: glpk, linprog, lpSolve. From what I can tell, if there are N variables and M constraints, all these solvers require the full NxM constraint matrix. Some linear solvers I know of (not in R) have a sparse matrix input format. Are there any linear solvers in R that have a sparse matrix input format? (including the

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

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

Dear all I can not understand how to install the package lpsolve_1.1.9.zip I have read the FAQ and the help pages carefully, but it still not clear for me. I have tried the following (and obtained the respective error messages): >install.packages("c:/ProgramFiles/R/rw2011/library/lpSolve_1.1.9",destdir=" c:/ProgramFiles/R/rw2011/library/lpSolve") Mensagem de aviso:

Hi list, I want to find the total maximum resources I can spend given a set allocation proportion and some simple budget constraints. However, I get suboptimal results via lp and friends (i.e. lpSolve and simplex in the linprog and boot) . For example: library(lpSolve) proportions = c( 0.46, 0.28, 0.26) constraints = c( 352, 75, 171) lp(objective.in = proportions, const.mat =

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

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

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

Apart from the fact that the statement "such that t1+t2+t3+t4=2970 (as it must)" is not correct, the LP can be implemented as follows: library(lpSolve) LHS <- rbind( c(0,0,0,0, 1, 0, 0,0), c(1,0,0,0,-1, 1, 0,0), c(0,1,0,0, 0,-1, 1,0), c(0,0,1,0, 0, 0,-1,1), cbind(-diag(4),diag(4)), c(0,0,0,0,0,1,0,0), c(0,0,0,0,0,0,1,0), c(0,0,0,0,0,0,0,1) ) RHS <-

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:

Question for 'experts' in LP using R (using the lpSolve package, say) -- which does not apply to me for the sort of problem I describe below. I've run any number of LP's using lpSolve in R, but all of them to date have objective and constraint functions that both contain the same variables. This lets you set up a LHS and RHS matrix/vector that are symmetrical. But, for a

Dear UseRs, I wrote following function in order to solve Data Envelopment Analysis. Reason for posting is that the function is slow when nrow(dat) is large. I wonder if other functions could substitute the for() loop in the code, such as mapply(). Can anybody help to rewrite the dea() function as efficiently as possible? The code is as follows:

Hi Folks: I used that one example for AGI script on C web, only to fill the working with the Asterisk. I compiled and it worked great. I executed accidentally the ls -l command in directory where was the source and executable, I noted and was surprised that because the executable size was to further 20 times more than source. I executed the gcc -Os source.c -o executable.agi command several

Dear all, I am trying to find the solution for the optimization problem focused on the finding minimum cost. I used the solution proposed by excel solver, but there is a restriction in the number of variables. My data consists of 300 rows represent cities and 6 columns represent the centres. It constitutes a cost matrix, where the cost are distances between each city and each of six centres. ..+

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 <- >

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, I am new to R for solving optimization problems, I have set of communication channels with limited capacity with two types of costs, fixed and variable cost. Each channel has expected gain for a single communication. I want to determine optimal number of communications for each channel maximizing ROI)return on investment) with overall budget as constraint.60000 is the budget allocated.

Dear Ben Bolker, searching for a R code able to do the CPCA I found a message by you on https://stat.ethz.ch/. In that message you said you have something I am looking for. Would you share with me? I ma stuck with a commercial software (GOLPE) that is not developed anymore, therefore I'd like to try to use R for the calculations I need. Looking forware for a reply from you Rino --