Geometry.Net - Scientists: Dantzig George


Home - Scientists - Dantzig George

e99.com Bookstore

Images

Newsgroups

61-80 of 94 Back | 1 | 2 | 3 | 4 | 5 | Next 20

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Dantzig George: more books (75)

Generalized upper bounding techniques-II by George Bernard Dantzig, 1965

A complementarity algorithm for an optimal capital path with invariant proportions (Research report / International Institute for Applied Systems Analysis) by George Bernard Dantzig, 1973

A decomposition principle for linear programs (Paper) by George Bernard Dantzig, 1959

Discrete-variable extremum problems (Notes on linear programming) by George B Dantzig, 1956

Symmetric dual nonlinear programs (I.E.R) by George Bernard Dantzig, 1962

The role of models in determining policy for transition to a more resilient technological society (IIASA distinguished lecture series) by George Bernard Dantzig, 1979

Formulating a linear programming model by George Bernard Dantzig, 1956

Comments on J. Von Neumann's "The problem of optimal assignment in a two-person game" (P-435) by George Bernard Dantzig, 1952

On the status of multistage linear programming problems by George Bernard Dantzig, 1957

Linear Programming and Extensions by George B.; Rand Cooperation Dantzig, 1963-01-01

Note on B. Klein's "direct use of extremal principles in solving certain problems involving inequalities" (Notes on linear programming) by George B Dantzig, 1957

Linear Programming and Extensions by George B. Dantzig, 1966-01-01

A linear programming approach to the chemical equilibrium problem by George Bernard Dantzig, 1958

Maximum payloads per unit time delivered through an air network (Mathematical note) by George Bernard Dantzig, 1963

lists with details

Computer-Pioneers-Contents
Curtis, Kent K. Curtiss, John H. Dahl, OleJohan. dantzig, george Bernard. Davidson,Charles H. Davies, Donald W. Dennard, Robert H. Denning, Peter J.
http://www.fitzroydearborn.com/Contents/CmpuPiCs.htm

Extractions: International Biographical Dictionary of Computer Pioneers Contents Introduction Adams, Jeanne Clare Aiken, Howard Hathaway Alexander, Samuel N. Al-Khowarizmi, Mukhammad ibn Musa Amdahl, Gene M. Andrews, Ernest Galen Astrahan, Morton Michael Atanasoff, John Vincent Atchison, William Auerbach, Isaac L. Babbage, Charles Bachman, Charles Backus, John Warner Baker, Charles L. Bardeen,John Barr, Joel Bauer, Friedrich L. Bech, Niels Ivar Belady, Laszlo A. Bell, Chester Gordon Bell, Gwen Bemer, Robert W. Berkeley, Edmund C. Berry, Clifford Edward Billing, Heinz Birkenstock, James Birkhoff, Garrett Bloch, Erich Boole, George Booth, Andrew Donald Booth, Taylor L. Bowden, Bertram Vivian Bradshaw, Charles L. Brainerd, John Grist Bright, Herbert S. Bromberg, Howard Brooker, Ralph Anthony Brooks, Frederick P., Jr. Brown, George H. Brown, Gordon S. Buie, James L. Burks, Alice R. Burks, Arthur Walter Bush, Vannevar E. Bushnell, Nolan Carlson, Walter M. Carr, John Weber III Chandler, W.W.
[MATEMAC] Dantzig Prize
math.uwaterloo.ca Category Awards CALL FOR NOMINATIONS FOR THE george B. dantzigPRIZE 2003 Nominations are solicited for the george B. dantzig Prize
http://listas.rcp.net.pe/pipermail/matemac/2002-August/000151.html

Extractions: Sat, 31 Aug 2002 07:55:24 -0500 This is a multi-part message in MIME format. =_NextPart_000_0019_01C250C3.C384CBA0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable http://optnet.itwm.fhg.de/opt-net/ (text-digest v02w35) -= - v02w35n1 Subject: N01: Dantzig Prize =20 Sender: whcunnin@pythagoras.math.uwaterloo.ca Category: Awards CALL FOR NOMINATIONS FOR THE GEORGE B. DANTZIG PRIZE 2003 Nominations are solicited for the George B. Dantzig Prize, administered jointly by the Mathematical Programming Society (MPS) and the Society = for Industrial and Applied Mathematics (SIAM). This prize is awarded to one = or more individuals for original research which by its originality, breadth and depth, is having a major impact on the field of mathematical programming. The contributions(s) for which the award is made must be publicly available and may belong to any aspect of mathematical programming in its broadest sense. Strong preference will be given to candidates that have not reached their 50th birthday in the year of the award. The prize will be presented at the Mathematical Programming Society's triennial symposium, to be held 18-22 August 2003 in Copenhagen. Past prize recipients are listed on the MPS Web site
Omega Rho Distinguished Lecture
george B. dantzig Professor of Operations Research Computer Science CoDirector,Systems Optimization Laboratory School of Engineering Stanford University.
http://www.cba.uc.edu/dept/qa/omega_rho/lecture/dantzig.htm

Extractions: http://www.stanford.edu/group/SOL/dantzig.html "Importance of Recent Developments in Linear Programming and Reminiscences About its Origin" George B. Dantzig George B. Dantzig, Professor of Operations Research and Computer Science at Stanford University, was the recipient of the National Medal of Science the nations highest science award. He earned the medal "for inventing linear programming and discovering methods that led to wide-scale scientific and the technical applications to important problems in logistics, scheduling, and network optimization, and to the us of computers in making efficient use of mathematical theory." Dr. Dantzig received the John von Neumann Theory Prize from ORSA and TIMS in 1975 for "fundamental contribution to the theory of operations research and management science." Last year, he received Phi Bet Kappa honors and an Honorary Doctor of Science degree from the University of Maryland. He has also received Honorary Doctorates from the Israel Institute of Technology and from the University of Linkoping, Sweden.
Untitled
Blumstein, Alfred. Charnes, Abraham. Chu, David SC. Cyert, Richard M. dantzig, georgeB. Geoffrion, Arthur M. Gomory, Ralph E. Keeney, Ralph L. Kozmetsky, george.
http://www.cba.uc.edu/dept/qa/Omega_Rho/HonoraryMembersofOmegaRho.htm

Extractions: Ackoff, Russell L. Arnoff, E. Leonard Blumstein, Alfred Charnes, Abraham Chu, David S. C. Cyert, Richard M. Dantzig, George B. Geoffrion, Arthur M. Gomory, Ralph E. Keeney, Ralph L. Kozmetsky, George Machol, Robert E. Marous, John C., Jr. Maxwell, William L. Murrin, Thomas J. Nemhauser, George L. Neuts, Marcel F. Pierskalla, William P. Prabhu, Narahari U. Pritsker A. Alan B. Simon, Herbert A. Thrall, Robert M. White, John A. Woolsey, R. Eugene
1860 Castle Garden Shipping
44..M..Seaman..Ireland THOMS, John..27..M..Steward..Bavaria DAVIS, William..47..M..Captain..MaineFRAZIER, James..24..M..Seaman..Maine dantzig, george..29..M
http://freepages.genealogy.rootsweb.com/~blkyn/Census/1860.CastleShipping.html
Dantzig, Fulkerson, And Johnson's Cutting-Plane Method For The TSP
A breakthrough in solution methods for the traveling salesman problem (TSP) camein 1954, when george dantzig, Ray Fulkerson, and Selmer Johnson 2 published
http://www.math.princeton.edu/tsp/dfj/

Extractions: Linear Programming FAQ A breakthrough in solution methods for the traveling salesman problem (TSP) came in 1954, when George Dantzig, Ray Fulkerson, and Selmer Johnson [2] published a description of a method for solving the TSP and illustrated the power of this method by solving an instance with 49 cities, an impressive size at that time. Riding the wave of excitement over the numerous applications of the simplex method (designed by George Dantzig in 1947), they attacked the salesman with linear programming as follows. Each TSP instance with n cities can be specified as a vector of length n(n-1)/2 (whose components, indexed by the edges of the complete graph, specify the costs) and each tour through the n cities can be represented as its incidence vector of length n(n-1)/2 (with each component set at 1 if the corresponding edge is a part of the tour, and set at otherwise); if denotes the cost vector (thought of as a row vector) and if denotes the set of the incidence vectors (thought of as column vectors) of all the tours, then the problem is to
INFORMS Inaugurates Fellows Award
Also receiving the award are National Medal of Technology recipient DonaldFrey and National Medal of Science recipient george dantzig.
http://www.eurekalert.org/pub_releases/2002-12/ifor-iif122602.php

Extractions: Institute for Operations Research and the Management Sciences LINTHICUM, MD - The Institute for Operations Research and the Management Sciences (INFORMS®), today announced 113 recipients of the INFORMS Fellows Award. This is the first year the award is being presented. Recipients include Nobel Prize winners Kenneth Arrow, Harry Markowitz, and John Nash. Also receiving the award are National Medal of Technology recipient Donald Frey and National Medal of Science recipient George Dantzig. Arrow, Markowitz, Nash, and Dantzig have all received the society's John Von Neumann Theory Prize, and Kenneth Arrow is a past President of the Society. The Fellows Award is designed to recognize outstanding achievements in at least one of five areas: The initial 113 awardees included all past presidents of the society and its predecessor societies, the Operations Research Society of America (ORSA) and The Institute of Management Sciences (TIMS), as well as all previous recipients of the Society's Von Neumann Prize for fundamental theoretical contributions and the George E. Kimball Medal for service to the profession. INFORMS members who were previously inducted into the National Academy of Sciences or the National Academy of Engineering also received the award. Subsequent Fellow Awardees will be determined by a subcommittee of the current Fellow Awardees.
Saturday's Devotion
The man was a mathematician named george dantzig. But on the day of thefinal exam, george dantzig overslept. He got to the exam late.
http://www.devotions.net/devotions/files/1999/08aug21.htm

Extractions: (Mark 10:27 NRSV Dr. Robert Schuller, who is known for his emphasis on positive thinking or possibility thinking as he calls it, tells about a man he once met on a flight to Los Angeles. The man was a mathematician named George Dantzig. Schuller made the observation to Dantzig that this was the first time it had occurred to him that there was a field of endeavor to which positive thinking didn't apply. Mathematical problems have only one right answer, so they can't be affected in any way by how a person thinks. Dantzig said Schuller was wrong. Dantzig explained that during the Depression he had been a student of mathematics at the University of California-Berkeley. People were hungry and desperate for any job they could get. Dantzig, along with all his other classmates, desperately wanted the job of assistant teacher in the math department. Rumor had it that the person who scored the highest grade in a certain math course would get the job. Dantzig worked unbelievably hard in this one class. He was determined to be the high scorer. But on the day of the final exam, George Dantzig overslept. He got to the exam late. The teacher handed Dantzig a piece of paper with eight math problems on it. Dantzig thought he could handle those eight problems just fine, but then he noticed two more problems on the board. He finished the eight problems in the time allotted, but asked the professor for extra time to finish the last two. The professor gave him an extension on his exam.
George Trotman
In Memory of. george TROTMAN. Commemorative Information. Cemetery dantzig ALLEYBRITISH CEMETERY, MAMETZ, Somme, France More information on dantzig Cemetery.
http://www.easywell.co.uk/wfh/hillesleymemorial/g-trotman.htm
[DMANET] Dantzig Prize
CALL FOR NOMINATIONS FOR THE george B. dantzig PRIZE 2003 Nominations are solicitedfor the george B. dantzig Prize, administered jointly by the Mathematical
http://www.zpr.uni-koeln.de/pipermail/dmanet/2002-August/000913.html

Extractions: Sun, 25 Aug 2002 17:02:39 -0400 (EDT) CALL FOR NOMINATIONS FOR THE GEORGE B. DANTZIG PRIZE 2003 Nominations are solicited for the George B. Dantzig Prize, administered jointly by the Mathematical Programming Society (MPS) and the Society for Industrial and Applied Mathematics (SIAM). This prize is awarded to one or more individuals for original research which by its originality, breadth and depth, is having a major impact on the field of mathematical programming. The contributions(s) for which the award is made must be publicly available and may belong to any aspect of mathematical programming in its broadest sense. Strong preference will be given to candidates that have not reached their 50th birthday in the year of the award. The prize will be presented at the Mathematical Programming Society's triennial symposium, to be held 18-22 August 2003 in Copenhagen. Past prize recipients are listed on the MPS Web site http://www.mathprog.org/
Mathematical Programming Society Prizes
endowment. Theses funds are to be sent directly to SIAM, to be contributedto the george B. dantzig Prize Fund in care of SIAM.
http://www.mathprog.org/prz/dantzig.htm

Extractions: Dantzig Prize ... Prize Bylaws The Dantzig Prize The prize is awarded jointly by the Mathematical Programming Society (MPS) and the Society for Industrial and Applied Amthematics (SIAM). The prize is awarded for original research, which by its originality, breadth and depth, is having a major impact on the field of mathematical programming. The contributions(s) for which the award is made must be publicly available and may belong to any aspect of mathematical programming in its broadest sense. Strong preference will be given to candidates that have not reached their 50th birthday in the year of the award. There will be an ad hoc Prize Committee appointed for each award jointly by the Chairman of MPS and the President of SIAM. The committee will consist of four members, one designated 'chair' by the Chair of MPS, and it will represent a diversified view of mathematical programming. Committee appointments should be made at least two years before the prize award date. The MPS has the responsibility to notify its Chair and the President of SIAM to make the appointments. For continuity, committee members will normally serve on two successive prize committees with the committee chairman being a seond-term member. Thus two new members will be appointed and two members will be reappointed every three years. Committee members will be members of MPS and/or SIAM. At least two members of the committee will be MPS members and at least two will be members of SIAM. The membership of the committee should also reflect the international character of the societies.
The Potential Role Of An Artificial Psychologist Within An
The system that resulted from this study was named george, in honorof the inventor of the simplex method george dantzig. george
http://archive.wcape.school.za/conf97/proceed/adp1.htm

Extractions: Alten du Plessis A general framework for the development of intelligent, learning style- and computer-based educational software was constructed and applied to linear programming. The system that resulted from this study was named GEORGE, in honor of the inventor of the simplex method George Dantzig. GEORGE utilizes a fuzzy interpretation of Neethling's Brain Profile Test and a model of teaching and learning that is based on left and right brain preferences to determine a student's learning and teaching style preferences. An individualized tutoring strategy is then computed and used to present the course material to the student. A whole range of modes of presentation can be included in such a strategy, from drill-and-practice exercises, demonstrations and step-by-step tutorials to flow- and step charts and point-and-query interfaces. GEORGE keeps a practical and effective student model and controls the tutoring with a domain- and motivational based planner. GEORGE consists of six modules, namely a problem solving or domain expert module, a generic questioning module, a presentation module, an "artificial psychologist" module, a student model module and a tutorial module. The goal of this presentation will be to spell out the potential role of the "artificial psychologist" within the proposed tutoring environment.
1980-1999
1983/5/17, Asimov, Isaac, Sc.D. 1983/5/17, Cary, William L. (posthumous),LL.D. 1983/5/17, dantzig, george B. Sc.D. 1983/5/17, Frye, Northrop, Litt.D.
http://www.columbia.edu/cu/ceremonies/commencement/notes/honorary/89.htm

Extractions: Cavalli-Sforza, L. L. Sc.D. Derrida, Jacques Litt.D. Miller, George A. Sc.D. Borlaug, Norman E. Sc.D. Buhler, Curt F. Litt.D. Chinn, Mary Edward Sc.D. Cotton, F. Albert Sc.D. Fitch, James Marston Litt.D. Pei, Ieoh Ming L.H.D. Petersen, William E. LL.D. Robinson, Prezell Russell LL.D. Rose, Harry M. Sc.D. Sovern, Michael I. LL.D. Woodcock, Leonard LL.D. Shange, Ntozake Medal Friedrichs, Kurt O. Sc.D. Lilley, Robert D. LL.D. Luening, Otto Litt.D. Naipaul, V. S. L.H.D. Raphaelson, Samson L.H.D. Ricoeur, Paul Litt.D. Ruben, Samuel Sc.D. Sills, Beverly Mus.D. Warren, William C. LL.D. Wise, George Schneiweis LL.D. Gould, Stephen J. Medal Josephson, Mark E. Medal Pertini, Alessandro LL.D. Delacorte, George T., Jr. LL.D. Donhoff, Marion LL.D. Ginzberg, Eli Litt.D. Hoffmann, Roald Sc.D. Krim, Arthur B. LL.D. Southern, Sir Richard W. Litt.D. Welty, Eudora L.H.D. Wu, Chein-Shiung Sc.D. Tutu, Bishop Desmond M. S.T.D. Fung, Yu-Lan Litt.D. Moore, J. Emerson Medal Simon, Herbert A. Sc.D. Asimov, Isaac Sc.D. Cary, William L. (posthumous) LL.D. Dantzig, George B. Sc.D. Frye, Northrop Litt.D. Greene, Jerome L.
CDE
Damrosch, Walter Johannes, Mus.D. 1914. Daniell, Lucetta, Medal, 1933. dantzig,george B. Sc.D. 1983/5/17. Darden, Colgate Whitehead, Jr. LL.D. 1948/6/1.
http://www.columbia.edu/cu/ceremonies/commencement/notes/honorary/cde.htm

Extractions: Cabanel, Benjamin A.M. Cadman, Reverend Samuel Parkes S.T.D. Caetani, Don Gelasio Benedetto Anatolio LL.D. Caffey, Francis Gordon LL.D. Cahill, George Francis Sc.D. Calderone, Mary Steichen Sc.D. Calkins, Gary Nathan Sc.D. Calkins, Mary Whiton Litt.D. Calvin, Melvin Sc.D. Campbell, Joseph LL.D. Campbell, William Sc.D. Campbell, William Wallace Sc.D. Cardozo, Benjamin Nathan LL.D. Carey, Hugh LL.D. Carman, Harry J. LL.D. Carr, Sir Cecil Thomas LL.D. Carr, William L.H.D. Carr-Saunders, Sir Alexander Morris LL.D. Carrel, Alexis Sc.D. Cartier de Marchienne, Baron de LL.D. Cary, Frank T. LL.D. Cary, William L. (posthumous) LL.D. Casals, Pablo L.H.D. Case, Clifford Philip LL.D. Casimir, Hendrik B. G. Sc.D. Castillejo y Duarte, José Litt.D. Castillo Armas, Carlos LL.D. Cates, Louis Shattuck Sc.D. Cather, Willa Litt.D. Catton, Bruce Litt.D. Cauldwell, John Britton A.M. Cavalli-Sforza, L. L. Sc.D. Chadwick, Owen Litt.D. Chamberlain, Joseph Perkins LL.D. Chambers, Julius L. Medal Chandler, Charles Frederick LL.D. Channing, Edward Litt.D. Channing, John Parke M.S. Chapin, Francis Stuart Medal Chapin, Henry Dwight
IMS Fellows
D, Dabrowska, Dorota Dahlhaus, Rainer Dalenius, Tore Daley, Daryl J. Daly, JosephF. Daniel, Cuthbert Daniels, Henry E. dantzig, george B. Darling, Donald A
http://www.imstat.org/awards_honored_fellows.htm
Linear Programming And Extensions
inear Programming and Extensions by george B. dantzig Paperback 648pages (August 3, 1998). Linear Programming and Extensions.
http://www.sanctury.com/book/0/224/0691059136.html
What Is OR
dantzig, george B., Linear Programming and Extensions, Princeton University Press,1963, ISBN 0691080003. The most widely cited early textbook in the field.
http://math.nicholls.edu/badie/WhatIsLP.html

Extractions: x i where, C is a vector of known constants, X is a vector of unknown variables, A is a matrix of known coefficients, and b is a vector of known values. The expression Z=C T LP Problem: An LP problem is an optimization problem for which the objective is to maximize (or minimize) a linear function of some well defined variables (known as decision variables) subject to a set of linear constraints LP has many applications in business oriented problems. Two families of solution techniques are in wide use today. Both are based on a progressively improving series of trial solutions, until a solution is reached that satisfies the conditions for an optimum. Simplex Methods: The simplex algorithm (or method) was introduced by Dr. George B. Dantzig in late 1940's. Barrier or Interior-point Methods: These methods derive from techniques for nonlinear programming that were developed and popularized in the 1960s by Fiacco and McCormick, but their application to linear programming dates back only to Dr. N. Karmarkar's innovative analysis in 1984 (Karmarkar, N. "A new Polynomial-Time Algorithm for linear Programming." Combinatorica 4 (1984), 373-395.)
Smart Computing-Editorial
george Bernard dantzig Since 1979, the Mathematical Programming Society (SIAM)has also honored dantzig by awarding the george B. dantzig Prize.
http://www.smartcomputing.com/editcat/SMART/OTHER SUBJECTS OF INTEREST/176/19190

Extractions: Ole-Johan Dahl co-developed the SIMULA programming language with fellow Norwegian computer scientist, Kristen Nygaard, in the mid-1960s. SIMULA was originally designed for use in discrete event simulation, but it was later redesigned as a full-scale programming language. Although never widely used in the United States, SIMULA was an important European computer-based simulation tool in the 1960s and early 1970s. It introduced many object-oriented concepts, such as classes, objects, inheritance and dynamic binding, which are found in modern programming languages and operating systems, such as Windows, C++, and Java. Dahl was born in 1931 in Mandal, Norway. He continued his education at the University of Oslo and received his master of science degree in 1957. His masters thesis, Numerical Mathematics, addressed the representation and manipulation of multidimensional arrays in a computer, and it was one of the first European works dedicated to computer science. In 1968, Dahl returned to the university as professor of computer science, which was a new offering at the school at the time.
The Science Bookstore - Books
(Book ID 12125) $115.00. dantzig, george. Linear ProgrammingOriginalOffprint. 1947. dantzig, george B. Linear Programming.
http://www.thesciencebookstore.com/bookmain.asp?pg=2&bookcat=Mathematics
Basic Library List-Modeling And Operations Research
dantzig, george B. and Eaves, BC, eds. ** dantzig, george B. Linear Programmingand Extensions Princeton, NJ Princeton University Press, 1963.
http://www.maa.org/BLL/modelingor.htm

Extractions: Back to Table of Contents * Daellenbach, Hans G. and George, John A. Introduction to Operations Research Techniques Boston, MA: Allyn and Bacon, 1978. * Dantzig, George B. and Eaves, B.C., eds. Studies in Optimization Washington, DC: Mathematical Association of America, 1974. Foulds, L.R. Combinatorial Optimization for Undergraduates New York, NY: Springer-Verlag, 1984. French, Simon. Readings in Decision Analysis New York, NY: Chapman and Hall, 1989. * Gass, Saul I. Decision Making, Models, and Algorithms: A First Course New York, NY: John Wiley, 1985. Gribik, Paul R. and Kortanek, Kenneth O. Extremal Methods of Operations Research New York, NY: Marcel Dekker, 1985. *** Hillier, Frederick S. and Lieberman, Gerald J. Introduction to Operations Research, New York, NY: McGraw-Hill, 1990. Fifth Edition. Marlow, W.H. Mathematics for Operations Research New York, NY: John Wiley, 1978. Schmidt, J. William and Davis, Robert P. Foundations of Analysis in Operations Research New York, NY: Academic Press, 1981.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

61-80 of 94 Back | 1 | 2 | 3 | 4 | 5 | Next 20