Linear Programming, Sensitivity Analysis & Related Topics Upplaga 1
Linear Programming, Sensitivity Analysis and Related Topics
Marie-France Derhy
This book covers all aspects of linear programming from the two-dimensional LPs and their extension to higher dimensional LPs, through duality and sensitivity analysis and finally to the examination of commented software outputs.
The book is organised into three distinct parts: the first part studies the concepts of linear programming and presents its founding theorems complete with proofs and applications; the second part presents linear programming in the diversity of its variants (Integer Programming, Game Theory, Transportation Problem, Assignment Model), and highlights the modelling problems that are involved in network optimisation; the final part furthers the discussion on selected topics and presents an opening to nonlinear programming through quadratic programming.
Features of the book:
A circular approach looks at same applications through various solution methods (geometric, simplex, revised simplex and dual simplex methods, duality, study of software outputs, sensitivity analysis), enabling the book to be structured to individual courses
The highly graphical approach aids understanding and visualisation
Each chapter includes a set of objectives, problems and applications.
The book is ideal for anybody studying courses in linear programming, operational research, discrete mathematics and graph theory, both at undergraduate and graduate levels.
Upplaga: 1a upplagan
Utgiven: 2010
ISBN: 9780273723387
Förlag: Pearson
Format: Häftad
Språk: Engelska
Sidor: 464 st
Linear Programming, Sensitivity Analysis and Related Topics
Marie-France Derhy
This book covers all aspects of linear programming from the two-dimensional LPs and their extension to higher dimensional LPs, through duality and sensitivity analysis and finally to the examination of commented software outputs.
The book is organised into three distinct parts: the first part studies the concepts of linear programming and presents its founding theorems complete with proofs and applications; the second part presents linear programming in the diversity of its variants (Integer Programming, Game Theory, Transportation Problem, Assignment Model), and highlights the modelling problems that are involved in network optimisation; the final part furthers the discussion on selected topics and presents an opening to nonlinear programming through quadratic programming.
Features of the book:
A circular approach looks at same applications through various solution methods (geometric, simplex, revised simplex and dual simplex methods, duality, study of software outputs, sensitivity analysis), enabling the book to be structured to individual courses
The highly graphical approach aids understanding and visualisation
Each chapter includes a set of objectives, problems and applications.
The book is ideal for anybody studying courses in linear programming, operational research, discrete mathematics and graph theory, both at undergraduate and graduate levels.
Varje vecka tillkommer tusentals nya säljare. Bevaka boken så får du meddelande när den finns tillgänglig igen.