Abstract
In this chapter, we introduce some basic concepts and formulations concerning separable programs. Approximation of the separable problem by a linear program is considered and a restricted basis entry rule for solving the resulting linear program by the simplex method is discussed. Some numerical examples are also given.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Stefanov, S.M. (2001). Introduction. Approximating the Separable Problem. In: Separable Programming. Applied Optimization, vol 53. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3417-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3417-1_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4851-9
Online ISBN: 978-1-4757-3417-1
eBook Packages: Springer Book Archive