What people are saying - Write a review
We haven't found any reviews in the usual places.
Computation The Simplex Method
Integral Linear Programming
The simpleassignment problem
42 other sections not shown
Other editions - View all
algebraic amount assert assigned assume assumption basic solutions basis called capacity Chap chapter choose column computation convex cone convex set coordinate corresponding cost define definition demand denote diet dual problem duality theorem economic entries equilibrium prices equilibrium theorem equilibrium vector example exchange matrix Exercise exists fact feasible vector finding nonnegative finite cone flow give given hence income independent subset inequality xA integers irreducible Lemma linear programming linear subspace matrix game maximize maximum problem maximum-flow problem minimax theorem minimize minimum mixed strategies n-vector nodes nonnegative numbers nonnegative solution optimal strategies optimal vector output P2 plays payoff matrix player polytope price vector production prove pure strategies rank reader replace result satisfy scalar semipositive simple simplex method solve strategies for Pi subspace suppose symmetric game tableau theory tion unit vectors verify zero