G
Gary
Howdy,
I'm trying to solve a Binary integer non-linear programming with the
mighty excel solver. The problems wants the optimal location for three
facilities based on their weighted distance from 30 different towns.
Each town connects to only one facility, hence the binary part. I'm
fairly certain I've set up the problem correctly. The trouble is the
solver's sensitivity to the initial locations of the facilities.
Depending on the initial location, solver seems to stop at a locally
optimal solution. My question, finally, is how can I force solver to
brute force the problem and find the globally optimal solution? I'm
willing to wait a couple of hours and so forth. Thanks for any advice.
-g
I'm trying to solve a Binary integer non-linear programming with the
mighty excel solver. The problems wants the optimal location for three
facilities based on their weighted distance from 30 different towns.
Each town connects to only one facility, hence the binary part. I'm
fairly certain I've set up the problem correctly. The trouble is the
solver's sensitivity to the initial locations of the facilities.
Depending on the initial location, solver seems to stop at a locally
optimal solution. My question, finally, is how can I force solver to
brute force the problem and find the globally optimal solution? I'm
willing to wait a couple of hours and so forth. Thanks for any advice.
-g