Introduction to operations research / Joseph G. Ecker and Michael Kupferschmid

Includes bibliographical references and index.

Linear Programming -- Linear Programming Models and Applications -- The Simplex Algorithm for Linear Programming -- Geometry of the Simplex Algorithm -- Duality in Linear Programming -- Sensitivity Analysis in Linear Programming -- Linear Programming Models for Network Flow Problems -- Integer, Nonlinear and Dynamic Programming -- Integer Programming -- Nonlinear Programming -- Dynamic Programming -- Probabilistic Models -- Queuing Models -- Inventory Models -- Simulation -- Notational Conventions for Matrix Algebra.

This textbook is intended for use in a two-semester sequence of courses introducing the mathematical methods of operations research. Part I can also be used alone for a one-semester course on linear programming. We have chosen to provide deep and thorough coverage of the most important methods in operations research rather than a superficial treatment of a larger number of topics. The level of exposition is appropriate for juniors and seniors who are majoring in engineering, computer science, mathematics, and quantitative methods in management. The basic techniques of operations research are simple and straightforward, and only a small amount of advanced mathematics is needed for a technically accurate introduction to the subject. This textbook assumes a knowledge of high school elementary algebra and a familiarity with simple matrix notation such as would be introduced in the first class of an undergraduate linear algebra course.