 Duality of the improved algebraic method (DIAM)Doraid Dalalah and Benjamin Lev Omega, 2009, vol. 37, issue 5, 1027-1035 Abstract: 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. Keywords: Linear; programming; Learning; Education (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:37:y:2009:i:5:p:1027-1035 Ordering information: This journal article can be ordered from Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.