Reminder: fill out the Week 3 feedback survey by tonight.
Extra credit opportunity - attend the teaching demo by our faculty candidate:
Teaching Demo: Linear Programming via Web-tools, R, and Branch-and-Bound
CF 316, 4:00 PM – Friday 21 April
Linear programming is a method to find an optimal solution when constraints are linear. For instance, how can you generate the most profit when selling a variety of items in a limited floor space with limited amount of funds to purchase inventory? Or what is the least number of operating cell towers necessary which can cover all customers in network at any particular moment? We learn how to setup such linear programming problems, to solve them graphically using simple web tools and also using software such as R. Building on these, we illustrate a design technique known as branch and bound to solve the problem when solutions must be integral. This latter condition makes such problems NP-hard. However, using a heuristic to “branch and bound” provides a polynomial-time method to solve the problem. Bring a computer to use the web-tools and run programs. Additionally learn how to generate branch and bound trees. Interactive.
For 2 points of extra credit in the Quizzes category, grab an index card from me and on it, write:
Hand the card back to me on your way out.