Operations research: an introductionThe sixth edition of Operations Research: An Introduction continues to provide readers with a balanced presentation of the theory, applications and computations of operations research. KEY TOPICS: The book uses case studies, accompanying software, and comprehensive exercises to explain the basics of operations research techniques. It includes much new material: Floyd's Shortest Route Algorithm, Goal Programming, Analytic Hierarchy Approach, Review of Probability, Probabilistic DP, Simulation Modeling, as well as updated versions of TORA software and the simulation language SIMNET II. A valuable reference book for professionals in a variety of fields, including Industrial Engineering, Business Administration, Statistics, Computer Science, and Mathematics. 
What people are saying  Write a review
User ratings
5 stars 
 
4 stars 
 
3 stars 
 
2 stars 
 
1 star 

Review: Operations Research: An Introduction
User Review  Mona Mahfouz  GoodreadsOnly skimmed through a few chapters. Great book for those interested in introductory level material on operations research and linear programming. Read full review
Review: Operations Research: An Introduction
User Review  GoodreadsOnly skimmed through a few chapters. Great book for those interested in introductory level material on operations research and linear programming. Read full review
Contents
Graphical Solution  
LP Formulations  
The LP Model and Resource Allocation  
Copyright  
1 other sections not shown
Common terms and phrases
activity algorithm applying arrivals artificial variables associated assuming basic solution basic variables Chapter coefficients column computations Consider corresponding criterion customers decision decision problem defined demand determine dual simplex dynamic programming entering variable equal event Example exponential exponential distribution extreme point feasible solution Figure formulation given Hessian matrix increase infeasible integer inventory iteration leaving variable linear programming machine Markov chain mathematical matrix maximize maximum minimax minimize minimum mixed cut node nonbasic variables nonnegative objective function objective value obtained optimal solution optimum value period Poisson distribution primal probability problem procedure production profit queueing queueing models queueing theory random numbers random variable recursive equation Reddy Mikks represents resource result satisfied schedule Section selected server shows simplex method simulation situation slack variables solution space Solve stage stationary policies Suppose Table tion transportation model vector waiting yields zequation ztransform zero