478 Nonlinear Programming III: Constrained Optimization Techniques
7.39 K. M. Ragsdell and D. T. Phillips, Optimal design of a class of welded structures
using geometric programming,ASME Journal of Engineering for Industry, Vol. 98,
pp. 1021–1025, 1976.
7.40 J. Golinski, An adaptive optimization system applied to machine synthesis,Mechanism
and Machine Synthesis, Vol. 8, pp. 419–436, 1973.
7.41 H. L. Li and P. Papalambros, A production system for use of global optimization knowl-
edge,ASME Journal of Mechanisms, Transmissions, and Automation in Design, Vol. 107,
pp. 277–284, 1985.
7.42 M. Avriel and A. C. Williams, An extension of geometric programming with application
in engineering optimization,Journal of Engineering Mathematics, Vol. 5, pp. 187–194,
1971.
7.43 G. A. Gabriele and K. M. Ragsdell, Large scale nonlinear programming using the gener-
alized reduced gradient method,ASME Journal of Mechanical Design, Vol. 102, No. 3,
pp. 566–573, 1980.
7.44 A. D. Belegundu and J. S. Arora, A recursive quadratic programming algorithm with
active set strategy for optimal design,International Journal for Numerical Methods in
Engineering, Vol. 20, No. 5, pp. 803–816, 1984.
7.45 G. A. Gabriele and T. J. Beltracchi, An investigation of Pschenichnyi’s recursive quadratic
programming method for engineering optimization,ASME Journal of Mechanisms, Trans-
missions, and Automation in Design, Vol. 109, pp. 248–253, 1987.
7.46 F. Moses, Optimum structural design using linear programming,ASCE Journal of the
Structural Division, Vol. 90, No. ST6, pp. 89–104, 1964.
7.47 S. L. Lipson and L. B. Gwin, The complex method applied to optimal truss configuration,
Computers and Structures, Vol. 7, pp. 461–468, 1977.
7.48 G. N. Vanderplaats,Numerical Optimization Techniques for Engineering Design with
Applications, McGraw-Hill, New York, 1984.
7.49 T. F. Edgar and D. M. Himmelblau,Optimization of Chemical Processes, McGraw-Hill,
New York, 1988.
7.50 A. Ravindran, K. M. Ragsdell, and G. V. Reklaitis,Engineering Optimization Methods
and Applications, 2nd ed., Wiley, New York, 2006.
7.51 L. S. Lasdon,Optimization Theory for Large Systems, Macmillan, New York, 1970.
7.52 R. T. Haftka and Z. Gurdal, ̈ Elements of Structural Optimization, 3rd ed., Kluwer Aca-
demic, Dordrecht, The Netherlands, 1992.Review Questions
7.1 Answer true or false:
(a)The complex method is similar to the simplex method.
(b)The optimum solution of a constrained problem can be the same as the unconstrained
optimum.
(c)The constraints can introduce local minima in the feasible space.
(d)The complex method can handle both equality and inequality constraints.
(e)The complex method can be used to solve both convex and nonconvex problems.
(f)The number of inequality constraints cannot exceed the number of design variables.
(g)The complex method requires a feasible starting point.