2023-05-19 21:51:35 +0100 | received badge | ● Taxonomist |
2019-09-24 09:52:17 +0100 | received badge | ● Student (source) |
2019-09-23 10:08:36 +0100 | asked a question | Linear Programming: float solving and exact verification Hi there, the glpsol tool (GLPK) provides an option "--xcheck": the solver compute the optimal solution uses floating points, and then checks the correctness using exact arithmetics (i guess implicitly they re-check the basis variables, so this only requires one matrix inversation on exact arithmetics)
So, does anyone have already an implementation for such a verification? Best, Manfred |
2019-09-22 23:37:15 +0100 | received badge | ● Notable Question (source) |
2019-09-22 23:37:15 +0100 | received badge | ● Popular Question (source) |
2019-09-22 23:36:19 +0100 | received badge | ● Autobiographer |
2015-03-30 16:08:44 +0100 | answered a question | Evaluation fail well thanks for the fast answer but i already knew this "workarround" ;) i reported this problem as i thought that this was a (very small) bug since pow(0,0) evaluates to 1. hence, it does not make any sense at all that the exception "pow(0,0) is undefined" is thrown. |
2015-03-29 12:37:39 +0100 | received badge | ● Editor (source) |
2015-03-29 12:35:31 +0100 | asked a question | Evaluation fail hello, when running "0^0" the result is "1", but when defining "f(x)=0^x" and evaluating "f(0)" the evaluation fails with "ValueError: power::eval(): pow(0,0) is undefined". I guess this one is easy to fix... :) version: Sage Version 6.5, Release Date: 2015-02-17 regards, manfred |