search

miguelkachondo / or-tools

Automatically exported from code.google.com/p/or-tools
0 stars 0 forks source link

mixed_integer_programming's result isn't global optimum(for .NET) #25

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
mixed_integer_programming's solution isn't global optimum(for .NET)

Thanks for your attention!

I'm trying to solve a mixed-integer problem with orTools like the example 
csintegerprogramming.cs.
The objective function and the constraints are all linear.
When I solved it with CBC_MIXED_INTEGER_PROGRAMMING or other methods,then I got 
one result(this is the first result).
But when I change the first result into a new constraint and add it into the 
problem above.Then I get a second result,I found that the sencond result is 
better then the first one. 
So, I think I got a locally optimal solution.
How can I solve this problem?

Original issue reported on code.google.com by mwzh2...@gmail.com on 16 May 2013 at 8:23