Skip to main content

A note on the optimization of constrained design problems

Journal of Optimization Theory and Applications volume 17, pages 337–342 (1975)Cite this article

Abstract

This paper describes a new algorithm for solving constrained optimization problems, based on a method proposed by Chattopadhyay. The proposed algorithm replaces the original problem withm constraints,m>1, by a sequence of optimization problems, with one constraint. Here, we modify the algorithm given by Chattopadhyay in order to make it applicable for a larger class of optimization problems and to improve its convergence characteristics.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

£ 29.95

Price includes VAT (United Kingdom)

References

  1. Chattopadhyay, R.,Optimization in Engineering Design, Journal of Optimization Theory and Applications, Vol. 9, No. 3, 1972.

  2. Fiacco, A. V., andMcCormick, G. P.,The Sequential Unconstrained Minimization Technique for Non-linear Programming, a Primal-Dual Method, Management Sciences, Vol. 10, pp. 360–364, 1964.

    Article  Google Scholar 

  3. Zangwill, W. I.,Non-linear Programming Via Penalty Functions, Management Sciences, Vol. 13, pp. 344–358, 1967.

    Article  MathSciNet  MATH  Google Scholar 

  4. Hestenes, M. R.,Multiplier and Gradient Methods, Journal of Optimization Theory and Applications, Vol. 4, No. 5, 1969.

  5. Chattopadhyay, R.,A Study of Test Functions for Optimization Algorithms, Journal of Optimization Theory and Applications, Vol. 8, No. 3, 1971.

Download references

Author information

Authors and Affiliations

  1. Department of Chemical Engineering and Materials Science, University of Minnesota, Minneapolis, Minnesota

    G. Stephanopoulos (Assistant Professor)

Authors
  1. G. Stephanopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by D. G. Luenberger

Partial support from the Graduate School of the University of Minnesota is gratefully acknowledged.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Stephanopoulos, G. A note on the optimization of constrained design problems. J Optim Theory Appl 17, 337–342 (1975). https://doi.org/10.1007/BF00933883

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00933883

Key Words

  • Bounds on cost functionals
  • engineering design
  • inequality constraints
  • mathematical programming
  • penalty-function methods