CMI Dual Algorithm for the Solution of Linear Programming Problems
S. Cynthiya Margaret Indrani1, N. Srinivasan2
1S.Cynthiya Margaret Indrani, Research Scholar & Assistant Professor, Department of Mathematics, St. Peter’s Institute of Higher Education and Research, Avadi, Chennai (Tamil Nadu), India.
2N.Srinivasan, Professor and Head, Department of Mathematics, St. Peter’s Institute of Higher Education and Research, Avadi, Chennai (Tamil Nadu), India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1080-1083| Volume-8 Issue-7, May 2019 | Retrieval Number: G6328058719/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In this paper, a new approach CMI Dual algorithm is introduced. This method is very easy to solve linear programming problem. Sometimes it involves less number of iterations than the Existing dual simplex method. This method is very strong with effortless iterations and also it saves the Precious time by avoiding the calculations of net evaluations.
Keyword: CMI Dual Method, LPP, Optimal Solution.
Scope of the Article: Smart Solutions – Wearable Sensors and Smart Glasses