A note on the optimization of constrained design problems

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 with m 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.

Original languageEnglish (US)
Pages (from-to)337-342
Number of pages6
JournalJournal of Optimization Theory and Applications
Volume17
Issue number3-4
DOIs
StatePublished - May 1 1975
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A note on the optimization of constrained design problems'. Together they form a unique fingerprint.

Cite this