I have a project that requires programming code for the simplex algorithm and criss-cross algorithm. The purpose of this project is to compare the two methods. I've tried to find it, but the programming code for the criss-cross algorithm is very difficult to find. Maybe someone can help me find the source or someone already has it. Or if you have another source that has it, please simply drop the link below. I'll use the programming code to solve linear programming problems. Any program doesn't matter as long as it can solve the problem of the linear program. Thank you very much.

For those who don't know about the Criss Cross algorithm I'm referring to, you can visit this link https://en.wikipedia.org/wiki/Criss-cross_algorithm

  • $\begingroup$ How does criss cross compare to dual simplex fir MILP nodes? $\endgroup$ – Mark L. Stone May 13 at 0:44
  • $\begingroup$ Is the criss cross algorithm the best kept secret in O.R., or is it secret for a reason (i.e, has no merit vs. (dual) simplex or IPM)? $\endgroup$ – Mark L. Stone May 13 at 1:39
  • 2
    $\begingroup$ a comparision paper: onlinelibrary.wiley.com/doi/pdf/10.1111/… $\endgroup$ – user3680510 May 13 at 7:53
  • $\begingroup$ @user3680510 Do you have, or is there, a free synopsis of the results of the paper you linked? Thanks. $\endgroup$ – Mark L. Stone May 13 at 15:11
  • $\begingroup$ @user3680510 thank you so much for the reference paper, and it is very helpful $\endgroup$ – newbie May 15 at 12:26

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.