On Wed, Nov 18, 2015 at 6:30 AM, Fernando Garcia <[email protected]> wrote:
> Hello everyone, I am having some problems when solving a problem because > it is not feasible. I have checked the code hundreds times and I still dont > know where can be the unfeasibility. > > Is there any routine in the glpk packet in c++ to show in which row/column > appears the unfeasibility? > > > Thanks in advance, > > Fernando > Infeasibility means that there are no points (assignments to all variables) that satisfy the system of constraints you've declared. Typically this isn't due to any single constraint (row) or variable (col) on its own. You might try removing constraints one at a time in some way until you reach a problem with non-empty feasible set. Identifying a minimal set of constraints for which the problem is infeasible can help figure out why the full system is infeasible (people sometimes call this a minimal UNSAT core, or just an UNSAT core..) (ps. sorry about double mail, I forgot to reply to list the first time)
_______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
