version: GLPSOL: GLPK LP/MIP Solver, v4.43 In my lp file, there are 2 constraint voilated by solving in GLPK:
Xmax67_134 - 999999 B67_134BB<= 0 Xmax67_136 - 999999 B67_136BB<= 0 B67_134BB and B67_136BB are both binary variables. The solution given by GLPK is following: Row name Activity Lower bound Upper bound Xmax67_134 6.8975 0 B67_134BB * 0 0 1 Xmax67_136 0.7975 0 B67_136BB * 0 0 1 How could GLKP give a solution that is not feasible? Thanks. _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
