Optimal Engineering Design: Principles and Applications |
Contents
Introduction | 1 |
Theory of Value | 9 |
The Design Option Problem | 40 |
The Concept of Optimization | 53 |
Interaction Curves and the Specifications Problem | 84 |
Techniques of Optimization | 98 |
The Practice of Optimization | 243 |
Optimization Examples | 298 |
FORTRAN Subroutine for Minimization | 408 |
FORTRAN Subroutine for Minimization | 414 |
FORTRAN Subroutine for Minimization | 420 |
FORTRAN Subroutine for Minimization | 426 |
FORTRAN Subroutine for Minimization Using | 433 |
FORTRAN Program for Random Number | 440 |
Householders Modification Method | 507 |
KuhnTucker Conditions for a Relative Minimum | 513 |
OPTIVAR Designers Optimization | 393 |
FORTRAN Subroutines for Penalty Functions | 402 |
Common terms and phrases
2SA 2SA 3SL 3SL 3SL 4SL 4SL 4SL 5SL 5SL 5SL 6SLH 6SLH 6SLH 8SL 8SL 8SL algorithm array basis calling program coefficient configuration CONST constraint functions convergence default values defined design characteristics design variables diameter DIMENSION X(1 disc brake engineering equality constraints equations expressions feasible solution FORMAT 1H0 FORMAT 61HONUMBER formulation FORTRAN gradient ICONV IDATA independent variables inequality constraints infeasible IPRINT iteration linear programming matrix maximum MAXM minimize minimum NCONS NEQUS Newton's method nonlinear programming NPENAL NRET NRUN NSMAX NVIOL objective function optimization function output penalty function PHIP pressure problem PSIP quadratic random number REDUCE RETURN END RMAX RMAX(I RMIN RMIN(I shown in Fig SIGK simplex method slack variables specifications step strategy SUBROUTINE TAUK temperature thickness trade-off curve tube UART UREAL value curves vector WRITE XSTRT XSTRT(I zero