Hi I would like to generate a dual ray when the first phase of the primal simplex algorithm cannot reach the zero objective value. The auxiliary optimization problem's dual solution is exactly an infeasible ray (dual unbounded ray), but I do not know, how can I retrieve it in glpk. Could you advice some solution?
Best, Balazs _______________________________________________ Help-glpk mailing list [email protected] http://lists.gnu.org/mailman/listinfo/help-glpk
