Engineering Optimization: Methods and Applications: Second Edition

Engineering Optimization: Methods and Applications: Second Edition

Volumn , Issue , 2007, Pages 1-667

  Ravindran, A ^a   Ragsdell, K M ^b   Reklaitis, G V ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b University of Missouri Rolla   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889382553     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470117811     Document Type: Book

References (458)

1. Zeleny, M., Multiple Criteria Decision Making, McGraw-Hill, New York, (1982).
2. Vincent, T. L., and W. J. Grantham, Optimality in Parametric Systems, Wiley, New York, (1981).
3. Bett, K. E., J. S. Rowlinson, and G. Saville, Thermodynamics for Chemical Engineers, MIT Pres, Cambridge, MA, (1975).
4. Jen, F. C., C. C. Pegels, and T. M. Dupuis, "Optimal Capacities of Production Facilities," Manag. Sci. 14B, 570-580 (1968).
5. Shigley, J. E., Mechanical Engineering Design, McGraw-Hill, New York, 1973, p. 271.
6. Timoshenko, S., and J. Gere, Theory of Elastic Stability, McGraw-Hill, New York, 1961, p. 257.
7. Ragsdell, K. M., and D. T. Phillips, "Optimal Design of a Class of Welded Structures using Geometric Programming," ASME J. Eng. Ind. Ser. B, 98(3), 1021-1025 (1975).
8. White, W. B., S. M. Johnson, and G. B. Dantzig, "Chemical Equilibrium in Complex Mixtures," J. Chem. Phys., 28, 251-255 (1959).
9. Hayt, W. H., and J. E. Kemmerly, Engineering Circuit Analysis, McGraw-Hill, New York, 1971, Chap. 2.
10. Philipson, R. H., and A. Ravindran, "Application of Mathematical Programming to Metal Cutting," Math. Prog. Study, 11, 116-134 (1979).
11. Armarego, E. J. A., and R. H. Brown, The Machining of Metals, Prentice-Hall, Englewood Cliffs, NJ, (1969).
12. Ragsdell, K. M., and W. J. Carter, "The Energy Method," Mechanisms and Machine Theory, 10(3), 245-260 (1975).
13. Carter, W. J., and K. M. Ragsdell, "The Optimal Column," ASME J. Eng. Mater. Technol., 71-76 (1974).
14. Trefethen, F. N., "A History of Operations Research," in Operations Research for Management (J. F. McCloskey and F. N. Trefethen, Eds.), John Hopkins Press, Baltimore, MD, (1954).
15. Ealey, L. A., Quality by Design, ASI Press, Dearborn, MI, (1988).
16. Taguchi, G. Taguchi on Robust Technology Development, ASME Press, New York, (1993).
17. Taguchi, G., System of Experimental Design, Vols. 1 and 2, Unipub/Kraus, White Plains, NY, (1987).
18. Taguchi, G., Introduction to Quality Engineering, Asian Productivity Organization, Tokyo, (1986).
19. Swann, W. H., "Report on the Development of a Direct Search Method of Optimization," ICI Ltd., Central Instr. Res. Lab, Res. Note, 64/3, London, (1964).
20. Kiefer, J., "Optimum Sequential Search and Approximation Methods under Minimum Regularity Assumptions," J. Soc. Ind. Appl. Math., 5(3), 105-125 (1957).
21. Bartle, R., Elements of Real Analysis, Wiley, New York, (1976).
22. Powell, M. J. D., "An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives," Computer J., 7, 155-162 (1964).
23. Raphson, J., History of Fluxion, London, (1725).
24. Kowalik, J., and M. R. Osborne, Methods for Unconstrained Optimization Problems, American Elsevier, New York, (1968).
25. Box, M. J., D. Davies, and W. H. Swann, Nonlinear Optimization Techniques, ICI Monograph, Oliver and Boyd, Edinburgh, (1969).
26. Himmelblau, D. M., Applied Nonlinear Programming, McGraw-Hill, New York, (1972).
27. Brent, R. P., Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, NJ, (1973).
28. Phillips, D. T., A. Ravindran, and J. J. Solberg, Operations Research: Principles and Practice, Wiley, New York, (1976).
29. Murray, W. (Ed.), Numerical Methods for Unconstrained Optimization, Academic, London, (1972).
30. Nocedal, J., "Theory of Algorithms for Unconstrained Optimization," Acta Numerica, 199-242 (1992).
31. Fletcher, R., Practical Methods of Optimization, 2nd ed., Wiley, New York, (2000).
32. Box, M. J., D. Davies, and W. H. Swann, Non-Linear Optimization Techniques, ICI Monograph 5, Oliver and Boyd, Edinburgh, (1969).
33. Krolak, P., and L. Cooper, "An Extension of Fibonaccian Search to Several Variables," J. ACM, 6, 639-641 (1963).
34. Box, G. E. P., "Evolutionary Operation: A Method for Increasing Industrial Productivity," Appl. Stat., 6, 81-101 (1957).
35. Spendley, W., G. R. Hext, and F. R. Himsworth, "Sequential Application of Simplex Designs in Optimization and Evolutionary Operation," Technometrics, 4, 441-461 (1962).
36. Nelder, J. A., and R. Mean, "A Simplex Method for Function Minimization," Computer J., 7, 308-313 (1965).
37. Box, G. E. P., and N. R. Draper, Evolutionary Operation, Wiley, New York, (1969).
38. Parkinson, J. M., and D. Hutchinson, "An Investigation into the Efficiency of Variants on the Simplex Method," in Numerical Methods for Non-Linear Optimization (F. A. Lootsma, Ed.), Academic, London, 1972, pp. 115-135.
39. Powell, M. J. D., "On Search Directions for Minimization Algorithms," Math. Prog., 4(2), 193-201 (1973).
40. Hooke, R., and T. A. Jeeves, "Direct Search of Numerical and Statistical Problems." J. ACM, 8, 212-229 (1966).
41. Bandler, J. W., and P.A. McDonald, "Optimization of Microwave Networks by Razor Search," IEEE Trans. Microwave Theory Tech., 17, 552-562 (1969).
42. Emery, F. E., and M. O. O'Hagan, "Optimal Design of Matching Networks for Microwave Transistor Amplifiers," IEEE Trans. Microwave Theory Tech., 14, 696-698 (1966).
43. Rosenbrock, H. H., "An Automated Method for Finding the Greatest or Least Value of a Function," Computer J., 3(3), 175-184 (1960).
44. Swann, W. H. "Report on the Development of a New Direct Search Method of Optimization," Central Instr. Res. Lab., Res. Note 64/3, Imperial Chemical Industries, Widnes, England, (1964).
45. Powell, M. J. D., "An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives," Computer J., 7, 155-162 (1964).
46. Zangwill, W. I., "Minimizing a Function without Calculating Derivatives," Computer J., 10, 293-296 (1967).
47. Brent, R. P., Algorithms for Minimization without Derivatives, Prentice-Hall, Englewood Cliffs, NJ, (1973).
48. Gill, P. E., W. Murray, and M. H. Wright, Practical Optimization, Academic, New York, 1981, p. 57.
49. Fletcher, R., Practical Methods of Optimization, Vol. 1: Unconstrained Optimization, Wiley, New York, 1980, p. 17.
50. Fletcher, R., Practical Methods of Optimization, 2nd ed., Wiley, New York, (2000).
51. Cauchy. A., "Method Generale pour la Resolution des Systemes d'Equations Simultanees," Compt. Rend. Acad. Sci., 25, 536-538 (1847).
52. Coggins, G. F., "Univariate Search Methods," Central Instr. Res. Lab., Res. Note 64/11, Imperial Chemical Industries, Widnes, England, (1964).
53. Gabriele, G. A., and K. M. Ragsdell, OPTLIB: An Optimization Program Library, Purdue Research Foundation, West Lafayette, IN, Jan. (1977).
54. Ragsdell, K. M., R. R. Root, and G. A. Gabriele, "Newton's Method: A Classical Technique of Contemporary Value," ASME Design Technol. Transfer Conf. Proc., New York, Oct. 1974, p. 137.
55. Mangasarian, O. L., "Techniques of Optimization," ASME paper 71-vibr.-118 presented at the ASME Design Automat. Conference, Sept. 8-10, (1971).
56. Marquardt, D. W., "An Algorithm for Least Squares Estimation of Non-Linear Parameters," SIAM J., 11, 431-441 (1963).
57. Powell, M. J. D., "Problems Related to Unconstrained Optimization," in Numerical Methods for Unconstrained Optimization, Academic, New York, 1972, Chap. 3, p. 29.
58. Bard, Y., Nonlinear Parameter Estimation, Academic, New York, (1974).
59. Hestenes, M. R., and E. Stiefel, "Methods of Conjugate Gradients for Solving Linear Systems," NBS Res. J., 49, 409-436 (1952).
60. Fletcher, R., and C. M. Reeves, "Function Minimization by Conjugate Gradients," Computer J., 7, 149-154 (1964).
61. Fried, I., and J. Metzler, "SOR vs Conjugate Gradients in a Finite Element Discretization," Int. J. Numer. Methods Eng., 12, 1329-1342, (1978).
62. Miele, A., and J. W. Cantrell, "Study on a Memory Gradient Method for Minimization of Functions," JOTA, 3(6), 459 (1969).
63. Polak, E., and G. Ribiere, "Note sur la Convergence de Methods de Directions Conjugees," Rev. Fr. Inform. Rech. Operat., 16, 35-43 (1969).
64. Davison, E. J., and P. Wong, "A Robust Conjugate-Gradient Algorithm Which Minimizes L-Functions," Automatica, 11, 297-308 (1975).
65. Boland, W. R., E. R. Kamgnia, and J. S. Kowalik, "A Conjugate Gradient Optimization Method Invariant to Nonlinear Scaling," JOTA, 27(2), 221-230 (1979).
66. Boland, W. R., and J. S. Kowalik, "Extended Conjugate-Gradient Methods with Restarts," JOTA, 28(1), 1-9 (1979).
67. Crowder, H. P., and P. Wolfe, "Linear Convergence of the Conjugate Gradient Method," IBM J. Res. Develop., 16, 431-433 (1972).
68. Powell, M. J. D., "Some Convergence Properties of the Conjugate Gradient Method," Math. Prog., 11, 42-49 (1976).
69. Powell, M. J. D., "Restart Procedures for the Conjugate Gradient Method," Math. Prog., 12, 241-254 (1977).
70. Beale, E. M. L., "A Derivation of Conjugate Gradients," in Numerical Methods for Non-Linear Optimization (F. A. Lootsma, Ed.), Academic, New York, 1972, pp. 39-43.
71. Shanno, D. F., "Conjugate Gradient Methods with Inexact Searches," Math. Oper. Res., 3(3), 244-256 (1978).
72. Gabriele, G. A., and K. M. Ragsdell, "Large Scale Nonlinear Programming Using the Generalized Reduced Gradient Method," ASME J. Mech. Des., 102(3), 566-573 (1980).
73. Avriel, M., Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1976, p. 322.
74. Davidon, W. C., "Variable Metric Method for Minimization," AEC Res. Develop. Rep., ANL-599, (1959).
75. Fletcher, R., and M. J. D. Powell, "A Rapidly Convergent Descent Method for Minimization," Computer J., 6, 163 (1963).
76. Broyden, G. G., "The Convergence of a Class of Double-Rank Minimization Algorithms," J. Inst. Math. Appl., 6, 76-90, 222-231 (1970).
77. Fletcher, R., "A New Approach to Variable Metric Algorithms," Computer J., 13, 317-322 (1970).
78. Goldfarb, D., "Generating Conjugate Directions without Line Searches Using Factorized Variable Metric Updating Formulas," Math Prog., 13, 94-110 (1977).
79. Shanno, D. F., "Conditioning of Quasi-Newton Methods for Function Minimization," Math. Comp., 24, 647-657 (1970).
80. Powell, M. J. D., "A View of Unconstrained Optimization," paper presented at IMA Conference, "Optimization in Action," Jan. (1975).
81. Davidon, W. C., "Optimally Conditioned Optimization Algorithms without Line Searches," Math. Prog., 9, 1-30 (1975).
82. Powell, M. J. D., "Quadratic Termination Properties of Davidon's New Variable Metric Algorithm," Math. Prog., 12, 141-147 (1977).
83. McCormick, G. P., "Methods of Conjugate Directions versus Quasi-Newton Methods," Math. Prog., 3(1), 101-116 (1972).
84. Shanno, D. F., and K. H. Phua, "A Variable Method Subroutine for Unconstrained Nonlinear Minimization," Manag. Inform. Syst. Rep. 28, University of Arizona, Tucson, AZ, (1979).
85. Dixon, L. C. W., "Quasi-Newton Algorithms Generate Identical Points," Math. Prog., 2(3), 383-387 (1972).
86. Dixon, L. C. W., "Quasi-Newton Algorithms Generate Identical Points II: The Proofs of Four New Theorems," Math. Prog., 3(3), 345-358 (1972).
87. Shanno, D. F., and K. H. Phua, "Matrix Conditioning and Nonlinear Optimization," Math. Prog., 14, 149-160 (1978).
88. Shanno, D. F., and K. H. Phua, "Numerical Comparison of Several Variable-Metric Algorithms," JOTA, 25(4), 507-518 (1978).
89. Shanno, D. F., and K. H. Phua, "Algorithms 500: Minimization of Unconstrained Multivariate Functions [E4], "ACM Trans. Math. Software, 2(1), 87-94 (1976).
90. LaFrance, L. J., J. F. Hamilton, and K. M. Ragsdell, "On the Performance of a Combined Generalized Reduced Gradient and Davidon-Fletcher-Powell Algorithm: GRGDFP," Eng. Opt., 2, 269-278 (1977).
91. Root, R. R., and K. M. Ragsdell, "Computational Enhancements to the Method of Multipliers," ASME J. Mech. Des., 102(3), 517-523 (1980).
92. Han, S. P., "Superlinearly Convergent Variable Metric Algorithms for General Nonlinear Programming Problems," Math. Prog., 11, 263-282 (1976).
93. Powell, M. J. D., "The Convergence of Variable Metric Method for Nonlinear Constrained Optimization Calculations," in Nonlinear Programming, Vol. 3 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York, 1978, pp. 27-64.
94. Nocedal, J., and S. J. Wright, Numerical Optimization, Springer Science, New York, (1999).
95. Toint, Ph. L., "On Sparse and Symmetric Matrix Updating Subject to a Linear Equation," Math. Comp., 31(140), 954-961 (1977).
96. Powell, M. J. D., and Ph. L. Toint, "On the Estimation of Sparse Hessian Matrices," SIAM J. Numer. Anal., 16, 1060-1074 (1979).
97. Shanno, D. F., "On Variable-Metric Methods for Sparse Hessians," Math. Comp., 34(150), 499-514 (1980).
98. Shanno, D. F., "Computational Experience with Methods for Estimating Sparse Hessians for Nonlinear Optimization," JOTA, 35(2), 183-193 (Oct. 1981).
99. Sorensen, D. C., "Trust Region Methods for Unconstrained Optimization," in Nonlinear Optimization-1981 (M. J. D. Powell, Ed.), Academic Press, London, 1981, p. 29.
100. Stewart, G. W., "A Modification of Davidon's Method to Accept Difference Approximations of Derivatives," JACM, 14, 72-83 (1967).
101. Gill, P. E., W. Murray, M. A. Saunders, and M. H. Wright, "Computing Finite-Difference Approximations to Derivatives for Numerical Optimization," Stanford Systems Optimization Lab. Tech. Rep. SOL80-6, Palo Alto, CA, (1980).
102. Himmelblau, D. M., Applied Nonlinear Programming, McGraw-Hill, New York, 1972, p. 190.
103. Sargent, R. W. H., and D. J. Sebastian, "Numerical Experience with Algorithms for Unconstrained Minimization," in Numerical Methods for Non-Linear Optimization (F. A. Lootsma, Ed.), Academic, New York, 1971, Chap. 5, p. 45.
104. Carpenter, W. C., and E. A. Smith, "Computational Efficiency in Structural Optimization," Eng. Optimization, 1(3), 169-188 (1975).
105. Crowder, H., R. S. Dembo, and J. M. Mulvey, "On Reporting Computational Experiments with Mathematical Software," ACM Trans. Math. Software, 5(2), 198-203 (1979).
106. Miele, A., and S. Gonzalez, "On the Comparative Evaluation of Algorithms for Mathematical Programming Problems," in Nonlinear Programming, Vol. 3 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York, 1978, pp. 337-359.
107. Eason, E. D., and R. G. Fenton, "A Comparison of Numerical Optimization Methods for Engineering Design," J. Eng. Ind. Trans. ASME, 96(1), 196-200 (1974).
108. Colville, A. R., "A Comparative Study of Nonlinear Programming Codes," Tech. Rep. 320-2949, IBM New York Scientific Center, (1968).
109. Sherwood, T. K., A Course in Process Design, MIT Press, Cambridge, MA, 1963, p. 84.
110. Gass, S. I., "Comments on the Possibility of Cycling with the Simplex Method," Oper. Res., 27(4), 848-852 (1979).
111. Ravindran, A., D. T. Phillips and J. J. Solberg, Operations Research: Principles and Practice, 2nd ed., Wiley, New York, (1987).
112. Fourer, R., "Linear Programming Software Survey," OR/MS Today, 30, 34-43 (Dec. 2003).
113. Brooke, A., D. Kendrick, and A Meeraus, GAMS: A User's Guide, Scientific Press, Redwood City, CA, (1988).
114. Fourer, R., "Modelling Languages versus Matrix Generators for Linear Programming," ACM Trans. Math Software, 9, 143-183 (1983).
115. Fourer, R., D. M. Gay, and B. W. Kernighan, "A Modeling Language for Mathematical Programming," Manage. Sci., 36(5), 519-554 (1990).
116. Czyzyk J., J. H. Owen, and S. J. Wright, "Optimization on the Internet," OR/MS Today, 24, 48-52 (Oct. 1997).
117. More, J. J., and S. J. Wright, Optimization Software Guide, SIAM Publications, Philadelphia, PA, (1993).
118. Khachian, L. G., "A Polynomial Algorithm in Linear Programming," Soviet Math. Dokl., 20(1), 191-194 (1979).
119. Karmarkar, N. K., "A New Polynomial Time Algorithm for Linear Programming," Combinatorica, 4, 373-395 (1984).
120. Felt, A., "LINDO: API: Software Review," OR/MS Today, 29, 58-60 (Dec. 2002).
121. Gass, S. I., An Illustrated Guide to Linear Programming, McGraw-Hill, New York, (1970).
122. Salkin, H. M., and J. Saha, Studies in Linear Programming, North Holland/American Elsevier, New York, (1975).
123. Gass, S., Linear Programming, 4th ed., McGraw-Hill, New York, (1975).
124. Gray, P., and C. Cullinan-James, "Applied Optimization-A Survey," Interfaces, 6(3), 24-41 (May 1976).
125. Dantzig, G. B., Linear Programming and Extensions, Princeton University Press, Princeton, NJ, (1963).
126. Murty, K. G., Operations Research: Deterministic Optimization Models, Prentice-Hall, Englewood Cliffs, NJ, (1995).
127. Marsten, R. R., Subramanian, M. Saltzman, I. Lustig, and D. Shanno, "Interior Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick," Interfaces, 20(4), 105-116 (1990).
128. Bixby, R. E., "Progress in Linear Programming," ORSA J. Comput., 6(1), 15-27 (1994).
129. Arbel, A., Exploring Interior Point Linear Programming: Algorithms and Software, MIT Press, Cambridge, MA, (1993).
130. Fang, S.-C., and S. Puthenpura, Linear Optimization and Extensions, Prentice-Hall, Englewood Cliffs, NJ, 1993
131. Lustig, I. J., R. E. Marsten, and D. F. Shanno, "Interior Point Methods for Linear Programming: Computational State of the Art," ORSA J. Comput., 6(1), 1-14 (1994).
132. Bixby, R. E., J. W. Gregory, I. J. Lusting, R. E. Marsten, and D. F. Shanno, "Very Large Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods," Operations Res., 40, 885-897 (1992).
133. Bazaraa, M. S., D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., Wiley, New York, (1993).
134. Mangasarian, O. L., Nonlinear Programming, McGraw-Hill, New York, (1969).
135. Lasdon, L. S., Optimization Theory for Large Systems, Macmillan, New York, (1979).
136. Everett, H., "Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources," Oper. Res., 11, 399-471 (1963).
137. McCormick, G. P., "Second Order Conditions for Constrained Optima," SIAM J. Appl. Math., 15, 641-652 (1967).
138. Han, S. P., and O. L. Mangasarian, "Exact Penalty Functions in Nonlinear Programming," Math. Programming, 17, 251-269 (1979).
139. Fiacco, A. V., "Second Order Sufficient Conditions for Weak and Strict Constrained Minima," SIAM J. Appl. Math., 16, 105-108 (1968).
140. Brooks, R., and A. Geoffrion, "Finding Everett's Lagrange Multipliers by Linear Programming," Oper. Res., 14, 1149-1153 (1966).
141. Everett, H., "Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources," Oper. Res., 11, 300-471 (1963).
142. Siddall, J. N., Analytical Decision-Making in Engineering Design, Prentice-Hall, Englewood Cliffs, NJ, (1972).
143. Siddall, J. N., "Opti-Sep: Designer's Optimization Subroutines," McMaster University, Canada, (1971).
144. Lootsma, F. A., "A Survey of Methods for Solving Constrained Minimization Problems via Unconstrained Minimization," in Numerical Methods for Nonlinear Optimization (F. A. Lootsma, Ed.), Academic, New York, 1972, pp. 313-348.
145. Ragsdell, K. M., R. R. Root, and G. A. Gabriele, "Subroutine ZERO," in MELIB: A Subroutine Library for Mechanical Engineers, (1975).
146. Fiacco, A. V., and G. P. McCormick, "Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming," Manag. Sci., 10, 601-617 (1964).
147. Fiacco, A. V., and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, (1968).
148. Lootsma, F. A., "Extrapolation in Logarithmic Programming," Philips Res. Rep., 23, 108-116 (1968).
149. Lootsma, F. A., "Boundary Properties of Penalty Functions for Constrained Minimization," Philips Res. Rep. Suppl., 3, (1970).
150. Fletcher, R., and A. P. McCann, "Acceleration Techniques for Nonlinear Programming," in Optimization (R. Fletcher, Ed.), Academic, New York, 1986, pp. 203-214.
151. Murray, W., "Ill-Conditioning in Barrier and Penalty Functions Arising in Constrained Nonlinear Programming," in Proceedings of the Sixth Symposium on Mathematical Programming, Princeton, NJ, (1967).
152. Lootsma, F. A., "Hessian Matrices of Penalty Functions for Solving Constrained Optimization Problems," Philips Res. Rep., 24, 322-331 (1969).
153. Courant, R., "Variational Methods for the Solution of Problems of Equilibrium and Vibrations," Bull. Am. Math. Soc., 49, 1-23 (1943).
154. Carroll, C. W., "The Created Response Surface Technique for Optimizing Nonlinear Restrained Systems," Oper. Res., 9, 169-184 (1961).
155. Fiacco, A. V., and G. P. McCormick, "The Sequential Unconstrained Minimization Technique for Nonlinear Programming, a Primal-Duel Method," Manag. Sci., 10, 360-366 (1964).
156. Fiacco, A. V., and G. P. McCormick, "Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming," Manag. Sci., 10, 601-617 (1964).
157. Fiacco, A. V., and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, New York, (1968).
158. Zangwill, W. I., "Nonlinear Programming via Penalty Functions," Manag. Sci., 13(5), 344-358 (1967).
159. Lootsma, F. A., "Logarithmic Programming: A Method of Solving Nonlinear Programming Problems," Philips Res. Rep., 22, 329-344 (1967).
160. Lootsma, F. A., "Constrained Optimization via Penalty Functions," Philips Res. Rep., 23, 408-423 (1968).
161. Lootsma, F. A., "A Survey of Methods for Solving Constrained-Minimization Problems via Unconstrained Minimization," in Optimization and Design (M. Avriel, H. Rijckaert, and D. J. Wilde, Eds.), Prentice-Hall, Englewood Cliffs, NJ, 1973, pp. 88-118.
162. McCormick, G. P., "Penalty Function versus Non-Penalty Function Methods for Constrained Nonlinear Programming Problems," Math. Prog., 1(2), 217-238 (1971).
163. Lasdon, L. S., "An Efficient Algorithm for Minimizing Barrier and Penalty Functions," Math. Prog., 2(1), 65-106 (1972).
164. Moe, J., "Penalty-Function Methods," in Optimum Structural Design: Theory and Applications (R. H. Gallagher and O. C. Zienkiewicz, Eds.), Wiley, New York, 1973, Chap. 9.
165. Ryan, D. M., "Penalty and Barrier Functions," in Numerical Methods for Constrained Optimization (P. E. Gill and W. Murray, Eds.), Academic, New York, 1974, pp. 175-190.
166. Fox, R. L., Optimization Methods for Engineering Design, Addison-Wesley, Reading, MA, (1971).
167. Himmelblau, D. M., Applied Nonlinear Programming, McGraw-Hill, New York, 1972, Chap. 7, p. 299.
168. Avriel, M., Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, NJ, (1976).
169. Gulf Oil Corporation, "Compute II, a General Purpose Optimizer for Continuous Nonlinear Models-Description and User's Manual," Gulf Computer Sciences Incorporated, Houston, TX, (1972).
170. Afimiwala, K. A., "Program Package for Design Optimization," Department of Mechanical Engineering, State University of New York at Buffalo, (1974).
171. Lill, S., The University of Liverpool Computer Laboratory: E04HAF, Numerical Algorithms Group, Document No. 737, (1974).
172. DeSilva, B. M. E., and G. N. C. Grant, "Comparison of Some Penalty Function Based Optimization Procedures for the Synthesis of a Planar Truss," Int. J. Numer. Methods Eng., 7(2), 155-173 (1973).
173. Bracken, J., and G. P. McCormick, Selected Applications of Nonlinear Programming, Wiley, New York, (1968).
174. Gupta, B. D., and S. S. Rao, "Optimum Design of Air-Conditioned Buildings," ASME J. Mech. Des., 102(3), 476-480 (1980).
175. Rao, S. S., and B. D. Gupta, "Application of External Distributions in the Design of Thermal Systems," ASME J. Mech. Des., 102(3), 481-491 (1980).
176. Fiacco, A. V., and G. P. McCormick, Nonlinear Programming, Wiley, New York, (1968).
177. Sandgren, E., "The Utility of Nonlinear Programming Algorithms," Ph.D. dissertation, Purdue University, 1977; available from University Microfilm, 300 N. Zeeb Road, Ann Arbor, MI, Document No. 781(3115).
178. Fletcher, R., Practical Methods of Optimization, 2nd ed., Wiley, New York, (2004).
179. Nocedal, J., and S. Wright, Numerical Optimization, Springer Science, New York, (1999).
180. Franz, J., M. Liepelt, and K. Schittkowski, "Penalty-Barrier-Methods for Nonlinear Optimization: Implementation and Numerical Results," Report, Department of Mathematics, University of Bayreuth, Germany.
181. http://www/unibayreuth.de/departments/math/_kschittkowski/software.htm.
182. http://www.ece.northwestern.edu/OTC/.
183. Gabriele, G. A., OPTLIB: An Optimization Program Library, Purdue University, West Lafayette, IN, (1979).
184. Bertsekas, D. P., Constrained Optimization and Lagrange Multiplier Methods, Athena Scientific, Belmont, MA, (1996).
185. Kowalik, J., "Nonlinear Programming Procedures and Design Optimization," Acta Polytech. Scand., 13, (1966).
186. Fiacco, A. V., and G. P McCormick, "The Sequential Unconstrained Minimization Technique without Parameters," Oper. Res., 15, 820-827 (1967).
187. Fiacco, A. V., "Sequential Unconstrained Minimization Methods for Nonlinear Programming," Thesis, Northwestern University, Evanston, IL, (1967).
188. Rosenbrock, H. H., "An Automatic Method for Finding the Greatest or Least Value of a Function," Comput. J. 3, 175-184 (1960).
189. Huard, P., "Resolution of Mathematical Programming with Nonlinear Constraints by the Method of Centres," in Nonlinear Programming (J. Abodie, Ed.), North-Holland, Amsterdam, 1967, pp. 207-219.
190. Staha, R. L., "Documentation for Program Comet, a Constrained Optimization Code," University of Texas, Austin, TX, (1973).
191. Lootsma, F. A., "Convergence Rates of Quadratic Exterior Penalty-Function Methods for Solving Constrained Minimization Problems," Philips Res. Rep., 29(1) (Feb. 1974).
192. Schuldt, S. B., "A Method of Multipliers for Mathematical Programming Problems with Equality and Inequality Constraints," JOTA, 17(1/2), 155-162 (1975).
193. Schuldt, S. B., G. A. Gabriele, R. R. Root, E. Sandgren, and K. M. Ragsdell, "Application of a New Penalty Function Method to Design Optimization," ASME J. Eng. Ind., 99(1), 31-36 (Feb. 1977).
194. Rockafellar, R. T., "A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization," Math. Prog., 5(3), 354-373 (1973).
195. Powell, M. J. D., "A Method for Nonlinear Constraints in Minimization Problems," in Optimization (R. Fletcher, Ed.), Academic, London, 1969, pp. 283-298.
196. Hestenes, M. R., "Multiplier and Gradient Methods," JOTA, 4(5), 303-320 (1969).
197. Gould, F. J., and S. Howe, "A New Result on Interpreting Lagrange Multipliers as Dual Variables," Department of Statistics, University of North Carolina, Chapel Hill, NC, (1971).
198. Gill, P. E., and W. Murray, "The Computation of Lagrange-Multiplier Estimates for Constrained Minimization," Math. Prog., 17(1), 32-60 (1979).
199. Root, R. R., "An Investigation of the Method of Multipliers," Ph.D. dissertations, Purdue University, West Lafayette, IN, Dec. (1977).
200. Bertsekas, D. P., "On Penalty and Multiplier Methods for Constrained Minimization," in Nonlinear Programming, Vol. 2 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York 1975, pp. 165-192.
201. Kort, B. W., "Rate of Convergence of the Method of Multipliers with Inexact Minimization," in Nonlinear Programming, Vol. 2 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York, 1975, pp. 193-214.
202. Root, R. R., and K. M. Ragsdell, "Computational Enhancements of the Method of Multipliers," ASME J. Mech. Des., 102(3), 517-523 (1980).
203. Keefer, D. L., and X. X. Gottfried, "Differential Constraint Scaling in Penalty Function Optimization," AIIE Trans., 2(4), 281 (1970).
204. Keefer, D. L., "Simpat: A Self-Bounding Direct Search Method for Optimization," I & EC Proc. Des. Develop., 12, 92 (1973).
205. Ragsdell, K. M., and D. T. Phillips, "Optimal Design of a Class of Welded Structures Using Geometric Programming," ASME J. Eng. Ind. Ser. B, 98(3), 1021-1025 (1976).
206. Root, R. R., and K. M. Ragsdell, "BIAS: A Nonlinear Programming Code in Fortran IV-Users Manual," Purdue Research Foundation, West Lafayette, IN, June (1976).
207. Schittkowski, K., "Nonlinear Programming Codes: Information, Tests, Performance," Lecture Notes in Economics and Mathematical Systems, Vol. 183, Springer-Verlag, Berlin, (1980).
208. Best, M. J., and A. T. Bowler, "ACDPAC: A Fortran IV Subroutine to Solve Differentiable Mathematical Programmes-Users Guide-Level 2.0," Res. Rep., CORR75-26, Department of Combinatorics and Optimization, University of Waterloo, Ontario, Canada/, (1978).
209. Best, M. J., and Ritter, K., "An Accelerated Conjugate Direction Method to Solve Linearly Constrained Minimization Problems," J. Computer Syst. Sci., 11(3), 295-322 (1975).
210. Newell, J. S., and D. M. Himmelblau, "A New Method for Nonlinearly Constrained Optimization," AIChE J., 21(3), 479-486 (1975).
211. Fletcher, R., "An Ideal Penalty Function for Constrained Optimization," in Nonlinear Programming, Vol. 2 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York, (1975).
212. Gill, P. E., and W. Murray (Eds.), Numerical Methods for Constrained Optimization, Academic, New York, (1974).
213. Freudenstein, F., "Approximate Synthesis of Four-Bar Linkages," Trans. ASME, 853-861 (Aug. 1955).
214. Wait, R. The Numerical Solution of Algebraic Equations, Wiley, New York, (1979).
215. Westerberg, A. W., H. P. Hutchinson, R. L. Motard, and P. Winter, Process Flowsheeting, Cambridge University Press, Cambridge, England, (1979).
216. Sargent, R. W. H., "A Review of Methods for Solving Nonlinear Algebraic Equations," in Foundations of Computer Aided Process Design, Vol. 1 (R. S. H. Mah and W. D. Seider, Eds.) Engineering Foundation, New York, 1981, pp. 27-76.
217. Box, M. J., D. Davies, and W. H. Swann, Nonlinear Optimization Techniques, ICI Monograph No. 5, Oliver & Boyd, London, (1969).
218. Klingman, W. R., and D. M. Himmelblau, "Nonlinear Programming with the Aid of a Multiple Gradient Summation Technique," JACM, 11, 400-415 (1964).
219. Gill, P. E., and W. Murray (Eds.), Numerical Methods for Constrained Optimization, Academic, London, (1974).
220. Box, M. J., "A New Method of Constrained Optimization and a Comparison with Other Methods," Computer J., 8, 42-52 (1965).
221. Biles, W. E., "Optimization of Multiple Response Simulation Models," University of Notre Dame, Final Report, ONR-Contract N00014-76-C-1021, Oct. 31, (1978).
222. Brooks, S. H., "A Discussion of Random Methods for Seeking Maxima," Oper. Res., 6, 244-253 (1958).
223. Spang, H. A., "A Review of Minimization Techniques for Nonlinear Function," SIAM Rev., 4, 343-365 (1962).
224. Luus, R., and T. H. I. Jaakola, "Optimization by Direct Search and Systematic Reduction of the Size of Search Region," AIChE J., 19, 760-766 (1973).
225. Heuckroth, M. W., J. L. Gaddy, and L. D. Gaines, "An Examination of the Adaptive Random Search Technique," AIChE J., 22, 744-750 (1976).
226. Doering, F. J., and J. L. Gaddy, "Optimization of the Sulfuric Acid Process with a Flowsheet Simulator," Computers Chem. Eng., 4, 113-122 (1980).
227. Goulcher, R., and J. J. Casares Long, "The Solution of Steady State Chemical Engineering Optimization Problems Using a Random Search Algorithm," Computers Chem. Eng., 2, 33-36 (1978).
228. Martin, D. L., and J. L. Gaddy, "Process Optimization with the Adaptive Randomly Directed Search," in Selected Topics in Computer Aided Process Design and Analysis, CEP Symp. Ser., Vol. 214 (R. S. H. Mah and G. V. Reklaitis, Eds.), American Institute of Chemical Engineers, New York, (1982).
229. Schumer, M. A., and K. Steiglitz, "Adaptive Step Size Random Search," IEEE Trans., AC-13, 270-276 (1968).
230. Jarvis, R. A., "Optimization Strategies in Adaptive Control: A Selective Survey," IEEE Trans. Syst. Man and Cybern., 5, 83-94 (1975).
231. Schrack, G., and N. Borowski, "An Experimental Comparison of Three Random Searches," in Numerical Methods for Nonlinear Optimization (F. A. Lootsma, Ed.), Academic, New York, (1972).
232. Lee, T. W., and F. Freudenstein, "Heuristic Combinatorial Optimization in the Kinematic Design of Mechanisms: Part 1: Theory," J. Engl. Ind. Trans. ASME, 1277-1280 (1976).
233. Datseris, P., "Principles of a Heuristic Optimization Technique as an Aid in Design-An Overview," ASME Tech. Paper, 80-DET-44 (Sept. 1980).
234. Lee, T. W., and R. Freudenstein, "Heuristic Combinatorial Optimization in the Kinematic Design of Mechanisms, Part 2: Applications," J. Engl. Ind. Trans. ASME, 1281-1284 (1976).
235. Mockus, J., "On Baysian Methods of Optimization," in Towards Global Optimization (L. C. W. Dixon and G. P. Szego, Eds.), North-Holland, Amsterdam, (1975).
236. Zilinskas, A., "On Statistical Models for Multi-Modal Optimization," Math. Operationsforsh. Stat. Ser. Stat., 9, 255-266 (1978).
237. Devroye, L. P., "Progressive Global Random Search of Continuous Functions," Math Program., 15, 330-342 (1978).
238. Frank, N., and P. Wolfe, "An Algorithm for Quadratic Programming," Naval Res. Log. Quart., 3, 95-110 (1956).
239. Zangwill, W. I., Nonlinear Programming, Prentice-Hall, Englewood Cliffs, NJ, (1969).
240. Wolfe, P., "Convergence Theory in Nonlinear Programming," in Integer and Nonlinear Programming (J. Abadie, Ed.), North-Holland, Amsterdam, (1970).
241. Griffith, R. E., and R. A. Stewart, "A Nonlinear Programming Technique for Optimization of Continuous Processing Systems," Manag. Sci., 7, 379-391 (1961).
242. Smith, H. V., "A Process Optimization Program for Nonlinear Systems, Pop II," 7090 H9 IBM UD21, SHARE General Program Library, (1965).
243. Graves, G. W., "Development and Testing of a Nonlinear Programming Algorithm," Rep. No. ATR-64 (7040)-2, Aerospace Corporation, June (1964).
244. Clasen, R. J., G. W. Graves, and J. Y. Lu, "Sortie Allocation by a Nonlinear Programming Model for Determining a Munitions Mix," Rep R-1411-DDPAE, Rand Corporation, Mar. (1974).
245. Palacios-Gomez, F. E., L. Lasdon, and M. Engquist, "Nonlinear Optimization by Successive Linear Programming," Manag. Sci., 28(10), 1106-1120 (1982).
246. Zhang, J., N. H. Kim, and L. Lasdon, "An Improved Successive Linear Programming Algorithm," Manag. Sci., 31(10), 1312-1331 (1985).
247. Beale, E. M. L., "Nonlinear Programming Using a General Mathematical Programming System," in Design and Implementation of Optimization Software (H. J. Greenberg, Ed.), Sijthoff and Noordhoff, Netherlands, (1978).
248. Lasdon, L. S., and A. D. Warren, "Survey of Nonlinear Programming Applications," Oper. Res., 28, 1029-1073 (1980).
249. Baker, T. E., and L. Lasdon, "Successive Linear Programming at Exxon," Manag. Sci., 31(3), 264-274 (1985).
250. Dash Optimization, Englewood Cliffs, NJ, www.dashoptimization.com.
251. Haverly, C. A., "Studies of the Behavior of Recursion for the Pooling Problem," SIGMAP Bull., 25, 19-28 (Dec. 1978).
252. Lasdon, L. S., A. D. Warren, S. Sarkar, and F. E. Palacios-Gomez, "Solving the Pooling Problem Using Generalized Reduced Gradient and Successive Linear Programming Algorithms," SIGMAP Bull., 77, 9-15 (July 1979).
253. Miller, C. E., "The Simplex Method for Local Separable Programming," in Recent Advances in Mathematical Programming (R. Graves and P. Wolfe, Eds.), McGraw-Hill, New York, (1963).
254. Bazaraa, M. S., H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed., Wiley, New York, (1993).
255. Beale, E. M. L., "Advanced Algorithmic Features for General Mathematical Programming Systems," in Integer and Nonlinear Programming (J. Abadie, Ed.), North-Holland, Amsterdam, (1970).
256. El Agizy, "Applications of Separable Programming to Refinery Models," ORSA 36th National Meeting, Nov. (1969).
257. Kawaratoni, T. K., R. J. Ullman, and G. B. Dantzig, "Computing Tetraethyl-lead Requirements in a Linear Programming Format," Oper. Res., 8, 24-29 (1960).
258. Zoutendijk, G., Methods of Feasible Directions, Elsevier, Amsterdam, (1960).
259. Zangwill, W. I., Nonlinear Programming: A Unified Approach, Prentice-Hall, Englewood Cliffs, NJ, (1969).
260. Wolfe, P., "On the Convergence of Gradient Methods Under Constraints," IBM J. Res. Develop., 16, 407-411 (1972).
261. Topkis, D. M., and A. F. Veinott, "On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming," SIAM J. Control, 5, 268-279 (1967).
262. Zangwill, W. I., "The Convex Simplex Method," Manag. Sci. A, 14, 221-238 (1967).
263. Wolfe, P., "Methods of Nonlinear Programming," in Recent Advances in Mathematical Programming (R. L. Graves and P. Wolfe, Eds.), McGraw-Hill, New York, pp. 76-77, (1963).
264. McCormick, G. P., "Anti-Zig-Zagging by Bending," Manag. Sci., 15, 315-320 (1969).
265. Bazaraa, M., and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, Wiley, New York, (1979).
266. Hans-Tijan, T. Y., and W. I. Zangwill, "Analysis and Comparison of the Reduced Gradient and the Convex Simplex Method for Convex Programming," paper presented at ORSA 41st National Meeting, New Orleans, Apr. (1972).
267. Murtagh, B. A., and M. A. Saunders, "Large Scale Linearly Constrained Optimization," Math. Prog., 14, 41-72 (1978).
268. Abadie, J., and J. Carpentier, "Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints," in Optimization (R. Fletcher, Ed.), Academic, New York, 1969, Chapter 4.
269. Johnson, R. C., "A Method of Optimum Design," ASME J. Mech. Des., 101, 667-673 (1979).
270. Beightler, C., and D. J. Wilde, Foundation of Optimization Theory, Prentice-Hall, Englewood Cliffs, NJ, (1967).
271. Wilde, D. J., "Differential Calculus in Nonlinear Programming," Oper. Res., 10, 764-773 (1962). See also Oper. Res. 13, 848-855 (1965).
272. Reklaitis, G. V., and D. J. Wilde, "Necessary Conditions for a Local Optimum without Prior Constraint Qualifications," in Optimizing Methods in Statistics (J. S. Rustagi, Ed.), Academic, New York, 1971, pp. 339-368.
273. Lasdon, L. S., A. D. Waren, A. Jain, and M. Ratner, "Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming," ACM Trans. Math. Software, 4, 34-50 (1978).
274. Smith, S., and L. Lasdon, "Solving Large Sparse Nonlinear Programs Using GRG," ORSA J. Comput., 4, 3-15 (Winter 1992).
275. Smeers, Y., "Generalized Reduced Gradient Method as an Extension of Feasible Direction Methods," J. Opt. Theory Appl., 22, 209-226 (1977).
276. Luenberger, D. G., Introduction to Linear and Nonlinear Programming, 2nd ed., Addison-Wesley, Reading, MA, (1984).
277. Murtagh, B. A., and M. A. Saunders, "MINOS User's Guide," Tech. Rep. P3-20, Systems Optimization Laboratory, Stanford University, Stanford, CA, Feb. (1987).
278. Lasdon, L. S., and A. D. Warren, "Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems," in Design and Implementation of Optimization Software (H. Greenberg, Ed.), Sijthoff and Noordhoff, Holland, (1978).
279. Drud, A., "CONOPT-a Large Scale GRG Code," ORSA J. Comput., 6 (Spring 1994).
280. Mathematics and Computer Science Division, Argonne National Laboratories, Argonne, IL, www.mcs.gov.
281. Gabriele, G. A., and K. M. Ragsdell, "The Generalized Reduced Gradient Method: A Reliable Tool for Optimal Design," ASME J. Eng. Ind., 99, 384-400 (1977).
282. Fylstra, D., L. Lasdon, and A. Waven, "Design and Use of the Microsoft Excel Solver", Interfaces, 28, 29-55 (Sept.-Oct. 1998).
283. Knopf, F. C., M. R. Okos, and G. V. Reklaitis, "Optimal Design of Batch/Semi-Continuous Processes," Ind. Eng. Chem. Proc. Des. Dev., 21, 79-86 (1982).
284. Biegler, L. T., and I. E. Grossmann, and A. W. Westerberg, Systematic Methods of Chemical Process Design, Prentice-Hall, Upper Saddle River, NJ, (1997).
285. Wilson, R. B., "A Simplicial Algorithm for Concave Programming," Ph.D. dissertation, Harvard University, Cambridge, MA, (1963).
286. Beale, E. M. L., "Numerical Methods," in Nonlinear Programming (J. Abadie, Ed.), North-Holland, Amsterdam, (1967).
287. Bard, Y., and J. L. Greenstadt, "A Modified Newton Method for Optimization with Equality Constraints," in Optimization (R. Fletcher, Ed.), Academic, New York, (1969).
288. Garcia-Palomares, U. M., and O. L. Mangasarian, "Superlinearly Convergent Quasi-Newton Algorithms for Nonlinearly Constrained Optimization Problem," Math. Prog., 11, 1-13 (1976).
289. Han, S. P., "Superlinearly Convergent Variable Metric Algorithms for General Nonlinear Programming Problems," Math. Prog., 11, 263-282 (1976).
290. Han, S. P., "A Globally Convergent Method for Nonlinear Programming," J. Opt. Theory Appl. 22, 297-309 (1977).
291. Powell, M. J. D., "A Fast Algorithm for Nonlinearly Constrained Optimization Calculations," in Numerical Analysis, Dundee 1977 (G. A. Watson, Ed.), Lecture Notes in Mathematics No. 630, Springer-Verlag, New York, (1978).
292. Powell, M. J. D., "Algorithms for Nonlinear Functions that Use Lagrangian Functions," Math. Prog., 14, 224-248 (1978).
293. Chamberlain, R. M., "Some Examples of Cycling in Variable Metric Methods for Constrained Minimization," Math. Prog., 16, 378-383 (1979).
294. Mayne, D. Q., "On the Use of Exact Penalty Functions to Determine Step Length in Optimization Algorithms," in Numerical Analysis, Dundee, 1979 (G. A.Watson, Ed.), Lecture Notes in Mathematics No. 773, Springer-Verlag, New York, (1980).
295. Powell, M. J. D., "The Convergence of Variable Metric Methods for Nonlinearly Constrained Optimization Calculations," in Nonlinear Programming, Vol. 3 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson Eds.), Academic, New York, (1978).
296. Biggs, M. C., "Minimization Using Recursive Equality Quadratic Programming," in Numerical Methods for Nonlinear Optimization (F. A. Lootsma, Ed.), Academic, New York, (1972).
297. Bartholemew-Biggs, M. C., "Recursive Quadratic Programming Based on Penalty Functions for Constrained Minimization," in Nonlinear Optimization: Theory and Algorithms (L. C. W. Dixon, E. Spedicato, and G. P. Szego, Eds.), Birkhauser, Boston, (1980).
298. Berna, T. J., M. H. Locke, and A. W. Westerberg, "A New Approach to Optimization of Chemical Processes," AICHE J., 26, 37-43 (1980).
299. Chao, N. H., S. J. Fenvers, and A. W. Westerberg, "Application of a Reduced Quadratic Programming Technique to Structural Design," in Proc. Intern. Symp. Optimum Structural Design, Tucson, AZ, Oct. 1981, pp. 8.5-8.12.
300. Powell, M. J. D., "Constrained Optimization Using Variable Metric Methods," in Nonlinear Optimization: Theory and Algorithms (L. C. W. Dixon, E. Spedicato, and G. P. Szego, Eds.), Birkhauser, Boston, (1980).
301. Reklaitis, G. V., and D. J. Wilde, "A Computationally Compact Sufficient Condition for Constrained Minima," Oper. Res., 17, 425-436 (1969).
302. Biegler, L. T., and R. R. Hughes, "Approximation Programming of Chemical Process with Q/LAP," Chem. Eng. Prog., 77, 76-83 (1981).
303. Gill, P. E., W. Murray, M. A. Saunders, and M. H. Wright, "QP-Based Method for Large Scale Nonlinearly Constrained Optimization," in Nonlinear Programming, Vol. 4 (O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds.), Academic, New York, (1981).
304. Watters, L., "Reduction of Integer Polynomial Programming Problems to Zero-One Linear Programming Problems," Oper. R., 15(6), 1171-1174 (1967).
305. Glover, F., and E. Woolsey, "Converting 0-1 Polynomial Programming Problem to 0-1 Linear Program," Oper. Res., 22, 180-182 (1974).
306. Ravindran, A., D. T. Phillips, and J. J. Solberg, Operations Research: Principles and Practice, 2nd ed., Wiley, New York, (1987).
307. Plane, D. R., and C. McMillan, Discrete Optimization, Prentice-Hall, Englewood Cliffs, NJ, (1971).
308. Murty, K. G., Operations Research-Deterministic Optimization Models, Prentice-Hall, Englewood Cliffs, NJ, (1995).
309. Rardin, R. L., Optimization in Operations Research, Prentice-Hall, Upper Saddle River, NJ, (1998).
310. Gupta, O. K., and A. Ravindran, "Branch and Bound Experiments in Convex Nonlinear Integer Programming," Manag. Sci., 31(12), 1553-1546 (1985).
311. Albright, C., "Premium Solver Platform for Excel," OR/MS Today, 28, 58-63 (June 2001).
312. Grossman, T. A., "Spreadsheet Add-Ins for OR/MS," OR/MS Today, 29, 46-51 (Aug. 2002).
313. Saltzman, M., "Broad Selection of MIP Software Packages Available," OR/MS Today, 21, 42-51 (Apr. 1994).
314. Sharda, R., Linear and Discrete Optimization and Modeling Software: A Resource Handbook, Lionheart Publishing, Atlanta, GA, (1993).
315. Nemhauser, G. L., and L. A. Woolsey, Integer and Combinatorial Optimization, Wiley, New York, (1988).
316. McCarl, B. A., H. Moskowitz, and H. Furtan, "Quadratic Programming Applications," Omega, 5(1), 43-55 (1977).
317. Wolfe, P., "The Simplex Method of Quadratic Programming," Econometrica, 27, 382-398 (1959).
318. Lemke, C. E., "Bimatrix Equilibrium Points and Mathematical Programming," Manag. Sci., 11, 681-689 (1965).
319. Ravindran, A., and H. Lee, "Computer Experiments on Quadratic Programming Algorithms," Eur. J. Oper. Res., 8(2), 166-174 (1981).
320. Cottle, R. W., and G. B. Dantzig, "Complementary Pivot Theory and Mathematical Programming," J. Linear Algebra Appl., 1, 105-125 (1968).
321. Ravindran, A., "A Computer Routine for Quadratic and Linear Programming Problems," Commun. ACM, 15(9), 818-820 (1972).
322. Ravindran, A., "A Comparison of Primal Simplex and Complementary Pivot Methods for Linear Programming," Naval Res. Logistics Q., 20(1), 95-100 (1973).
323. Ravindran, A., "Computational Aspects of Lemke's Algorithm Applied to Linear Programs," OPSEARCH, 7(4), 241-262 (1970).
324. Philipson, R. H., and A. Ravindran, "Applications of Mathematical Programming to Metal Cutting," Math. Prog. Study, 19, 116-134 (1979).
325. Armarego, E. J. A., and R. H. Brown, The Machining of Metals, Prentice-Hall, Englewood Cliffs, NJ, (1969).
326. Philipson, R. H., and A. Ravindran, "Application of Goal Programming to Machinability Data Optimization," J. Mech. Design: Trans. ASME, 100, 286-291 (1978).
327. Arthur, J. L., and A. Ravindran, "An Efficient Goal Programming Algorithm Using Constraint Partitioning and Variable Elimination," Manag. Sci., 24(8), 867-868 (Apr. 1978).
328. Arthur, J. L., and A. Ravindran, "PAGP-Partitioning Algorithm for (Linear) Goal Programming Problems," ACM Trans. Math. Software, 6, 378-386 (1980).
329. Charnes, A., W. W. Cooper, and R. J. Niehaus, "Dynamic Multi-Attribute Models for Mixed Manpower Systems," Naval Res. Logistics Q., 22(2), 205-220 (1975).
330. Zanakis, S. H., and M. W. Maret, "A Markovian Goal Programming Approach to Aggregate Manpower Planning," 32(1), 55-63 (1981).
331. Schuler, A. T., H. H. Webster, and J. C. Meadows, "Goal Programming in Forest Management," J. Forestry, 75, 320-324, June (1977).
332. Dane, C. W., N. C. Meador, and J. B. White, "Goal Programming in Land-use Planning," J. Forestry, 75, 325-329, June (1977).
333. Haimes, Y. Y., W. A. Hall, and H. T. Freedman, Multiobjective Optimization in Water Resources Systems, Elsevier, Amsterdam, (1975).
334. Charnes, A., W. W. Cooper, J. Harrald, K. R. Karwan, and W. A. Wallace, "A Goal Interval Programming Model for Resource Allocation on a Marine Environmental Protection Program," J. Environ. Econ. Manag., 3, 347-362 (1976).
335. Ijiri, Y., Management Goals and Accounting for Control, Rand-McNally, Chicago, IL, (1965).
336. Beilby, M. H., and T. H. Mott, Jr., "Academic Library Acquisitions Allocation Based on Multiple Collection Development Goals," Computers & OR, 10(4), 335-344 (1983).
337. Lee, S. M., and E. R. Clayton, "A Goal Programming Model for Academic Resource Allocation," Manag. Sci., 17(8), 395-408 (1972).
338. Lee, S. M., and A. J. Lerro, "Optimizing the Portfolio Selection for Mutual Funds," J. Finance, 28(8), 1087-1101 (1973).
339. Cook, W. D., "Goal Programming and Financial Planning Models for Highway Rehabilitation," J. Oper. Res. Soc., 35(3), 217-224 (1984).
340. Lee, S. M., and L. J. Moore, "Multi-Criteria School Busing Models," Manag. Sci., 23(7), 703-715 (1977).
341. Moore, L. J., B. W. Taylor, and S. M. Lee, "Analysis of a Transhipment Problem with Multiple Conflicting Objectives," Comput. Oper. Res., 5, 39-46 (1978).
342. Sinha, K. C., M. Muthusubramanyam, and A. Ravindran, "Optimization Approach for Allocation of Funds for Maintenance and Preservation of the Existing Highway System," Transportation Res. Record, 826, 5-8 (1981).
343. Lee, S. M., and R. Nicely, "Goal Programming for Marketing Decisions: A Case Study," J. Marketing, 38(1), 24-32 (1974).
344. Arthur, J. L., and K. D. Lawrence, "Multiple Goal Production and Logistics Planning in a Chemical and Pharmaceutical Company," Comput. Oper. Res., 9(2), 127-137 (1982).
345. Deckro, R. J., J. E. Herbert, and E. P. Winkofsky, "Multiple Criteria Job-Shop Scheduling," Comput. Oper. Res., 9(4), 279-285 (1984).
346. Lawrence, K. D., and J. J. Burbridge, "A Multiple Goal Linear Programming Model for Coordinated and Logistics Planning," Int. J. Prod. Res., 14(2), 215-222 (1976).
347. Lee, S. M., and J. L. Moore, "A Practical Approach to Production Scheduling," Production Inventory Manag., 15(1), 79-92 (1974).
348. Lee, S. M., E. R. Clayton, and B. W. Taylor, "A Goal Programming Approach to Multi-Period Production Line Scheduling," Comput. Oper. Res., 5, 205-211 (1978).
349. Arthur, J. L., and A. Ravindran, "A Multiple Objective Nurse Scheduling Model," Inst. Ind. Eng. Trans., 13(1), 55-60 (1981).
350. Musa, A. A., and U. Saxena, "Scheduling Nurses Using Goal Programming Techniques," Inst. Ind. Eng. Trans., 16(3), 216-221 (1984).
351. Trivedi, V. M., "A Mixed-Integer Goal Programming Model for Nursing Service Budgeting," Oper. Res., 29(5), 1019-1034 (1981).
352. Ravindran, A., W. Shin, J. L. Arthur, and H. Moskowitz, "Nonlinear Integer Goal Programming Models for Acceptance Sampling," Comput. Oper. Res., 13(6), 611-622 (1986).
353. Sengupta, S., "A Goal Programming Approach to a Type of Quality Control Problem," J. Oper. Res. Soc., 32(2), 207-212 (1981).
354. Lee, S. M., Goal Programming for Decision Analysis, Auerback Publishers, Philadelphia, PA, (1972).
355. Schniederjan, M. J., Goal Programming: Methodology and Applications, Kluwer, Norwell, MA, (1994).
356. Zanakis, S. H., and S. K. Gupta, "A Categorized Bibliographic Survey of Goal Programming," Omega, 13(3), 211-222 (1985).
357. Ignizio, J. P., Goal Programming and Extensions, Health, Lexington, KY, (1976).
358. Zeleny, M., Multi Criteria Decision Making, McGraw-Hill, New York, (1982).
359. Keeney, R. L., and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeofffs, Wiley, New York, (1976).
360. Sharda, R., Linear and Discrete Optimization and Modeling Software: A Resource Handbook, Lionheart, Atlanta, GA, (1993).
361. Nash, S. G. "Nonlinear Programming Software Survey," OR/MS Today, 25 (June 1998).
362. Albright, C., "Premium Solver Platform for Excel," OR/MS Today, 29, 58-63 (June 2001).
363. Grossman, T. A., "Spreadsheet Add-ins for Excel," OR/MS Today, 29, 46-51 (Aug. 2002).
364. Brooke, A., D. Kendrick, and A. Meerans, GAMS: A User's Guide, Scientific Press, Redwood City, CA (1988).
365. Sharda, R., and G. Rampla, "Algebraic Modeling Languages on PC's," OR/MS Today, 22, 58-63 (1995).
366. Fourer, R., R. M. Gay, and B. W. Kermighan, "A Modeling Language for Mathematical Programming," Manag. Sci., 36, 519-554 (1990).
367. Brian, R., and M. Breiner, MATLAB for Engineers, Addison-Wesley, Reading, MA (1995).
368. Hutchinson, J. J., "Matlab Software Review," OR/MS Today, 23 (Oct. 1996).
369. http://www.ece.northwestern.edu/OTC/.
370. Dolan, E. D., J. J. Moreé, and T. S. Munson, "Benchmarking Optimization with COPS 3.0," Technical Report ANC/MCS-273, Mathematics and Computer Science Division, Argonne National Laboratory, Feb. (2004).
371. Dolan, E. D., and J. J. Moré. "Benchmarking Optimization Software with Performance Profiles," Math. Prog., 91, 201-213 (2002).
372. Ragsdell, K. M., "Design and Automation," ASME J. Math. Design, 102, 424-429 (1980).
373. Mayne, R. W., and K. M Ragsdell, Progress in Engineering Optimization, American Society of Mechanical Engineers, New York (1981).
374. Ragsdell, K. M., "A Proposal for the Establishment of an Optimization Software Testing Center," in Nonlinear Optimization-1981 (M. J. D. Powell, Ed.), 1981, p. 465.
375. Crowder, H. P., R. S. Dembo, and J. M. Mulvey, "Reporting Computational Experiments in Mathematical Programming," Math. Prog., 15, 316-329 (1978).
376. Eason, E. D., "Evidence of Fundamental Difficulties in Nonlinear Optimization Code Comparisons," Proc. U.S. Bur. Stands./Math. Programming Soc. Conf. Testing Validating Algorithms Software, Boulder, CO, Jan. (1981).
377. Box, M. J., "A New Method of Constrained Optimization and a Comparison with Other Methods," Computer J., 8(1), 42-51 (1965).
378. Brooks, S. H., "A Comparison of Maximum Seeking Methods," J. Oper. Res., 7(4), 430-437 (1959).
379. Leon, A., "A Comparison among Eight Known Optimizing Procedures," in Recent Advances in Optimization Techniques (A. Lavi and W. Vogl, Eds.), Wiley, New York, 1966, pp. 23-42.
380. Fletcher, R., "Mathematical-Programming Methods-A Critical Review," in Optimum Structural Design: Theory and Applications (R. H. Gallagher and O. C. Zienkiewicz, Eds.), Wiley, New York, 1973, pp. 51-77.
381. Colville, A. R., "A Comparative Study of Nonlinear Programming Codes," Tech. Rep. No. 320-2949, IBM New York Scientific Center, NY, June (1968).
382. Griffith, F. E., and R. A. Stewart, "A Nonlinear Programming Technique for Optimization of Continuous Processing Systems," Manag. Sci., 7, 379-392 (1961).
383. Mylander, W. C., R. L. Holmes, and G. P. McCormick, A Guide to SUMT-Version, Vol. 4, Research Analysis Corporation, McLean, VA RAC-P-63, (1964).
384. Eason, E. D., "Validity of Colville's Time Standardization for Comparing Optimization Codes," Paper No. 77-DET-116, presented at the ASME Des. Eng. Tech. Conf., Chicago, Sept. (1977).
385. Eason, E. D., and R. G. Fenton, "A Comparison of Numerical Optimization Methods for Engineering Design," ASME J. Eng. Ind. Ser. B, 96(1), 196-200 (Feb. 1974).
386. Sandgren, E., "The Utility of Nonlinear Programming Algorithms," Ph.D. dissertation, Purdue University, Ann Arbor, MI, document no. 7813115, Dec. (1977).
387. Sandgren, E., and K. M. Ragsdell, "The Utility of Nonlinear Programming Algorithms: A Comparative Studey-Parts 1 and 2," ASME J. Mech. Des., 102(3), 540-551 (July 1980).
388. Dembo, R. S., "A Set of Geometric Programming Test Problems and Their Solutions," Working Paper 87, Dept. Management Sci. University of Waterloo, Ontario, Canada, Dec. (1974).
389. Sandgren, E., "A Statistical Review of the Sandgren-Ragsdell Comparative Study," in Mathematical Programming Society COAL Meeting Proceedings, Boulder, CO, Jan. 5-6, 1981, pp. 72-90.
390. Rosen, J. B., and S. Suzuki, "Construction of Nonlinear Programming Test Problems," ACM Commun. 8(2), Feb. 1965.
391. Schittkowski, K., Nonlinear Programming Codes: Information Tests, Performance, Lecture Notes in Economics and Mathematical Systems, Vol. 183, Springer-Verlag, New York, (1980).
392. Schittkowski, K., Nonlinear Programming Codes: Information, Tests, Performance, Lecture Notes in Economics and Mathematical Systems, Vol. 183, Springer-Verlag, New York, (1980).
393. Saaty, T. L., "A Scaling Method for Priorities in Hierarchical Structures," J. Math. Psych., 15, 234-281 (1977).
394. Lootsma, F. A., "Ranking of Nonlinear Optimization Codes According to Efficiency and Robustness," in Konstrucktive Methoden der finiten nichtlinearen Optimierung (L. Collatz, G. Meinardus, and W. Wetterling, Eds.), Birkhauser, Basel, Switzerland, 1980, pp. 157-158.
395. Embury, M. C., G. V. Reklaitis, and J. M. Woods, "Scheduling and Simulation of a Staged Semi-Continuous Multi-Product Process," Proceedings of Pacific Chemical Engineering Congress, Denver, CO, Aug. 1977, Vol. 2.
396. Bett, K. E., J. S. Rawlinson, and G. Saville, Thermodynamics for Chemical Engineers, MIT Press, Cambridge, MA, (1975).
397. King, J. C., Separation Processes, McGraw-Hill, New York, (1971).
398. Scribner, B. F., and D. H. Berlau, "Optimal Planning for Product/Production Facility Studies (OPPLAN)," Proc. Amer. Inst. Ind. Eng. Conf., San Francisco, May 1979, pp. 383-387.
399. Benjamin, D. R., M. H. Locke, and A. W. Westerberg, "ASCEND: Friendly Interactive Flowsheeting System," paper 25b, presented at AIChE Summer Meeting, Detroit, Aug. (1981).
400. Kilkas, A. C., and H. P. Hutchison, "Process Optimization Using Linear Models, Computers Chem. Eng., 4, 39-48 (1980).
401. Pollack, H. W., and W. D. Lieder, "Linking Process Simulators to a Refinery Linear Programming Model" in Computer Applications to Chemical Engineering (R. G. Squires and G. V. Reklaitis, Eds.), ACS Symposium Series Vol. 124, American Chemical Society, Washington, DC, (1980).
402. Parker, A. L., and R. R. Hughes, "Approximation Programming of Chemical Processes: Parts 1 and 2," Computers Chem. Eng., 5, 123-131 (1981).
403. Biegler, L. T., and R. R. Hughes, "Approximation Programming of Chemical Processes with Q/LAP," Chem. Eng. Prog., 77, 76-83 (1981).
404. McLane, M., M. K. Sood, and G. V. Reklaitis, "A Hierarchical Strategy for Large Scale Process Calculations," Computers Chem. Eng., 3, 383-394 (1979).
405. Biles, W. E., and J. J. Swain, Optimization and Industrial Experimentation, Wiley-Interscience, New York, 1980, Chap. 7.
406. Rosen, E. M., "Steady State Chemical Process Simulation: A State of the Art Review," in Computer Applications to Chemical Engineering (R. G. Squires and G. V. Reklaitis, Eds.), ACS Symposium Series Vol. 124, American Chemical Society, Washington, DC, (1980).
407. Pritsker, A. A. B., Modeling and Analysis Using Q-GERT Networks, Wiley-Halsted, New York, (1977).
408. Salvendy, G. (Ed), Handbook of Industrial Engineering, Wiley-Interscience, New York, (1981).
409. Root, R. R., and K. M. Ragsdell, "Computational Enhancements of the Method of Multipliers," ASME J. Mech. Des., 102, 517-523 (1980).
410. Keefer, D. L., and B. Gottfried, "Differential Constraint Scaling in Penalty Function Optimization," AIIE Trans., 2, 281-286 (1970).
411. Lasdon, L. S., and P. O. Beck, "Scaling Nonlinear Programs," Oper. Res. Lett., 1, 6-9 (1981).
412. Berna, T. J., M. H. Locke, and A. W. Westerberg, "A New Approach to Optimization of Chemical Processes," AIChE J., 26, 37-43 (1980).
413. Box, M. J., "A Comparison of Several Current Optimization Methods and the Use of Transformations in Constrained Problems," Computer J., 9, 67-77 (1966).
414. Sisser, F. S., "Elimination of Bounds in Optimization Problems by Transforming Variables," Math. Prog., 20, 110-121 (1981).
415. Luenberger, D. G., Introduction to Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, 1973, Chap. 5.
416. Reklaitis, G. V., and D. J. Wilde, "A Differential Algorithm for Polynomial Programs," DECHEMA Monogr., 67, 324-350 (1970).
417. Reklaitis, G. V., and D. J. Wilde, "Geometric Programming via a Primal Auxiliary Problem," AIIE Trans., 6, 308-317 (1974).
418. Rijckaert, M. J., and X. M. Martens, "Analysis and Optimization of the Williams-Otto Process by Geometric Programming," AIChE J., 20, 742-750 (1974).
419. Westerberg, A. W., and J. V. Shah, "Assuring a Global Optimum by the Use of an Upper Bound on the Lower (Dual) Bound," Computers Chem. Eng., 2, 83-92 (1978).
420. Guthrie, K. M., Process Plant Estimating, Evaluation, and Control, Craftsman Book Company, Solana Beach, CA, (1974).
421. Knopf, F. C., M. R. Okos, and G. V. Reklaitis, "Optimal Design of Batch/Semi-Continuous Processes," Ind. Eng. Chem. Proc. Design Devel., 21, 79-86 (1982).
422. Fattler, J. E., G. V. Reklaitis, Y. T. Sin, R. R. Root, and K. M. Rasgsdell, "On the Computational Utility of Polynomial Geometric Programming Solution Methods," Math. Prog., 22, 163-201 (1982).
423. Geoffrion, A. M., "Generalized Benders Decomposition," JOTA, 10, 237-251 (1972).
424. Sargent, R. W. H., and K. Gannibandara, "Optimum Design of Plate Distillation Columns." in Optimization in Action (L. C. W. Dixon, Ed.), Academic, New York, (1976).
425. Gupta, A., and A. Ravindran, "Optimization of Transportation Networks," in Stochastic Modeling of Large Scale Transportation Networks (J. J. Solberg, Ed.), Final Rep., Automotive Transportation Center, Purdue University, West Lafayette, IN, Apr. (1981).
426. Reklaitis, G. V., and J. M. Woods, "Optimization of a Non-Ideal Staged Compression Facility," Proc. 1974 Purdue Compressor Technol. Conf., Purdue University, West Lafayette, IN, July 1974, pp. 415-422.
427. Biles, W. E., and J. J. Swain, Optimization and Industrial Experimentation, Wiley, New York, 1980, Chap. 7.
428. Knopf, F. C., G. V. Reklaitis, and M. R. Okos, "Combined Design and Scheduling of Regenerative Noncontinuous Processes," Symp. Prod. Planning Multi-Product Plants, AIChE Nat. Meet., Houston, TX, Apr. (1981).
429. Pritsker, A. A. B., and C. P. Pegden, Introduction to Simulation and SLAM, Systems Publ. Corp. and Halsted Press, New York, (1979).
430. Archetti, F., and G. P. Szego, "Global Optimization Algorithms," in Nonlinear Optimization: Theory and Algorithms (L. C. W. Dixon, E. Spedicato, and G. P. Szego, Eds.), Birkhauser, Boston, (1980).
431. Cabot, A. V., and R. L. Francis, "Solving Nonconvex Quadratic Minimization Problems by Ranking Extreme Points," Oper. Res., 18, 82-86 (1970).
432. McCormick, G. P., "Attempts to Calculate Global Solutions to Problems That May Have Local Minima," in Numerical Methods for Nonlinear Optimization (F. A. Lootsma, Ed.), Academic, New York, (1972).
433. Geoffrion, A. M., "The Purpose of Mathematical Programming in Insight, not Numbers," Interfaces, 7, 81-92 (1976).
434. Sherwood, T., A Course in Process Design, MIT Press, Cambridge, MA, (1963).
435. Ravindran, A., and D. L. Hanline, "Optimal Location of Coal Blending Plants by Mixed Integer Programming," Am. Inst. Eng. Trans., 12(2), 179-185 (1980). Key Stone Coal Industry Manual, McGraw-Hill, New York, 1975. Compilation of Air Pollutant Emission Factors, 2nd ed., U.S. Environmental Protection Agency, Apr. 1973. Rural Electrification, National Rural Electric Cooperative Association, Washington, DC, Mar. (1978).
436. Indiana Energy Office, State Department of Commerce, Indianapolis, IN, private communication. Rand McNally Railroad Atlas of the United States, Rand McNally & Co., Chicago, IL, (1971).
437. Wier, C. E., Coal Resources of Indiana, Indiana Geological Survey, Bloomington, IN, 1973. MIPZI-Documentation of a Zero-One Mixed Integer Programming Code, Department of Agricultural Economics, Purdue University, West Lafayette, IN, Sept. (1973).
438. Balas, E., "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Oper. Res., 13, 517-547 (1965).
439. Sarma, P. V. L. N., and G. V. Reklaitis, "Optimization of a Complex Chemical Process Using an Equation Oriented Model," Math. Prog. Study, 20, 113-160, (1982).
440. Sarma, P. V. L. N., "Strategy of Modeling and Optimization in Chemical Process Design," Ph.D. dissertation, Purdue University, West Lafayette, IN, (1978).
441. Stewart, P. B., and P. Mungal, "Correlation Equation for Solubility of Carbon Dioxide in Water, Seawater, and Seawater Concentrates, J. Chem. Eng. Data, 2, 170 (1971).
442. Smith, B. D., Design of Equilibrium Stage Processes, McGraw-Hill, New York, (1963).
443. Treybal, R. E., Mass Transfer Operations, McGraw-Hill, New York, (1968).
444. Eduljee, H. E., "Equations Replace Gilliland Plot," Hydrocarbon Proc., 54(9), 120 (1975).
445. Buntin, R. R., "A Kinetic Study of Oxidation of Ethylene on a Silver Catalyst," Ph.D. thesis, Purdue University, West Lafayette, IN, Aug. (1961).
446. Guthrie, K. M., "Data and Techniques for Preliminary Capital Cost Estimating," in Modern Cost Engineering Techniques (H. Popper, Ed.), McGraw-Hill, New York, (1970).
447. Lasdon, L. S., A. D. Warren, A. Jam, and M. W. Ratner, "Design and Testing of Generalized Reduced Gradient Code for Nonlinear Programming," ACM Trans. Math. Software, 4, 34-50 (Mar. 1978).
448. Sharma, A., H. H. Chiu, F. W. Abrens, R. K. Ahluwalia, and K. M. Ragsdell, "Design of Optimum Compressed Air Energy Storage Systems," Energy, 4, 201-216 (1979).
449. Ahrens, F. W., A. Sharma, and K. M. Ragsdell, "Computer Aided Optimal Design of Compressed Air Energy Storage Systems," ASME J. Mech. Des., 102, 437-445 (1980).
450. Ahrens, F. W., A. Sharma, and K. M. Ragsdell, "Optimal Design of Compressed Air Energy Storage Systems," Proceedings of the Sixth UMR-DNR Conference on Energy, 431-441 (Oct. 1979).
451. Vosburgh, K. G., "Compressed Air Energy Storage," AJAA J. Energy, 2(2), 106-112 (1978).
452. Kim, C. S., and G. T. Kartsounes, "A Parametric Study of Turbine Systems for Compressed Air Energy Storage Plants," Final Report FY1977, Report No. ANL/ES-64, Argonne National Laboratory, Chicago, IL, (1978).
453. Davison, W. R., and R. D. Lessard, "Study of Selected Turbomachinery Components for Compressed Air Storage Systems," Report No. ANL/EES-TM-14, United Technologies Research Center for Argonne National Laboratory, (1977).
454. Ahluwalia, R. K., A. Sharma, and F. W. Ahrens, Proc. Compressed Air Energy Storage Technology Symposium, Pacific Grove, CA, 1979, pp. 295-325.
455. Root, R. R., and K. M. Ragsdell, "Computational Enhancements to the Method of Multipliers," ASME J. Mech. Des., 102(3), 517-523 (1980).
456. Gabriele, G. A., and K. M. Ragsdell, "Large Scale Nonlinear Programming Using the Generalized Reduced Gradient Method," ASME J. Mech. Des., 102(3), 566-573 (1980).
457. Katz, D. L., and E. R. Lady, Compressed Air Storage for Electric Power Generation, Ulrich's Books, Ann Arbor, MI, (1976).
458. Ahrens, F. W., "The Design Optimization of Aquifer Reservoir-Based Compressed Air Energy Storage Systems," Proc. 1978 Mech. Magnetic Energy Storage Contractors' Rev. Meet., Luray, VA, CONF-781046, 1978, pp. 404-415.