Abstract
The objective of this chapter is to discuss an advanced technique, called the dual simplex method, for solving linear programming problems with ≥ type constraints.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Bhunia, A., Sahoo, L., Shaikh, A. (2019). Dual Simplex Method. In: Advanced Optimization and Operations Research. Springer Optimization and Its Applications, vol 153. Springer, Singapore. https://doi.org/10.1007/978-981-32-9967-2_5
Download citation
DOI: https://doi.org/10.1007/978-981-32-9967-2_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-32-9966-5
Online ISBN: 978-981-32-9967-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)