Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| Soggetto genere / forma | Electronic books. |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910480893603321 |
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910784638503321 |
|
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck
| Elementary linear programming with applications / / Bernard Kolman, Robert E. Beck |
| Autore | Kolman Bernard |
| Edizione | [2nd ed.] |
| Pubbl/distr/stampa | San Diego, California ; ; London, England : , : Academic Press, , 1995 |
| Descrizione fisica | 1 online resource (474 p.) |
| Disciplina | 519.7/2 |
| Collana | Computer Science and Scientific Computing |
| Soggetto topico | Linear programming |
| ISBN | 0-08-053079-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Front Cover; Elementary Linear Programming with Applications; Copyright Page; Dedication; Table of Contents; Preface; Acknowledgments; Prologue; Chapter 0. Review of Linear Algebra (Optional); 0.1 Matrices; 0.2 Gauss-Jordan Reduction; 0.3 The Inverse of a Matrix; 0.4 Subspaces; 0.5 Linear Independence and Basis; Further Reading; Chapter 1. Introduction to Linear Programming; 1.1 The Linear Programming Problem; 1.2 Matrix Notation; 1.3 Geometry of Linear Programming Problems; 1.4 The Extreme Point Theorem; 1.5 Basic Solutions; Further Reading; Chapter 2. The Simplex Method
2.1 The Simplex Method for Problems in Standard Form2.2 Degeneracy and Cycling (Optional); 2.3 Artificial Variables; Further Reading; Chapter 3. Further Topics in Linear Programming; 3.1 Duality; 3.2 The Duality Theorem; 3.3 Computational Relations between the Primal and Dual Problems; 3.4 The Dual Simplex Method; 3.5 The Revised Simplex Method; 3.6 Sensitivity Analysis; 3.7 Computer Aspects (Optional); Further Reading; Chapter 4. Integer Programming; 4.1 Examples; 4.2 Cutting Plane Methods; 4.3 Branch and Bound Methods; 4.4 Computer Aspects (Optional); Further Reading Chapter 5. Special Types of Linear Programming Problems5.1 The Transportation Problem; 5.2 The Assignment Problem; 5.3 Graphs and Networks: Basic Definitions; 5.4 The Maximal Flow Problem; 5.5 The Shortest Route Problem; 5.6 The Critical Path Method; 5.7 Computer Aspects (Optional); APPENDIX A: Karmarkar's Algorithm; APPENDIX B: Microcomputer Software; APPENDIX C: SMPX; Answers to Odd-Numbered Exercises; Index |
| Record Nr. | UNINA-9910808851903321 |
|
Kolman Bernard
|
||
| San Diego, California ; ; London, England : , : Academic Press, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||