Re: [ojAlgo-user] bug report: ILP problem

[Anders P. <an...@op...>]

It's better you send me source code that I can execute and use as a test case. /Anders

On 8 apr 2013, at 01:25, Jeff Sherman <jef...@gm...> wrote:

> When I execute the following program:
> Minimize
>  1*x1
> Subject To
>  1*x2013 >= 0
>  1*x2014 >= 0
>  1*x1 >= 0
>  -5000.0*x2014 + 5100.0*x2013 + -1.0*x1 <= 0
>  -5000.0*x2014 + 5100.0*x2013 + 1.0*x1 >= 0
>  5000*x2013 + 5000*x2014 = 19105000
> Bounds
> Variables
>  x2014 integer
>  x2013 integer
>  x1 continuous
> 
> I get these results which are suboptimal:
> x1 = 5899.999999996906
> x2013 =  1891
> x2014 = 1930
> 
> Or these results (which seem to occur at random):
> x1 = Infinity
> x2013 =  0
> x2014 = 0
> 
> Using another solver, I obtain: 
> x1 = 4200.000000000075
> x2013 = 1892
> x2014 = 1929
> ------------------------------------------------------------------------------
> Minimize network downtime and maximize team effectiveness.
> Reduce network management and security costs.Learn how to hire 
> the most talented Cisco Certified professionals. Visit the 
> Employer Resources Portal
> http://www.cisco.com/web/learning/employer_resources/index.html_______________________________________________
> ojAlgo-user mailing list
> ojA...@li...
> https://lists.sourceforge.net/lists/listinfo/ojalgo-user