## Operations research: an introduction |

### From inside the book

91 pages matching **linear programming problem** in this book

#### Page xii

Where's the rest of this book?

Results 1-3 of 91

### What people are saying - Write a review

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

### Contents

Basics of Operations Research | 1 |

PART | 13 |

The Simplex Method | 42 |

Copyright | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

0-equation activities algorithm applied arrival assumed basic solution basic variables Basic x0 Chapter coefficients column computations convex convex set corresponding cost per unit criterion customers decision defined demand determined distribution dual problem dynamic programming elements entering variable equal equation Example expected expected value exponential exponential distribution extreme point Figure following problem Formulate given hence Hessian matrix illustrate infeasible inventory iteration leaving variable linear programming problem machine Markov chain mathematical matrix maximum means minimize x0 node nonbasic variables nonlinear nonnegative objective function obtained operations optimal solution optimum parameters period Poisson Poisson distribution probability procedure production pure strategies queueing queueing models random variable represents result satisfied Section selected servers shortage shows simplex method simulation slack variables solution space Solution x0 stage starting solution stationary point Table tableau theorem vector xu x2 yields z-transform zero