A computationally stable solution algorithm for linear programs
Published in Applied Mathematics and Computation • Jan 17, 2007
NobleIDNI3P79W69R19S60
Authors:
H. Arsham
Abstract
An active area of research for linear programming is to construct initial Simplex tableau that is close to the optimal solution, and to improve its pivoting selection strategies efficiently. In this paper, we present a new approach to the problem of initialization and pivoting rules: the algorithm i...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!