Modeling the Duality Extraction for Linear Programming Models

Muwafaq M. Fendi AlKubaisi

Abstract


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.

Full Text: PDF DOI: 10.5430/ijba.v4n6p90

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

International Journal of Business Administration
ISSN 1923-4007(Print) ISSN 1923-4015(Online)

 

Copyright © Sciedu Press

To make sure that you can receive messages from us, please add the 'Sciedu.ca' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.