|
From: | Anselmo Pitombeira |
Subject: | Re: [Help-glpk] feasibility problem |
Date: | Sun, 18 Apr 2010 11:58:40 -0300 |
User-agent: | Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.9.1.10pre) Gecko/20100416 Shredder/3.0.5pre |
The feasibility problem is a particular case of the optimizationI am wondering if GLPK solves feasibility problem,that is the problem without objective function just with constraints.problem, where the objective function is a constant (usually zero).If Yes,what kind of formulation it accepts.The same as in the general case.
I think the feasibility problem is solved by the artificial problem, this is, the problem of finding an initial basic feasible solution by the Simplex Algorithm.
_______________________________________________ Help-glpk mailing list address@hidden http://lists.gnu.org/mailman/listinfo/help-glpk
[Prev in Thread] | Current Thread | [Next in Thread] |