Experimental investigation of an interior search method within a simplex framework
By Gautam Mitra, Mehrdad Tamiz, Joseph Yadegar
Communications of the ACM,
Vol. 31 No. 12, Pages 1474-1482
10.1145/53580.214953
A feasible direction method for solving Linear Programming (LP) problems, followed by a procedure for purifying a non-basic solution to an improved extreme point solution have been embedded within an otherwise simplex based optimizer. The algorithm is designed to be hybrid in nature and exploits many aspects of sparse matrix and revised simplex technology. The interior search step terminates at a boundary point which is usually non-basic. This is followed by a series of minor pivotal steps which lead to a basic feasible solution with a superior objective function value. It is concluded that the procedures discussed in this article are likely to have three possible applications, which are(i) improving a non-basic feasible solution to a superior extreme point solution,(ii) an improved starting point for the revised simplex method, and(iii) an efficient implementation of the multiple price strategy of the revised simplex method.
The full text of this article is premium content
0 Comments
No entries found
Log in to Read the Full Article
Purchase the Article
Log in
Create a Web Account
If you are an ACM member, Communications subscriber, Digital Library subscriber, or use your institution's subscription, please set up a web account to access premium content and site
features. If you are a SIG member or member of the general public, you may set up a web account to comment on free articles and sign up for email alerts.