The rational fear of irrational coefficients: Talking about IP on PI day

One of the central elements of (Mixed-) Integer Linear Programming is the polyhedral approach. The feasible set of a Linear Program is a polyhedron, where a vertex (if there is one) is optimal for any linear objective function where an optimal solution exists. In the case of MILPs, however, the integrality constraint on some variables breaks down the feasible set S into disjoint polyhedra. Nevertheless, the first reasonable attempt at solving any MILP consists of replacing S with the linear relaxation P defined by the linear constraints of the formulation alone. Then we can run the “wish-me-luck” algorithm:

The wish-me-luck algorithm:
1.     Ignore the integrality constraints and solve the MILP as an LP.
2.     If the integrality constraints are satisfied, we are done!
3.     Otherwise, we are (temporarily) doomed!

DSC09669bSometimes the gamble is guaranteed. If we can find a polyhedron Q corresponding to the convex hull of the feasible set S, i.e. Q = conv(S), then we can solve the MILP as if it were an LP by optimizing over Q because all vertices belong to S. We say that an MILP formulation is perfect if P and Q coincide, like in network flow problems with integer coefficients. In the vast amount of cases where that does not happen, the quest illustrated in Schrijver’s book cover begins: we want to start from a good P (in white) and hopefully find an optimal solution by getting closer to Q (in red).

For a good P, we may compare different formulations for their strength. For example, by showing that the linear relaxation of one formulation is a proper subset of another, even if  the variables are different. We can show that by proving that a function maps each solution of the linear relaxation of one formulation to that of another whereas the converse is not true. To strengthen this formulation towards something like Q, at least around the optimal solution, we may add cutting planes. A cutting plane is an inequality that removes a region of the linear relaxation not in S, which is often around an optimal solution of the linear relaxation, in the hope that “wish-me-luck” works next time!

We take for granted that the convex hull is polyhedral, but is it? The following result is adapted from the recent book by Conforti, Cornuéjols, and Zambelli:

The Fundamental Theorem of Integer Programming (Meyer, 1974):
Given rational matrices A, G and a rational vector b, let P := { (x, y) : Ax + Gy ≤ b } and let S := { (x, y) ∈ P : x integral }. Then there exist rational matrices A’, G’ and a rational vector b’ such that conv(S) = { (x, y) : A’ x + G’ y ≤ b’ }.

The fact that the coefficients of the formulation should be rational is often overlooked. In practice, since these problems are solved with finite precision, this becomes irrelevant. However, the convex hull of some MILPs is not polyhedral. The following example is adapted from an exercise in the book above and includes “pi” as a special guest.

If P := { (x, y) : 0 ≤ y ≤ π x } and S := { (x, y) ∈ P : x, y integral },
then conv(S) = { (0, 0) } ∪ { (x, y) : 0 ≤ y < π x }, which is not polyhedral.


The proof for this example is quite simple (in comparison to the example in CCZ’s book). First, no point besides (0, 0) in the line y = π x belongs to S, and by consequence to conv(S). Suppose for contradiction that such a point (x’, y’) exits. Then y’ / x’ is a rational representation of π, a contradiction.  Second, any other point (x, y) for which 0 ≤ y < π x belongs to conv(S). Since x > 0, there is a rational number p / q such that y / x < p / q < π  and thus (x, y) is inside a cone rooted at (0, 0) with rays (1, 0) and (p, q).

Hence, when it comes to integer programming, you should better be rational…

Using the CPLEX solver through COIN-OR’s Open Solver Interface

Today I could not find a single web search result for this:

OsiCpxSolverInterface.hpp: No such file or directory

If you come across this error, you are likely trying to compile code that uses COIN-OR software but that, ultimately, relies on CPLEX to solve optimization problems. In my case, that software was CBC and I reinstalled it (i.e., ./configure; make; make install) with the path to CPLEX libraries and headers on my computer. There is a good explanation for configure options in COIN-OR’s website, but I also needed to add some additional library compiler flags to make it work. So here is my configure command in the end:

./configure –with-cplex-lib=”-L/opt/ibm/ILOG/CPLEX_Studio1263/cplex/lib/x86-64_linux/static_pic/ -lcplex -lpthread -lm” -with-cplex-incdir=”/opt/ibm/ILOG/CPLEX_Studio1263/cplex/include/ilcplex”

If you came here with the same problem, I hope this post saves you some time  🙂

Summer 2018 schools on algorithms, combinatorics, data science, machine learning, optimization, and other relevant #orms topics

If you know of other schools that are not listed here, please let me know. Like in previous posts (Summer 2016, Winter 2016/ 2017, Summer 2017, and Winter 2017 / 2018), I may add schools with past deadlines as reference for readers looking for schools in the next years.

PS: For schools after September, check the Winter 2018 / 2019 post

NATCOR Heuristics & Approximation Algorithms
April 9-13     (deadline not posted)
Nottingham, England

International Spring School on High Performance Computing
April 23-27     (deadline: February 12)
San Sebastián, Spain
* Included on January 29

Optimal Transport: Numerical Methods and Applications
May 7-11     (deadline: March 10)
Como, Italy

International Spring School on Integrated Operational Problems
May 14-16     (deadline: March 31)
Troyes, France

Complex Networks: Theory, Methods, and Applications
May 14-18     (deadline: February 18)
Como, Italy
* Included on February 19

Summer School on Mathematics in Imaging Science
May 28 – June 1     (deadline: February 14)
Bologna, Italy

1st International Summer School on Artificial Intelligence and Games
May 28 – June 1     (deadline: January 31 for early registration)
Chania, Greece
* Included on January 29

VeRoLog PhD School on Vehicle Routing Problems
June 1-2     (deadline: January 31)
Cagliari, Italy

NATCOR Convex Optimization
June 4-8     (deadline not posted)
Edinburgh, Scotland

Association for Constraint Programming (ACP) Summer School 2018
June 4-8     (deadline not posted)
Jackson, WY, USA
* Included on February 19 by suggestion of Serdar Kadioglu

School on Graph Theory
June 11-15     (deadline: May 4 for early registration)
Sète, France
* Included on March 5

8th Lisbon Machine Learning School
June 14-21     (deadline: March 16)
Lisbon, Portugal

Summer Institute in Computational Social Science
June 17-30     (deadline: February 19)
Durham, North Carolina, USA

2018 Gene Golub SIAM Summer School on Inverse Problems: Systematic Integration of Data with Models under Uncertainty
June 17-30     (deadline: February 1)
Breckenridge, Colorado, USA

2nd International Workshop on Bilevel Programming (including mini-courses)
June 18-22     (deadline: April 15 for early registration)
Lille, France

Machine Learning Summer School
June 18-30     (deadline: February 20)
Buenos Aires, Argentina

The Data Incubator Data Science Fellowship
June 18 – August 10     (deadline not posted)
New York / San Francisco Bay Area / Seattle / Boston / Washington DC, USA, or online
* Included on January 29 by suggestion of Heitor H. Arakawa

International Conference on Automated Planning and Scheduling (ICAPS) Summer School
June 24-29     (deadline: March 23)
Delft, The Netherlands

DTU CEE Summer School 2018: Modern Optimization in Energy
June 24-29     (deadline: March 18)
Copenhagen, Denmark
* Included on February 2 by suggestion of Nicola Secomandi

Eötvös Loránd University Summer School in Mathematics: Introduction to Graph Limits
June 25-29     (deadline: April 30 for early registration)
Budapest, Hungary

2018 Summer School on “Operations Research and Machine Learning”
June 25-29     (registrations closed)
Fréjus, France

Summer School on Hyperbolic Polynomials, Sums of Squares and Optimization
June 25-29     (deadline: April 1)
Atlanta, GA, USA
* Included on February 19

15th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR) Master Class
June 26     (deadline not posted)
Delft, The Netherlands
* Included on January 29 by suggestion of Willem-Jan van Hoeve

The Second Annual JuMP-dev Workshop
June 27-29     (deadline not posted)
Bordeaux, France
* Included on February 5

2nd School on Foundations of Programming and Software Systems: Logic and Learning
July 1-6     (deadline: April 15 for early registration)
Oxford, UK
* Included on March 22

EURO PhD School on Sustainable Supply Chains 2018 (preannouncement link)
July 1-7     (deadline not posted)
Wageningen & Amsterdam, The Netherlands

8th PhD School in Discrete Mathematics
July 1-7     (deadline: June 10)
Rogla, Slovenia
* Included on February 28

NATCOR System Dynamics
July 2-4     (deadline not posted)
Coventry, England

Summer School on Algorithms and Lower Bounds 2018
July 6-9     (deadline: April 15)
Prague, Czech Republic
* Included on February 2

ACM Special Interest Group on Genetic and Evolutionary Computation (SIGEVO) Summer School (website under construction)
July 13-19     (deadline not posted)
Kyoto, Japan

Prague School on Discrete Mathematics 2018
July 16-20     (deadline: March 30)
Prague, Czech Republic

Metaheuristics Summer School
July 21-25     (deadline: April 15)
Taormina, Italy

2nd International Summer School on Deep Learning 2018
July 23-27     (first deadline: February 14)
Genova, Italy
* Included on January 29

EURO PhD Summer School on MCDA/M (Multiple Criteria Decision Aiding / Making)
July 23 – August 3     (deadline: January 31)
Chania, Greece

8th Summer School on Imprecise Probabilities: Theory and Applications
July 24-28     (deadline: March 31)
Oviedo, Spain

Fundamentals of Data Analysis TRIPODS Madison Summer School 2018
July 24-28     (deadline not posted)
Madison, WI, USA
* Included on March 10

Deep Learning and Reinforcement Learning Summer School 2018
July 25 – August 3     (deadline not posted)
Toronto, ON, Canada
* Included on February 19

Argonne Training Program on Extreme-Scale Computing
July 29 – August 10     (deadline: February 28)
St. Charles, IL, United States

4th Algorithmic and Enumerative Combinatorics Summer School 2018
July 30 – August 3     (deadline: June 15)
Hagenberg, Austria

The Cornell, Maryland, Max Planck Pre-doctoral Research School 2018: “Emerging Trends in Computer Science”
August 7-12     (deadline: February 7)
Saarbrücken, Germany

Uncertainty Quantification Summer School
August 8-10     (deadline not posted)
Los Angeles, CA, USA
* Included on May 15

August 10-12     (registration closed)
Bethlehem, PA, USA
* Included on May 15

Hausdorff School on Combinatorial Optimization
August 20-24     (deadline: April 30)
Bonn, Germany

Network Modeling for Epidemics
August 20-24     (deadline: May 1)
Seattle, WA, USA
* Included on March 12 by suggestion of Emily Tucker

SYNERGY Summer School on Efficient Multi-Objective Optimisation
August 27-31     (deadline: May 31 for early registration)
Ljubljana, Slovenia

Summer School on Statistical Relational Artificial Intelligence
August 27-31     (deadline not posted)
Ferrara, Italy
* Included on April 13

Data Science Summer School
August 28 – September 1     (deadline: April 20)
Paris, France

CPSE Summer School 2018: Optimisation Under Uncertainty
September 3-7     (deadline: July 31 for early registration)
London, England
* Included on May 18

ALOP Summer School on Mixed-Integer Nonlinear Programming
August 13-16 September 10-12 (deadline: May 30 June 15 for travel support application)
Trier, Germany
* Included on May 15, updated on June 12

FoMICS-DADSi Summer School on Data Assimilation
September 11-15     (deadline: June 30 for abstract submission)
Lugano, Switzerland
* Included on June 12

Fall School: Order and Geometry
September 14-17     (deadline: July 31)
Sauen, Germany
* Included on June 12

Graph Drawing 2018 PhD School: Recent trends in Graph Drawing and Network Visualization
September 24-25     (deadline: August 28 for early registration)
Barcelona, Spain
* Included on June 12

NATCOR Forecasting & Predictive Analytics
September 24-26     (deadline not posted)
Lancaster, England

Summer School in Algebraic Statistics
September 24-28     (deadline: June 30 for room application and/or travel support)
Tromsø, Norway
* Included on June 12

How can INFORMS help with your educational needs?

(Originally posted in the INFORMS 2017 blog).

Jill Wilson, the VP for Education, lead the first meeting of the newly created Education Strategy Committe this morning. The goal of this committe is to oversee the activities of the other education committes and think strategically about how our efforts are supporting INFORMS goals.

Do you have any ideas about information or resources that INFORMS could help develop or centralize?

Do you have suggestions for initiatives that INFORMS could support in order to promote better educational practices in Operations Research, Management Science, and Advanced Analytics?

Is there anything that we currently do, but that could be done better somehow?

I am serving as the student member of the committe and I am looking forward to know what other students think on the topic. As TAs, first-time instructors, and potentially future faculty, our input is crucial for better educating the next generation of analytics professionals.

Teaching Colloquium: The Brave 16

(Originally posted in the INFORMS 2017 blog).

In the words of one of the combined colloquia organizers, I was one of the “brave 16” yesterday. The teaching colloquium is often the smallest in attendance numbers, but also the only one that you can attend more than once. If you enjoyed attending other colloquia in the past, and deep inside you know that you have fun teaching, consider joining us next year!

You can find my longer post about what happens at the teaching colloquium in the 2016’s blog.

Winter 2017 / 2018 schools on big data, data science, discrete math, optimization, and other relevant #orms topics

If you know of other schools that are not listed here, please reach out to me. Like in previous posts (Summer 2016, Winter 2016 / 2017, and Summer 2017), I may add schools with past deadlines as reference for readers looking for schools in the next years.

PS: There is a more recent post covering Winter schools for 2018 / 2019

SESO 2017 Winter School “Data, Uncertainty and Optimization”
November 28-30     (deadline: October 20)
Luminy, France

Recent Advances ​in Parameterized Complexity
December 3-7     (deadline: October 15)
Tel Aviv, Israel
* Included on October 11

13th Summer School on Discrete Math
January 8-12     (deadline: October 27)
Valparaiso, Chile

Winter School on Optimization and Operations Research: Data Science and Optimization
January 14-19     (deadline: December 16 for early registration)
Zinal, Switzerland

Data61 6th International Optimisation Summer School
January 14-19     (no deadline: first come, first served registration)
Kioloa, Australia

7th Winter School on Network Optimization
January 15-19     (deadline: November 30 for early registration)
Estoril, Portugal

4th International Winter School on Big Data
January 22-26     (deadline: October 19)
Timişoara, Romania

International Research School on Graph Limits
January 22-26     (deadline not posted)
Lyon, France
* Included on November 27

2018 School on Column Generation
February 26 – March 2     (deadline: December 15)
Paris, France
* Included on October 17

2018 Operations Research Summer School for Young Latin American Schoolars (ELAVIO) March 5-9     (deadline not posted)
Marbella Resort, Chile

2018 EURO Winter Institute on Lot Sizing and Related Topics
March 5-16     (deadline: October 31)
Frankfurt an der Oder, Germany

Intensive Research Program in Discrete, Combinatorial and Computational Geometry
April 16 – June 8     (deadline: February 28 for early registration)
Barcelona, Spain

ISCO 2018 Spring School “Advanced MIP Formulations and Computations”
April 9-10     (deadline: January 10)
Marrakesh, Morocco
* Included on November 1

Big M: good in practice, bad in theory, and ugly numerically!

If you have seen or modeled enough optimization problems, you probably came across or felt the need for some big Ms: very large coefficients used as a proxy for infinity. Most often, a big M is used along with a binary variable to turn constraints on or off.

In scheduling, for example, you may use a binary variable y to decide if a job i ends before another job j (ei ≤ sj) when y=1 or vice-versa (ej ≤ si) when y=0. We use M to make the right-hand side of the inactive constraint so large that it becomes irrelevant:

ei ≤ sj + M (1-y)
ej ≤ si + M y

You may like it or not, but no one can be indifferent to big Ms. In fact, many regular attendees and some speakers of the upcoming 2017 MIP workshop have written about it:

How bad are the bounds of a linear relaxation with big M constraints?

The. Worst.

You can think of a mixed-integer linear program as a disjunctive program: the union of all linear programs corresponding to fixing the integer variables to every possible value. Ideally, you want the linear relaxation of mixed-integer linear program to be as close as possible to the convex hull of such a union of polyhedra. However, disjunctions represented via big M constraints are as good as nothing for the linear relaxation:


We can see that with a numerical example describing the figure above:

x + y ≤ 1       or       x + y ≥ 5
0 ≤ x ≤ 3
0 ≤ y ≤ 3

We can formulate the disjunction as

x + y ≤ 1 + M z
x + y ≥ 5 – M (1-z)
z ∈ {0, 1}

In this case, M=5 is the smallest valid value for the domains of x and y. However, here is what happens if we project out the binary variable z by Fourier-Motzkin elimination:

(x+y-1)/5 ≤ z
(x+y)/5 ≥ z

(x+y)/5 ≥ (x+y-1)/5

The big M constraints vanish in the projection and we are left with the bounds of x and y.

Is there a way around it?

Yes! And no…

In theory, you can describe the convex hull by lifting the formulation to a much larger space, where we explicitly combine points from different polyhedra. However, the size of the formulation quickly explodes: if you could represent your terms by switching through n pairs of big M constraints, this tighter relaxation will be 2n times larger.

Update: After this post was published, Hassan Hijazi pointed out to his recent work on representing the convex hull in the space of the original variables.

Summer 2017 schools on algorithms, combinatorics, learning, optimization, and other relevant #orms topics

While some summer schools have not been officially announced yet, many are very close to their deadlines already. Repeating what I did for Summer 2016 and Winter 2016 / 2017, I will keep this post as an updated list of schools and workshops for the upcoming break. Suggestions are always welcome. I am also interested in recurrent schools with past deadlines since they may be relevant for those reading this post in the future.

Workshop-School on Agents, Environments, and Applications (WESAAC) 2017
May 4-6     (deadline was February 9)
Sao Paulo, Brazil

International School on Mathematics “Guido Stampacchia”: Graph Theory, Algorithms and Applications 4th Edition
May 5-13     (deadline: February 28)
Erice, Italy

Optimization Days 2017
May 8-10     (early registration deadline: April 3)
Montréal, Canada
* Included on March 17 by suggestion of Leandro C. Coelho

1st Canadian Healthcare Optimization Workshop
May 10-11     (early registration deadline: April 3)
Montréal, Canada
* Included on February 21 by suggestion of L.-M. Rousseau

Recent Advances in Algorithms International Computer Science Student School
May 22-26     (deadline was February 10)
St. Petersburg, Russia

Athens Summer School: Techniques in Random Discrete Structures
May 22-27     (deadline not posted)
Athens, Greece
* Included on March 17

BGSMath Monthly Program Random Discrete Structures and Beyond
May 22 – June 16     (early registration deadline: May 15)
Barcelona, Spain
* Included on March 17

Eötvös Loránd University Summer School in Mathematics: Higher mathematics through problem solving
June 6-10     (deadline: May 31)
Budapest, Hungary

ATOM 2017: Multiobjective Optimization Summer School
June 12-16     (early registration deadline: April 30)
Villeneuve d’Ascq, France
* Included on February 20 by suggestion of Sarah Fores

Summer Institute in Computational Social Science
June 18 – July 1     (deadline: February 24)
Princeton, United States

The Machine Learning Summer School
June 19-30     (deadline was February 10)
Tübingen, Germany

Integer Programming and Combinatorial Optimization (IPCO) 2017 Summer School
June 24-25     (deadline not posted)
Waterloo, Canada

The First Israeli Modelling Week
July 2-6     (deadline not posted)
Nahariya, Israel
* Included on March 17

Summer School on Optimization, Big Data and Applications (OBA)
July 2-8     (deadline: March 15)
Veroli, Italy
* Included on February 20 by suggestion of Sarah Fores

ACM Special Interest Group on Genetic and Evolutionary Computation (SIGEVO) Summer School
July 14, 20-21     (deadline not posted)
Berlin, Germany

Swedish Summer School in Computer Science 2017: Boolean Circuit Complexity; Algorithms and Lower Bounds
July 16-22     (deadline not posted)
Stockholm, Sweden

International Summer School on Deep Learning
July 17-21    (deadline: February 24)
Bilbao, Spain

Healthcare Operations Research Summer School
July 21-25     (deadline: March 31)
Enschede, The Netherlands
* Included on February 20 by suggestion of Sarah Fores

7th PhD Summer School in Discrete Mathematics
July 23-29     (deadline: April 30)
Rogla, Slovenia

Argonne Training Program on Extreme-Scale Computing
July 30 – August 11     (deadline: March 10)
St. Charles, IL, United States

Eight Montreal Industrial Problem Solving Workshop
August 7-10     (deadline not posted)
Montreal, Canada

The Jyväskylä Summer Schools (several courses, including Data-driven optimization via search heuristics and Online Social Media Analytics)
August 7-18     (deadline: April 30)
Jyväskylä, Finland
* Included on February 20 by suggestion of Sarah Fores

Graph Limits, Groups and Stochastic Processes Summer School
August 28 – September 2     (deadline: March 18)
Budapest, Hungary

Autumn School: Optimization in Machine Learning and Data Science
August 28-31     (deadline not posted)
Trier, Germany
* Included on February 20 by suggestion of Sarah Fores

ALGO 2017 Parameterized Complexity Summer School
September (dates not posted yet)
Vienna, Austria

130th European Study Group with Industry
September 4-8     (deadline not posted)
Coventry, United Kingdom

Association for Constraint Programming (ACP) Summer School: Hybridization of Constraint Programming and Operational Research
September 18-22     (deadline not posted)
Porquerolles, France
* Included on February 21 by suggestion of L.-M. Rousseau

The State of CMU INFORMS in 2016

(Originally posted at the CMU INFORMS website).

A lot of great things happened in 2016 at CMU INFORMS. Since we already compiled all of that for the annual report to INFORMS, we are sharing it publicly in the hope that other chapters find it useful and share back with us, just like we did with 2015 activities.


We launched the seminar series Industry Leaders in Analytics in partnership with the MBA Data Analytics club, which sponsored receptions after the talks. We first brought Steve Sashihara through the INFORMS Speakers Program and later Sebastian Ceria.

Princeton Consultants CEO Steve Sashihara came in April to present “The Executive’s Guide to Optimization”.


Axioma CEO and CMU PhD alumnus Sebastian Ceria came in September to present “What’s in a Name? In the Case of Smart Beta, It’s Hard to Tell”.


Both talks were preceded by an informal gathering with PhD students and followed by a happy hour with all attendees.

We also launched the academic seminar series Research & Analytics @ CMU with the goal of presenting research done at CMU in an accessible language to undergraduate students, thanks to input from our undergraduate officer Michael Rosenberg. Our first speaker was Prof. Mor Harchol-Balter (School of Computer Science) in September.


We also invited Prof. John Birge (The University of Chicago) for an academic seminar through the INFORMS Speakers Program in November. Prof. Birge met with PhD students for dinner on the night before and to talk about research after his seminar.


The publication of our 2015 review ignited an amazing exchange of ideas among INFORMS chapters. Similar reviews were later published by the chapters from University of Massachussets-Amherst and University of Michigan. We also were approached by officers of other chapters at the Annual Meeting that found helpful advice in our posts. These exchanges also made us realized how much we could benefit from the Speakers Program.

While many conversations happened in the halls, INFORMS helped us connect too. Here is a picture of the student chapter officers meeting after the chapters and fora breakfast:


These breakfasts and meetings happen every year on Tuesday mornings. If you are an officer attending the next Annual Meeting in Houston, show up and take a seat!

At that meeting in Nashville, our chapter was awarded the Summa Cum Laude Award for our activities in 2015, the highest distinction granted by INFORMS to student chapters.


We also had a short piece on our student-led seminars in the most recent issue of ORMS Tomorrow. Other chapters have also implemented this program recently: University of Michigan launched theirs in September 2016 and University of Illinois at Urbana-Champaign in January 2017.


We extended our most successful initiatives from 2015. We held another 2 joint happy hours with the INFORMS chapter at the University of Pittsburgh. Interestingly, the attendance at these happy hours is growing exponentially: from about 10 people in Fall 2015, we got 20 in Spring 2016 and 40 in Fall 2016. The latest one had a better venue and improved organization thanks to our new officer Neda Mirzaeian.

It is not clear at this point if the exponential trend will persist, but we can always hope!

We also increased the number of student-led discussion dinners in 15%. That was only possible thanks to the continuous effort of Siddharth Singh. Here are the list of talks:

02/01 – Yang Jiao: Student question posets
02/08 – Thiago Serra: Sound decision diagrams: a .zip file of near-optimal solutions
02/15 – Dabeen Lee: On some polytopes contained in the 0,1 hypercube that have a small Chvatal rank
02/22 – Nam Ho-Nguyen: Second-order Conic Formulation of the Trust Region Subproblem
02/29 – Stelios Despotakis: Attribution models in marketing
03/21 – Tarek Elgindy: Topics in AC optimal power flow
04/04 – Gerdus Benade: Formulating a branching dual
04/11 – Aleksandr Kazachkov: Small representations for large kidney exchange graphs
04/25 – Thiago Serra: Reformulating the Disjunctive Cut Generating Linear Program
05/09 – Siddharth Singh: Net Metering Policies for PV solar electricity
05/16 – Dabeen Lee: Optimizing over the Chvatal Closure of a 0,1 Polytope is NP-Hard
05/23 – Bo Yang, Franco Berbeglia, and Mehmet Aydemir: Summer paper proposals
08/15 – Thiago Serra and Siddharth Singh: MOPTA practice talks
09/14 – Arash Hadadan, Gerdus Benade, and Nam HO-Nguyen: OR summer paper practice talks 1
09/19 – Bo Yang, Franco Berbeglia, and Mehmet Berat Aydemir: OM summer paper practice talks
09/28 – Amin Hosseini, Dabeen Lee, and Ryo Kimura: OR summer paper practice talks 2
10/10 – Thiago Serra and Siddharth Singh: Summer internship experiences 1
10/19 – Jeremy Karp, Ryo Kimura, and Yang Jiao: Summer internship experiences 2
10/31 – Siddharth Singh: That’s not fair – Tariff structures for electricity markets with rooftop solar
11/07 – Abhinav Maurya, Siddarth Singh, and Thiago Serra: INFORMS practice talks 1
11/09 – Gerdus Benade, Amin Hosseini, and Leela Nageswaran: INFORMS practice talks 2
11/30 – Siddarth Singh, and Thiago Serra: INFORMS Combined Colloquia
12/05 – Ahmad Abdi (U. Waterloo): Ideal clutters that do not pack

We have also increased the number of review sessions in anticipation of important talks:

01/21 – Laci Babai (The University of Chicago)
01/29 – Nina Balcan (CMU)
02/05 – Javier Pena (CMU)
02/26 – Yanjun Li (Purdue University)
03/04 – Andrea Lodi (Polytechnique Montreal)
04/08 – Rakesh Vohra (University of Pennsylvania)
12/09 – John Birge (The University of Chicago)


We found good sources of funding. We successfully pitched the doctoral program for $1,500 and obtained another $1,000 from student government funding.

Our MBA officers have contributed to make the chapter more professional in a variety of ways. Former secretary David Sandora led the reformulation of our bylaws and helped us develop a mission, vision, goals, and more tangible roles for the officer positions prior to the 2016 elections. His slides are available here. Chris Boccio is serving his second term as treasurer and first as secretary. He has working on proving the maturity of our organization before CMU to obtain more funding from the student government in the next academic years. Since April, Lauren Wilson has joined the team with her marketing expertise and is helping to reshape how the chapter is seen at CMU and outside.


Bidding for an Omega Rho chapter at CMU: We are supporting the application of a group of undergraduate students from a variety of departments at CMU for a Carnegie Mellon chapter of the Omega Rho International Honor Society. Fingers crossed for their success!


Keeping Moore’s Law going with happy hours: We cannot keep doubling happy hour attendance for long, but for sure we can double the number of happy hours. We are considering another joint happy hour with the Chemical Engineering department.

MDD #50: We are likely to reach our 50th student-led discussion at some point in Spring 2017. We are still discussing how to make it a special happening to celebrate the consolidation of this great initiative started by Tarek Elgindy in 2015.

Big Data Challenge: CMU INFORMS was invited by the Texas A&M chapter to participate in their traditional big data challenge. Details to follow.


We are grateful for the support of faculty and staff from the Tepper School of Business: our faculty advisor Fatma Kilinc-Karzan; the Associate Director for the PhD Program Lawrence Rapp; the heads of the PhD Program Alan Scheller-Wolf, Gerard Cornuejols, Nicola Secomandi; the Associate Dean Michael Trick; and many others in the OR and OM programs. We are also thankful to all our speakers, volunteers, officers (listed on the website), members of the MBA clubs that partnered with us, faculty of other schools at CMU. And thank you INFORMS for all the help, recognition, and support since 2014!

11 types of tweets for #ics2017

With the 2017 INFORMS Computing Society Conference in Austin around the corner, I was looking for useful way to make a binary joke and decided to write about tweeting.

For a long time I used Twitter as I would use Linkedin (that is, if Linkedin worked): for networking and letting people know about something going on where I was. This type of tweet, which I now call “Look what you are missing”, is quite useful.

I still use Twitter in that way, particularly when I am busy keeping session time (like above) or trying to understand something that is new to me. However, I started paying attention to other people’s tweets and decided to use it in a more productive way for me and others: taking notes of what seem to be the takeaway message or good to know.


But there is another – more entertaining – way of using Twitter in conferences…

I still have to figure how to tweet while giving a talk. Talk would entail 100 types of tweets!