Obtaining a feasible geometric programming primal solution, given a near-optimal dual solution

A dual algorithm applied to a posynomial geometric programming problem generally terminates with a dual feasible solution which is only approximately optimal. The usual methods for recovering the primal solution then yields solutions with corresponding slight infeasibilities in the primal constraints. This paper demonstrates a linear programming problem for computation of a primal solution which is strictly feasible.