User:EvangeliaG/sandbox

The primal-dual method is a standard linear programming tool used in the design of algorithms for combinatorial optimization problems. It was first proposed by Dantzig, Ford, and Fulkerson in 1956. This tools draws deeply from Linear Programming theory, using duality and complementary slackness in order to construct an optimal solution without actually solving the linear program, like the Simplex or the Ellipsoid algorithms do.