{"id":168,"date":"2007-07-11T09:28:11","date_gmt":"2007-07-11T13:28:11","guid":{"rendered":"http:\/\/mat.tepper.cmu.edu\/blog\/?p=159"},"modified":"2007-07-11T09:28:11","modified_gmt":"2007-07-11T13:28:11","slug":"ifors-distinguished-lecturer","status":"publish","type":"post","link":"https:\/\/mat.tepper.cmu.edu\/blog\/index.php\/2007\/07\/11\/ifors-distinguished-lecturer\/","title":{"rendered":"IFORS Distinguished Lecturer"},"content":{"rendered":"

I am at the closing session of EURO<\/a>. This year’s conference was huge with more than 2000 participants. I did attend a good amount of the conference, though Prague has its own attractions.<\/p>\n

EURO (along with INFORMS, ALIO, and APORS) have a plenary given by the IFORS<\/a> Distinguished Lecturer (I chair the committee that recommends the selection to the President of IFORS). This conference’s IDL is Bob Bixby, from Rice University and ILOG. Elise del Rosario introduced Bob, and here are some quotes from her introduction:<\/p>\n

The IFORS Distinguished Lecturer for this conference is
\nDr. Robert Bixby<\/span>, an outstanding researcher, innovator, and business
\nleader. Dr. Bixby<\/span> received his Ph.D. in the early 1970s from Cornell
\nUniversity, and looked like he would have a long and distinguished
\ncareer in research on combinatorial structures. A sharp turn in the
\n1980s led him to develop CPLEX, an outstanding large-scale linear
\nprogram optimizer. CPLEX led to CPLEX Optimization, Inc, marketing
\nalgorithms for linear and mixed-integer programming. CPLEX was sold
\nto ILOG in 1997, a company in which Dr. Bixby<\/span> has served a number of
\nroles and where he is currently Chief Science Officer.<\/p>\n

Dr. Bixby<\/span> has combined his business success with continued research
\nsuccess. He, along with his colleagues David Applegate, Vasek
\nChvatal, and Bill Cook have just published a book entitled “The
\nTraveling Salesman Problem: A computational study” that sum up their
\n20 years of work on solving large scale traveling salesman problems,
\nculminating the solution of TSPs with tens of thousands of cities.<\/p>\n

Dr. Bixby<\/span> has held a number of leadership roles in our field,
\nincluding the presidency of the Mathematical Programming Society, and
\nhas received a number of awards for this work, including the
\nBeale-Orchard-Hays Prize for excellence in computational mathematical
\nprogramming.<\/p><\/blockquote>\n

<\/span>The title of his presentation was “From Planning to Operations: the Devil’s in the Details”.\u00a0 Unfortunately, I had to run out for a plane (for my 42 hour return to New Zealand) so I only got to see the first part, where he reviewed progress in linear programming and integer programming.\u00a0 A few striking points:<\/p>\n

    \n
  1. The speed improvement in linear programming from 1996-2004 is a factor of about 5.3 million (3600 due to algorithms and 1300 due to computing).<\/li>\n
  2. Not much improvement in linear programming the last few years:\u00a0 only computer speed improvements.<\/li>\n
  3. (Mixed) integer programming is about 13 times fast over the same period.<\/li>\n
  4. The next version of CPLEX provides another decrease in time required (by a factor of .6)<\/li>\n
  5. The next version of CPLEX is much better at finding feasible solutions to MIP (a test set of about 1300 instances) went from 250 with no solution found in 100 seconds in CPLEX 10 to about 120 in the next version.<\/li>\n<\/ol>\n

    The main point of the rest of the talk is that MIP and other optimization models are going to be used increasingly for day-to-day decisions (not as an aid to decision making, but making the decisions directly) and that puts lots of pressure on our models and data.
    \n