The Subject A little explanation is in order for our choice of the title Linear Opti- 1 mization (and corresponding terminology) for what has traditionally been called Linear Programming.Theword programming in this context can be confusing and/or misleading to students. Linear programming problems are referred to as optimization problems but the general term linear p- gramming remains. This can cause people unfamiliar with the subject to think that it is about programming in the sense of writing computer code. It isn't. This workbook is about the beautiful mathematics underlying the ideas of optimizing linear functions subject to linear constraints and the algorithms to solve such problems. In particular, much of what we d- cuss is the mathematics of Simplex Algorithm for solving such problems, developed by George Dantzig in the late 1940s. The word program in linear programming is a historical artifact. When Dantzig ?rstdevelopedthe Simplex Algorithm to solvewhat arenowcalled linear programming problems, his initial model was a class of resource - location problems to be solved for the U.S. Air Force. The decisions about theallocationswerecalled'Programs'bytheAirForce, andhencetheterm.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
* Uses the "modified Moore method" approach in which examples and proof opportunities are worked into the text in order to encourage students to develop some of the content through their own examples and arguments while they are reading the text * Concentrates on the mathematics underlying the ideas of optimizing linear functions under linear constraints and the algorithms used to solve them * The material progresses at a gentle and inviting pace * Ample examples and exercises are included This undergraduate textbook is written for a junior/senior level course on linear optimization. Unlike other texts, the treatment allows the use of the "modified Moore method" approach by working examples and proof opportunities into the text in order to encourage students to develop some of the content through their own experiments and arguments while reading the text. Additionally, the focus is on the mathematics underlying the ideas of optimizing linear functions under linear constraints and the algorithms used to solve them. In particular, the author uses the Simplex Algorithm to motivate these concepts. The text progresses at a gentle and inviting pace. The presentation is driven by numerous examples and illustrations. Ample exercises are provided at the end of each chapter for mastering the material. Opportunities for integrating Maple (or similar) software are included in the book. The author s own WebSim software can be freely downloaded from his website for pedagogical use. The teacher's version of the text contains solutions embedded within the text, rather than in an appendix. It also has extra material and suggestions for the teacher s benefit. Junior/senior level undergraduate students will benefit from the book, as will beginning graduate students. Future secondary school mathematics teachers will also find this book useful.
Arizona State University Professor Glenn H. Hurlbert has published nearly 50 articles in graph theory, combinatorics, and optimization, and has been the recipient of numerous teaching and mentoring awards from ASU, the ASU Parents Association, the School of Mathematical and Statistical Sciences, and the Mathematical Association of America.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 10 expédition depuis Allemagne vers France
Destinations, frais et délaisEUR 6,99 expédition depuis Italie vers France
Destinations, frais et délaisVendeur : Universitätsbuchhandlung Herta Hold GmbH, Berlin, Allemagne
XVII, 272 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Stamped. N° de réf. du vendeur 4801JB
Quantité disponible : 18 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. N° de réf. du vendeur 17246982-6
Quantité disponible : 1 disponible(s)
Vendeur : Brook Bookstore, Milano, MI, Italie
Etat : new. N° de réf. du vendeur NZH2CDUFQM
Quantité disponible : 3 disponible(s)
Vendeur : Libro Co. Italia Srl, San Casciano Val di Pesa, FI, Italie
Cartonato. Etat : new. Heidelberg, 2008; hardback, cm 18,5x24,5. Libro. N° de réf. du vendeur 2596464
Quantité disponible : 3 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Uses the modified Moore method approach in which examples and proof opportunities are worked into the text in order to encourage students to develop some of the content through their own examples and arguments while they are reading the textConc. N° de réf. du vendeur 5911284
Quantité disponible : Plus de 20 disponibles
Vendeur : Zoom Books Company, Lynden, WA, Etats-Unis
Etat : good. Book is in good condition and may include underlining highlighting and minimal wear. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. N° de réf. du vendeur ZBV.0387791477.G
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Subject A little explanation is in order for our choice of the title Linear Opti- 1 mization (and corresponding terminology) for what has traditionally been called Linear Programming.Theword programming in this context can be confusing and/or misleading to students. Linear programming problems are referred to as optimization problems but the general term linear p- gramming remains. This can cause people unfamiliar with the subject to think that it is about programming in the sense of writing computer code. It isn't. This workbook is about the beautiful mathematics underlying the ideas of optimizing linear functions subject to linear constraints and the algorithms to solve such problems. In particular, much of what we d- cuss is the mathematics of Simplex Algorithm for solving such problems, developed by George Dantzig in the late 1940s. The word program in linear programming is a historical artifact. When Dantzig rstdevelopedthe Simplex Algorithm to solvewhat arenowcalled linear programming problems, his initial model was a class of resource - location problems to be solved for the U.S. Air Force. The decisions about theallocationswerecalled'Programs'bytheAirForce,andhencetheterm. 292 pp. Englisch. N° de réf. du vendeur 9780387791470
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The Subject A little explanation is in order for our choice of the title Linear Opti- 1 mization (and corresponding terminology) for what has traditionally been called Linear Programming.Theword programming in this context can be confusing and/or misleading to students. Linear programming problems are referred to as optimization problems but the general term linear p- gramming remains. This can cause people unfamiliar with the subject to think that it is about programming in the sense of writing computer code. It isn't. This workbook is about the beautiful mathematics underlying the ideas of optimizing linear functions subject to linear constraints and the algorithms to solve such problems. In particular, much of what we d- cuss is the mathematics of Simplex Algorithm for solving such problems, developed by George Dantzig in the late 1940s. The word program in linear programming is a historical artifact. When Dantzig rstdevelopedthe Simplex Algorithm to solvewhat arenowcalled linear programming problems, his initial model was a class of resource - location problems to be solved for the U.S. Air Force. The decisions about theallocationswerecalled'Programs'bytheAirForce,andhencetheterm. N° de réf. du vendeur 9780387791470
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : Neu. Neuware -The Subject A little explanation is in order for our choice of the title Linear Opti- 1 mization (and corresponding terminology) for what has traditionally been called Linear Programming.Theword programming in this context can be confusing and/or misleading to students. Linear programming problems are referred to as optimization problems but the general term linear p- gramming remains. This can cause people unfamiliar with the subject to think that it is about programming in the sense of writing computer code. It isn¿t. This workbook is about the beautiful mathematics underlying the ideas of optimizing linear functions subject to linear constraints and the algorithms to solve such problems. In particular, much of what we d- cuss is the mathematics of Simplex Algorithm for solving such problems, developed by George Dantzig in the late 1940s. The word program in linear programming is a historical artifact. When Dantzig rstdevelopedthe Simplex Algorithm to solvewhat arenowcalled linear programming problems, his initial model was a class of resource - location problems to be solved for the U.S. Air Force. The decisions about theallocationswerecalled¿Programs¿bytheAirForce,andhencetheterm.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 292 pp. Englisch. N° de réf. du vendeur 9780387791470
Quantité disponible : 2 disponible(s)
Vendeur : TextbookRush, Grandview Heights, OH, Etats-Unis
Etat : Acceptable. Expedited orders RECEIVED in 1-5 business days within the United States. Orders ship SAME or NEXT business day. We proudly ship to APO/FPO addresses. 100% Satisfaction Guaranteed! N° de réf. du vendeur 52702280
Quantité disponible : 1 disponible(s)