## Foundations and Tools for Operations Research and the Management Sciences, Volume 1University of Michigan, 1965 - Programming (Mathematics) |

### What people are saying - Write a review

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

### Contents

A Simple Linear Programming Problem | xi |

The Dual of a Linear Programming Problem | xix |

Some Linear Programming Models | xxvii |

29 other sections not shown

### Common terms and phrases

augmented matrix auxiliary problem basic sequence basic solution basic variables binomial calculate called canonical cost canonical form central limit theorem coefficient coin column degree column vector consider convex combination corresponding cost row cycle defined denote dual problem duality echelon matrix elements equal equivalent example expected value feasible solution feasible vector Figure finite free variables given hence hypothesis i-th illustrate independent indicate inequalities interval linear programming problem mathematics maximize minimize multiplication negative non-negative nonbasic normal distribution number of heads number of units obtain operations optimal feasible optimal solution ordered pairs orthogonal orthonormal outcomes parameter positive primal probability distribution probability function rain random quantity random variable real numbers require sample space sampling distribution scalar schema Section simplex algorithm simplex method slack variables Solve subset subspace Suppose Table theorem tion toss unitary matrix variance vector space zero