Abstract
We present a feasible direction approach to general linear programming, which can be embedded in the simplex method although it works with non-edge feasible directions. The feasible direction used is the steepest in the space of all variables, or an approximation thereof. Given a basic feasible solution, the problem of finding a (near-)steepest feasible direction is stated as a strictly convex quadratic program in the space of the non-basic variables and with only non-negativity restrictions. The direction found is converted into an auxiliary non-basic column, known as an external column. Our feasible direction approach allows several computational strategies. First, one may choose how frequently external columns are created. Secondly, one may choose how accurately the direction-finding quadratic problem is solved. Thirdly, near-steepest directions can be obtained from low-dimensional restrictions of the direction-finding quadratic program or by the use of approximate algorithms for this program.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20, 221–246 (1982)
Eiselt, H.A., Sandblom, C.-L.: Experiments with external pivoting. Comput. Oper. Res. 17, 325–332 (1990)
Goldfarb, D., Reid, J.K.: A practicable steepest-edge simplex algorithm. Math. Program. 12, 361–371 (1977)
Murty, K.G.: Linear Programming. Wiley, New York (1983)
Murty, K.G., Fathi, Y.: A feasible direction method for linear programming. Oper. Res. Lett. 3, 121–127 (1984)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Wolde, B.C., Larsson, T. (2020). A Steepest Feasible Direction Extension of the Simplex Method. In: Neufeld, J.S., Buscher, U., Lasch, R., Möst, D., Schönberger, J. (eds) Operations Research Proceedings 2019. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-48439-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-48439-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48438-5
Online ISBN: 978-3-030-48439-2
eBook Packages: Business and ManagementBusiness and Management (R0)