Approximation Algorithms Based on the Primal-Dual Method

  • Published 2005
Theprimal-dual method(or primal-dual schema) is another means of solving linear programs. The basic idea of this method is to start from a feasible solution y to the dual program, then attempt to find a feasible solutionx to the primal program that satisfies the complementary slackness conditions. If such anx cannot be found, it turns out that we can find a… CONTINUE READING