Modeling the Duality Extraction for Linear Programming Models

Many operations research (OR) textbooks have not tackled the problem of converting the various types of Linear Programming (LP) models (i.e. Maximization, Minimization and mixed Constraint Model)from its primal form to dual form. Furthermore, little attention has paid for showing how to extract the dual optimal solution. Extracting duality is of great importance when we tackle problems with mixed constraints models. The primary goal of this research is to demonstrate the methodology adopted in extracting all types of dual models and its optimal solution.