Synopsis
This text offers a comprehensive treatment of linear programming as well as of the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces. An introduction surveying 50 years of linear optimization is given. The main topics treated include simplex algorithms and their derivatives, such as the duality theory of linear programming, polyhedral theory, projective algorithms, Newtonian barrier methods, and ellipsoid algorithms in perfect and in finite precision arithmetic. The book can serve both as a graduate textbook for linear programming and as a text for advanced topics classes or seminars. Exercises as well as several case studies are included.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Présentation de l'éditeur
From the reviews: "Do you know M.Padberg's Linear Optimization and Extensions? [?] Now here is the continuation of it, discussing the solutions of all its exercises and with detailed analysis of the applications mentioned. Tell your students about it. [?] For those who strive for good exercises and case studies for Lp this is an excellent volume." Acta Scientiarum Mathematicarum
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Linear Optimization and Extensions
Image fournie par le vendeur
Linear optimization and extensions
Edité par
Springer, 1995
ISBN 10 : 3540587349
ISBN 13 : 9783540587347
Ancien ou d'occasion
Couverture rigide
Vendeur : Bookbot, Prague, Rébublique tchèque
Évaluation du vendeur 5 sur 5 étoiles
Etat : Fair. Aus Bibliothek aussortiert; Leichte Risse; Gebogener Buchrücken. This book offers a comprehensive treatment of linear programming as well as of the optimization of linear functions over polyhedra in finite dimensional Euclidean vector spaces. An introduction surveying fifty years of linear optimization is given. The main topics treated in the book include: simplex algorithms and their derivatives including the duality theory of linear programming, polyhedral theory, projective algorithms, Newtonian barrier methods, ellipsoid algorithms in perfect and in finite precision arithmetic. The book can serve both as a graduate textbook for linear programming and as a text for advanced topics classes or seminars. Exercises as well as several case studies are included. N° de réf. du vendeur f6c9be5c-6a90-4fcf-b947-d2d834f7331d
Acheter D'occasion
EUR 74,64
Frais de port :
EUR 15,99
De Rébublique tchèque vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Linear optimization and extensions (Algorithms and combinatorics)
Edité par
Springer Verlag, USA, 1995
ISBN 10 : 3540587349
ISBN 13 : 9783540587347
Ancien ou d'occasion
Couverture rigide
Vendeur : RT Books, Wexford, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Very Good. No Jacket. PUBLISHER: Springer Verlag DATE/EDITION: 1995 BINDING: Hardbound, 449 pages. DUST JACKET: No jacket. BOOK CONDITION: Very good, tight binding and very clean inside and out. DESCRIPTION: Illustrated with 50 figures. N° de réf. du vendeur 009314
Acheter D'occasion
EUR 169,94
Frais de port :
EUR 4,21
Vers Etats-Unis
Quantité disponible : 1 disponible(s)
Image d'archives
Linear optimization and extensions (Algorithms and combinatorics)
Edité par
Springer Verlag, 1995
ISBN 10 : 3540587349
ISBN 13 : 9783540587347
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-F-049-01338
Acheter D'occasion
EUR 297,45
Frais de port :
EUR 12,10
De Royaume-Uni vers Etats-Unis
Quantité disponible : 1 disponible(s)