References
- Barton. R.B. and Ivey, J.S., Jr., Nelder-Mead Simplex Modifications for Simulation Optimization, Management Science. 42 (1996). 954–972.
- Box. M.J., A New Method of Constrained Optimization and a Comparison with Other Methods, Computer J.,8(1965),42–52.
- Hooke, R. and Jeeves, T.A., Direct Search of Numerical and Statistical Problems, J. ACM. 8 (1966), 212–229.
- Ignizio. J., Goal Programming utid Extensions. Heath. 1976.
- Kuriger, G., Intelligent Search Methods for Nonlinear Goal Programming Problems, Unpublished Masters Thesis, University of Oklahoma, School of Industrial Engineering, 1998.
- Mangasarian. O.L., Nonlinear Programming, New York. NY: McGraw-Hill. Inc., 1969.
- Nelder. J.A. and Mead, R., A Simplex Method for Function Minimization, Computer J., 7(1965), 308–313
- Ravindran. A., Phillips. D.T., and Solberg. J.J., Operations Research Principles and Practice (Second ed.). New York, NY: John Wiley & Sons, Inc., 1987.
- Ravindran. A., Shin. W.S., Arthur, J.L., and Moskowitz, H., Nonlinear Integer Goal Programming Models for Acceptance Sampling. Comput. & Ops. Res., 13(1986), 611–622.
- Reklaitis. G.V., Ravindran. A., and Ragsdell. K.M., Engineering Optimization: Methods and Applications. New York, NY: John Wiley & Sons. Inc., 1983.
- Saber, H.J., A Partitioning Gradient Based Algorithm for Solving Nonlinear Goal Programming Problems, Unpublished Ph.D. Dissertation. University of Oklahoma, School of Industrial Engineering, 1991.
- Saber, H.J. and Ravindran. A., Nonlinear Goal Programming: Theory and Practice, Computers & Ops Res., 20(1993), 275–291.
- Saber, H.J. and Ravindran. A., A Partitioning Gradient Based (PGB) Algorithm for Solving Nonlinear Goal Programming Problems. Computers & Ops Res., 23 (1995). 141–152.
- Spendley, W., Hext, G.R., and Himsworth. F.R., Sequential Application of Simplex Designs in Optimization and Evolutionary Operation, Technometrics, 4(1962), 441–461.