A nonlinear-programming problem in which some or all of the constraints and the objective function are separable functions of one variable. Using linear approximations to the separable functions, the problem can be approximated and solved by a variation of the simplex algorithm that uses a restricted-basis entry rule. Separable function; Special-ordered sets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Separable-programming problem . In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_937
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_937
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive