Optimization For Engineering Systems Revised(1st Edition)

Book details

Book Price $76.44 : Optimization Has Many Facets Ranging From Pure Mathematics To Automated Manufacturing. Over Time, There Has Been A Flow Of Optimization Concepts And Algorithms From Mathematics To Applications In Engineering Design And Operation Of Manufacturing Plants. A Classic Example Is The Simplex Algorithm Of Linear Programming Which Is Used In A Wide Variety Of Industrial And Other Applications. The Mathematics Of Optimization Capitalizes On The Structure Of The Problems To Obtain Formal Proofs Of Global And Local Optimality And To Develop Efficient Algorithms For Locating Best Values Of The Economic Model While Satisfying Constraints. The Simplex Algorithm And Its Extensions Also Illustrate This Approach Of Using The Mathematical Form Of All Linear Equations To Find The Global Optimum. Other Examples Are Geometric Programming Where The Economic Model And Constraints Are Polynomials, Convex Programming With A Concave Economic Model And Convex Constraints And Dynamic Programming Where The Stage Structure Is Exploited By A Series Of Partial Optimizations. This Book Is At The Interface Of Mathematics And Industrial Applications Of Optimization. The Topics Were Selected For Their Breadth Of Application To The Optimization Of Engineering Systems, Especially Continuous Ones. Also, The Mathematics Of Optimization Is Presented To Provide The Foundation For These Methods That Have Proven Successful In Industrial Applications. The Material Is Structured To Build On Knowledge Of Calculus And Differential Equations By Beginning With The Classical Theory Of Maxima And Minima To Establish A Base For The Modern Methods That Follow. The Progression Of Topics Was Designed To Add Depth And Breadth In The Concepts And Applications As The Individual Moves Through The Material. Upon Completion, This Should Provide The Necessary Background For Further Reading Of Texts, Monographs And Current Research Literature On The Subject. The Introductory Chapter Gives A Brief Historical Prospective, The Relation To Other Subjects, And An Overview Of The Rational For The Order Of Presentation Of The Optimization Methods. The Second Chapter Covers Analytical Methods For Unconstrained And Constrained Problems And Serves As A Foundation For The Subjects That Follow. The Third Chapter Is On Geometric Programming, And It Is Presented As An Extension Of Analytical Methods Which Introduces The Concept Of A Dual Problem. The Fourth Chapter Is On The Most Widely Used Optimization Technique, Linear Programming; And It Includes An Illustration Of The Application Of A Commercial Code To An Industrial Plant. In The Fifth Chapter, Single Variable Search Methods Based On The Minimax Concept Are Given Along With A FORTRAN Program For Fibonacci Search. These Techniques Used With The Multivariable Search Methods Described In The Sixth Chapter, Where Constrained Direct Methods Are Emphasized. In The Seventh Chapter, The Sequential Partial Optimization Procedure Of Dynamic Programming Is Developed Where The Concepts Of Resource Allocation And Optimization Through Time Are Included. The Text Is Concluded With A Chapter On Variational Methods Giving The Important Results For Obtaining An Optimum Function Rather Than An Optimum Point. The Approach Was To Include Subjects That Have Proved To Be More Valuable For Industrial Applications Rather Than Having The Text Be A Handbook. In Addition, The Material Was Prepared With The Idea That Users Of Optimization Procedures Would Be Employing Packaged Computer Programs In Many Cases, Such As The Relatively Sophisticated Linear And Nonlinear Programming Codes That Are Available On Large Computers, E.g. MPSX And MINOS V. See more