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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
