A note on the optimization of constrained design problems

G. Stephanopoulos

doi:10.1007/BF00933883

A note on the optimization of constrained design problems

G. Stephanopoulos

Research output: Contribution to journal › Article › peer-review

2 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 language	English (US)
Pages (from-to)	337-342
Number of pages	6
Journal	Journal of Optimization Theory and Applications
Volume	17
Issue number	3-4
DOIs	https://doi.org/10.1007/BF00933883
State	Published - May 1975
Externally published	Yes

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

Access to Document

10.1007/BF00933883

Cite this

@article{07cf4f5fac8f4ae0966c9837ed1350d6,

title = "A note on the optimization of constrained design problems",

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.",

keywords = "Bounds on cost functionals, engineering design, inequality constraints, mathematical programming, penalty-function methods",

author = "G. Stephanopoulos",

year = "1975",

month = may,

doi = "10.1007/BF00933883",

language = "English (US)",

volume = "17",

pages = "337--342",

journal = "Journal of Optimization Theory and Applications",

issn = "0022-3239",

publisher = "Springer New York",

number = "3-4",

}

TY - JOUR

T1 - A note on the optimization of constrained design problems

AU - Stephanopoulos, G.

PY - 1975/5

Y1 - 1975/5

N2 - 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.

AB - 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.

KW - Bounds on cost functionals

KW - engineering design

KW - inequality constraints

KW - mathematical programming

KW - penalty-function methods

UR - http://www.scopus.com/inward/record.url?scp=34250398704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250398704&partnerID=8YFLogxK

U2 - 10.1007/BF00933883

DO - 10.1007/BF00933883

M3 - Article

SN - 0022-3239

VL - 17

SP - 337

EP - 342

JO - Journal of Optimization Theory and Applications

JF - Journal of Optimization Theory and Applications

IS - 3-4

ER -

A note on the optimization of constrained design problems

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this