Engineering Optimization: Theory and Practice / Edition 4

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $54.45
Usually ships in 1-2 business days
(Save 72%)
Other sellers (Hardcover)
  • All (11) from $54.45   
  • New (6) from $155.42   
  • Used (5) from $54.45   



Helps you move from theory to optimizing engineering systems in almost any industry

Now in its Fourth Edition, Professor Singiresu Rao's acclaimed text Engineering Optimization enables readers to quickly master and apply all the important optimization methods in use today across a broad range of industries. Covering both the latest and classical optimization methods, the text starts off with the basics and then progressively builds to advanced principles and applications.

This comprehensive text covers nonlinear, linear, geometric, dynamic, and stochastic programming techniques as well as more specialized methods such as multiobjective, genetic algorithms, simulated annealing, neural networks, particle swarm optimization, ant colony optimization, and fuzzy optimization. Each method is presented in clear, straightforward language, making even the more sophisticated techniques easy to grasp. Moreover, the author provides:

  • Case examples that show how each method is applied to solve real-world problems across a variety of industries
  • Review questions and problems at the end of each chapter to engage readers in applying their newfound skills and knowledge
  • Examples that demonstrate the use of MATLAB® for the solution of different types of practical optimization problems
  • References and bibliography at the end of each chapter for exploring topics in greater depth
  • Answers to Review Questions available on the author's Web site to help readers to test their understanding of the basic concepts

With its emphasis on problem-solving and applications, Engineering Optimization is ideal for upper-level undergraduates and graduate students in mechanical, civil, electrical, chemical, and aerospace engineering. In addition, the text helps practicing engineers in almost any industry design improved, more efficient systems at less cost.

Read More Show Less

Editorial Reviews

From the Publisher
"He presents an updated textbook addressing the techniques and applications of engineering optimization for the efficient and economical design and production of products and systems. The material has been used extensively by the author to teach optimum design and engineering optimization courses at the advanced-undergraduate and graduate levels at a number of universities." (Book News, August 2009)
A comprehensive professional reference or graduate-level textbook, presenting the theory, techniques, and applications of engineering optimization. Essential proofs and explanations of the various techniques are presented in a simple manner, and new concepts are illustrated with numerical examples. The coverage includes linear and nonlinear programming, integer programming, and stochastic programming techniques, as well as some recently developed methods such as genetic algorithms, simulated annealing, neural-network-based methods, and fuzzy optimization. Includes a large number of solved examples and review questions. Annotation c. Book News, Inc., Portland, OR (
Read More Show Less

Product Details

  • ISBN-13: 9780470183526
  • Publisher: Wiley
  • Publication date: 7/20/2009
  • Edition description: New Edition
  • Edition number: 4
  • Pages: 840
  • Product dimensions: 7.80 (w) x 9.40 (h) x 1.90 (d)

Meet the Author

Singiresu S. Rao, PhD, is a Professor and Chairman of the Department of Mechanical Engineering at the University of Miami. Dr. Rao has published more than 175 technical papers in internationally respected journals and more than 150 papers in conference proceedings in the areas of engineering optimization, reliability-based design, fuzzy systems, uncertainty models, structural and mechanical design, and vibration engineering. He has authored several books, including The Finite Element Method in Engineering, Mechanical Vibrations, Vibration of Continuous Systems, Reliability-Based Design, and Applied Numerical Methods for Engineers and Scientists.

Read More Show Less

Table of Contents


1 Introduction to Optimization.

1.1 Introduction.

1.2 Historical Development.

1.3 Engineering Applications of Optimization.

1.4 Statement of an Optimization Problem.

1.5 Classification of Optimization Problems.

1.6 Optimization Techniques.

1.7 Engineering Optimization Literature.

1.8 Solution of Optimization Problems Using MATLAB.

References and Bibliography.

Review Questions.


2 Classical Optimization Techniques.

2.1 Introduction.

2.2 Single-Variable Optimization.

2.3 Multivariable Optimization with No Constraints.

2.4 Multivariable Optimization with Equality Constraints.

2.5 Multivariable Optimization with Inequality Constraints.

2.6 Convex Programming Problem.

References and Bibliography.

Review Questions.


3 Linear Programming I: Simplex Method.

3.1 Introduction.

3.2 Applications of Linear Programming.

3.3 Standard Form of a Linear Programming Problem.

3.4 Geometry of Linear Programming Problems.

3.5 Definitions and Theorems.

3.6 Solution of a System of Linear Simultaneous Equations.

3.7 Pivotal Reduction of a General System of Equations.

3.8 Motivation of the Simplex Method.

3.9 Simplex Algorithm.

3.10 Two Phases of the Simplex Method.

3.11 MATLAB Solution of LP Problems.

References and Bibliography.

Review Questions.


4 Linear Programming II: Additional Topics andExtensions.

4.1 Introduction.

4.2 Revised Simplex Method.

4.3 Duality in Linear Programming.

4.4 Decomposition Principle.

4.5 Sensitivity or Postoptimality Analysis.

4.6 Transportation Problem.

4.7 Karmarkar’s Interior Method.

4.8 Quadratic Programming.

4.9 MATLAB Solutions.

References and Bibliography.

Review Questions.


5 Nonlinear Programming I: One-Dimensional MinimizationMethods.

5.1 Introduction.

5.2 Unimodal Function.


5.3 Unrestricted Search.

5.4 Exhaustive Search.

5.5 Dichotomous Search.

5.6 Interval Halving Method.

5.7 Fibonacci Method.

5.8 Golden Section Method.

5.9 Comparison of Elimination Methods.


5.10 Quadratic Interpolation Method.

5.11 Cubic Interpolation Method.

5.12 Direct Root Methods.

5.13 Practical Considerations.

5.14 MATLAB Solution of One-Dimensional MinimizationProblems.

References and Bibliography.

Review Questions.


6 Nonlinear Programming II: Unconstrained OptimizationTechniques.

6.1 Introduction.


6.2 Random Search Methods.

6.3 Grid Search Method.

6.4 Univariate Method.

6.5 Pattern Directions.

6.6 Powell’s Method.

6.7 Simplex Method.


6.8 Gradient of a Function.

6.9 Steepest Descent (Cauchy) Method.

6.10 Conjugate Gradient (Fletcher–Reeves) Method.

6.11 Newton’s Method.

6.12 Marquardt Method.

6.13 Quasi-Newton Methods.

6.14 Davidon–Fletcher–Powell Method.

6.15 Broyden–Fletcher–Goldfarb–ShannoMethod.

6.16 Test Functions.

6.17 MATLAB Solution of Unconstrained Optimization Problems.

References and Bibliography.

Review Questions.


7 Nonlinear Programming III: Constrained OptimizationTechniques.

7.1 Introduction.

7.2 Characteristics of a Constrained Problem.


7.3 Random Search Methods.

7.4 Complex Method.

7.5 Sequential Linear Programming.

7.6 Basic Approach in the Methods of Feasible Directions.

7.7 Zoutendijk’s Method of Feasible Directions.

7.8 Rosen’s Gradient Projection Method.

7.9 Generalized Reduced Gradient Method.

7.10 Sequential Quadratic Programming.


7.11 Transformation Techniques.

7.12 Basic Approach of the Penalty Function Method.

7.13 Interior Penalty Function Method.

7.14 Convex Programming Problem.

7.15 Exterior Penalty Function Method.

7.16 Extrapolation Techniques in the Interior Penalty FunctionMethod.

7.17 Extended Interior Penalty Function Methods.

7.18 Penalty Function Method for Problems with Mixed Equalityand Inequality Constraints.

7.19 Penalty Function Method for Parametric Constraints.

7.20 Augmented Lagrange Multiplier Method.

7.21 Checking the Convergence of Constrained OptimizationProblems.

7.22 Test Problems.

7.23 MATLAB Solution of Constrained Optimization Problems.

References and Bibliography.

Review Questions.


8 Geometric Programming.

8.1 Introduction.

8.2 Posynomial.

8.3 Unconstrained Minimization Problem.

8.4 Solution of an Unconstrained Geometric Programming ProgramUsing Differential Calculus.

8.5 Solution of an Unconstrained Geometric Programming ProblemUsing Arithmetic–Geometric Inequality.

8.6 Primal–Dual Relationship and Sufficiency Conditions inthe Unconstrained Case.

8.7 Constrained Minimization.

8.8 Solution of a Constrained Geometric Programming Problem.

8.9 Primal and Dual Programs in the Case of Less-ThanInequalities.

8.10 Geometric Programming with Mixed InequalityConstraints.

8.11 Complementary Geometric Programming.

8.12 Applications of Geometric Programming.

References and Bibliography.

Review Questions.


9 Dynamic Programming.

9.1 Introduction.

9.2 Multistage Decision Processes.

9.3 Concept of Suboptimization and Principle of Optimality.

9.4 Computational Procedure in Dynamic Programming.

9.5 Example Illustrating the Calculus Method of Solution.

9.6 Example Illustrating the Tabular Method of Solution.

9.7 Conversion of a Final Value Problem into an Initial ValueProblem.

9.8 Linear Programming as a Case of Dynamic Programming.

9.9 Continuous Dynamic Programming.

9.10 Additional Applications.

References and Bibliography.

Review Questions.


10 Integer Programming.

10.1 Introduction 588.


10.2 Graphical Representation.

10.3 Gomory’s Cutting Plane Method.

10.4 Balas’ Algorithm for Zero–One ProgrammingProblems.


10.5 Integer Polynomial Programming.

10.6 Branch-and-Bound Method.

10.7 Sequential Linear Discrete Programming.

10.8 Generalized Penalty Function Method.

10.9 Solution of Binary Programming Problems Using MATLAB.

References and Bibliography.

Review Questions.


11 Stochastic Programming.

11.1 Introduction.

11.2 Basic Concepts of Probability Theory.

11.3 Stochastic Linear Programming.

11.4 Stochastic Nonlinear Programming.

11.5 Stochastic Geometric Programming.

References and Bibliography.

Review Questions.


12 Optimal Control and Optimality Criteria Methods.

12.1 Introduction.

12.2 Calculus of Variations.

12.3 Optimal Control Theory.

12.4 Optimality Criteria Methods.

References and Bibliography.

Review Questions.


13 Modern Methods of Optimization.

13.1 Introduction.

13.2 Genetic Algorithms.

13.3 Simulated Annealing.

13.4 Particle Swarm Optimization.

13.5 Ant Colony Optimization.

13.6 Optimization of Fuzzy Systems.

13.7 Neural-Network-Based Optimization.

References and Bibliography.

Review Questions.


14 Practical Aspects of Optimization.

14.1 Introduction.

14.2 Reduction of Size of an Optimization Problem.

14.3 Fast Reanalysis Techniques.

14.4 Derivatives of Static Displacements and Stresses.

14.5 Derivatives of Eigenvalues and Eigenvectors.

14.6 Derivatives of Transient Response.

14.7 Sensitivity of Optimum Solution to Problem Parameters.

14.8 Multilevel Optimization.

14.9 Parallel Processing.

14.10 Multiobjective Optimization.

14.11 Solution of Multiobjective Problems Using MATLAB.

References and Bibliography.

Review Questions.


A Convex and Concave Functions.

B Some Computational Aspects of Optimization.

B.1 Choice of Method.

B.2 Comparison of Unconstrained Methods.

B.3 Comparison of Constrained Methods.

B.4 Availability of Computer Programs.

B.5 Scaling of Design Variables and Constraints.

B.6 Computer Programs for Modern Methods of Optimization.

References and Bibliography.

C Introduction to MATLAB®.

C.1 Features and Special Characters.

C.2 Defining Matrices in MATLAB.


C.4 Optimization Toolbox.

Answers to Selected Problems.


Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)