This book is addressed to students in the fields of engineering and technology as well as practicing engineers. It covers the fundamentals of commonly used optimization methods in engineering design. These include graphical optimization, linear and nonlinear programming, numerical optimization, and discrete optimization.

The methods covered in this book include
• analytical methods that are based on calculus of variations;
• graphical methods that are useful when minimizing functions involving a small number of variables; and
• iterative methods that are computer friendly, yet require a good understanding of the problem.
Both linear and nonlinear methods are covered.

Engineering examples have been used to build an understanding of how these methods can be applied. The material is presented roughly at senior undergraduate level.
Readers are expected to have familiarity with linear algebra and multivariable calculus.

Contents
Preface
1. Engineering Design Optimization
1.1. Introduction
1.2. Optimization Examples in Science and Engineering
1.3. Notation
2. Mathematical Preliminaries
2.1. Set Definitions
2.2. Function Definitions
2.3. Taylor Series Approximation
2.4. Gradient Vector and Hessian Matrix
2.5. Convex Optimization Problems
2.6. Vector and Matrix Norms
2.7. Matrix Eigenvalues and Singular Values
2.8. Quadratic Function Forms
2.9. Linear Systems of Equations
2.10. Linear Diophantine System of Equations
2.11. Condition Number and Convergence Rates
2.12. Conjugate-Gradient Method for Linear Equations
2.13. Newton’s Method for Nonlinear Equations
3. Graphical Optimization
3.1. Functional Minimization in One-Dimension
3.2. Graphical Optimization in Two-Dimensions
4. Mathematical Optimization
4.1. The Optimization Problem
4.2. Optimality criteria for the Unconstrained Problems
4.3. Optimality Criteria for the Constrained Problems
4.4. Optimality Criteria for General Optimization Problems
4.5. Postoptimality Analysis
4.6. Lagrangian Duality
5. Linear Programming Methods
5.1. The Standard LP Problem
5.2. The Basic Solution to the LP Problem
5.3. The Simplex Method
5.4. Postoptimality Analysis
5.5. Duality Theory for the LP Problems
5.6. Non-Simplex Methods for Solving LP Problems
5.7. Optimality Conditions for LP Problems
5.8. The Quadratic Programming Problem
5.9. The Linear Complementary Problem
6. Discrete Optimization
6.1. Discrete Optimization Problems
6.2. Solution Approaches to Discrete Problems
6.3. Linear Programming Problems with Integral Coefficients
6.4. Integer Programming Problems
7. Numerical Optimization Methods
7.1. The Iterative Method
7.2. Computer Methods for Solving the Line Search Problem
7.3. Computer Methods for Finding the Search Direction
7.4. Computer Methods for Solving the Constrained Problems
7.5. Sequential Linear Programming
7.6. Sequential Quadratic Programming
References

Download File Size:5.29 MB

---