Higher Engineering Mathematics Series curriculum materials: optimization methods (2nd edition)(Chinese Edition)

Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Pub Date: 2012 Publisher: Machinery Industry Press. to adapt to the requirements of scientific and technological progress. and to improve the quality of the mathematics of modern engineering and technical personnel. Harbin Institute of Technology (Weihai) years of engineering mathematics teaching reform. engineering mathematics new curriculum system of higher engineering mathematics course overall optimization of design and the preparation of a series of curriculum materials. Higher Engineering Mathematics Series curriculum materials: optimization methods (2nd edition) The main contents include: the variational method. linear programming. nonlinear programming. dynamic programming. preliminary. Book a large number of examples and exercises. some exercises with reference to the answer. to facilitate self-learning. The book can be used as an engineering undergraduate mathematics curriculum materials are also available for engineering graduate. university teachers and engineering and technical personnel Reference. Contents: sequence 2 Preface 1 Preface Chapter 1 variational method extrema extremum necessary conditions for 1.1 Basic concepts and definitions Exercises 11.2 Functional Exercises 21.3 functional conditions of extreme value Exercises 31.4 movable boundary variational variational problem unilateral variational problems with sharp points exercises 4 * 1.5 concept exercises fully functional extreme conditions 61.7 51.6 variational method direct method exercises maximum principle with the concept of optimal control Problem 7 Chapter 2 Linear Programming 2.1 Linear Programming problems 2.2 linear programming problem and the solution of the geometrical representation of the general problem of Chapter 3 Nonlinear Programming and Dynamic Programming Exercises 12.3 simplex method exercises preliminary 3.1 Nonlinear Programming Problem 1 Problem 3.7 Dynamic Programming Solution Exercise 23.2 feasible direction method Exercise 3 Exercise 43.3 conditions of extreme value method exercises Exercise 63.5 penalty method exercises 53.4 gradient projection method 73.6 Introduction to Dynamic Programming Part 8 Exercises reference answer ReferencesFour Satisfaction guaranteed,or money back.…