𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A New Steepest Edge Approximation for the Simplex Method for Linear Programming

✍ Scribed by Artur Świętanowski

Book ID
110368889
Publisher
Springer US
Year
1998
Tongue
English
Weight
110 KB
Volume
10
Category
Article
ISSN
0926-6003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A projective simplex method for linear p
A projective simplex method for linear programming
✍ Ping-Qi Pan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Linear programming problems with quite square coecient matrix form a wide range of problems that are not amenable to existing algorithms. The method proposed in this paper attacks such problems from the dual side, alternatively arranging computations of the simplex method using the QR factorization.

A steepest edge active set algorithm for
A steepest edge active set algorithm for solving sparse linear programming problems
✍ S. W. Sloan 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations