## Principles of Operations Research: With Applications to Managerial DecisionsThe art and science of executive decisions. Formulation of liner optimization models. Algebraic and geometric representations of linear optimization models. Simplex method of solution. Sensitivity testing and duality. Transportation problem. Shortest-route and other network models. Introduction to dynamic optimization models. Dynamic optimization of inventory scheduling. Other examples of dynamic programming. Decision-making over an unbounded horizon. Optimization methods for an unbounded horizon. Integer programming and combinatorial models. Optimization with a nonlinear objective function. Advenced techniques in nonlinear programming. Introduction to stochastic programming models. Probabilistic dynamic programming models. Dynamic programming in markov chains. Probabilistic inventory models. Waitting line models. Computer simulation of management systems; Implementation of network algorithms. Advanced techniques for waiting line models. Table-probability of a busy period. |

### What people are saying - Write a review

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

### Contents

THE ART AND SCIENCE OF EXECUTIVE DECISIONS | 1 |

Exhibit B Immediate | 8 |

FORMULATION OF LINEAR OPTIMIZATION MODELS | 31 |

Copyright | |

42 other sections not shown

### Other editions - View all

### Common terms and phrases

alternative analysis apply approach approximation associated Assume assumption basic solution calculations Chap coefficients Company concave concave function Consider convergence convex convex function corresponding cost function criterion decision decision problem demand denote determine dual linear programming dual problem dual variables entering inventory equal equivalent average example exercise expected extremal equations feasible solution find an optimal formulation given holding cost illustrate indicate integer-valued interval inventory model linear programming model mathematical maximize maximum minimize minimum Node nonlinear nonlinear programming nonnegative objective function operations research optimal policy optimal solution optimal value optimization model penalty cost period present value primal probability distribution production profit random variable restrictions right-hand side route satisfy schedule selected Show shown in Fig simplex algorithm simplex method simulation solve Specifically stationary stationary policy Step stochastic strategy Suppose techniques tion unbounded horizon unit Verify yields