8th Edition

by

Hamdy A. Taha

Item specification:

- Brand new book
- Free shipping and handling Australia wide.

- Hard cover

- 8th Edition

- Include a CD
- ISBN-10: 0131889230
- ISBN-13: 9780131889231
- Free postage Australia wide.

Detailed item info

Key Features
Author(s)	Hamdy Abdelaziz Taha
Publisher	Pearson Education (US)
Date of Publication	04/04/2006
Language	English
Format	Mixed media product
ISBN-10	0131889230
ISBN-13	9780131889231
Subject	Library & Information Science

Publication Data
Place of Publication	Upper Saddle River
Country of Publication	United States
Imprint	Prentice Hall
Out-of-print date	08/12/2008
Content Note	Illustrations

Dimensions
Weight	1348 g
Width	183 mm
Height	243 mm
Spine	36 mm

Editorial Details
Contained items statement	Contains Hardback and CD-ROM
Edition Statement	8 Revised ed of US ed

Description
Table Of Contents	Chapter 1: What is Operations Research? 1.1 Operations Research Models 1.2 Solving the OR Model 1.3 Queueing and Simulation Models 1.4 Art of Modeling 1.5 More than Just Mathematics 1.6 Phases of an OR Study 1.7 About this Book Problems References Chapter 2: Modeling with Linear Programming 2.1 Two-Variable LP Model 2.2 Graphical LP Solution 2.3 Selected LP Applications 2.4 Computer Solution with Solver and AMPL Problems References Chapter 3: The Simplex Method and Sensitivity Analysis 3.1 LP Model in Equation Form 3.2 Transition from Graphical to Algebraic Solution 3.3 The Simplex Method 3.4 Artificial Starting Solution 3.5 Special Cases in the Simplex Method 3.6 Sensitivity Analysis Problems References Chapter 4: Duality and Post-Optimal Analysis 4.1 Definition of the Dual Problem 4.2 Primal-Dual Relationships 4.3 Economic Interpretation of Duality 4.4 Additional Simplex Algorithms 4.5 Post-Optimal Analysis Problems References Chapter 5: Transportation Model and its Variants 5.1 Definition of the Transportation Model 5.2 Nontraditional Transportation Models 5.3 The Transportation Algorithm 5.4 The Assignment Model 5.5 The Transshipment Model Problems References Chapter 6: Network Models 6.1 Scope and Definition of Network Models 6.2 Minimal Spanning Tree Algorithm 6.3 Shortest-Route Problem 6.4 Maximal Flow Model 6.5 CPM and PERT Problems References Chapter 7: Advanced Linear Programming 7.1 Simplex Method Fundamentals 7.2 Revised Simplex Method 7.3 Bounded Variables Algorithm 7.4 Duality 7.5 Parametric Linear Programming Problems References Chapter 8: Goal Programming 8.1 A Goal Programming Formulation 8.2 Goal Programming Algorithms Problems References Chapter 9: Integer Linear Programming 9.1 Illustrative Applications 9.2 Integer Programming Algorithms 9.3 Traveling Salesperson (TSP) Problem Problems References Chapter 10: Deterministic Dynamic Programming 10.1 Recursive Nature of Computations in DP 10.2 Forward and Backward Recursion 10.3 Selected DP Applications 10.4 Problem of Dimensionality Problems References Chapter 11: Deterministic Inventory Models 11.1 General Inventory Model 11.2 Role of Demand in the Development of Inventory Models 11.3 Static Economic-Order-Quantity (EOQ) Models 11.4 Dynamic EOQ Models Problems References Chapter 12: Review of Basic Probability 12.1 Laws of Probability 12.2 Random Variables and Probability Distributions 12.3 Expectation of a Random Variable 12.4 Four Common Probability Distributions 12.5 Empirical Distributions Problems References Chapter 13: Decision Analysis and Games 13.1 Decision Making under Certainty-Analytic Hierarchy Process (AHP) 13.2 Decision Making under Risk 13.3 Decision under Uncertainty 13.4 Game Theory Problems References Chapter 14: Probabilistic Inventory Models 14.1 Continuous Review Models 14.2 Single-Period Models 14.3 Multiperiod Model Problems References Chapter 15:Queueing Systems 15.1 Why Study Queues? 15.2 Elements of a Queuing Model 15.3 Role of Exponential Distribution 15.4 Pure Birth and Death Models (Relationship between the Exponential and Poisson Distributions) 15.5 Generalized Poisson Queuing Model 15.6 Specialized Poisson Queues 15.7 (M/G/1):(GD/Inf/Inf)-Pollaczek-Khintchine (P-K) Formula 15.8 Other Queuing Models 15.9 Queueing Decision Models Problems References Chapter 16: Simulation Modeling 16.1 Monte Carlo Simulation 16.2 Types of Simulation 16.3 Elements of Discrete-Event Simulation 16.4 Generation of Random Numbers 16.5 Mechanics of Discrete Simulation 16.6 Methods for Gathering Statistical Observations 16.7 Simulation Languages Problems References Chapter 17: Markov Chains 17.1 Definition of a Markov Chain 17.2 Absolu