DOCSLIB.ORG

From the Editor WHATS INSIDE

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
From the Editor WHATS INSIDE Volume 6 Number 1 March 2012 International Federation of Operational Research Societies NEWS ISSN 2223-4373 WHATS INSIDE From the Editor 2 Editorial . 2011 Accomplishments - IFORS and OR publishing and A Taste of 2012 3 Publications . Elise del Rosario <[email protected]> - ITOR Features Tutorials We used to dedicate one issue of IFORS News to the - Tutorial: The importance of pricing decisions Annual Report. This year, we have a full issue that com- plements the 2011 Annual Report. The year had been 5 Developing Countries . a most productive one for the Administrative Commit- tee, as can be gleaned from the President Dominique de Werra’s summary of - A Star for ORiON the activities undertaken for the year. - Locals Support First OR Meeting in Nepal - From the DC Section Editor: On the Activities continued on into 2012, as you can see from the OR Schools con- ORSN Conference ducted in Africa and Brazil and those being planned for in Ukraine and Por- - OR tools have huge potential tugal. It is always very refreshing to see these young people, all enthusiastic about OR and benefiting from the various programs made available to them 8 Conferences . by IFORS and other sponsors. - Portugal Hosts the First ICORES - OR Luminaries Grace Peruvian Conference Conferences that were held within ALIO, EURO and APORS are covered. IFORS was well represented in the conferences that happened in Peru, Por- 10 OR Schools . tugal and Nepal. I met the Developing Countries Section editor Arabinda Tripathy at the Nepal conference, and his perspectives on that conference - IFORS Sponsors OR School in Africa are here printed. He also forwarded a very interesting experience of the - IFORS Selects Scholar for the ESI South African society which faced the multilingual aspect of publishing a - ALIO Summer School Scores Sixteenth Success journal. - A Different Kind of A Summer School Speaking of journals, we cover a milestone issue of ITOR – its first as an ISI 13 OR Practice Survey . indexed journal, and its first issue to cover tutorials. To give you a flavor of one of these tutorials, we print a piece on revenue management by IFORS 14 IFORS 2011 Annual Report . Treasurer Peter Bell. He also writes the editorial, which raises some very im- portant and timely issues in publishing, gathered from his years of being up 22 OR Society in Focus . close and personal with this area. - Croatian Operational Research Society We always take the opportunity to give our readers who are operations re- search professionals something that they do not encounter everyday. In this 23 Book Review . issue are articles in the realms of art, psychology and politics. Do read them and see how OR plays a role in these fields that may be seemingly distant - The Mathematics Behind A Public Policy from OR. 24 Features . The first quarter of 2012 has seen a lot happening in the OR world. I do hope - Psychophysics in Operations Research you’ll let IFORS News in on what’s up in your corner of this world - Operations Research in Abstract Art? Yes! Reproduction of materials printed here is welcome. We do request that the source, IFORS News, be acknowledged. P. 1 • IFORS NEWS • March 2012 Editorial IFORS and OR publishing Peter C. Bell <[email protected]> IFORS is an OR publisher. We own two prompt reviews. The slightly worrying news is that ITOR (in addition journals: International Abstracts in to most other journals) is detecting more examples of borderline or Operations Research (IAOR) and Inter- unprofessional author behaviours, including evidence of multiple national Transactions in Operational submissions and plagiarism, including self-plagiarism. Valuable ref- Research (ITOR). These two journals ereeing and editorial time is now being spent checking submissions contribute the lion’s share of IFORS in- for these. come and so maintaining and nurturing these journals is a priority. IAOR is a unique OR abstracting journal under the leadership of Editor Preston White Jr. and his editorial team. As the number of new jour- Over the last few years, OR publishing has changed markedly. Two nals expands, IAOR’s objective of abstracting all published OR articles trends dominate these changes. The first is the rise in the number becomes increasingly difficult to achieve. Many of the new journals of articles being submitted for publication and the second is the in- appear to publish just about anything and so IAOR has somehow to crease in the number of ‘journals’ which publish OR work, particularly assess ‘quality’ but IAOR has no history and is not set up to review the growth of open access on-line journals. articles or journals. Abstracting all the new journals will stretch IAOR editorial resources, but at the same time provides a lot of new mate- The number of articles circulating the journals rial and adds to the value proposition of IAOR as a looking for a publication outlet has exploded “one-stop shop” providing an indexed, searchable and will continue to do so: major journals now database of the OR literature. receive well over 1,000 submissions annually and “...while the inflow this number is increasing. The educational job of new articles is Scientific journals were once published for read- market is a powerful submission motivator with ers who bought the journals to read the articles. the result that some articles are submitted several growing fast, the Increasingly, scientific journals are now published times, starting with an “A” journal and, if rejected, stock of rejected for authors who benefit from their publications moving to an “A-“ journal, and then a “B” and trick- through employment and promotions. As an ex- ling on down. This kind of submission ‘strategy’ is articles circulating ample, the motivation for the new open-access rewarded by university promotion policies that around looking for on-line journals is coming from authors looking tend to assign reward ‘points’ based on the high- a publication for a place to publish since there is no ‘fee’ for a est level of journal achieved. While some authors reader to access the journals. In mathematics use the review process to improve their work and outlet is growing and the sciences, it is common for authors to pay revise their articles, others appear to resubmit the even faster.” for publication through “page charges”, but the same article repeatedly: it is quite common to value that the journal provides does not come receive an article for review that is seriously out- from publication, but rather from the reviewing of-date. The result of all this is that while the in- process; the author reaps the benefits as soon as flow of new articles is growing fast, the stock of the article is “accepted” not when it is eventually rejected articles circulating around looking for a published (many major journals now list or pre- publication outlet is growing even faster. At the publish accepted articles.) Charging a fee to sub- same time, the resources available to review all mit an article to a journal is a more attractive idea these articles have pretty much stayed the same (perhaps the fee would be refundable if the article and we are now consuming ever-increasing quan- was published), since this “reviewing” fee would tities of reviewing resources that the beneficiary reconnect the recipient of the value of publication (the author or university) does not pay for. with the cost of reviewing and publishing. Such a reviewing fee might at the same time motivate The second major trend is the explosion of new more thoughtful behaviour from authors consid- open access ‘journals’ looking for OR work to pub- ering whether to submit a rejected article to one lish. Hardly a week goes by without an announce- more journal. ment of a new journal. The unknown here is the quality of the ac- cepted articles. Perhaps over time, reputations will be built and some For the moment IFORS publishing is healthy and we are not planning high quality open-access on-line journals will be recognized. major changes. We invite you to send your best articles to ITOR and to make use of IAOR as you search the ever expanding list of OR jour- These trends effect both IFORS publications, but in different ways. nals to find relevant published work. The growing number of sub- ITOR is thriving under the capable leadership of Editor Celso Carnei- missions to OR journals and the expanding list of journals for IAOR ro Ribeiro. ISI indexing has been achieved and submissions are on to abstract presents opportunities and challenges for IFORS. We wel- the increase: Celso is looking for articles to publish and his editorial come your ideas and suggestions on how IFORS might continue to and reviewing team have successfully focussed on offering authors move forward as a leading OR publisher. P. 2 • IFORS NEWS • March 2012 Publications ITOR Features Tutorials Celso Ribeiro <[email protected]> Celso Ribeiro, editor of the International Transactions in Operational » Fragile networks: identifying vulner- Research (ITOR) announced the publication of the Volume 19, Nos. abilities and synergies in an uncertain 1-2 special double issue that celebrates ITOR indexation by Thomson age by Anna Nagurney and Qiang Reuters ISI (formerly known as the Institute for Scientific Informa- Qiang discusses some of the recent tion). Thomson Reuters ISI accepted ITOR into the Social Sciences developments in the assessment of Citation Index (SSCI) and the Science Citation Index Expanded (SCIE), network vulnerability and robust- with coverage from the 2009 volume. The journal should therefore ness through appropriate tools that assist in the quantification receive its first impact factor in the 2011 Journal Citation Reports, to of network efficiency/performance and the identification of the be released next year.
Load more

Recommended publications
  • Algorithmic System Design Under Consideration of Dynamic Processes
    Algorithmic System Design under Consideration of Dynamic Processes Vom Fachbereich Maschinenbau an der Technischen Universit¨atDarmstadt zur Erlangung des akademischen Grades eines Doktors der Ingenieurwissenschaften (Dr.-Ing.) genehmigte Dissertation vorgelegt von Dipl.-Phys. Lena Charlotte Altherr aus Karlsruhe Berichterstatter: Prof. Dr.-Ing. Peter F. Pelz Mitberichterstatter: Prof. Dr. rer. nat. Ulf Lorenz Tag der Einreichung: 19.04.2016 Tag der m¨undlichen Pr¨ufung: 24.05.2016 Darmstadt 2016 D 17 Vorwort des Herausgebers Kontext Die Produkt- und Systementwicklung hat die Aufgabe technische Systeme so zu gestalten, dass eine gewünschte Systemfunktion erfüllt wird. Mögliche System- funktionen sind z.B. Schwingungen zu dämpfen, Wasser in einem Siedlungsgebiet zu verteilen oder die Kühlung eines Rechenzentrums. Wir Ingenieure reduzieren dabei die Komplexität eines Systems, indem wir dieses gedanklich in überschaubare Baugruppen oder Komponenten zerlegen und diese für sich in Robustheit und Effizienz verbessern. In der Kriegsführung wurde dieses Prinzip bereits 500 v. Chr. als „Teile und herrsche Prinzip“ durch Meister Sun in seinem Buch „Die Kunst der Kriegsführung“ beschrieben. Das Denken in Schnitten ist wesentlich für das Verständnis von Systemen: „Das wichtigste Werkzeug des Ingenieurs ist die Schere“. Das Zusammenwirken der Komponenten führt anschließend zu der gewünschten Systemfunktion. Während die Funktion eines technischen Systems i.d.R. nicht verhan- delbar ist, ist jedoch verhandelbar mit welchem Aufwand diese erfüllt wird und mit welcher Verfügbarkeit sie gewährleistet wird. Aufwand und Verfügbarkeit sind dabei gegensätzlich. Der Aufwand bemisst z.B. die Emission von Kohlendioxid, den Energieverbrauch, den Materialverbrauch, … die „total cost of ownership“. Die Verfügbarkeit bemisst die Ausfallzeiten, Lebensdauer oder Laufleistung. Die Gesell- schaft stellt sich zunehmend die Frage, wie eine Funktion bei minimalem Aufwand und maximaler Verfügbarkeit realisiert werden kann.
    [Show full text]
  • 54 OP08 Abstracts
    54 OP08 Abstracts CP1 Dept. of Mathematics Improving Ultimate Convergence of An Aug- [email protected] mented Lagrangian Method Optimization methods that employ the classical Powell- CP1 Hestenes-Rockafellar Augmented Lagrangian are useful A Second-Derivative SQP Method for Noncon- tools for solving Nonlinear Programming problems. Their vex Optimization Problems with Inequality Con- reputation decreased in the last ten years due to the com- straints parative success of Interior-Point Newtonian algorithms, which are asymptotically faster. In the present research We consider a second-derivative 1 sequential quadratic a combination of both approaches is evaluated. The idea programming trust-region method for large-scale nonlin- is to produce a competitive method, being more robust ear non-convex optimization problems with inequality con- and efficient than its ”pure” counterparts for critical prob- straints. Trial steps are composed of two components; a lems. Moreover, an additional hybrid algorithm is defined, Cauchy globalization step and an SQP correction step. A in which the Interior Point method is replaced by the New- single linear artificial constraint is incorporated that en- tonian resolution of a KKT system identified by the Aug- sures non-accent in the SQP correction step, thus ”guiding” mented Lagrangian algorithm. the algorithm through areas of indefiniteness. A salient feature of our approach is feasibility of all subproblems. Ernesto G. Birgin IME-USP Daniel Robinson Department of Computer Science Oxford University [email protected]
    [Show full text]
  • Resumé WARD WHITT
    March 2020 Resum´e WARD WHITT Current Employment Wai T. Chang Professor Department of Industrial Engineering and Operations Research Fu Foundation School of Engineering and Applied Science Columbia University Mail Code 4704, S. W. Mudd Building 500 West 120th Street New York, NY 10027-6699 Phone: (212) 854-7255 Fax: (212) 854-8103 Citizenship: USA Email: [email protected] URL: http://www.columbia.edu/∼ww2040 Education 1969 Ph.D., Cornell University Major Field: Operations Research Minor Fields: Mathematics and Regional Planning Thesis: Weak Convergence Theorems for Queues in Heavy Traffic (Advisor: D. L. Iglehart; Committee Members: H. Kesten and N. U. Prabhu) 1964 A.B., Dartmouth College Major: Mathematics (Senior Honors Thesis Advisor: J. G. Kemeny) Research, Consulting and Teaching Interests Queues: approximation techniques, limit theorems, heavy-traffic theory, model stability, bounds and inequalities, transient behavior, queues with time-varying arrival rates, nu- merical transform inversion, fundamental principles such as L = λW , stochastic net- works, applications to communication networks, manufacturing systems and service sys- tems such as contact centers and healthcare systems Probability and Stochastic Processes: limit theorems, weak convergence, diffusion processes, stochastic order relations, simulation, numerical transform inversion, stochastic models in operations research. Telecommunication Systems: performance analysis, internet performance, IP networks, circuit- switched networks, wireless networks, high-speed communication networks, asynchronous transfer mode technology, traffic descriptors, traffic regulators, protection against over- loads, staffing telephone call centers, real-time performance prediction and control Operations Research: applied probability, stochastic models, queues, performance analysis, simulation, dynamic programming, game theory, decision analysis, approximation tech- niques, telecommunication, computer manufacturing and service systems. Employment History Columbia University in the City of New York 2002– Professor, Dept.
    [Show full text]
  • Affiliation of Authors in Production and Operations Management Journals" (2003)
    Western Michigan University ScholarWorks at WMU Honors Theses Lee Honors College 5-15-2003 Affiliation ofuthors A in Production and Operations Management Journals Steven M. Yager Western Michigan University, [email protected] Follow this and additional works at: https://scholarworks.wmich.edu/honors_theses Part of the Business Commons, and the Journalism Studies Commons Recommended Citation Yager, Steven M., "Affiliation of Authors in Production and Operations Management Journals" (2003). Honors Theses. 1173. https://scholarworks.wmich.edu/honors_theses/1173 This Honors Thesis-Open Access is brought to you for free and open access by the Lee Honors College at ScholarWorks at WMU. It has been accepted for inclusion in Honors Theses by an authorized administrator of ScholarWorks at WMU. For more information, please contact [email protected]. THE CARL AND WINIFRED LEE HONORS COLLEGE CERTIFICATE OF ORAL EXAMINATION Steven M. Yager, having been admitted to the Carl and Winifred Lee Honors College in Fall 1998 successfullypresented the Lee Honors College Thesis on May 15, 2003. The title of the paper is: Affiliation of Authors in Production and Operations Management Journals /JsS / /J.-\ /-''>l"^C Dr. Sime Curkovic r. Robert Landeros AFFILIATION OF AUTHORS IN PRODUCTION AND OPERATIONS MANAGEMENT JOURNALS Spring 2003 Steven M. Yager Haworth College of Business & Lee Honors College Western Michigan University Kalamazoo, MI 49008, USA Dr. Sime Curkovic Haworth College of Business Western Michigan University Kalamazoo, MI 49008, USA
    [Show full text]
  • Basic Polyhedral Theory 3
    BASIC POLYHEDRAL THEORY VOLKER KAIBEL A polyhedron is the intersection of finitely many affine halfspaces, where an affine halfspace is a set ≤ n H (a, β)= x Ê : a, x β { ∈ ≤ } n n n Ê Ê for some a Ê and β (here, a, x = j=1 ajxj denotes the standard scalar product on ). Thus, every∈ polyhedron is∈ the set ≤ n P (A, b)= x Ê : Ax b { ∈ ≤ } m×n of feasible solutions to a system Ax b of linear inequalities for some matrix A Ê and some m ≤ n ′ ′ ∈ Ê vector b Ê . Clearly, all sets x : Ax b, A x = b are polyhedra as well, as the system A′x = b∈′ of linear equations is equivalent{ ∈ the system≤ A′x }b′, A′x b′ of linear inequalities. A bounded polyhedron is called a polytope (where bounded≤ means− that≤ there − is a bound which no coordinate of any point in the polyhedron exceeds in absolute value). Polyhedra are of great importance for Operations Research, because they are not only the sets of feasible solutions to Linear Programs (LP), for which we have beautiful duality results and both practically and theoretically efficient algorithms, but even the solution of (Mixed) Integer Linear Pro- gramming (MILP) problems can be reduced to linear optimization problems over polyhedra. This relationship to a large extent forms the backbone of the extremely successful story of (Mixed) Integer Linear Programming and Combinatorial Optimization over the last few decades. In Section 1, we review those parts of the general theory of polyhedra that are most important with respect to optimization questions, while in Section 2 we treat concepts that are particularly relevant for Integer Programming.
    [Show full text]
  • 1. Introduction: Learning About Operations Research
    1. Introduction: Learning about Operations Research IRV LUSTIG: So hi, my name's Irv Lustig from Princeton Consultants and today, I'm privileged to interview George Nemhauser, who is currently a distinguished professor at the Georgia Institute of Technology. So thank you, George, for joining us today and let's get started. GEORGE NEMHAUSER: Oh, you're most welcome. I'm really looking forward to it. IRV LUSTIG: All right. So tell me, when did you first learn about operations research? GEORGE NEMHAUSER: So basically, I am a chemical engineer. And I think it was the summer between when I graduated with a Bachelor's degree in Chemical Engineering and the fall, when I was going to go off to graduate school at Northwestern for Chemical Engineering, I had a job with the research department of Allied Chemical. And there was a guy-- I think he was my supervisor who was working there-- who told me he was taking a part-time degree at Princeton and he was studying things like linear programming and game theory and I think maybe Kuhn, Tucker conditions, And he told me about this kind of stuff and I thought, wow, this is really interesting stuff, much more interesting than what I'm doing in chemical engineering. So when I got to Northwestern, as a first-year graduate student in Chemical Engineering, I had one elective course. And I looked and there was this new course called Operations Research and it included linear programming and game theory and stuff like that. I said, that's it.
    [Show full text]
  • EPADEL a Semisesquicentennial History, 1926-2000
    EPADEL A Semisesquicentennial History, 1926-2000 David E. Zitarelli Temple University An MAA Section viewed as a microcosm of the American mathematical community in the twentieth century. Raymond-Reese Book Company Elkins Park PA 19027 Author’s address: David E. Zitarelli Department of Mathematics Temple University Philadelphia, PA 19122 e-mail: [email protected] Copyright © (2001) by Raymond-Reese Book Company, a division of Condor Publishing, Inc. All rights reserved. No part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photography, recording, or any information storage retrieval system, without written permission from the publisher. Requests for permission to make copies of any part of the work should be mailed to Permissions, Raymond-Reese Book Company, 307 Waring Road, Elkins Park, PA 19027. Printed in the United States of America EPADEL: A Sesquicentennial History, 1926-2000 ISBN 0-9647077-0-5 Contents Introduction v Preface vii Chapter 1: Background The AMS 1 The Monthly 2 The MAA 3 Sections 4 Chapter 2: Founding Atlantic Apathy 7 The First Community 8 The Philadelphia Story 12 Organizational Meeting 13 Annual Meeting 16 Profiles: A. A. Bennett, H. H. Mitchell, J. B. Reynolds 21 Chapter 3: Establishment, 1926-1932 First Seven Meetings 29 Leaders 30 Organizational Meeting 37 Second Meeting 39 Speakers 40 Profiles: Arnold Dresden, J. R. Kline 48 Chapter 4: Émigrés, 1933-1941 Annual Meetings 53 Leaders 54 Speakers 59 Themes of Lectures 61 Profiles: Hans Rademacher, J. A. Shohat 70 Chapter 5: WWII and its Aftermath, 1942-1955 Annual Meetings 73 Leaders 76 Presenters 83 Themes of Lectures 89 Profiles: J.
    [Show full text]
  • N Rapid Development of an Open-Source Minlp Solver With
    75 o N O PTIMA Mathematical Programming Society Newsletter DECEMBER 2007 Rapid Development of an Open-source Minlp Solver with COIN-OR Pierre Bonami, John J. Forrest, Jon Lee and Andreas Wächter Abstract • Csdp, Dfo, Ipopt, LaGO, and Svm- QP are solvers for different types of We describe the rapid development of Nonlinear Optimization (semidefinite, Bonmin (Basic Open-source Nonlinear derivative-free, general large-scale Mixed INteger programming) using the interior point, global optimization, QP community and components of COIN- solver for support vector machines) OR (COmputational INfrastructure • CoinMP, FlopC++, GAMSlinks, for Operations Research). NLPAPI, Osi, OS and Smi are problem 1. Introduction modeling and interface tools. Even more, COIN-OR has become the As famous examples like Linux have platform that facilitates the collaboration proven, open-source communities of optimization researchers to start entirely can produce rapidly-developing high- new projects, exploring and developing new quality software, often competitive with algorithmic ideas, by providing both a sound expensive commercial solutions. COIN- software basis that can be re-used, as well as OR (COmputational INfrastructure the technical forum to coordinate the effort. for Operations Research), originally In order to clarify a common founded by IBM in 2000 and a non-profit misconception, we want to emphasize that foundation since 2004, provides such the term “open source” does not simply refer a platform for us optimization folks. to software that is made available to some Since its conception, a number of users in source-code format. According optimization-algorithm implementations to the definition put forth by the non- and related software projects have been profit corporation Open Source Initiative contributed to COIN-OR.
    [Show full text]
  • Branch-And-Bound Strategies for Dynamic Programming
    LIBRARY OF THE MASSACHUSETTS INSTITUTE OF TECHNOLOGY C7. WORKING PAPER ALFRED P. SLOAN SCHOOL OF MANAGEMENT BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC PROGRAMMING Thomas L. Morin* and Roy E. Marsten** WP 750-74ooREVISED May 1975 MASSACHUSETTS INSTITUTE OF TECHNOLOGY 50 MEMORIAL DRIVE CAMBRIDGE, MASSACHUSETTS 02139 BRANCH-AND-BOUND STRATEGIES FOR DYNAMIC PROGRAMMING Thomas L. Morin* and Roy E. Mar St en** WP 750-74floREVISED May 1975 *Northwestern University, Evanston, Illinois **Massachusetts Institute of Technology Alfred P. Sloan School of Management, Cambridge, Massachusetts ABSTRACT This paper shows how branch -and -bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming cjriteria are used to identify and to eliminate states whose corresponding subpolicies could not lead to optimal policies. The general dynamic programming/branch- and-bound approach is applied to the traveling -salesman problem and the nonlinear knapsack problem. The reported computational experience de- monstrates the dramatic savings in both computer storage and computa- tional requirements which were effected utilizing the hybrid approach. Consider the following functional equation of dynamic programming for additive costs: = {TT(y',d) (y = (P. - f(y) min + f ') lT(y ' ,d) y] , y € y.) (1) d € D with the boundary condition f(yo) = ko (2) in which, Q is the finite nonempty state space; y- € fi is the initial state; d € D is a decision, where D is the finite nonempty set of decisions; T: n X D — n is the transition mapping, where T(y',d) is the state that is tt; -• reached when decision d is applied at state y ; Q x D IR is the cost function, where TT(y',d) is the incremental cost that is incurred when de- cision d is applied at state y'; k_ 6 IR is the initial cost incurred in the initial state y_; and in (2) we make the convenient but unnecessary assump- tion that return to the initial state is not possible.
    [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]
  • Mathematical Programming Society Newsletter
    69 o N O PTIMA Mathematical Programming Society Newsletter JANUARY2003 69 Primal Integer Programming 2 mindsharpener 8 gallimaufry 10 OPTIMA69 JANUARY 2003 PAGE 2 Primal Integer Programming Robert Weismantel Faculty of Mathematics, University of Magdeburg Universitatsplatz 2, D-39106 Magdeburg, Germany [email protected] September 17, 2002 Primal integer programming is an area of Let us begin by recalling that all the problem specific cuts such as facet-defining cuts discrete optimization that -- in a broad sense -- algorithmic schemes applied to integer for the TSP in [18]. To the best of our includes the theory and algorithms related to programming problems without a-priori knowledge, a method of this type for Integer augmenting feasible integer solutions or knowledge about the structure of the side Programming has first been suggested by Ben- verifying optimality of feasible integer points. constraints resort to the power of linear Israel and Charnes [3]. They employed the fact This theory naturally provides an algorithmic programming duality. that for any feasible solution of an integer scheme that one might regard as a generic form Dual type algorithms start solving a linear program optimality can be proven by solving a of a primal integer programming algorithm: programming relaxation of the problem, subproblem arising from the non-basic columns First detect an integer point in a given domain typically with the dual simplex method. In the of a primal feasible simplex tableau. Various of discrete points. Then verify whether this course of the algorithm one maintains as an specializations and variants of a primal cutting point is an optimal solution with respect to a invariant both primal and dual feasibility of the plane algorithm were later given by Young [21, specific objective function, and if not, find solution of the relaxation.
    [Show full text]
  • Technical Sessions
    T ECHNICAL S ESSIONS Sunday, 8:00am - 9:30am How to Navigate the Technical Sessions ■ SA01 There are three primary resources to help you C-Room 21, Upper Level understand and navigate the Technical Sessions: Panel Discussion: The Society of Decision • This Technical Session listing, which provides the Professionals - Building a True Profession most detailed information. The listing is presented Sponsor: Decision Analysis chronologically by day/time, showing each session Sponsored Session and the papers/abstracts/authors within each Chair: Carl Spetzler, Chairman & CEO, Strategic Decisions Group (SDG), 745 Emerson St, Palo Alto, CA, 94301, United States of session. America, [email protected] • The Session Chair, Author, and Session indices 1 - The Society of Decision Professionals - Building a provide cross-reference assistance (pages 426-463). True Profession Moderator: Carl Spetzler, Chairman & CEO, Strategic Decisions • The Track Schedule is on pages 46-53. This is an Group (SDG), 745 Emerson St, Palo Alto, CA, 94301, United overview of the tracks (general topic areas) and States of America, [email protected], Panelist: Larry Neal, when/where they are scheduled. David Leonhardi, Hannah Winter, Jack Kloeber, Andrea Dickens When we take stock of 40 years of Decision Analysis practice. Decision professionals still assist in only a small fraction of important and difficult choices. In this panel, practitioners will explore why this is the case and discuss how to Quickest Way to Find Your Own Session form a true profession to transform the way important and difficult decisions are Use the Author Index (pages 430-453) — the session made. code for your presentation(s) will be shown along with the track number.
    [Show full text]