Elementary linear programming with applications Bernard Kolman, Robert E. Beck ; [cover photo by Terry Lennon].
Series Computer science and applied mathematicsDetalles de publicación: New York Academic Press c1980.Descripción: xiii, 399 p. ill. 25 cmISBN:- 012417860X
- 519.7/2
- T57.74 .K64
| Imagen de cubierta | Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Ubicación en estantería | Signatura topográfica | Materiales especificados | Info Vol | URL | Copia número | Estado | Notas | Fecha de vencimiento | Código de barras | Reserva de ítems | Prioridad de la cola de reserva de ejemplar | Reservas para cursos | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Libro | Biblioteca Encarnación Valdés Colección General bev | 519.72 K81e (Navegar estantería(Abre debajo)) | Disponible | 80000001214884 |
Descripciones mejoradas de Syndetics:
The disk that comes with the book contains the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University. The authors also recommend inexpensive linear programming software for personal computers. * More review material on linear algebra* Elementary linear programming covered more efficiently* Presentation improved, especially for the duality theorem, transportation problems, the assignment problem, and the maximal flow problem* New figures and exercises* Computer applications updated* Added disk with the student-oriented linear programming code SMPX, written by Professor Evar Nering of Arizona State University* New guide to inexpensive linear programming software for personal computers
Includes index.
Tabla de contenidos provista por Syndetics
- Prologue: Introduction to Operations Research
- Review of Linear Algebra: Matrices
- Gauss-Jordan Reduction
- The Inverse of a Matrix
- Subspaces
- Linear Independence and Basis
- Introduction to Linear Programming: The Linear Programming Problem
- Matrix Notation
- Geometry of Linear Programming Problems
- The Extreme Point Theorem
- Basic Solutions
- The Simplex Method: The Simplex Method for Problems in Standard Form
- Degeneracy and Cycling
- Artificial Variables
- Further Topics in Linear Programming: Duality
- The Duality Theorem
- Computational Relations between the Primal and Dual Problems
- The Dual Simplex Method
- The Revised Simplex Method
- Sensitivity Analysis
- Computer Aspects
- Integer Programming: Examples
- Cutting Plane Methods
- Branch and Bound Methods
- Computer Aspects
- Special Types of Linear Programming Problems: The Transportation Problem
- The Assignment Problem
- Graphs and Networks (Basic Definitions). The Maximal Flow Problem
- The Shortest Route Problem
- The Critical Path Method
- Computer Aspects
- Appendices: Karmarkar's Algorithm
- Microcomputer Software
- SMPX
- Answers to Odd-Numbered Exercises
- Index