Duality of the improved algebraic method (DIAM)

In this note we present a variant of the improved algebraic method (IAM) using a duality analysis to solve linear programming (LP) problems where more insights to the method are presented. When the coordinates of all vertices are computed, any feasible point can be expressed as a linear combination of the vertices. The objective function is expressed as a weighted sum of its evaluation at the feasible vertices and the optimal point is associated with the highest/lowest coefficient of the weighted sum.In this work two adaptations of LP objective function are formulated in primal and dual domains. A simple LP bounds test is also presented which includes unbounded solution space in the IAM. The presented analysis can determine degeneracy and/or alternative optima from the dual parametric objective function. It also spots the optimal solution by intersecting the primal and dual parametric objective functions. The proposed approach is simple and enhances the understanding of the simplex method. We demonstrate several numerical examples to explain the proposed analysis.