GENERALIZED POLYNOMIAL PROGRAMMING

被引：25

作者：

BLAU, GE

WILDE, DJ

机构：

[1] Department of Chemical Engineering, Stanford University, Stanford, California

[2] Computation Research Laboratory, Operations Research Section, Dow Chemical Company, Midland, Michigan

来源：

CANADIAN JOURNAL OF CHEMICAL ENGINEERING | 1969年 / 47卷 / 03期

关键词：

D O I：

10.1002/cjce.5450470401

中图分类号：

TQ [化学工业];

学科分类号：

0817 ;

摘要：

Conventional design procedures use physical reasoning to construct equations describing the system. To find the optimal design for some specified performance criterion, it is desirable to change these equations into inequalities so that generalized polynominal programming, a highly nonlinear optimization technique, can be used. For illustration, a chemical reactor system optimal design problem with 11 variables and 8 constraints is formulated as an equality constrained optimization problem, then transformed into an inequality constrained generalized polynominal program and finally solved on the computer. Copyright © 1969 Canadian Society for Chemical Engineering

引用

页码：317 / &

共 22 条

[1]

ARIES RE, 1955, CHEMICAL ENGINEERING

[2]

ARIS R, 1965, INTRODUCTION ANALYSI

[3] OPTIMAL CONDENSER DESIGN BY GEOMETRIC PROGRAMMING [J].

AVRIEL, M ;

WILDE, DJ .

INDUSTRIAL & ENGINEERING CHEMISTRY PROCESS DESIGN AND DEVELOPMENT, 1967, 6 (02) :256-&

[4]

AVRIEL M, 1966, THESIS STANFORD U

[5]

BLAU GE, 1967, 6 INT S MATH PROGRAM

[6]

BLAU GE, 1968, THESIS STANFORD U

[7]

CLASEN RJ, 1965, RM4345PR RAND CORP R

[8]

Colburn AP, 1933, T AM INST CHEM ENG, V29, P174

[9]

DUFFIN RJ, 1966, GEOMETRIC PROGRAMMIN

[10]

GRIMSON ED, 1936, T ASME, V59, P583

← 1 2 3 →