Linear Programming

Total Page:16

File Type:pdf, Size:1020Kb

Linear Programming LINEAR PROGRAMMING GEORGE B. DANTZIG Department of Management Science and Engineering, Stanford University, Stanford, California 94305-4023 The Story About How It Began: Some legends, a little the transportation problem was also overlooked until after about its historical significance, and comments about where others in the late 1940’s and early 1950’s had independently its many mathematical programming extensions may be rediscovered its properties. headed. What seems to characterize the pre-1947 era was lack of any interest in trying to optimize. T. Motzkin in his schol- inear programming can be viewed as part of a great arly thesis written in 1936 cites only 42 papers on linear Lrevolutionary development which has given mankind inequality systems, none of which mentioned an objective the ability to state general goals and to lay out a path of function. detailed decisions to take in order to “best” achieve its goals The major influences of the pre-1947 era were Leon- when faced with practical situations of great complexity. tief’s work on the Input-Output Model of the Economy Our tools for doing this are ways to formulate real-world (1933), an important paper by von Neumann on Game The- problems in detailed mathematical terms (models), tech- ory (1928), and another by him on steady economic growth niques for solving the models (algorithms), and engines for (1937). executing the steps of algorithms (computers and software). My own contributions grew out of my World War II This ability began in 1947, shortly after World War II, experience in the Pentagon. During the war period (1941– and has been keeping pace ever since with the extraordinary 45), I had become an expert on programming-planning growth of computing power. So rapid has been the advance methods using desk calculators. In 1946 I was Mathemat- in decision science that few remember the contributions of ical Advisor to the US Air Force Comptroller in the Pen- the great pioneers that started it all. Some of their names tagon. I had just received my PhD (for research I had are von Neumann, Kantorovich, Leontief, and Koopmans. done mostly before the war) and was looking for an aca- The first two were famous mathematicians. The last three demic position that would pay better than a low offer I received the Nobel Prize in economics. had received from Berkeley. In order to entice me to not In the years from the time when it was first proposed take another job, my Pentagon colleagues, D. Hitchcock in 1947 by the author (in connection with the planning and M. Wood, challenged me to see what I could do to activities of the military), linear programming and its many mechanize the planning process. I was asked to find a way extensions have come into wide use. In academic circles to more rapidly compute a time-staged deployment, train- decision scientists (operations researchers and management ing and logistical supply program. In those days “mecha- scientists), as well as numerical analysts, mathematicians, nizing” planning meant using analog devices or punch-card and economists have written hundreds of books and an equipment. There were no electronic computers. uncountable number of articles on the subject. Consistent with my training as a mathematician, I set Curiously, in spite of its wide applicability today to out to formulate a model. I was fascinated by the work of everyday problems, it was unknown prior to 1947. This Wassily Leontief who proposed in 1932 a large but simple is not quite correct; there were some isolated exceptions. matrix structure which he called the Interindustry Input- Fourier (of Fourier series fame) in 1823 and the well- Output Model of the American Economy. It was simple in known Belgian mathematician de la Vallée Poussin in 1911 concept and could be implemented in sufficient detail to each wrote a paper about it, but that was about it. Their be useful for practical planning. I greatly admired Leontief work had as much influence on Post-1947 developments as for having taken the three steps necessary to achieve a suc- would finding in an Egyptian tomb an electronic computer cessful application: built in 3000 BC. Leonid Kantorovich’s remarkable 1939 1. Formulating the inter-industry model. monograph on the subject was also neglected for ideolog- 2. Collecting the input data during the Great Depression. ical reasons in the USSR. It was resurrected two decades 3. Convincing policy makers to use the output. later after the major developments had already taken place Leontief received the Nobel Prize in 1976 for developing in the West. An excellent paper by Hitchcock in 1941 on the input-output model. Subject classification: Professional: comments on. Area of review: Anniversary Issue (Special). Operations Research © 2002 INFORMS 0030-364X/02/5001-0042 $05.00 Vol. 50, No. 1, January–February 2002, pp. 42–47 42 1526-5463 electronic ISSN Dantzig / 43 For the purpose I had in mind, however, I saw that Leon- disadvantages, that it would be impossible to compare all tief’s model had to be generalized. His was a steady-state the cases and choose which among them would be the best. model and what the Air Force wanted was a highly dynamic Invariably, man in the past has turned to a leader whose model, one that could change over time. In Leontief’s ‘experience’ and ‘mature judgment’ would guide the way. model there was a one-to-one correspondence between the Those in charge like to do this by issuing a series of ground production processes and the items being produced by these rules (edicts) to be executed by those developing the plan. processes. What was needed was a model with alternative This was the situation prior to 1946. In place of an activities. Finally it had to be computable. Once the model explicit goal or objective function, there were a large num- was formulated, there had to be a practical way to com- ber of ad hoc ground rules issued by those in authority to pute what quantities of these activities to engage in that guide the selection. Without such rules, there would have was consistent with their respective input-output character- been, in most cases, an astronomical number of feasible istics and with given resources. This would be no mean solutions to choose from. Incidentally, “Expert System” task since the military application had to be large scale, software which is very much in vogue today makes use of with thousands of items and activities. this ad hoc ground-rule approach. The activity analysis model I formulated would be All that I have related up to now about the early devel- described today as a time-staged, dynamic linear program opment took place before the advent of the computer, more with a staircase matrix structure. Initially there was no precisely, before in late 1946 we were aware that the com- objective function; broad goals were never stated explic- puter was going to exist. But once we were aware, the com- itly in those days because practical planners simply had no puter became vital to our mechanization of the planning waytoimplement such a concept. Noncomputability was process. So vital was the computer, that our group arranged the chief reason, I believe, for the total lack of interest in (in the late 1940’s) that the Pentagon fund the development optimization prior to 1947. of computers. To digress for a moment, I would like to say a few words A simple example may serve to illustrate the fundamen- about the electronic computer itself. To me, and I suppose tal difficulty of finding a solution to a planning problem to all of us, one of the most startling developments of all once it is formulated. Consider the problem of assigning time has been the penetration of the computer into almost 70 men to 70 jobs. Suppose a value or benefit v would ij every phase of human activity. Before a computer can be result if the ith man is assigned to the jth job. An activity intelligently used, a model must be formulated and good consists in assigning the ith man to the jth job. The restric- algorithms developed. To build a model, however, requires tion are: (i) each man must be assigned a job (there are 70 the axiomatization of a subject matter field. In time this such), and (ii) each job must be filled (also 70). The level axiomatization gives rise to a whole new mathematical dis- of an activity is either 1, meaning it will be used, or 0, cipline which is then studied for its own sake. Thus, with × meaning it will not. Thus there are 2 70 or 140 restric- each new penetration of the computer, a new science is × tions, 70 70 or 4900 activities with 4900 corresponding born. 0-1 decision variables xij . Unfortunately there are 70! dif- Von Neumann notes this tendency to axiomatize in his ferent possible solutions or ways to make the assignments paper on The General and Logical Theory of Automata.In xij . The problem is to compare the 70! solutions with one it he states that automata have been playing a continuously another and to select the one which results in the largest increasing role in science. He goes on to say: sum of benefits from the assignments. Now 70! is a big number, greater than 10100. Suppose we Automata have begun to invade certain parts of math- had a computer capable of doing a million calculations per ematics too, particularly but not exclusively mathemat- ical physics or applied mathematics. The natural sys- second available at the time of the big bang fifteen billion tems (e.g., central nervous system) are of enormous years ago.
Recommended publications
  • The Original Version of This Chapter Was Revised: the Copyright Line Was Incorrect
    The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35615-0_52 D. Passey et al. (eds.), TelE-Learning © IFIP International Federation for Information Processing 2002 62 Yakov I. Fet. scientists from CEE countries, including two distinguished Russian scientists, Sergey Lebedev, who 'designed and constructed the first computer in the Soviet Union and founded the Soviet computer industry' , and Aleksey Lyapunov, who 'developed the first theory of operator methods for abstract programming and founded Soviet cybernetics and programming' (IEEE Computer, 1998; IEE Annals of the History of Computing, 1999). Of course, this reward recognised the important contribution of scientists and engineers from Central and Eastern Europe who played a significant role. However, in our opinion, it was just the first step in exploring and publishing this contradictory history which is of particular interest. It can serve a critical lesson to teachers and students who should learn the truth about suppressing an understanding of cybernetics and other advanced modem sciences behind the 'iron curtain'. What can be done today in order to make familiar to the world computer community the true history of computer science in CEE countries? Recently, a special group of Russian experts started their investigations in this field. The first result of their efforts was the book 'Essays on the History of computer science in Russia' (Pospelov and Fet, 1998) published in 1998 in Novosibirsk, Russia. In contrast to historical and biographical writings reflecting to a great extent the personal views of their authors, this book is built completely on the basis of authentic documents of the epoch.
    [Show full text]
  • Curriculum Vitæ
    Aleksandr M. Kazachkov May 30, 2021 Contact Department of Industrial and Systems Engineering Website akazachk.github.io Information Herbert Wertheim College of Engineering Email akazachkov@ufl.edu 303 Weil Hall, P.O. Box 116595 Office 401B Weil Hall Gainesville, FL 32611-6595, USA Phone +1.352.273.4902 Research Discrete optimization, including theoretical, methodological, and applied aspects, with an emphasis on devel- Interests oping better cutting plane techniques and open-source computational contributions Computational economics, particularly on the fair allocation of indivisible resources and fair mechanism design Social good applications, such as humanitarian logistics and donation distribution Academic University of Florida, Department of Industrial and Systems Engineering, Gainesville, FL, USA Positions Assistant Professor January 2021 – Present Courtesy Assistant Professor March 2020 – December 2020 Polytechnique Montréal, Department of Mathematics and Industrial Engineering, Montréal, QC, Canada Postdoctoral Researcher under Andrea Lodi May 2018 – December 2020 Education Carnegie Mellon University, Tepper School of Business, Pittsburgh, PA, USA Ph.D. in Algorithms, Combinatorics, and Optimization under Egon Balas May 2018 Dissertation: Non-Recursive Cut Generation M.S. in Algorithms, Combinatorics, and Optimization May 2013 Cornell University, College of Engineering, Ithaca, NY, USA B.S. in Operations Research and Engineering with Honors, Magna Cum Laude May 2011 Publications [1] P.I. Frazier and A.M. Kazachkov. “Guessing Preferences: A New Approach to Multi-Attribute Ranking and Selection”, Winter Simulation Conference, 2011. [2] J. Karp, A.M. Kazachkov, and A.D. Procaccia. “Envy-Free Division of Sellable Goods”, AAAI Conference on Artificial Intelligence, 2014. [3] J.P. Dickerson, A.M. Kazachkov, A.D. Procaccia, and T.
    [Show full text]
  • Journal of Economics and Management
    Journal of Economics and Management ISSN 1732-1948 Vol. 39 (1) 2020 Sylwia Bąk https://orcid.org/0000-0003-4398-0865 Institute of Economics, Finance and Management Faculty of Management and Social Communication Jagiellonian University, Cracow, Poland [email protected] The problem of uncertainty and risk as a subject of research of the Nobel Prize Laureates in Economic Sciences Accepted by Editor Ewa Ziemba | Received: June 27, 2019 | Revised: October 29, 2019 | Accepted: November 8, 2019. Abstract Aim/purpose – The main aim of the present paper is to identify the problem of uncer- tainty and risk in research carried out by the Nobel Prize Laureates in Economic Sciences and its analysis by disciplines/sub-disciplines represented by the awarded researchers. Design/methodology/approach – The paper rests on the literature analysis, mostly analysis of research achievements of the Nobel Prize Laureates in Economic Sciences. Findings – Studies have determined that research on uncertainty and risk is carried out in many disciplines and sub-disciplines of economic sciences. In addition, it has been established that a number of researchers among the Nobel Prize laureates in the field of economic sciences, take into account the issues of uncertainty and risk. The analysis showed that researchers selected from the Nobel Prize laureates have made a significant contribution to raising awareness of the importance of uncertainty and risk in many areas of the functioning of individuals, enterprises and national economies. Research implications/limitations – Research analysis was based on a selected group of scientific research – Laureates of the Nobel Prize in Economic Sciences. However, thus confirmed ground-breaking and momentous nature of the research findings of this group of authors justifies the selective choice of the analysed research material.
    [Show full text]
  • Initial Feasible Origin: 1. Set Values of Original Variables to Zero. 2. Set Values of Slack Variables According to the Dictionary
    Initial feasible origin: 1. Set values of original variables to zero. 2. Set values of slack variables according to the dictionary. The problems we have solved so far always had an initial feasible origin. 1. Make up one problem which does NOT have an initial feasible origin. 2.What do you look at in the initial problem to tell if there is an initial feasible origin or not? 1 Office hours: MWR 4:20-5:30 inside or just outside Elliott 162- tell me in class that you would like to attend. For those of you who cannot stay: MWR: 1:30-2:30pm. But let me know 24 hours in advance you would like me to come in early. We will meet outside Elliott 162- Please estimate the length of time you require. I am also very happy to provide e-mail help: ([email protected]). Important note: to ensure your e-mail gets through the spam filter, use your UVic account. I answer all e-mails that I receive from my students. 2 George Dantzig: Founder of the Simplex method. http://wiki.hsc.com/wiki/Main/ConvexOptimization 3 In Dantzig’s own words: During my first year at Berkeley I arrived late one day to one of Neyman's classes. On the blackboard were two problems which I assumed had been assigned for homework. I copied them down. A few days later I apologized to Neyman for taking so long to do the homework - the problems seemed to be a little harder to do than usual. I asked him if he still wanted the work.
    [Show full text]
  • 2019 Contents 2019
    mathematical sciences news 2019 contents 2019 Editor-in-Chief Tom Bohman Contributing Writers Letter from Department 03 Tom Bohman Head, Tom Bohman Jocelyn Duffy Bruce Gerson Florian Frick 04 Ben Panko Emily Payne Faculty Notes Ann Lyon Ritchie Franziska Weber Graphic Design and Photography 10 Carnegie Mellon University Expanding the Boundaries on Marketing & Communications Summer Undergraduate Research Mellon College of Science Communications 14 Carnegie Mellon University Frick's Fellowship Department of Mathematical Sciences Wean Hall 6113 Pittsburgh, PA 15213 20 cmu.edu/math In Memorium Carnegie Mellon University does not discriminate in admission, employment, or administration of its programs or activities on the basis of race, color, national origin, sex, 24 handicap or disability, age, sexual orientation, gender identity, religion, creed, ancestry, belief, veteran status, or genetic information. Furthermore, Carnegie Mellon University does Alumni News not discriminate and is required not to discriminate in violation of federal, state, or local laws or executive orders. Inquiries concerning the application of and compliance with this statement should be directed to the university ombudsman, Carnegie Mellon University, 5000 Forbes 26 Avenue, Pittsburgh, PA 15213, telephone 412-268-1018. Obtain general information about Carnegie Mellon University Student News by calling 412-268-2000. Produced for the Department of Mathematical Sciences by Marketing & Communications, November, 2019, 20-137. ©2019 Carnegie Mellon University, All rights reserved. No 30 part of this publication may be reproduced in any form without written permission from Carnegie Mellon University's Department of Mathematical Sciences. Class of 2019 1 Letter from Mathematics Department Head, Tom Bohman Undergraduate research has become a hallmark of a Carnegie Mellon University education, with students citing that it has helped to prepare them for their futures in academia and the workforce.
    [Show full text]
  • Leonid Vitaliyevich Kantorovich [Ideological Profiles of the Economics Laureates] Daniel B
    Leonid Vitaliyevich Kantorovich [Ideological Profiles of the Economics Laureates] Daniel B. Klein, Ryan Daza, and Hannah Mead Econ Journal Watch 10(3), September 2013: 385-388 Abstract Leonid Vitaliyevich Kantorovich is among the 71 individuals who were awarded the Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred Nobel between 1969 and 2012. This ideological profile is part of the project called “The Ideological Migration of the Economics Laureates,” which fills the September 2013 issue of Econ Journal Watch. Keywords Classical liberalism, economists, Nobel Prize in economics, ideology, ideological migration, intellectual biography. JEL classification A11, A13, B2, B3 Link to this document http://econjwatch.org/file_download/734/KantorovichIPEL.pdf IDEOLOGICAL PROFILES OF THE ECONOMICS LAUREATES Shea, Christopher. 2011. Daniel Kahneman’s Politics. Ideas Market, Wall Street Journal, October 28. Link Thaler, Richard H., and Cass R. Sunstein. 2008. Nudge: Improving Decisions About Health, Wealth, and Happiness. New Haven, Conn.: Yale University Press. Leonid Vitaliyevich Kantorovich by Daniel B. Klein, Ryan Daza, and Hannah Mead Leonid V. Kantorovich (1912–1986) was born in Tsarist Russia to an affluent Jewish family; when he was 12 years old, his native city was renamed Leningrad. Kantorovich had a talent for mathematics and finished high school early at age 14 to enter Leningrad University. He graduated in 1930, then received a professorship in 1934 and finally his doctorate in mathematics in 1935 (Kantorovich 1992/1976b)—all by the age of 23. Kantorovich began his career as a mathematics professor, but forayed into economics in the late 1930s, when he began working on complex problems of resource allocation (Kantorovich 1992/1976b).
    [Show full text]
  • The Mystery of Growth Mechanism in a Centrally Planned Economy: Planning Process and Economics of Shortages
    Munich Personal RePEc Archive The mystery of growth mechanism in a centrally planned economy: Planning process and economics of shortages Popov, Vladimir 20 June 2020 Online at https://mpra.ub.uni-muenchen.de/101300/ MPRA Paper No. 101300, posted 02 Jul 2020 08:55 UTC The mystery of growth mechanism in a centrally planned economy: Planning process and economics of shortages Vladimir Popov ABSTRACT Since the economic calculation debate of the 1920-30s, it is known that it is impossible to create a coherent balanced plan that equates supply and demand of millions of goods and services in the national economy, not to speak about the optimal plan. It is not well understood, though, how the centrally planned economy (CPE) really functioned and what were the real determinants of their growth rates, if not the planned indicators. It was shown that forecasts of growth rates based on the extrapolation of past trends were better correlated with actual performance than planned indicators, but it is still unclear what was the real mechanism of growth of CPE and what was the role of the planning process in it. The hypothesis in this paper is that the drivers of growth in the CPE were the major investment projects initiated by the planners. They led to shortages of supplies, which triggered creeping price increases for scarce goods, which in turn boosted profitability in respective industries allowing them to increase output. De facto it was a market economy multiplier process – fiscal and monetary expansion leading to the price and output increases that eventually balanced supply and demand.
    [Show full text]
  • On the Depth of Cutting Planes
    On the depth of cutting planes Laurent Poirrier, James Yu∗ flpoirrier,[email protected] March 12, 2019 Abstract We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical strength of cutting planes. In particular, we show that its value lies in a well-defined interval, and we give parametric upper bounds on the depth of two prominent types of cutting planes: split cuts and intersection cuts from a simplex tableau. Interestingly, these parametric bounds can help explain behaviors that have been observed computationally. For polyhedra, the depth of an individual cutting plane can be computed in polynomial time through an LP formulation, and we show that it can be computed in closed form in the case of corner polyhedra. 1 Introduction Cutting planes (also called valid inequalities or cuts) have proven computationally useful since the very early history of Integer Programming (IP). In the pioneering work of Dantzig, Fulkerson and Johnson [10] on the traveling salesman problem, cutting planes were the main computational tool alongside the simplex method. They were initially less successful for general IP problems, where they were largely outperformed by Land and Doig's branch-and-bound method [23]. However, in the mid-nineties, Balas, Ceria and Cornu´ejols[2] proposed combining the two: first adding a few rounds of cuts, before resorting to branch-and-bound. Since then, cutting planes have become a central component of IP solvers [3], the most effective single families of cuts being Gomory's Mixed-Integer (GMI) cuts [19], and Nemhauser and Wolsey's Mixed-Integer Rounding (MIR) cuts [24, 25].
    [Show full text]
  • Ideological Profiles of the Economics Laureates · Econ Journal Watch
    Discuss this article at Journaltalk: http://journaltalk.net/articles/5811 ECON JOURNAL WATCH 10(3) September 2013: 255-682 Ideological Profiles of the Economics Laureates LINK TO ABSTRACT This document contains ideological profiles of the 71 Nobel laureates in economics, 1969–2012. It is the chief part of the project called “Ideological Migration of the Economics Laureates,” presented in the September 2013 issue of Econ Journal Watch. A formal table of contents for this document begins on the next page. The document can also be navigated by clicking on a laureate’s name in the table below to jump to his or her profile (and at the bottom of every page there is a link back to this navigation table). Navigation Table Akerlof Allais Arrow Aumann Becker Buchanan Coase Debreu Diamond Engle Fogel Friedman Frisch Granger Haavelmo Harsanyi Hayek Heckman Hicks Hurwicz Kahneman Kantorovich Klein Koopmans Krugman Kuznets Kydland Leontief Lewis Lucas Markowitz Maskin McFadden Meade Merton Miller Mirrlees Modigliani Mortensen Mundell Myerson Myrdal Nash North Ohlin Ostrom Phelps Pissarides Prescott Roth Samuelson Sargent Schelling Scholes Schultz Selten Sen Shapley Sharpe Simon Sims Smith Solow Spence Stigler Stiglitz Stone Tinbergen Tobin Vickrey Williamson jump to navigation table 255 VOLUME 10, NUMBER 3, SEPTEMBER 2013 ECON JOURNAL WATCH George A. Akerlof by Daniel B. Klein, Ryan Daza, and Hannah Mead 258-264 Maurice Allais by Daniel B. Klein, Ryan Daza, and Hannah Mead 264-267 Kenneth J. Arrow by Daniel B. Klein 268-281 Robert J. Aumann by Daniel B. Klein, Ryan Daza, and Hannah Mead 281-284 Gary S. Becker by Daniel B.
    [Show full text]
  • H-Diplo ROUNDTABLE XXII-24
    H-Diplo ROUNDTABLE XXII-24 Alan Bollard. Economists at War: How a Handful of Economists Helped Win and Lose the World Wars. Oxford: Oxford University Press, 2020. ISBN: 9780198846000 (hardcover, $25.00). 1 February 2021 | https://hdiplo.org/to/RT22-24 Editor: Diane Labrosse | Production Editor: George Fujii Contents Introduction by Paul Poast, University of Chicago ........................................................................................................................... 2 Review by Laura Hein, Northwestern University .............................................................................................................................. 5 Review by Annalisa Rosselli, University of Rome Tor Vergata, Italy ............................................................................................ 8 Response by Alan Bollard, Victoria University of Wellington .....................................................................................................11 H-Diplo Roundtable XXII-24 Introduction by Paul Poast, University of Chicago ive me a one-handed economist. All my economists say, “on the one hand… on the other hand”.’ That phrase, reputedly uttered by President Harry Truman, captures the core of economics as a discipline and practice. Call it ‘G cost-benefit analysis, decision making in recognition of tradeoffs, or an ability to think ‘on the margin.’ While such practices are of value during times of peace, their importance heightens during the exigencies of war. War exacerbates the scarcity which marks everyday
    [Show full text]
  • A New Column for Optima Structure Prediction and Global Optimization
    76 o N O PTIMA Mathematical Programming Society Newsletter MARCH 2008 Structure Prediction and A new column Global Optimization for Optima by Alberto Caprara Marco Locatelli Andrea Lodi Dip. Informatica, Univ. di Torino (Italy) Katya Scheinberg Fabio Schoen Dip. Sistemi e Informatica, Univ. di Firenze (Italy) This is the first issue of 2008 and it is a very dense one with a Scientific February 26, 2008 contribution on computational biology, some announcements, reports of “Every attempt to employ mathematical methods in the study of chemical conferences and events, the MPS Chairs questions must be considered profoundly irrational and contrary to the spirit in chemistry. If mathematical analysis should ever hold a prominent place Column. Thus, the extra space is limited in chemistry — an aberration which is happily almost impossible — it but we like to use few additional lines would occasion a rapid and widespread degeneration of that science.” for introducing a new feature we are — Auguste Comte particularly happy with. Starting with Cours de philosophie positive issue 76 there will be a Discussion Column whose content is tightly related “It is not yet clear whether optimization is indeed useful for biology — surely biology has been very useful for optimization” to the Scientific contribution, with ­ — Alberto Caprara a purpose of making every issue of private communication Optima recognizable through a special topic. The Discussion Column will take the form of a comment on the Scientific 1 Introduction contribution from some experts in Many new problem domains arose from the study of biological and the field other than the authors or chemical systems and several mathematical programming models an interview/discussion of a couple as well as algorithms have been developed.
    [Show full text]
  • The Life Cycles of Nobel Laureates in Economics
    Creative Careers: The Life Cycles of Nobel Laureates in Economics Bruce A. Weinberg & David W. Galenson De Economist Netherlands Economic Review ISSN 0013-063X Volume 167 Number 3 De Economist (2019) 167:221-239 DOI 10.1007/s10645-019-09339-9 1 23 Your article is published under the Creative Commons Attribution license which allows users to read, copy, distribute and make derivative works, as long as the author of the original work is cited. You may self- archive this article on your own website, an institutional repository or funder’s repository and make it publicly available immediately. 1 23 De Economist (2019) 167:221–239 https://doi.org/10.1007/s10645-019-09339-9 Creative Careers: The Life Cycles of Nobel Laureates in Economics Bruce A. Weinberg1 · David W. Galenson2 Published online: 26 April 2019 © The Author(s) 2019, corrected publication 2019 Abstract We identify two polar life cycles of scholarly creativity among Nobel laureate econ- omists with Tinbergen falling broadly in the middle. Experimental innovators work inductively, accumulating knowledge from experience. Conceptual innovators work deductively, applying abstract principles. Innovators whose work is more conceptual do their most important work earlier in their careers than those whose work is more experimental. Our estimates imply that the probability that the most conceptual lau- reate publishes his single best work peaks at age 25 compared to the mid-50 s for the most experimental laureate. Thus, while experience benefts experimental innova- tors, newness to a feld benefts conceptual innovators. Keywords Creativity · Life cycle · Innovation · Nobel laureates · Economics of science JEL Classifcation J240 · O300 · B310 Many scholars believe that creativity is the particular domain of the young.
    [Show full text]