Linear optimization and extensions /

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. Here are the book's main topics. Simplex algor...

Descripció completa

Guardat en:
Dades bibliogràfiques
Autor principal: Padberg, M. W.
Format: Llibre
Idioma:English
Publicat: Berlin ; New York : Springer, c1995.
Col·lecció:Algorithms and combinatorics ; 12
Matèries:
LEADER 02564cam a2200337 a 4500
001 c000284226
003 CARM
005 20080709145117.0
008 941207s1995 gw a b 001 0 eng
010 |a 94047365 
019 1 |a 11340209  |z 24415316  |5 LACONCORD2021 
020 |a 3540587349 (acid-free paper) 
035 |a (OCoLC)31739756  |5 LACONCORD2021 
040 |a TOC  |b eng  |c TOC  |d TOC 
050 0 |a T57.74  |b .P3 1995 
050 1 4 |a T57.74  |b .P3 1995 
082 0 0 |a 519.7/2  |2 20 
082 0 4 |a 519.7/2 
100 1 |a Padberg, M. W. 
245 1 0 |a Linear optimization and extensions /  |c Manfred Padberg. 
260 |a Berlin ;  |a New York :  |b Springer,  |c c1995. 
300 |a xviii, 449 p. :  |b ill. ;  |c 25 cm. 
440 0 |a Algorithms and combinatorics ;  |v 12 
504 |a Includes bibliographical references (p. [431]-444) and index. 
505 0 |a 1. Introduction -- 2. The Linear Programming Problem -- 3. Basic Concepts -- 4. Five Preliminaries -- 5. Simplex Algorithms -- 6. Primal-Dual Pairs -- 7. Analytical Geometry -- 8. Projective Algorithms -- 9. Ellipsoid Algorithms -- 10. Combinatorial Optimization: An Introduction -- App. A. Short-Term Financial Management -- App. B. Operations Management in a Refinery -- App. C. Automatized Production: PCBs and Ulysses' Problem. 
520 |a 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. Here are the book's main topics. Simplex algorithms and their derivatives, the duality theory of linear programming. Polyhedral theory, pointwise and linear descriptions of double description algorithms, Gaussian elimination with and without division, the complexity of simplex steps. Projective algorithms, the geometry of projective algorithms, Newtonian barrier methods. Ellipsoid algorithms in perfect and in finite precision arithmetic, the equivalence of linear optimization and polyhedral separation. The foundations of mixed integer programming. The book can serve both as a graduate textbook and as a text for advanced topics classes or seminars. Exercises as well as several case studies are included. 
650 0 |a Linear programming. 
650 0 |a Mathematical optimization. 
852 8 |b CARM  |h A3:AR09F0  |i C11175  |p 0467417  |f BK 
999 f f |i 976a94c5-0510-5e42-a4da-54bd7c8c59dc  |s ccc70139-4250-5c23-bf32-844f1096415d 
952 f f |p Can circulate  |a CAVAL  |b CAVAL  |c CAVAL  |d CARM 1 Store  |e C11175  |f A3:AR09F0  |h Other scheme  |i book  |m 0467417