Introduction to the mathematics of operations research with Mathematica

Description

Content: Graph Theory and Network Analysis Definitions and Examples Spanning Trees Minimal Cost Networks Critical Path Algorithm Maximal Flow Problems Maximum Matching Problems Other Problems of Graph Theory Linear Programming Two-Variable Problems Geometry of Linear Programming Simplex Algorithm for the Standard Maximum ProblemDuality and the Standard Minimum Problem Further Topics in Linear Programming Non-Standard Problems Transportation Problem Sensitivity Analysis Markov Chains Definitions and Examples Short-Run Distributions First Passage Times Classification of States Limiting Probabilities Absorption Probabilities Continuous Time Processes Poisson Processes Birth and Death Processes Renewal Processes Queueing Theory Brownian Motion Dynamic Programming The Markovian Decision Model The Finite Horizon Problem The Discounted Reward Problem Policy Improvement Optimal Stopping of a Markov Chain Extended Applications Appendix A - Probability Review Appendix B - Answers to Selected Exercises Appendix C - Glossary of Mathematica Commands