EUR 29,48 expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délaisEUR 3,55 expédition vers Etats-Unis
Destinations, frais et délaisVendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar2716030030087
Quantité disponible : Plus de 20 disponibles
Vendeur : BargainBookStores, Grand Rapids, MI, Etats-Unis
Paperback or Softback. Etat : New. Mathematical Introduction to Linear Programming and Game Theory 0.48. Book. N° de réf. du vendeur BBS-9781461288695
Quantité disponible : 5 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781461288695_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Paperback. Etat : New. N° de réf. du vendeur 6666-IUK-9781461288695
Quantité disponible : 10 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Paperback / softback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 257. N° de réf. du vendeur C9781461288695
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes almost obvious. Examples and extensive discussions throughout the book provide insight into definitions, theorems, and applications. There is considerable informal discussion on how best to play matrix games. The book is designed for a one-semester undergraduate course. Readers will need a degree of mathematical sophistication and general tools such as sets, functions, and summation notation. No single college course is a prerequisite, but most students will do better with some prior college mathematics. This thorough introduction to linear programming and game theory will impart a deep understanding of the material and also increase the student's mathematical maturity. N° de réf. du vendeur 9781461288695
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of R.G. Bland is proven more simply than heretofore, and the important duality theorem becomes almost obvious. Examples and extensive discussions throughout the book provide insight into definitions, theorems, and applications. There is considerable informal discussion on how best to play matrix games. The book is designed for a one-semester undergraduate course. Readers will need a degree of mathematical sophistication and general tools such as sets, functions, and summation notation. No single college course is a prerequisite, but most students will do better with some prior college mathematics. This thorough introduction to linear programming and game theory will impart a deep understanding of the material and also increase the student's mathematical maturity. 148 pp. Englisch. N° de réf. du vendeur 9781461288695
Quantité disponible : 2 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. reprint edition. 130 pages. 9.00x6.00x0.50 inches. In Stock. N° de réf. du vendeur x-146128869X
Quantité disponible : 2 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Mathematical elegance is a constant theme in this treatment of linear programming and matrix games. Condensed tableau, minimal in size and notation, are employed for the simplex algorithm. In the context of these tableau the beautiful termination theorem of. N° de réf. du vendeur 4191419
Quantité disponible : Plus de 20 disponibles
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA773146128869X6
Quantité disponible : 1 disponible(s)