Open AccessModeling the Duality Extraction for Linear Programming Models
Author(s) -
Muwafaq Mohammed Alkubaisi
Publication year - 2013
Publication title -
international journal of business administration
Language(s) - English
Resource type - Journals
eISSN - 1923-4015
pISSN - 1923-4007
DOI - 10.5430/ijba.v4n6p90
Subject(s) - duality (order theory) , dual (grammatical number) , mathematical optimization , linear programming , maximization , computer science , constraint (computer aided design) , minification , constraint programming , mathematics , stochastic programming , art , geometry , literature , discrete mathematics
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