  


A Nonstandard Simplex Algorithm for Linear Programming
PingQi Pan(panpqseu.edu.cn) Abstract: The simplex algorithm travels, on the underlying polyhedron, from vertex to vertex until reaching an optimal vertex. With the same simplex framework, the proposed algorithm generates a series of feasible points (which are not necessarily vertices). In particular, it is exactly an interior point algorithm if the initial point used is interior. Computational experiments show that the algorithm are very efficient, relative to the standard simplex algorithm. It terminates at an approximate optimal vertex, or at an optimal vertex if a simple purification is incorporated. Keywords: simplex algorithm, nonstandard, feasible point, column rule, Category 1: Linear, Cone and Semidefinite Programming (Linear Programming ) Citation: Southeast University, Nanjing, 210096, China. 01/2009 Download: [PDF] Entry Submitted: 01/22/2009 Modify/Update this entry  
Visitors  Authors  More about us  Links  
Subscribe, Unsubscribe Digest Archive Search, Browse the Repository

Submit Update Policies 
Coordinator's Board Classification Scheme Credits Give us feedback 
Optimization Journals, Sites, Societies  