Approximation algorithm for optimal solution to the linear programming problem Online publication date: Sat, 28-Jun-2014
by N.W. Khobragade; N.V. Vaidya; Navneet K. Lamba
International Journal of Mathematics in Operational Research (IJMOR), Vol. 6, No. 2, 2014
Abstract: This paper deals with a new alternative algorithm for two phase simplex method and linear programming. The method involves less iteration than the usual simplex method as well as two phase simplex method. This powerful technique is better understood by resolving a cyclic problem.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com