Teep

195 Reputation

5 Badges

15 years, 351 days

MaplePrimes Activity


These are questions asked by Teep

Can somebody please expand the following double sum to produce a list of sequences?

(Sum(f[i], i = 0 .. 1))*(Sum(g[i, j, k], j = 0 .. 1)) for k = {1,2}

I need to make sure the operation order is correct, so I would like to verify my workings.

Thanks!

I wish to apply several i-j constraints to an optimization problem that involves minimizing a function x[i,j]. 

Does anyone know of a simple way to exclude values for i and j? For instance, how do we specify the conditions, i not equal to j, i is not equal to 1, etc.?

Thanks in advance!

 

 

Can somebody suggest an efficient way to specify / input a large list of binary variables in the LPSolve command, for example:

> LPSolve(objective function, constraints, binaryvariables={ x[0,0,1], .x[0,0,2], ...., x[i,j,k]}

Is it possible to assign a name to the set rather than input each element, x[i,j,k], manually?

Thanks in advance!

I'm curious to know if anyone has written a procedure to optimize the VRP with time windows / constraints.

I am working to minimize an objective function concerning a facility location problem (p-median technique).

Can somebody explain how to formulate the constraint equation that involves  1 or 0?

For instance, the constraint x[i,j]  is an element of {0,1}; namely, x[i,j] = 1 if a point is assigned to a facility located at the point j; 0 otherwise.

Thanks in advance.

 

First 9 10 11 Page 11 of 11