Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.



Optimization problem
Posted:
Feb 2, 2010 7:19 AM


Hello,
I am working on the following reallife problem:
Maximize sum_p (product_t [(1x)_tp])
s.t. sum_t (x_tp) <= 18 for all p sum_p (x_tp) = 1 for all t
x_tp binary
There are about 10000 variables and 1000 restrictions.
My optimization knowledge is not really uptodate, so I hope anyone can help.
Can anyone give me any information about what methods or software are suitable for this problem. If there is any software that can solve this problem, how long will it take to solve such kind of problem?
Thank you very much,
Jantina



