## Introduction to Operations ResearchFor over four decades, Introduction to Operations Research by Frederick Hillier has been the classic text on operations research. While building on the classic strengths of the text, the author continues to find new ways to make the text current and relevant to students. One way is by incorporating a wealth of state-of-the-art, user-friendly software and more coverage of business applications than ever before. The hallmark features of this edition include new section and chapters, updated problems, clear and comprehensive coverage of fundamentals, an extensive set of interesting problems and cases, and state-of-the-practice operations research software used in conjunction with examples from the text. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

10 | |

25 | |

The Simplex Method | 93 |

CHAPTER 5 The Theory of the Simplex Method | 163 |

CHAPTER 6 Duality Theory | 197 |

CHAPTER 7 Linear Programming under Uncertainty | 225 |

CHAPTER 8 Other Algorithms for Linear Programming | 290 |

CHAPTER 13 Nonlinear Programming | 547 |

CHAPTER 14 Metaheuristics | 617 |

CHAPTER 15 Game Theory | 661 |

CHAPTER 16 Decision Analysis | 682 |

CHAPTER 17 Queueing Theory | 731 |

CHAPTER 18 Inventory Theory | 800 |

CHAPTER 19 Markov Decision Processes | 877 |

CHAPTER 20 Simulation | 892 |

CHAPTERT 9 The Transportation and Assignment Problems | 318 |

CHAPTER 10 Network Optimization Models | 372 |

CHAPTER 11 Dynamic Programming | 438 |

CHAPTER 12 Integer Programming | 474 |

APPENDIXES | 952 |

PARTIAL ANSWERS TO SELECTED PROBLEMS | 969 |

INDEXES | 983 |

### Other editions - View all

Introduction to Operations Research with Student Access Card Frederick Hillier No preview available - 2014 |

### Common terms and phrases

algorithm apply basic solution batch book’s website cells changes coefficients column constraint boundary convex corresponding CPF solution customers decision variables described in Sec dual problem dynamic programming entering basic variable equations example exponential distribution feasible region feasible solutions flow following problem formulation functional constraints given graphical identify initial BF solution initial trial solution installation integer IOR Tutorial iteration leaving basic variable linear programming model linear programming problem LP relaxation Maximize Maximize Z metaheuristics minimize minimum node nonbasic variables nonlinear programming nonnegativity objective function obtained operations research optimal solution parameter plant player presented in Sec primal problem Prob probability procedure profit provides queueing models queueing system queueing theory sensitivity analysis servers simplex method simplex tableau slack variables solve Solver spreadsheet strategy subproblem tabu tabu search tion transportation problem traveling salesman problem unit Wyndor Glass zero