Abstract
Great strides have been made in nonlinear programming (NLP) in the last 5 years. In smooth NLP, there are now several reliable and efficient codes capable of solving large problems. Most of these implement GRG or SQP methods, and new software using interior point algorithms is under development. NLP software is now much easier to use, as it is interfaced with many modeling systems, including MSC/NASTRAN, and ANSYS for structural problems, GAMS and AMPL for general optimization, Matlab and Mathcad for general mathematical problems, and the widely used Microsoft Excel spreadsheet. For mixed integer problems, branch and bound and outer approximation codes are now available and are coupled to some of the above modeling systems, while search methods like Tabu Search and Genetic algorithms permit combinatorial, nonsmooth, and nonconvex problems to be attacked.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L. Biegler, I. Grossman and A. Westerberg, Systematic Methods of Chemical Process Design (Prentice-Hall, 1997).
I. Busch-Vishniac, J. Pang and L. Lasdon, Optical sensor design using nonlinear programming, Engineering Optimization (2000) (to appear).
E.J. Cramer, J. Dennis et al., Problem formulation for multidisciplinary optimization, Report CRPC-TR94489, Center for Research on Parallel Computation, Rice University, Houston, TX (1994).
C. Floudas, Nonlinear and Mixed-Integer Optimization (Oxford University Press, 1995).
R.S. Gajulapalli and L.S. Lasdon, Computational experience with a safeguarded barrier algorithm for sparse nonlinear programming, Journal of Computational Optimization and Applications (2000) (to appear).
F. Glover and M. Laguna, Tabu Search (Kluwer Academic, 1997).
K.O. Kortanek, X. Xu and Y. Ye, An infeasible interior point algorithm for solving primal and dual geometric programs, Mathematical Programming 76 (1996) 155–181.
L. Lasdon, J. Plummer and A. Waren, Nonlinear Programming, in: Mathematical Programming for Industrial Engineers (Marcel Dekker, 1996) chapter 6.
R. Levary, ed., Engineering Design: Better Results Through Operations Research Methods (North-Holland, 1988).
J. Mulvey, R. Vanderbei and S. Zenios, Robust optimization of large-scale systems, Operations Research 43(2) (1995) 264ff.
S.G. Nash, Nonlinear programming, OR/MS Today (June 1998) 36-45.
S. Nash and A. Sofer, Linear and Nonlinear Programming (McGraw-Hill, 1996).
Proceedings of the “Optimization in Industry-II” Conference, United Engineering Foundation (pub), Banff, Canada (June 6-11, 1998).
J. Rajgopal and D. Bricker, On subsidiary problems in geometric programming, European Journal of Operational Research 63 (1992) 102–113.
G. Vanderplaats, Numerical Optimization Techniques for Engineering Design (Vanderplaats Research and Development, Colorado Springs, CO, 1999).
G. Vanderplaats, Structural design optimization status and direction, Journal of Aircraft 36(1) (1999) 11–20.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lasdon, L. Nonlinear and Geometric Programming – Current Status. Annals of Operations Research 105, 99–107 (2001). https://doi.org/10.1023/A:1013301515058
Issue Date:
DOI: https://doi.org/10.1023/A:1013301515058