## An introduction to linear programming and the theory of games |

### What people are saying - Write a review

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

### Contents

Elementary Aspects of Linear Programming | 1 |

Alternate Optimal Solutions | 13 |

Convex Sets in the Cartesian Plane and | 22 |

Copyright | |

11 other sections not shown

### Other editions - View all

An Introduction to Linear Programming and the Theory of Games Abraham M. Glicksman Limited preview - 1963 |

### Common terms and phrases

A's problem artificial variables basic feasible solution basic variables boundary lines boundary point Bulkswagons called cartesian plane choose closed half plane closed segment codeine Condensed Tableau constraints contain a ray convex polygon convex set Jf corresponding defined definition Determine edge endpoint enters the basis example Exercise expected payoff extreme points Figure finite number gain per play Game Theory grains of aspirin half line inequalities interior point iteration last row least upper bound linear programming problems matching pennies matrix game Minimax Theorem minimum value minutes mixed strategy negative entries non-negative nonbasic obtain optimal solution optimal tableau ordered pairs parameter value parametric representation payoff matrix player plays HEADS plays TAILS point of Jf polygonal convex region polygonal convex set Pontillacs Prove pure strategy real numbers saddle point set of points Simplex Method slack variables solution set solve strategy point Theory of Games values assumed vertices yields zero