Dantzig g b (20 risultati)

hardcover. 5 1/2 x 8 1/8" 180 pages. Studies in Mathematics Volume 10. ex university library. spine label neatly removed. stamped on page edges and first and last pages which have been partially inked out. stamped discard. library stickers on last page and rear cover which have also been inked out. bookplate on inside front cover "A Gift of Professor Herman Karreman" and his flourish of a signature on title page. …

Condizione: Fair. Volume 10. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. With usual stamps and markings, In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,450grams, ISBN:0883851105.…

Hardcover. Condizione: As New. 1st Edition. As new hardcover. Brown cloth with black spine panel; silver MAA imprint; light shelf wear; clean interior; tight binding. No marks, underlining, or inscriptions observed. Pages bright and uncreased.For more information on condition. Please view all images. Additional images upon request. Vintage 1974 - 1st Edition. 291 Pages. Volume 10 in the MAA Studies in Mathematics series, edited by George B. Dantzig and B. Curtis Eaves. A collection of foundational papers in optimization theory by leading mathematicians of the era, including Kuhn, Edmonds, Fulkerson, Scarf, Shapley, Veinott, Wolfe, and others. Topics include Steiner's problem, labeling methods, bottleneck extremes, cores and invariants, Markov decision processes, and decomposition programs. Published by the Mathematical Association of America; printed in the United States. Includes contributor list, full contents, and index.…

Condizione: Fair. 1970. Reprinted with Corrections. 429 pages. No dust jacket. This is an ex-Library book. Green cloth. Library copy, with expected inserts and inscriptions. Part 1. Binding remains firm. Pages have light tanning and foxing throughout. Boards have light shelf-wear with corner bumping. Light tanning to spine and edges with crushing to spine ends. Tears to cloth to spine edges. Water marking to front board.…

Cloth. Condizione: Very Good. No Jacket. Volume 10 of 'Studies in Mathematics', light wear to covers, unmarked, 180pp, VG/--. Book.

Paperback. Condizione: Brand New. 508 pages. 9.61x6.69x1.15 inches. In Stock.

Soft cover. Condizione: Near Fine. Condizione sovraccoperta: Very Good. 1st Edition. Xi, 291 Pp. Blue Cloth, Gilt. First Edition Stated. Light Usage. Dust Jacket Priced $3.50, Wear, Small Losses, No Loss Of Lettering Or Design, Internal Tape Repaitrs.

Paperback. Condizione: New.

Condizione: New. In English.

Condizione: New. pp. 732.

Hardcover. Condizione: Very Good. G.B. Dantzig, D.R. Fulkerson, S.M. Johnson. Two Papers. (1) "Solution for a large-scale traveling-salesman problem" (1954) AND (Ibid.) (2) "On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem" (1959) both in "Operations Research". Two items. [++] (Dantzig 1954, #1 is found in the "Journal of the Operations Research Society of America" 2 (1954), pp. 393-41 in the full bound volume of 470, 40pp. Bound in cloth and decorated boards. FINE copy. AND #2, Operations Research, January-February 1959, vol 7 number 1, with the Dantzig on pp 58-66 in the issue of pp 1-142. This is the original issue, in wrappers. The spine has been expertly restored. [++] "Dantzig, Fulkerson and Johnson solved the 49-city instance by solving a sequence of linear programs, starting with the fundamental inequalities, and adding successive cuts as required to exclude fractional optimal solutions."--"George Dantzig's impact on the theory of computation" by Richard M. Karp, in "Discrete Optimization," Volume 5, Issue 2, May 2008, Pages 174-185. Karp continues: "George Dantzig will go down in history as one of the founders and chief contributors to the field of mathematical programming, and as the creator of the simplex algorithm for linear programming, perhaps the most important algorithm developed in the 20th century. --"George Dantzig's impact on the theory of computation"--Karp, ibid. Dantzig "was one of the three founders of linear programming, a mathematical method used for the optimum allocation of scarce resources among competing activities [Dantzig] discovered that many such allocation problems could be formulated as linear computer programs" (Jeremy Norman, Origins of Cyberspace, 92) [++] Also in the issue with #2 is Alfred HAUSRATH, "Utilization of Negro Manpower in the Army", a foundation paper in equality and race relations.  The ORO (The Johns Hopkins University Operations Research Office) instituted a study in 1951 by a team of five analysts headed by Dr. Alfred Hausrath (a war games researcher) to study the effects of integration, part of which was published in the report "Utilization of Negro Manpower in the Army",  with the full three-volume publication of the study coming slightly later in 1954.   (Two earlier interim reports were issued in July and December 1951.) Basically, after everything was said and done, Hausrath and his team found that integrated units work much better than segregated units. The report "provided policymakers in the Army with the objective arguments in favor of integrated units", and the policy changes for full integration of the Army were issued just months after this report was rendered, in July 1951. This document was printed for the first time in a general format for OR folks in 1953.  (The term "landmark" was used to describe this paper in Saul Gass' "An Annotated Timeline of Operations Research," an Informal History, page 80.).…

Paperback. Condizione: Brand New. reprint edition. 728 pages. German language. 9.25x6.10x1.60 inches. In Stock.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering.

Paperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condizione: new. Questo è un articolo print on demand.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 732 pp. Deutsch.

Condizione: New. Print on Demand pp. 732 103 Figures, 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 732.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 1. Der Begriff der linearen Programmierung.- 1-1 Einfuehrung.- 1-2 Das Problem der Programmierung.- 1-3 Definition der linearen Programmierung.- 1-4 Klassifizierung von Programmierungsproblemen.- 1-5 Mathematische Programmierung und Automation.- 2. Urspruenge.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -1. Der Begriff der linearen Programmierung.- 1-1 Einführung.- 1-2 Das Problem der Programmierung.- 1-3 Definition der linearen Programmierung.- 1-4 Klassifizierung von Programmierungsproblemen.- 1-5 Mathematische Programmierung und Automation.- 2. Ursprünge und Einwirkungen.- 2-1 Einflüsse des zweiten Weltkrieges.- 2-2 Wirtschaftsmodelle und lineare Programmierung.- 2-3 Mathematische Ursprünge und Entwicklungen.- 2-4 Industrielle Anwendungen der linearen Programmierung.- 3. Aufstellung eines linearen Programmierungsmodells.- 3-1 Grundbegriffe.- 3-2 Konstruktion des Modells.- 3-3 Ein Transportproblem.- 3-4 Beispiele von Mischungsproblemen.- 3-5 Ein Problem der Mischung von Produkten.- 3-6 Ein einfaches Lagerhaltungsproblem.- 3-7 Ausbildung auf der Arbeitsstätte.- 3-8 Das mathematische Problem der linearen Programmierung.- 3-9 Probleme.- 4. Lineare Gleichungs- und Ungleichungssysteme.- 4-1 Systeme von Gleichungen mit der gleichen Lösungsmenge.- 4-2 Kanonische Systeme.- 4-3 Lineare Ungleichungen.- 4-4 Die Eliminationsmethode von FOURIER und MOTZKIN.- 4-5 Lineare Programme in Ungleichungsform.- 4-6 Probleme.- 5. Die Simplexmethode.- 5-1 Der Simplexalgorithmus.- 5-2 Die zwei Phasen der Simplexmethode.- 5-3 Probleme.- 6. Beweis des Simplexalgorithmus und des Dualitätssatzes.- 6-1 Induktiver Beweis des Simplexalgorithmus.- 6-2 Äquivalente duale Formen.- 6-3 Beweis des Dualitätssatzes.- 6-4 Fundamentalsätze über Dualität.- 6-5 Multiplikatoren von LAGRANGE.- 6-6 Probleme.- 7. Die Geometrie linearer Programme.- 7-1 Konvexe Gebiete.- 7-2 Die Simplexmethode als steilster Anstieg entlang der Kanten.- 7-3 Die Simplexinterpretation der Simplexmethode.- 7-4 Probleme.- 8. Pivot-Operationen, Vektorräume, Matrizen und ihre Inversen.- 8-1 Theorie der Pivots.- 8-2Vektorräume.- 8-3 Matrizen.- 8-4 Die Inverse einer Matrix.- 8-5 Der Simplexalgorithmus in Matrizenform.- 8-6 Probleme.- 9. Die Simplexmethode mit Benutzung von Multiplikatoren.- 9-1 Ein Beispiel mit Multiplikatoren.- 9-2 Die allgemeine Methode mit Benutzung von Multiplikatoren.- 9-3 Rechenregeln bei Benutzung von Multiplikatoren.- 9-4 Probleme.- 10. Endlichkeit der Simplexmethode bei Störung.- 10-1 Die Möglichkeit des Kreisens beim Simplexalgorithmus.- 10-2 Störung der Konstanten zur Vermeidung von Entartung.- 10-3 Probleme.- 11. Varianten des Simplexalgorithmus.- 11-1 Komplementäre primale und duale Basen.- 11-2 Die duale Simplexmethode.- 11-3 Ein selbstdualer parametrischer Algorithmus.- 11-4 Der primale-duale Algorithmus.- 11-5 Ein anderes Kriterium für Phase I.- 11-6 Probleme.- 12. Der Preisbegriff in der linearen Programmierung.- 12-1 Der Preismechanismus der Simplexmethode.- 12-2 Beispiele dualer Probleme.- 12-3 Die Vorzeichenvereinbarung bei Preisen.- 12-4 Erläuterung der Sensitivitätsanalyse.- 12-5 Probleme.- 13. Spiele und lineare Programme.- 13-1 Matrixspiele.- 13-2 Äquivalenz von Matrixspielen und linearen Programmen und der Minimaxsatz.- 13-3 Konstruktive Lösung eines Matrixspiels (ein anderer Beweis des Minimaxsatzes).- 13-4 Probleme.- 14. Das klassische Transportproblem.- 14-1 Geschichtliehe Übersieht.- 14-2 Elementare Transporttheorie.- 14-3 Algorithmus für das Transportproblem.- 14-4 Probleme.- 15. Optimale Zuordnung und andere Zuteilungsprobleme.- 15-1 Das Problem der optimalen Zuordnung.- 15-2 Zuordnung mit Überschuß und Defizit.- 15-3 Feste Werte und unzulässige Quadrate.- 15-4 Probleme.- 16. Das Umladeproblem.- 16-1 Eine äquivalente Formulierung des Modells.- 16-2 Die Äquivalenz von Transportproblemen und Umladeproblemen.- 16-3Lösung eines Umladeproblems durch die Simplexmethode.- 16-4 Probleme.- 17. Netzwerke und das Umladeproblem.- 17-1 Graphen und Bäume.- 17-2 Interpretation der Simplexmethode mit Hilfe des Netzwerks.- 17-3 Das Problem des kürzesten Weges.- 17-4 Probleme.- 18. Variablen mit oberen Grenzen.- 18-1 Der allgemeine Fall.- 18-2 Das Transportproblem mit beschränkten Variablen und Verallgemein.…