Abstract
We show that under certain conditions nonlinear programming problems can be decomposed into a series of smaller problems.
A Decomposition Theorem and example are presented.
This is a preview of subscription content, log in via an institution to check access.
References
J. Abadie, ed.,Nonlinear programming (North-Holland, Amsterdam, 1967).
G. Hadley,Linear programming (Addison Wesley, Reading, MA, 1962).
J.B. Rosen and J.C. Ornea, “Solution of nonlinear programming problems by partition,”Management Science 10 (1963) 160–173.
J.L. Sanders, “A nonlinear decomposition principle,”Operations Research 13 (2) (1965) 226–271.
P. Wolfe, “Methods of nonlinear programming,” in: R.L. Graves and P. Wolfe, eds.Recent advances in mathematical programming (McGraw-Hill, New York, 1963) pp. 67–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Posner, M.E. The decomposition of nonlinear problems. Mathematical Programming 15, 360–362 (1978). https://doi.org/10.1007/BF01609042
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01609042