I fixed some errors in modified simplex method. However I think not all. Keep working. Now for project build you can use Nant. I also added support of lp format that is used by lp_solve package. First priorities now - fix errors and speedup computations.
Included method based on Branch and Bound method for solving linear-integer programming tasks.
Next step will be heuristics and sparse matrix representation.
I almost finished BnB algorithm. It will be avalible by the end of this week. Everyone intrested in this project are welcome for beta testing.
New version has support of modified simplex method and parametrical analysis. Documentation will be later. Use examples for understanding task sintacsis.
I've just finished dual simplex method. Sametimes it gets strange results. Needs many tests. So you can try.
I finished M-task simplex method.
I created internal format for tasks that would be solved only by simplex method. This format allow using only real variables. No integer, no parametric. It is simple clone of more advenced format for package "LinProg/P" (http://www.bookworld.ru/Whitebear/LPSample/help.htm).
Sorry only Russian help. Coming soon English.
I also added parser for MPS format. May will be LP parser. How knows?