Using Dual Optimal Multipliers in Recovering an Optimal Primal Basic Solution

, , and

BibTeX reference

We describe an approach that computes an optimal primal basic solution given an optimal vector of dual multipliers. It consists in restricting the dual problem to a small box around the available optimal dual solution and in resolving the associated modified primal problem with a simplex algorithm. On average, it largely outperforms CPLEX crossover procedures, specially for large size problems.

, 12 pages

Research Axis

Research application


Recovering an optimal LP basis from an optimal dual solution 
, , and
Operations Research Letters, 34(5), 569–576, 2006 BibTeX reference