Operational Research problem solver

This is a Windows Forms (GUI) application that solves problems of Operational Research

Possible problems

These are the problems that can be solved via the application

• Linear programming in primal form (via simplex)
  • Step by step output
  • Gomory planes
• Linear programming in dual form (not tested)
  • Step by step output
• Knapsnack
  • Lower and upper bounds
  • Boolean version
    • Step by step
    • Solution via Branch and Bound
  • Recursive solution
• Travelling Salesman Problem (TSP)
  • Lower and upper bounds
  • Step by step
  • Solution via Branch and Bound
• Minimum Cost Flow Problem (MCFP)
  • Step by step solution (simplex for networks)
  • Max flow and cut of minimum capacity
  • Shortest paths tree via Dijkstra
• Non linear programming problems
  • Project gradient descent and Franke Wolfe algorithms for a IronPython function
  • LKKT solution for a QuadProg function

Credits

All the algorithms are implemented following the lectures of the Ricerca Operativa course of professor Massimo Pappalardo of the University of Pisa.