Approximation algorithm for optimal solution to the linear programming problem

N.W. Khobragade, N.V. Vaidya and Navneet K. Lamba

International Journal of Mathematics in Operational Research, 2014, vol. 6, issue 2, 139-154

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.

Keywords: approximation algorithm; linear programming; alternative solution; basic feasible solution; optimum solution; simplex method. (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=59528 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijmore:v:6:y:2014:i:2:p:139-154

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().