關(guān)于我們
書單推薦
新書推薦
|
最優(yōu)化理論與方法
本書系統(tǒng)地介紹了在機(jī)械工程學(xué)科中常用的最優(yōu)化理論與方法,分為線性規(guī)劃與整數(shù)規(guī)劃、非線性規(guī)劃、智能優(yōu)化方法、變分法與動(dòng)態(tài)規(guī)劃4個(gè)篇次,共15章。第1篇包含最優(yōu)化基本要素、線性規(guī)劃和整數(shù)規(guī)劃。在介紹優(yōu)化變量、目標(biāo)函數(shù)、約束條件和數(shù)學(xué)建模等最優(yōu)化的基本內(nèi)容后,討論了線性規(guī)劃求解基本原理和最常用的單純形方法,然后給出了兩種用于整數(shù)線性規(guī)劃的求解方法。在第2篇的非線性規(guī)劃中,包含了非線性規(guī)劃數(shù)學(xué)分析基礎(chǔ)、一維最優(yōu)化方法、無(wú)約束多維最優(yōu)化方法、約束非線性規(guī)劃方法等。第3篇的智能優(yōu)化方法包括啟發(fā)式搜索方法Hopfield神經(jīng)網(wǎng)絡(luò)優(yōu)化方法、模擬退火法與均場(chǎng)退火法、遺傳算法等內(nèi)容。在第4篇中,介紹了變分法、最大(。┲翟砗蛣(dòng)態(tài)規(guī)劃等內(nèi)容。各章都配備了習(xí)題。
本書可作為高等院校機(jī)械工程一級(jí)學(xué)科各專業(yè)的最優(yōu)化理論與方法課程的研究生教材和教師的教學(xué)和科研參考書,也可作為其他相關(guān)專業(yè)的教學(xué)用書,以及從事生產(chǎn)規(guī)劃、優(yōu)化設(shè)計(jì)和最優(yōu)控制方面工作的工程技術(shù)與科研人員的參考用書。 最優(yōu)化理論與方法是工科研究生學(xué)習(xí)的一門主干課。該課程主要教授研究生一些實(shí)用的最優(yōu)化理論和方法,使其在今后的研究中能夠運(yùn)用這些理論和方法,在設(shè)計(jì)、制造和選材等方面獲得結(jié)構(gòu)、電路和過(guò)程的最優(yōu)解。 以往大多數(shù)的最優(yōu)化方法課程和書籍專業(yè)性較強(qiáng),常被分為生產(chǎn)規(guī)劃類的線性規(guī)劃、機(jī)械類的優(yōu)化設(shè)計(jì)、計(jì)算機(jī)類的智能優(yōu)化和電子類的最優(yōu)控制等不同課程。隨著科學(xué)技術(shù)的發(fā)展,各學(xué)科間的交叉與融合越來(lái)越緊密,一項(xiàng)科學(xué)研究需要應(yīng)用不同學(xué)科的理論與方法已經(jīng)是極為普遍的,因此這也對(duì)最優(yōu)化理論與方法的研究生教學(xué)提出了新的要求。為了適應(yīng)學(xué)科發(fā)展現(xiàn)狀,我們?cè)诙嗄陮?shí)踐的基礎(chǔ)上,編寫了本書,以介紹成熟的最優(yōu)化理論與方法為主,適當(dāng)介紹最優(yōu)化理論的新的研究成果和發(fā)展趨勢(shì),為研究生將來(lái)開展的論文研究提供最優(yōu)化方面的理論基礎(chǔ)與實(shí)用方法。 本書較系統(tǒng)地介紹了在工科中常用的最優(yōu)化理論與方法,分為線性規(guī)劃與整數(shù)規(guī)劃、非線性規(guī)劃、智能優(yōu)化方法、變分法和動(dòng)態(tài)規(guī)劃4個(gè)篇次,共15章。第1篇包含最優(yōu)化基本要素、線性規(guī)劃和整數(shù)規(guī)劃3章。線性規(guī)劃在工業(yè)、農(nóng)業(yè)、商業(yè)、交通運(yùn)輸、軍事和科學(xué)研究的各個(gè)領(lǐng)域有廣泛應(yīng)用。例如,在資源有限的情況下,如何合理使用人力、物力和資金等資源,以獲取最大效益; 如何組織生產(chǎn)、合理安排工藝流程或調(diào)整產(chǎn)品成分等,使所消耗的資源(人力、設(shè)備臺(tái)時(shí)、資金、原材料等)為最少等。在介紹了最優(yōu)化的基本內(nèi)容后,討論了線性規(guī)劃求解的基本原理和最常用的單純形方法,并給出了用于整數(shù)線性規(guī)劃的求解方法。第2篇所述內(nèi)容是20世紀(jì)中期形成的一個(gè)方向,隨著計(jì)算機(jī)技術(shù)的發(fā)展,出現(xiàn)了許多有效的算法,并得到了快速發(fā)展。非線性規(guī)劃廣泛應(yīng)用于機(jī)械設(shè)計(jì)、工程管理、經(jīng)濟(jì)生產(chǎn)、科學(xué)研究和軍事等方面。這一篇的主要內(nèi)容包含非線性規(guī)劃數(shù)學(xué)基礎(chǔ)、一維最優(yōu)化方法、無(wú)約束多維非線性規(guī)劃方法、約束問題的非線性規(guī)劃方法和多目標(biāo)最優(yōu)化5章,這些內(nèi)容是非線性規(guī)劃中最基本也是最重要的,可以為優(yōu)化設(shè)計(jì)等提供有力的工具。第3篇是智能優(yōu)化方法。智能優(yōu)化算法有別于一般的按照?qǐng)D靈機(jī)進(jìn)行精確計(jì)算的程序,是對(duì)計(jì)算機(jī)模型的一種新的詮釋,它模擬自然過(guò)程、生物或人類思維等方式來(lái)求解最優(yōu)化問題。例如,模擬退火法源于物質(zhì)的退火過(guò)程,遺傳算法借鑒了生物進(jìn)化思想,神經(jīng)網(wǎng)絡(luò)模擬了人腦的思維等。其中一些方法可以解決組合優(yōu)化或較有效處理“局部極值”和“全局極值”等問題。智能優(yōu)化方法很多,本書選取了啟發(fā)式搜索方法、Hopfield神經(jīng)網(wǎng)絡(luò)優(yōu)化方法、模擬退火法與均場(chǎng)退火法、遺傳算法4章內(nèi)容。第4篇包括變分法及其在最優(yōu)控制中的應(yīng)用、最大(小)值原理和動(dòng)態(tài)規(guī)劃共3章,這些內(nèi)容是解決最優(yōu)控制問題的主要方法。最優(yōu)控制廣泛應(yīng)用于控制系統(tǒng)、燃料控制系統(tǒng)、能耗控制系統(tǒng)、線性調(diào)節(jié)器等最優(yōu)綜合和設(shè)計(jì)場(chǎng)合。 本書介紹的最優(yōu)化理論與方法范圍較寬,包括了目前各工程類專業(yè)在科學(xué)研究與應(yīng)用時(shí)常用的和主要的方法與手段,這些是作為一名工科研究生需要學(xué)習(xí)和掌握的。另外,為了兼顧不同學(xué)科的特點(diǎn),在某些內(nèi)容上具有一定的理論深度。但是本書的重點(diǎn)是讓學(xué)生掌握這些內(nèi)容的基本理論和基本方法。考慮到教學(xué)時(shí)數(shù)的限制,書中給出了適當(dāng)?shù)乃憷,而具體的工程應(yīng)用實(shí)例有待于學(xué)生在今后的研究中進(jìn)一步學(xué)習(xí)和領(lǐng)會(huì)。本書各章均配備了習(xí)題,可作為高等院校機(jī)械工程一級(jí)學(xué)科各專業(yè)的最優(yōu)化理論與方法課程的研究生教材和教師的教學(xué)和科研參考書,也可作為其他相關(guān)專業(yè)的教學(xué)用書,以及作為從事生產(chǎn)規(guī)劃、優(yōu)化設(shè)計(jì)和最優(yōu)控制方面工作的工程技術(shù)與科研人員的參考用書。 本書主編為黃平,副主編為孟永鋼。具體參加本書各章內(nèi)容編寫工作的是: 李旻(第1~5章)、孟永鋼(第6,7章),黃平(第8,9,13章)、胡廣華(第10,11章)、邱志成(第12章)、劉旺玉(第14章)、孫建芳(第15章)。在本書編寫工作中,我們參考和引用了許多國(guó)內(nèi)外的書籍和文獻(xiàn)等材料,為此我們向這些作者表示衷心的感謝,這些參考文獻(xiàn)都列在本書各章的后面。另外,由于作者的水平所限,難免存在不足和錯(cuò)誤,希望讀者給予批評(píng)指正。 編者2008年10月30日 Preface Theories and methods of optimization is one of the main subjects for engineering graduate students. The purpose of this subject is to teach graduate students some common and useful theories and methods of optimization so that they can use the knowledge in design, manufacturing and material selection to obtain the optimal solution of a structure, a circuit or a process. Most of the traditional text books on optimization are discipline oriented, usually dividing into different courses of operation research, optimal machine design, intelligent optimization and optimal control. Along with the development of science and technology, interdisciplinary merging and fusion become closer and tighter. Nowadays it is quite often to apply theories and methods in different fields to solve problems in scientific researches. To meet the demands of scientific development, the education of theories and methods of optimization for graduate students should be improved. Based on the teaching practice in the past several years, the authors have compiled this new text book, which mainly covers the welldeveloped theories and methods of optimization, adding a few topics of advances in optimization theory. The book provides the knowledge of basic theories and practical methods of optimization for graduate students to carry out their research work. The subject matters of this book are grouped into 4 parts in total 15 chapters, linear programming and integer linear programming,nonlinear programming, intelligent optimization methods, calculus of variations and dynamic programming, collecting most of the theories and methods of optimization commonly used in engineering. In the first part of linear programming, 3 chapters of basic elements of optimization, linear programming and integer linear programming are included. Linear programming is of wide applications in industry, agriculture, business, transportation, military operations and scientific researches. For an example, under the condition of finite resources, linear programming can be used to make a plan of the distribution of human, material and financial resources for getting the maximum gain. Meanwhile, consumption of resources can be reduced to minimum by production planning, process rationalization and/or ingredient modification with the optimization method. At first fundamentals of optimization theories are introduced. Then the principles of linear programming and the simplex method are discussed. In addition, the scheme of integer linear programming is described in this part. The second part is on the nonlinear programming which is a branch formed in the middle of the 20th century. Accompanying with the development of digital computers, nonlinear programming has been growing rapidly, and many effective algorithms has appeared. Nowadays, nonlinear programming has been widely used in machine design, project management, production, scientific research activities and military affairs. In this part there are 5 chapters, including basic mathematics of nonlinear optimization, optimization methods for single argument problems, unconstrained multivariate problems and constrained nonlinear programming, which are the most fundamental and important contents of nonlinear programming, and powerful tools for optimal design. The third part is on intelligent optimization methods, which provide new interpretation of computing, differing from the precise calculation programs of Turing machines. Intelligent optimization methods are inspired from nature, and mimic of natural evolution and biological thinking processes to find optimal solutions. Simulated annealing method, for instance, mimics the annealing process of substances, while genetic algorithm refers to the evolution of organisms, and neural network is a model of human brain. Some of the intelligent optimization methods can effectively solve the problem of “l(fā)ocal maxima” or “whole maxima”. Among many intelligent optimization methods, the heuristic search method, Hopfield neural network optimization method, the simulated annealing method and mean field annealing method, and the genetic algorithm are selected and included in the book. The last part of the book consists of 3 chapters of calculus of variations and its applications in optimal control, maximum principle and dynamic programming, which are the major methods for solving optimal control problems. Optimal control is widely applied in the fields of system control, fuel consumption control, energy consumption control and linear adjustors. The major feature of this book is the broadness of its contents, covering most of the common optimization methods used in different engineering disciplines, which are necessary knowledge for engineering graduate students to be mastered. Considering the different requirements for the students in different fields, the book puts emphasis on the fundamentals of theories and methods of optimization although a part of them more theoretical are also included. Because of the limited course time in one semester, practical engineering problems are not discussed much in the book, leaving them for students to study in the future, while giving some relative simple examples. In the end of each chapter, exercises are prepared for students to do. This book can be used as a textbook for postgraduates majoring in mechanical engineering. It can also serve as a reference book for university teachers and students in their teaching and research work as well as for the researchers and engineers who work on operation research, optimal design or optimal control. The author in chief of this book is Huang Ping, and the associate author is Meng Yonggang. The following authors took part in the following compilations of the book, Li Min (Chapter 15), Meng Yonggang (Chapter 6 and 7), Huang Ping (Chapter 8, 9 and 13), Hu Guanghua (Chapter 10 and 11), Qiu Zhicheng (Chapter 12), Liu Wangyu (Chapter 14), and Sun Jianfang (Chapter 15). During the compilation of the book, we have referred and cited many publications which are listed in the references. To all of the authors of the references, we extend our most sincere thanks. The authors welcome hearing from readers about any errors of fact or omission that may undoubtedly existed in the book. AuthorsOctober 30, 2008
第1篇線性規(guī)劃與整數(shù)規(guī)劃
1最優(yōu)化基本要素 1.1優(yōu)化變量 1.2目標(biāo)函數(shù) 1.3約束條件 1.4最優(yōu)化問題的數(shù)學(xué)模型及分類 1.5最優(yōu)化方法概述 習(xí)題 參考文獻(xiàn) 2線性規(guī)劃 2.1線性規(guī)劃數(shù)學(xué)模型 2.2線性規(guī)劃求解基本原理 2.3單純形方法 2.4初始基本可行解的獲取 習(xí)題 參考文獻(xiàn) 3整數(shù)規(guī)劃 3.1整數(shù)規(guī)劃數(shù)學(xué)模型及窮舉法 3.2割平面法 3.3分枝定界法 習(xí)題 參考文獻(xiàn) 第2篇非線性規(guī)劃 4非線性規(guī)劃數(shù)學(xué)基礎(chǔ) 4.1多元函數(shù)的泰勒展開式 4.2函數(shù)的方向?qū)?shù)與最速下降方向 4.3函數(shù)的二次型與正定矩陣 4.4無(wú)約束優(yōu)化的極值條件 4.5凸函數(shù)與凸規(guī)劃 4.6約束優(yōu)化的極值條件 習(xí)題 參考文獻(xiàn) 5一維最優(yōu)化方法 5.1搜索區(qū)間的確定 5.2黃金分割法 5.3二次插值法 5.4切線法 5.5格點(diǎn)法 習(xí)題 參考文獻(xiàn) 6無(wú)約束多維非線性規(guī)劃方法 6.1坐標(biāo)輪換法 6.2最速下降法 6.3牛頓法 6.4變尺度法 6.5共軛方向法 6.6單純形法 6.7最小二乘法 習(xí)題 參考文獻(xiàn) 7約束問題的非線性規(guī)劃方法 7.1約束最優(yōu)化問題的間接解法 7.2約束最優(yōu)化問題的直接解法 習(xí)題 參考文獻(xiàn) 8非線性規(guī)劃中的一些其他方法 8.1多目標(biāo)優(yōu)化 8.2數(shù)學(xué)模型的尺度變換 8.3靈敏度分析及可變?nèi)莶罘?br /> 習(xí)題 參考文獻(xiàn) 第3篇智能優(yōu)化方法 9啟發(fā)式搜索方法 9.1圖搜索算法 9.2啟發(fā)式評(píng)價(jià)函數(shù) 9.3A*搜索算法 習(xí)題 參考文獻(xiàn) 10Hopfield神經(jīng)網(wǎng)絡(luò)優(yōu)化方法 10.1人工神經(jīng)網(wǎng)絡(luò)模型 10.2Hopfield神經(jīng)網(wǎng)絡(luò) 10.3Hopfield網(wǎng)絡(luò)與最優(yōu)化問題 習(xí)題 參考文獻(xiàn) 11模擬退火法與均場(chǎng)退火法 11.1模擬退火法基礎(chǔ) 11.2模擬退火算法 11.3隨機(jī)型神經(jīng)網(wǎng)絡(luò) 11.4均場(chǎng)退火 習(xí)題 參考文獻(xiàn) 12遺傳算法 12.1遺傳算法實(shí)現(xiàn) 12.2遺傳算法示例 12.3實(shí)數(shù)編碼的遺傳算法 習(xí)題 參考文獻(xiàn) 第4篇變分法與動(dòng)態(tài)規(guī)劃 13變分法 13.1泛函 13.2泛函極值條件——?dú)W拉方程 13.3可動(dòng)邊界泛函的極值 13.4條件極值問題 13.5利用變分法求解最優(yōu)控制問題 習(xí)題 參考文獻(xiàn) 14最大(。┲翟 14.1連續(xù)系統(tǒng)的最大(。┲翟 14.2應(yīng)用最大(。┲翟砬蠼庾顑(yōu)控制問題 14.3離散系統(tǒng)的最大(小)值原理 習(xí)題 參考文獻(xiàn) 15動(dòng)態(tài)規(guī)劃 15.1動(dòng)態(tài)規(guī)劃數(shù)學(xué)模型與算法 15.2確定性多階段決策 15.3動(dòng)態(tài)系統(tǒng)最優(yōu)控制問題 習(xí)題 參考文獻(xiàn) 附錄A中英文索引 Part 1Linear Programming and Integer Programming 1Fundamentals of Optimization 1.1Optimal Variables 1.2Objective Function 1.3Constraints 1.4Mathematical Model and Classification of Optimization 1.5Introduction of Optimal Methods Problems References 2Linear Programming 2.1Mathematical Models of Linear Programming 2.2Basic Principles of Linear Programming 2.3Simplex Method 2.4Acquirement of Initial Basic Feasible Solution Problems References 3Integer Programming 3.1Mathematical Models of Integer Programming and Enumeration Method 3.2Cutting Plane Method 3.3Branch and Bound Method Problems References Part 2NonLinear Programming 4Mathematical Basis of NonLinear Programming 4.1Taylor Expansion of MultiVariable Function 4.2Directional Derivative of Function and Steepest Descent Direction 4.3Quadratic Form and Positive Matrix 4.4Extreme Conditions of Unconstrained Optimum 4.5Convex Function and Convex Programming 4.6Extreme Conditions of Constrained Optimum Problems References 5OneDimensional Optimal Methods 5.1Determination of Search Interval 5.2Golden Section Method 5.3Quadratic Interpolation Method 5.4Tangent Method 5.5Grid Method Problems References 6NonConstraint NonLinear Programming 6.1Coordinate Alternation Method 6.2Steepest Descent Method 6.3Newtons Method 6.4Variable Metric Method 6.5Conjugate Gradient Algorithm 6.6Simplex Method 6.7Least Squares Method Problems References 7Constraint Optimal Methods 7.1Constraint Optimal Indirect Methods 7.2Constraint Optimal Direct Methods Problems References 8Other Methods in Non Linear Programming 8.1Multi Objectives Optimazation 8.2Metric Variation of a Mathematic Model 8.3Sensitivity Analysis and Flexible Tolerance Method Problems References Part 3Intelligent Optimization Method 9Heuristic Search Method 9.1Graph Search Method 9.2Heuristic Evaluation Function 9.3A*Search Method Problems References 10Optimization Method Based on Hopfield Neural Networks 10.1Artificial Neural Networks Model 10.2Hopfield Neural Networks 10.3Hopfield Neural Networks and Optimization Problems Problems References 11Simulated Annealing Algorithm and Mean Field Annealing Algorithm 11.1Basis of Simulated Annealing Algorithm 11.2Simulated Annealing Algorithm 11.3Stochastic Neural Networks 11.4Mean Field Annealing Algorithm Problems References 12Genetic Algorithm 12.1Implementation Procedure of Genetic Algorithm 12.2Genetic Algorithm Examples 12.3RealNumber Encoding Genetic Algorithm Problems References Part 4Variation Method and Dynamic Programming 13Variation Method 13.1Functional 13.2Functional Extreme Value Condition—Eulers Equation 13.3Functional Extreme Value for Moving Boundary 13.4Conditonal Extreme Value 13.5Solving Optimal Control with Variation Method Problems References 14Maximum (Minimum) Principle 14.1Maximum (Minimum) Principle for Continuum System 14.2Applications of Maximum (Minimum) Principle 14.3Maximum (Minimum) Principle for Discrete System Problems References 15Dynamic Programming 15.1Mathematic Model and Algorithm of Dynamic Programming 15.2Deterministic MultiStage Process Decision 15.3Optimal Control of Dynamic System Problems References Appendix AChinese and English Index
你還可能感興趣
我要評(píng)論
|