Modeling the Duality Extraction for Linear Programming Models

Muwafaq M. Fendi AlKubaisi

International Journal of Business Administration, 2013, vol. 4, issue 6, 90-95

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.

Keywords: OR; LP; primal; dual; maximization; minimization; mixed constraints models (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciedu.ca/journal/index.php/ijba/article/view/3615/2130 (application/pdf)
http://www.sciedu.ca/journal/index.php/ijba/article/view/3615 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:jfr:ijba11:v:4:y:2013:i:6:p:90-95

Access Statistics for this article

International Journal of Business Administration is currently edited by Jenny Zhang

More articles in International Journal of Business Administration from International Journal of Business Administration, Sciedu Press
Bibliographic data for series maintained by Jenny Zhang ().