Abstract
In Chap. 1 we dealt with optimality conditions for unconstrained problems, and then we described a number of algorithms for such problems in Chap. 2. The previous chapter discussed optimality conditions for constrained problems, and in parallel fashion, we will now turn to algorithms for such optimization problems. This chapter will cover some general approaches for constrained optimization, and the following three chapters describe some of the many algorithms for specific types of problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bazaraa MS, Sherali HD, Shetty CM (2013) Nonlinear programming: theory and algorithms. (3rd ed.) Wiley, New York
Bertsekas DP (2016) Nonlinear programming. (3rd ed.) Athena Scientific, Belmont, MA
Carroll CW (1961) The created response surface technique for optimizing nonlinear restrained systems. Operations Research 9: 169-184.
Cottle RW, Thapa MN (2017) Linear and nonlinear optimization. Springer-Verlag, Berlin-Heidelberg-New York
Dantzig GB, Thapa MN (2003) Linear programming 2: theory and extensions. Springer, New York, Berlin, Heidelberg
Eiselt HA, Sandblom C-L (2007) Linear programming and its applications. Springer-Verlag, Berlin-Heidelberg
Everett H (1963) Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Operations Research 11: 399-417
Fiacco AV, McCormick GP (1964a) Computational algorithm for the sequential unconstrained minimization technique for nonlinear programming. Management Science 10: 601-617
Fiacco AV, McCormick GP (1964b) The sequential unconstrained minimization technique for nonlinear programming-a primal-dual method. Management Science 10: 360-366
Fiacco AV, McCormick GP (1966) Extensions of SUMT for nonlinear programming equality constraints and extrapolation. Management Science 12: 816-828
Fiacco AV, McCormick GP (1967a) The sequential unconstrained minimization technique (SUMT) without parameters. Operations Research 15: 820-827
Fiacco AV, McCormick GP (1967b) The slacked unconstrained minimization technique for convex programming. The SIAM Journal of Applied Mathematics 15: 505-515
Fiacco AV, McCormick GP (1968) Nonlinear programming. J. Wiley & Sons, New York
Frisch KR (1956) La résolution des problèmes de programme lineaire pour la méthode du potential logarithmique. Cahiers du seminaire d’Économetrie 4: 7-20
Luenberger DL, Ye Y (2008) Linear and nonlinear programming. (3rd ed.) Springer-Verlag, Berlin-Heidelberg-New York
Rockafellar RT (1970) Convex analysis. University Press, Princeton, NJ
Sandblom C-L (1974) On the convergence of SUMT. Mathematical Programming 6: 360-364
Sun W, Yuan Y (2006) Optimization theory and methods. Nonlinear programming. Springer-Verlag, Berlin-Heidelberg-New York
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Eiselt, H.A., Sandblom, CL. (2019). General Solution Methods for Constrained Optimization. In: Nonlinear Optimization . International Series in Operations Research & Management Science, vol 282. Springer, Cham. https://doi.org/10.1007/978-3-030-19462-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-19462-8_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19461-1
Online ISBN: 978-3-030-19462-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)