Ricerca Operativa
Università degli Studi di Udine · A.A. 2025–2026
Ricerca Operativa — Interactive Companions
Interactive visualizations for the course lecture notes. Step through classic Operations Research algorithms with sliders and custom inputs—all running in your browser.
Covers the full syllabus: linear programming and the Simplex method, integer programming (Branch & Bound, Cutting Planes, Total Unimodularity), and graph algorithms (traversal, minimum spanning trees, shortest paths, network flows, and matching). Each topic pairs an interactive notebook with fully solved exercises, alongside the complete lecture notes and solutions as downloadable PDFs.
Linear Programming & Simplex
Ch 2
LP Graphical Method
Plot constraints, shade the feasible region, and slide the objective to the optimum
Ch 4
Simplex Tableau
Step through pivot operations on the simplex tableau
Ch 4
Simplex in 3D
Visualize the simplex path traversing vertices in a 3D polyhedron
Ch 5
LP Duality
Explore the primal-dual pair relationships and visualize weak/strong duality bounds
Integer Programming & TUM
Ch 3
LP Relaxation vs ILP
Visualize integer lattice points and analyze the integrality gap
Ch 6
Branch & Bound
Explore the B&B tree with LP relaxation bounds and pruning
Ch 6
Cutting Planes
Watch the feasible region tighten as Gomory cuts are added
Ch 7
Total Unimodularity
Compare TUM and non-TUM polyhedra and verify integer vertex properties
Graph Algorithms & Shortest Paths
Ch 8
Graph Traversal
BFS and DFS with step-by-step node coloring
Ch 9
Minimum Spanning Trees
Prim's and Kruskal's algorithms edge by edge
Ch 10
Shortest Paths
Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms step-by-step
Network Flows & Matching
Ch 11
Network Flow
Augmenting paths, residual graphs, and min-cut visualization
Ch 12
Matching
Augmenting paths on Bipartite Graphs
Course Materials
12 interactive companions
Operations Research (Ricerca Operativa)
Runs completely in-browser via Pyodide