Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimization by direct search and systematic reduction of the size of search region

Optimization by direct search and systematic reduction of the size of search region A direct search procedure utilizing pseudo random numbers over a region is presented to solve nonlinear programming problems. After each iteration the size of the region is reduced so that the optimum can be found as accurately as desired. The ease of programming, the speed of convergence, and the reliability of results make the procedure very attractive for solving nonlinear programming problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Aiche Journal Wiley

Optimization by direct search and systematic reduction of the size of search region

Aiche Journal , Volume 19 (4) – Jul 1, 1973

Loading next page...
 
/lp/wiley/optimization-by-direct-search-and-systematic-reduction-of-the-size-of-PhsQtaAKgM

References (2)

Publisher
Wiley
Copyright
Copyright © 1973 American Institute of Chemical Engineers
ISSN
0001-1541
eISSN
1547-5905
DOI
10.1002/aic.690190413
Publisher site
See Article on Publisher Site

Abstract

A direct search procedure utilizing pseudo random numbers over a region is presented to solve nonlinear programming problems. After each iteration the size of the region is reduced so that the optimum can be found as accurately as desired. The ease of programming, the speed of convergence, and the reliability of results make the procedure very attractive for solving nonlinear programming problems.

Journal

Aiche JournalWiley

Published: Jul 1, 1973

There are no references for this article.