Dear Vijay Patil, > You are right. I should have used term "repeating decimal" instead of > "irrational". Should have looked up before using it.
I would rather say not machine / internally representable. For example 0.1 is neither irrational nor repeating decimal, and still cannot be represented internally, the hexadecimal image of the floating point numbers enclosing 0.1 (interval enclosing 0.1) is: 0:3fb:9999999999999 0:3fb:999999999999a Try out the example program on my homepage or at least have a look at its output: http://reliablecomputing.eu/software.html Check out these software in case of numerical problems, probably one of them may help you: Verified SemiDefinite Programming in Matlab-toolbox INTLAB (Prof. Jansson) http://www.ti3.tu-harburg.de/jansson/vsdp/ Verification software in MATLAB / INTLAB (Prof. Rohn) http://www.cs.cas.cz/rohn/matlab/index.html Lurupa in C++ (Keil) http://www.ti3.tu-harburg.de/~keil/#software > give optimal integer solution (x_1 = 2, x_2 = 2). Since there are 3 optimal > integer solutions, it is matter of finding all of them, instead of accepting > first optimal solution. I need to work on this to find You probably do not loose solution, and do not have numerical difficulties; just need to enumerate all integer solutions? Good luck, Ali _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
