An introduction to continuous ptimization : foundations and Fundamental Algorithms; Niclas Andréasson, Anton Evgrafov, Michael Patriksson, Emil Gustavsson, Magnus Önnheim, Kin Cheong Sou, Magnus Önneheim; 2016
spara 12%
1 säljare

An introduction to continuous ptimization : foundations and Fundamental Algorithms Upplaga 3

av Niclas Andréasson, Anton Evgrafov, Michael Patriksson, Emil Gustavsson, Magnus Önnheim
m.fl.
Revised with second printing, 2018.
Optimization, or mathematical programming, is a fundamental subject within decision science and operations research in which mathematical decision models are constructed, analyzed, and solved.
Andreasson provides a basis for the analysis of optimization models and candidate optimal solutions for continuous optimization models. Elementary but rigorous mathematics and linear algebra underlie the workings of convexity and duality, and necessary/sufficient local/global optimality conditions for continuous optimization problems. Natural algorithms are developed from these optimality conditions, and their most important convergence characteristics are analyzed. The author answers many more “Why?” and “Why not?” than “How?” questions.
The author provides lecture, exercise and reading material for a first course on continuous optimization and mathematical programming. It is geared towards third-year students, and has already been used for nearly ten years. The preface describes the main changes to the first edition.
The book can be used in mathematical optimization courses at engineering, economics, and business schools. It is a perfect starting point for anyone who wishes to develop an understanding of the subject before actually applying it.
Revised with second printing, 2018.
Optimization, or mathematical programming, is a fundamental subject within decision science and operations research in which mathematical decision models are constructed, analyzed, and solved.
Andreasson provides a basis for the analysis of optimization models and candidate optimal solutions for continuous optimization models. Elementary but rigorous mathematics and linear algebra underlie the workings of convexity and duality, and necessary/sufficient local/global optimality conditions for continuous optimization problems. Natural algorithms are developed from these optimality conditions, and their most important convergence characteristics are analyzed. The author answers many more “Why?” and “Why not?” than “How?” questions.
The author provides lecture, exercise and reading material for a first course on continuous optimization and mathematical programming. It is geared towards third-year students, and has already been used for nearly ten years. The preface describes the main changes to the first edition.
The book can be used in mathematical optimization courses at engineering, economics, and business schools. It is a perfect starting point for anyone who wishes to develop an understanding of the subject before actually applying it.
Upplaga: 3e upplagan
Utgiven: 2016
ISBN: 9789144115290
Förlag: Studentlitteratur AB
Format: Häftad
Språk: Engelska
Sidor: 508 st
3 upplagor
Upplaga 2 (2013)
från 389 kr
Upplaga 1 (2006)
Tillfälligt slut
Upplaga 3 (2016)
från 439 kr
Revised with second printing, 2018.
Optimization, or mathematical programming, is a fundamental subject within decision science and operations research in which mathematical decision models are constructed, analyzed, and solved.
Andreasson provides a basis for the analysis of optimization models and candidate optimal solutions for continuous optimization models. Elementary but rigorous mathematics and linear algebra underlie the workings of convexity and duality, and necessary/sufficient local/global optimality conditions for continuous optimization problems. Natural algorithms are developed from these optimality conditions, and their most important convergence characteristics are analyzed. The author answers many more “Why?” and “Why not?” than “How?” questions.
The author provides lecture, exercise and reading material for a first course on continuous optimization and mathematical programming. It is geared towards third-year students, and has already been used for nearly ten years. The preface describes the main changes to the first edition.
The book can be used in mathematical optimization courses at engineering, economics, and business schools. It is a perfect starting point for anyone who wishes to develop an understanding of the subject before actually applying it.
Revised with second printing, 2018.
Optimization, or mathematical programming, is a fundamental subject within decision science and operations research in which mathematical decision models are constructed, analyzed, and solved.
Andreasson provides a basis for the analysis of optimization models and candidate optimal solutions for continuous optimization models. Elementary but rigorous mathematics and linear algebra underlie the workings of convexity and duality, and necessary/sufficient local/global optimality conditions for continuous optimization problems. Natural algorithms are developed from these optimality conditions, and their most important convergence characteristics are analyzed. The author answers many more “Why?” and “Why not?” than “How?” questions.
The author provides lecture, exercise and reading material for a first course on continuous optimization and mathematical programming. It is geared towards third-year students, and has already been used for nearly ten years. The preface describes the main changes to the first edition.
The book can be used in mathematical optimization courses at engineering, economics, and business schools. It is a perfect starting point for anyone who wishes to develop an understanding of the subject before actually applying it.
Begagnad bok
439 kr494 krSpara 55 kr (12%) mot nypris
Fri frakt & skickas inom 1-3 vardagar
Köpskydd med Studentapan
Varje köp täcks av Studentapans köpskydd som säkerställer att boken kommer fram, att du får rätt bok och att skicket stämmer överens med beskrivning.
439 kr494 krSpara 55 kr (12%) mot nypris
Fri frakt & skickas inom 1-3 vardagar