05715nam 2200781 a 450 991014149360332120200520144314.01-118-57789-21-299-14153-61-118-57775-21-118-57784-1(CKB)2670000000327413(EBL)1117270(OCoLC)827208481(SSID)ssj0000884299(PQKBManifestationID)11499521(PQKBTitleCode)TC0000884299(PQKBWorkID)10940505(PQKB)10348247(OCoLC)828735208(MiAaPQ)EBC1117270(Au-PeEL)EBL1117270(CaPaEBR)ebr10653871(CaONFJC)MIL445403(PPN)185427782(EXLCZ)99267000000032741320120905d2013 uy 0engur|n|---|||||txtccrOptimization in engineering sciences[electronic resource] exact methods /Pierre Borne ... [et al.]Hoboken, N.J. ISTE Ltd/John Wiley and Sons Inc.20131 online resource (328 p.)ISTEDescription based upon print version of record.1-84821-432-4 Includes bibliographical references and index.Title Page; Contents; Foreword; Preface; List of Acronyms; Chapter 1. Linear Programming; 1.1. Objective of linear programming; 1.2. Stating the problem; 1.3. Lagrange method; 1.4. Simplex algorithm; 1.4.1. Principle; 1.4.2. Simplicial form formulation; 1.4.3. Transition from one simplicial form to another; 1.4.4. Summary of the simplex algorithm; 1.5. Implementation example; 1.6. Linear programming applied to the optimization of resource allocation; 1.6.1. Areas of application; 1.6.2. Resource allocation for advertising; 1.6.3. Optimization of a cut of paper rolls1.6.4. Structure of linear program of an optimal control problemChapter 2. Nonlinear Programming; 2.1. Problem formulation; 2.2. Karush-Kuhn-Tucker conditions; 2.3. General search algorithm; 2.3.1. Main steps; 2.3.2. Computing the search direction; 2.3.3. Computation of advancement step; 2.4. Monovariable methods; 2.4.1. Coggin's method (of polynomial interpolation); 2.4.2. Golden section method; 2.5. Multivariable methods; 2.5.1. Direct search methods; 2.5.2. Gradient methods; Chapter 3. Dynamic Programming; 3.1. Principle of dynamic programming; 3.1.1. Stating the problem3.1.2. Decision problem3.2. Recurrence equation of optimality; 3.3. Particular cases; 3.3.1. Infinite horizon stationary problems; 3.3.2. Variable horizon problem; 3.3.3. Random horizon problem; 3.3.4. Taking into account sum-like constraints; 3.3.5. Random evolution law; 3.3.6. Initialization when the final state is imposed; 3.3.7. The case when the necessary information is not always available; 3.4. Examples; 3.4.1. Route optimization; 3.4.2. The smuggler problem; Chapter 4. Hopfield Networks; 4.1. Structure; 4.2. Continuous dynamic Hopfield networks; 4.2.1. General problem4.2.2. Application to the traveling salesman problem4.3. Optimization by Hopfield networks, based on simulated annealing; 4.3.1. Deterministic method; 4.3.2. Stochastic method; Chapter 5. Optimization in System Identification; 5.1. The optimal identification principle; 5.2. Formulation of optimal identification problems; 5.2.1. General problem; 5.2.2. Formulation based on optimization theory; 5.2.3. Formulation based on estimation theory (statistics); 5.3. Usual identification models; 5.3.1. General model; 5.3.2. Rational input/output (RIO) models5.3.3. Class of autoregressive models (ARMAX)5.3.4. Class of state space representation models; 5.4. Basic least squares method; 5.4.1. LSM type solution; 5.4.2. Geometric interpretation of the LSM solution; 5.4.3. Consistency of the LSM type solution; 5.4.4. Example of application of the LSM for an ARX model; 5.5. Modified least squares methods; 5.5.1. Recovering lost consistency; 5.5.2. Extended LSM; 5.5.3. Instrumental variables method; 5.6. Minimum prediction error method; 5.6.1. Basic principle and algorithm; 5.6.2. Implementation of the MPEM for ARMAX models5.6.3. Convergence and consistency of MPEM type estimations The purpose of this book is to present the main methods of static and dynamic optimization. It has been written within the framework of the European Union project - ERRIC (Empowering Romanian Research on Intelligent Information Technologies), funded by the EU's FP7 Research Potential program and developed in cooperation between French and Romanian teaching researchers.Through the principles of various proposed algorithms (with additional references) this book allows the interested reader to explore various methods of implementation such as linear programming, nonlinear programming - pISTEEngineering mathematicsMathematical optimizationProgram transformation (Computer programming)AlgorithmsSystems engineeringEngineering mathematics.Mathematical optimization.Program transformation (Computer programming)Algorithms.Systems engineering.519.92629.89Borne Pierre60243Borne Pierre60243MiAaPQMiAaPQMiAaPQBOOK9910141493603321Optimization in engineering sciences2096768UNINA01748nas 2200421 n 450 99000905758040332120240229084619.00953-0282000905758FED01000905758(Aleph)000905758FED01000905758CNRP 0022038520161109a19879999km-y0itaa50------baengGBauu--------SIPRI yearbook(1987)1987-OxfordOxford University PressAnnuale0010009075032001World armaments and disarmamentStockholm International Peace Research Institute yearbookSIPRI yearbook327.17405355.0330047623.405Stockholm International Peace Research InstituteITACNP20090723http://acnp.cib.unibo.it/cgi-ser/start/it/cnr/dc-p1.tcl?catno=2164519&person=false&language=ITALIANO&libr=&libr_th=unina1Biblioteche che possiedono il periodicoSE990009057580403321Biblioteca Centrale della Facoltà di Giurisprudenza dell'Università di Napoli Federico II1987-2003;Per. Est. 875 (INT)FGBCFGBCSIPRI yearbook786465UNINA866-01NA073 Biblioteca Centrale della Facoltà di Giurisprudenza dell'Università di Napoli Federico IIPer. Est. 875 (INT)Corso Umberto I, 80138 Napoli (NA)0812537531/330812537532itacnp.cib.unibo.itACNP Italian Union Catalogue of Serialshttp://acnp.cib.unibo.it/cgi-ser/start/it/cnr/df-p.tcl?catno=2164519&language=ITALIANO&libr=&person=&B=1&libr_th=unina&proposto=NO