On Tue, 29 Apr 2014, Fatih Gürdal wrote:
In an academic paper it is claimed finding all solutions to non linear
systems of equations by using glpk.There, dual simplex method is said to
use.
For the general case, color me dubious.
Some problem classes are inherently unsolvable.
My question is how we can define this problem in glpk to have the solutions.
In other words how can we define a problem about solving systems of
linear/nonlinear equations using glpk?
GLPK does continous and integer linear programming.
Iterative programming can get you a bit more,
but I expect that even among solvable problems,
iterative MILP is not suitable for some.
--
Michael henne...@web.cs.ndsu.nodak.edu
"SCSI is NOT magic. There are *fundamental technical
reasons* why it is necessary to sacrifice a young
goat to your SCSI chain now and then." -- John Woods
_______________________________________________
Help-glpk mailing list
Help-glpk@gnu.org
https://lists.gnu.org/mailman/listinfo/help-glpk
