Cantitate/Preț
Produs

Linear Programming Computation

Autor Ping-Qi PAN
en Limba Engleză Paperback – 2 sep 2016
With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 91232 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 2 sep 2016 91232 lei  6-8 săpt.
  Springer Nature Singapore – 3 ian 2024 149346 lei  38-44 zile
Hardback (1) 146832 lei  3-5 săpt. +5755 lei  10-14 zile
  Springer Nature Singapore – 2 ian 2023 146832 lei  3-5 săpt. +5755 lei  10-14 zile

Preț: 91232 lei

Preț vechi: 111259 lei
-18% Nou

Puncte Express: 1368

Preț estimativ în valută:
17459 18117$ 14593£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783662514306
ISBN-10: 3662514303
Pagini: 765
Ilustrații: XVIII, 747 p. 14 illus.
Dimensiuni: 155 x 235 x 39 mm
Greutate: 1.06 kg
Ediția:Softcover reprint of the original 1st ed. 2014
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany

Cuprins

Introduction.- Geometry of the Feasible Region.- Simplex Method.- Duality principle and dual simplex method.- Implementation of the Simplex Method.- Sensitivity Analysis and Parametric LP.- Variants of the Simplex Method.- Decomposition Method.- Interior Point Method.- Integer Linear Programming (ILP).- Pivot Rule.- Dual Pivot Rule.- Simplex Phase-I Method.- Dual Simplex Phase-l Method.- Reduced Simplex Method.- Improved Reduced Simplex Method.- D-Reduced Simplex Method.- Criss-Cross Simplex Method.- Generalizing Reduced Simplex Method.- Deficient-Basis Method.- Dual Deficient-Basis Method.- Face Method.- Dual Face Method.- Pivotal interior-point Method.- Special Topics.- Appendix.- References.

Recenzii

“Evidenced by superior performance in computational experiments, the author’s work has refreshed the state of the art of LP, and by its originality, breadth and depth, is having a major impact on the field of mathematical optimization.” (EJOR, European Journal of Operational Research, Vol. 267 (3), June, 2018)
“The book seems to be mainly addressed to scientists who already possess some expertise in LP. The kind of presentation, however, also allows using parts of it as a basis for a course on the topic. In fact, a special feature of the book is that an algorithm typically is accompanied by some example for which the results of all computational steps needed to find a solution are written down.” (Rembert Reemtsen, zbMATH, Vol. 1302, 2015)
“This book is a research monograph focusing on computational techniques in the simplex method for linear programming. … It may be of interest to researchers and developers of simplex method codes for linear programming.” (B. Borchers, Choice, Vol. 52 (3), November, 2014)

Textul de pe ultima copertă

With emphasis on computation, this book is a real breakthrough in the field of LP. In addition to conventional topics, such as the simplex method, duality, and interior-point methods, all deduced in a fresh and clear manner, it introduces the state of the art by highlighting brand-new and advanced results, including efficient pivot rules, Phase-I approaches, reduced simplex methods, deficient-basis methods, face methods, and pivotal interior-point methods. In particular, it covers the determination of the optimal solution set, feasible-point simplex method, decomposition principle for solving large-scale problems, controlled-branch method based on generalized reduced simplex framework for solving integer LP problems.

Caracteristici

A landmark work on LP
Includes a wealth of rich and advanced materials
A must-read for all students, researchers and practitioners interested in LP and related areas
Includes supplementary material: sn.pub/extras

Notă biografică

Ping-Qi Pan is Professor and Doctoral Supervisor of Mathematics Department at Southeast University, Nanjing, China. He was Visiting Scholar at University of Washington (1986–1987), and Visiting Scientist at Cornell University (1987–1988). His research interest focuses on mathematical programming and operations research, especially large-scale linear optimization. He was standing council member of Mathematical Programming Society of China, and standing council member of Operation Research Society of China. Professor Pan has received the honorary title of Outstanding Scientific-Technical Worker of Jiangsu Province of China. He was nominated as Top 100 scientist of 2012 by the International Biographical Centre, Cambridge, England. He won the LIFETIME ACHIEVEMENT AWARD by Who’s Who in the World in 2017.