Ana Guasque Ortega

Many thanks, David! I didn't know this possibility. An another question related to indicator constraints (if I should write the question at any other thread, please tell me) I read that it is not p...

Many thanks, Jaromil, now it is totally understood.  Maybe I should consider another way of modelling the problem since each of the lists may have up to 100 values, approximatelly. Maybe it becames...

Many many thanks, Jaromil! I get the point, I think I can do it. But, what if the values are not following any sequence? How to obtain the value of v2 in that case? for example: dict={'a':[1,1,2,2,...

Hi again, Jaromil! Many thanks, it worked.  However, it does not solve my problem. Maybe I did not explain it well. What I want is to find the value of the variable. Imagine this: dict={'a':[12,24,...

Many thanks for your response, Jaromil. Could I query the values of the attributes before the optimization is complete? I have tried to see (only for checking how it works) the name of the variable...

Many thanks again. Best, Ana.

Many thanks for your answer, Jaromil.  To know valid bounds for each iteration variable is not a problem. I think I can estimate the maximum number of iterations too. Do you know where can I find d...

Many thanks for your response!!! Finally it works!

Thanks, Elisabeth. Yes, you are totally right, I simplified the code but yours is the correct one. Thanks for solving the question of non-linearily. Now, I understand that the non-linearity is in t...

Many thanks! That was the solution.  Is there any way of obtaining not-repeated solutions? For example, in a classical multiple Knapsack problem, if I have 2 bins and 4 items, I'll get these soluti...