Abstract
The face and dual face methods, introduced in the previous two chapters, involve orthogonal transformations. But from a practical point of view, many researchers prefer LU factorization. In this chapter, we derive the face method based on LU factorization. In the following sections, we derive the descent search direction first and then address such topics as the update of the face solution, pivot operation, and optimality test. Then we spend the other sections to formulate the face algorithm in the tableau form and in the revised form, respectively, before making final comments.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Pan PQ (2014) Linear programming computation. Springer, Berlin Heidelberg, Germany
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
PAN, PQ. (2023). Face Method with LU Factorization. In: Linear Programming Computation. Springer, Singapore. https://doi.org/10.1007/978-981-19-0147-8_23
Download citation
DOI: https://doi.org/10.1007/978-981-19-0147-8_23
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0146-1
Online ISBN: 978-981-19-0147-8
eBook Packages: Computer ScienceComputer Science (R0)