Abstract
We shall now discuss how large linear programming problems may be solved on a digital computer with the aid of properly organized calculations. In spite of the recent tremendous advancement in the computational power and memory size of modern computers, computational difficulties still arise in solving large L.P. problems. New techniques have been developed to overcome some of these. The techniques that we shall discuss are: the revised simplex method, the dual simplex method, the primal-dual algorithm, and Wolfe-Dantzig decomposition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Foulds, L.R. (1981). Advanced Linear Programming Topics. In: Optimization Techniques. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9458-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9458-7_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9460-0
Online ISBN: 978-1-4613-9458-7
eBook Packages: Springer Book Archive