Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
