search for: amsterdamoptimization

Hello, 1) Is there any nonlinear programming optmizer that I can user for the following problem? Obj function: (max) revenue = price * volume Constraints: price and volume pair must be from the following variable data set: Variable data set: # price volume 1 10 500 2 20 450 3 30 330 4 40 250 5 50 190 Expected result: 10,000 (variable row#4) 2) Could it also be possible for the suggested

Dear R-experts, this is not a direct R-problem but I hope you can help me anyway. I would like to minimize || PG-I || over P, where P is a p x p permutation matrix (obtained by permuting the rows and/or columns of the identity matrix), G is a given p x p matrix with full rank and I the identity matrix. ||.|| is the frobenius norm. Does anyone know an algorithm to solve such a problem? And if

For an application in image processing -- using R for statistical purposes -- I need to solve the following task: Given n (e.g. n = 100 or 200) points in the unit square, more or less randomly distributed. Find a rectangle of maximal area within the square that does not contain any of these points in its interior. If a, b are height and width of the rectangel, other constraints may have to be

Hello I was trying to estimate the weibull model using nls after putting OLS values as the initial inputs to NLS. I tried multiple times but still i m getting the same error of Error in nlsModel(formula, mf, start, wts) : singular gradient matrix at initial parameter estimates. The Program is as below > vel <- c(1,2,3,4,5,6,7,8,9,10,11,12,13,14) > df <- data.frame(conc, vel) >

Hi, I have a complex-valued vector X in C^n. Given another complex-valued vector Y in C^n, I want to find a permutation of Y, say, Y*, that minimizes ||X - Y*||, the distance between X and Y*. Note that this problem can be trivially solved for "Real" vectors, since real numbers possess the ordering property. Complex numbers, however, do not possess this property. Hence the