> Is it possible to enumerate the neighboring feasible solutions of the > solution of an lp? > I assume that in order to decide if the simplex algorithm can stop it > is necessary to check all neighboring feasible solutions. Is this right? > And if so is there a way of enumerating the neighborhood of feasible > solutions around the optimal one? >
You may perform the post-optimal analysis by specifying the '--ranges' option for glpsol, or with the routine glp_print_ranges. For more details please see the glpk reference manual, Section 3.4 "Post-optimal analysis routines". _______________________________________________ Help-glpk mailing list [email protected] https://lists.gnu.org/mailman/listinfo/help-glpk
