Notes

Here's where you can find some of the notes/tutorial solutions/other random stuff that I scribble down during lectures.
With the new normal (wth, it's almost gonna be a year) of online lectures, I'm experimenting with taking notes down on a tablet, so the quality/form of notes may be variable, at least initially.
Feel free to use/refer to these, but beware that they haven't been subjected to any more scrutiny than a random glance, and I am not responsible for any errors, howsoever flagrant they may seem to you. In case you find mistakes in the notes (which you, hell yeah, obviously will), please reach out to me, and I will do the necessary. Neither are these notes assuredly complete, so they should not be used as a substitute for live/recorded lectures.

ME308: IEOR (Fall 2021)

OR Module
  • Lecture 1: On the preliminaries of optimization (13/01)
  • Lecture 2: On convex geometries and convexity in optimization (15/01)
  • Lecture 3: On the formulation of mathematical programming problems, in particular the Knapsack Problem (20/01)
  • Solutions to Problem Set 1: On the formulation of linear programming problems (22/01)
  • Lecture 4: An introduction to linear programming (27/01)
  • Lecture 5: On broad categories of solution methods for linear programs (29/01)

Phone

+(91) 78880 44850

Address

Room 7, Hostel 5, IIT Bombay
Mumbai, MH 400076
India