A function f(x 1, ..., x n) is a separable function if f(x 1, ..., x n) + f 1(x 1) + ⃛ + f n(x n). Certain nonlinear-programming problems that contain separable functions can be suitably represented by a linear approximation and solved by a variation of the simplex method. Separable-programming problem; Simplex method.
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 subscriptionsAuthor 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 function . 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_936
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_936
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