According to the original paper, all the constraints should be active by the end of the algorithm. That is, the final solution should satisfy all the constraints.
However, that is not true for my particular problem. I am using Accord.Net to get a C# implementation of a prototype I previously implemented in Matlab, and I debugged all the code prior to the call to the Accord.NET classes' methods to be sure that I am feeding the algorithms with the correct parameters.
The algorithm finishes without displaying any error or throwing any exception, but many constraints are not satisfied. Is this a bug of the library's code?
Was there any new release to correct this? I am seeing problems with the GodfarbIdnani solver myself . In my problem I have 19 variables , 2 equality constraints , and 38 inequality constraints ( basically inequalities are that each of the 19 solution points should be in the closed set [0 1] ).
The code completed with a solution , but the last solution variable is set to a negative value ( violating one inequality constraint)
I downloaded the latest Accord.Net package , so I probably have one that is newer than the one mentioned in this post , so I am puzzled. It is possible that I have incorrectly specified the problem . What is an easy way to verify this? I can provide the code and variables if needed.
Thanks
Sri